Codeforces Round 497 (Div. 1)

5 problems from Codeforces Round 497 (Div. 1) (contest 1007), difficulty 1300-3400. 3/5 solutions verified against sample I/O.

5 items

Codeforces Round 497 (Div. 1)

Div. 1 | 5 problems | 3/5 verified | Difficulty 1300-3400 | 11m 58s

# Problem Rating Tags Accepted Time ✓
A Reorder the Array 1300 combinatorics, data-structures, math 13,066 3m 11s ✓
B Pave the Parallelepiped 2400 bitmasks, brute-force, combinatorics 1,037 2m 4s ✓
C Guess two numbers 3000 binary-search, interactive 527 2m 36s
D Ants 3200 2-sat, data-structures, trees 322 2m 5s ✓
E Mini Metro 3400 dp 248 2m 2s
Practice › Codeforces Solutions › Codeforces Round 497 (Div. 1) ›

CF 1007E - Mini Metro

We are dealing with a linear sequence of subway stations, where each station continuously accumulates passengers over time. Initially, each station already has some number of waiting people.
codeforces competitive-programming dp Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 497 (Div. 1) ›

CF 1007D - Ants

We are given a tree and a collection of “ants”. Each ant comes with two alternative vertex pairs. For each ant, we must decide which of its two pairs it will use.
codeforces competitive-programming 2-sat data-structures trees Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 497 (Div. 1) ›

CF 1007A - Reorder the Array

We are given an array of numbers and allowed to freely reorder them. After rearranging, we compare the new array against the original array position by position.
codeforces competitive-programming combinatorics data-structures math sortings two-pointers Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 497 (Div. 1) ›

CF 1007C - Guess two numbers

We are dealing with a hidden pair of integers, both lying in a very large range up to $10^{18}$. The only way to learn about this pair is by repeatedly asking queries of the form $(x, y)$.
codeforces competitive-programming binary-search interactive Jun 16, 2026
Practice › Codeforces Solutions › Codeforces Round 497 (Div. 1) ›

CF 1007B - Pave the Parallelepiped

We are given a fixed rectangular box with side lengths $A, B, C$. We want to count how many different triples $(a,b,c)$, ordered so that $a le b le c$, can serve as a building block such that copies of this smaller box can exactly tile the larger one, provided every copy is…
codeforces competitive-programming bitmasks brute-force combinatorics math number-theory Jun 16, 2026