All-Ukrainian School Olympiad in Informatics

6 problems from All-Ukrainian School Olympiad in Informatics (contest 76), difficulty 1700-2700. 4/6 solutions verified against sample I/O.

6 items

All-Ukrainian School Olympiad in Informatics

Special | 6 problems | 4/6 verified | Difficulty 1700-2700 | 9m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Gift	2200	dsu, graphs, sortings	2,221	2m 12s	✓
B	Mice	2100	greedy, two-pointers	801	1m 53s
C	Mutation	2700	bitmasks, dp, math	369	2m 6s	✓
D	Plus and xor	1700	dp, greedy, math	2,403	1m 46s	✓
E	Points	1700	implementation, math	1,892	1m 53s	✓
F	Tourist			771

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76A - Gift

We have an undirected graph where every road has two thresholds attached to it. For a road with values (g, s), the road becomes safe only if the king gives at least g gold coins and at least s silver coins to the bandits.

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76B - Mice

We are given a row of mice located along a horizontal line at coordinate y = Y0 and a row of cheese pieces along another horizontal line at y = Y1. Each mouse can run directly towards any piece of cheese, and all mice run at the same speed.

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76C - Mutation

We are given a string representing the genome of an organism, where each character is one of the first K capital letters. Adjacent genes contribute to the total “risk of disease” according to a given K × K matrix of non-negative integers.

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76D - Plus and xor

We are given two non-negative integers, A and B. We need to construct two other non-negative integers, X and Y, such that: - their sum equals A - their bitwise xor equals B Among all valid pairs, we must output the one with the smallest possible X.

Practice › Codeforces Solutions › All-Ukrainian School Olympiad in Informatics ›

CF 76E - Points

We are given up to one hundred thousand points on a 2D plane. For every unordered pair of points, we must compute the squared Euclidean distance between them and add all those values together.