Codeforces Round 485 (Div. 1)

3 problems from Codeforces Round 485 (Div. 1) (contest 986), difficulty 1600-3300. 3/3 solutions verified against sample I/O.

3 items

Codeforces Round 485 (Div. 1)

Div. 1 | 3 problems | 3/3 verified | Difficulty 1600-3300 | 4m 10s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Fair	1600	graphs, greedy, number-theory	8,326	1m 26s	✓
B	Petr and Permutations	1800	combinatorics, math	5,054	1m 18s	✓
F	Oppa Funcan Style Remastered	3300	graphs, math, number-theory	743	1m 26s	✓

Practice › Codeforces Solutions › Codeforces Round 485 (Div. 1) ›

CF 986F - Oppa Funcan Style Remastered

We are asked whether it is possible to design a function on a very large set of positions, up to $10^{18}$, that behaves like a deterministic jump rule applied every second. Each position points to exactly one next position, and every element moves according to this fixed rule.

Practice › Codeforces Solutions › Codeforces Round 485 (Div. 1) ›

CF 986A - Fair

We are given a connected undirected graph of towns. Each town produces exactly one type of goods, and there are at most 100 distinct types overall. For any pair of towns, moving goods between them costs the shortest-path distance in the graph, where each road has unit length.

Practice › Codeforces Solutions › Codeforces Round 485 (Div. 1) ›

CF 986B - Petr and Permutations

We are given a permutation of size $n$, and we are told it was produced by one of two random procedures. Both procedures start from the identity permutation $[1, 2, 3, dots, n]$, then repeatedly pick two distinct positions uniformly at random and swap them.