Codeforces Round 573 (Div. 1)

Solutions for Codeforces Round 573 (Div. 1) (contest 1190). 4/6 problems verified against sample I/O. Difficulty range: 1400-3400.

6 items

Codeforces Round 573 (Div. 1)

Type: Div. 1 | Problems: 6 | Verified: 4/6 | Rating range: 1400-3400 | Time: 34m 45s

Problem Name Rating Tags Solve Time Verified
A Tokitsukaze and Discard Items 1400 implementation, two-pointers 13m 11s ✗
B Tokitsukaze, CSL and Stone Game 1800 games 3m 6s ✓
C Tokitsukaze and Duel 2300 brute-force, games, greedy 4m 20s ✓
D Tokitsukaze and Strange Rectangle 2000 data-structures, divide-and-conquer, sortings 8m 42s ✗
E Tokitsukaze and Explosion 3100 binary-search, greedy 3m 50s ✓
F Tokitsukaze and Powers 3400 number-theory, probabilities 1m 36s ✓
Practice › Codeforces Solutions › Codeforces Round 573 (Div. 1) ›

CF 1190A - Tokitsukaze and Discard Items

We are given a long line of items indexed from 1 to $n$. Among them, $m$ positions are marked as special. These special items are removed in a repeated process that works in rounds.
codeforces competitive-programming implementation two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 573 (Div. 1) ›

CF 1190D - Tokitsukaze and Strange Rectangle

We are given a set of points in the plane, and we are allowed to choose a special kind of region: a vertical strip between two x-coordinates, say between l and r, but open on the sides, combined with a horizontal threshold a such that we only take points strictly above that…
codeforces competitive-programming data-structures divide-and-conquer sortings two-pointers Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 573 (Div. 1) ›

CF 1190E - Tokitsukaze and Explosion

We are working in a plane where the origin represents the explosion point. A set of people are placed at integer coordinates, and we are allowed to draw up to $m$ infinite straight lines.
codeforces competitive-programming binary-search greedy Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 573 (Div. 1) ›

CF 1190C - Tokitsukaze and Duel

We are given a binary string representing a line of cards, each showing either 0 or 1. A move consists of choosing exactly k consecutive positions and forcing all of them to become identical, either all 0 or all 1. The rest of the array is unchanged.
codeforces competitive-programming brute-force games greedy Jun 13, 2026
Practice › Codeforces Solutions › Codeforces Round 573 (Div. 1) ›

CF 1190F - Tokitsukaze and Powers

We are asked to generate a set of possible passwords under very specific rules. The lock accepts integers between 0 and m-1.
codeforces competitive-programming number-theory probabilities Jun 12, 2026
Practice › Codeforces Solutions › Codeforces Round 573 (Div. 1) ›

CF 1190B - Tokitsukaze, CSL and Stone Game

We are given a collection of piles of stones, each pile containing a non-negative integer number of stones. Two players take turns removing exactly one stone from a pile. Tokitsukaze goes first.
codeforces competitive-programming games Jun 12, 2026