• Updates
  • /
  • New/Modified Tags and Updated Tag Application Rules (May 3, 2025)

New/Modified Tags and Updated Tag Application Rules (May 3, 2025)

English한국어

Hello! This is solved.ac, the community powered guide for programming challenges.

New Tags Added

24 new tags have been added.

New tag relationships have been added. ABA \leftarrow B means that BB is a subtag of AA, and contributing to BB will also contribute to AA automatically.

  • #bitset ← #bitset_lcs
  • #cyclic_group ← #pisano
  • #data_structures ← #set
  • #divide_and_conquer ← #cdq
  • #dp_tree ← #rerooting
  • #geometry ← #angle_sorting
  • #geometry ← #bulldozer
  • #graphs ← #flow
  • #graphs ← #grid_graph
  • #lcs ← #bitset_lcs
  • #math ← #harmonic_number
  • #number_theory ← #prime_factorization
  • #prime_factorization ← #pollard_rho
  • #segtree ← #beats
  • #segtree ← #kinetic_segtree
  • #segtree ← #li_chao_tree
  • #set ← #hash_set
  • #set ← #tree_set
  • #shortest_path ← #dial
  • #sorting ← #angle_sorting
  • #trees ← #tree_diameter
  • #trees ← #treewidth

Some existing tag relationships have been removed.

  • #number_theory ← #pollard_rho
  • #data_structures ← #hash_set
  • #data_structures ← #tree_set

The names of some tags have been changed.

  • #directed_mst (ko): 유향 최소 신장 트리 → 유향 최소 스패닝 트리
  • #lis (en): longest increasing sequence in o(n log n) → longest increasing sequence problem
  • #lis (ko): 가장 긴 증가하는 부분 수열 (o(n log n)) → 가장 긴 증가하는 부분 수열 문제

Update to Tag Application Rules

Tags applied to problems are calculated based on the number of contributions made by contributors. The conditions for applying tags to problems have been slightly modified.

Previous

Previously, if there were NN contributions with at least one tag, and a specific tag TT was included in MTM_T contributions, the tag TT was applied to the problem if:

MT>0andMT0.3×NM_T > 0 \quad \text{and} \quad M_T \geq 0.3 \times N

Updated

From now on, for each tag TT, if the time when tag TT was added to solved.ac is DD, then:

  • There are NDN_D contributions with at least one tag made after DD,
  • mT,Dm_{T,D} is the number of contributions with tag TT made after DD, and
  • MTM_T is the total number of contributions with tag TT regardless of time,

The tag TT will be applied to the problem if:

MT>0andmT,D0.3×NDM_T > 0 \quad \text{and} \quad m_{T,D} \geq 0.3 \times N_D