Testing Round 7

3 problems from Testing Round 7 (contest 323), difficulty 1600-2400. 3/3 solutions verified against sample I/O.

3 items

Testing Round 7

Special | 3 problems | 3/3 verified | Difficulty 1600-2400 | 5m 14s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Black-and-White Cube	1600	combinatorics, constructive-algorithms	967	1m 57s	✓
B	Tournament-graph	2200	constructive-algorithms, graphs	470	1m 12s	✓
C	Two permutations	2400	data-structures	675	2m 5s	✓

Practice › Codeforces Solutions › Testing Round 7 ›

CF 323C - Two permutations

Each value from 1 to n appears exactly once in both permutations. For a value v, let: - posP[v] be its position in the first permutation. - posQ[v] be its position in the second permutation.

Practice › Codeforces Solutions › Testing Round 7 ›

We are asked to construct a tournament graph of n vertices with a specific connectivity property. A tournament graph is a directed graph where every pair of distinct vertices has exactly one directed edge between them.

Practice › Codeforces Solutions › Testing Round 7 ›

CF 323A - Black-and-White Cube

We are asked to color every small cube inside a larger cube of size k × k × k using exactly two colors, black and white, with a specific local neighbor condition. Each small cube must have exactly two neighboring cubes of the same color.

Testing Round 7

Testing Round 7

CF 323C - Two permutations

CF 323B - Tournament-graph

CF 323A - Black-and-White Cube