XXIII Spain Olympiad in Informatics, Day 1

4 problems from XXIII Spain Olympiad in Informatics, Day 1 (contest 105455), difficulty -. 3/4 solutions verified against sample I/O.

4 items

XXIII Spain Olympiad in Informatics, Day 1

Special | 4 problems | 3/4 verified | Difficulty - | 6m 23s

#	Problem	Time	✓
A	Juan's Femur	1m 30s	✓
B	Bureaucratic Games	1m 43s	✓
C	Spam Mail	1m 28s
D	La Pachanga	1m 42s	✓

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 1 ›

CF 105455D - La Pachanga

We are given a set of players and a list of pairwise “hate relations”, each with a numerical strength. We need to split all players into two teams. A pair of players placed in the same team is only acceptable if their mutual hate is not “too large”.

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 1 ›

CF 105455C - Spam Mail

We are given a number of points on a line representing mailboxes that must all be “visited” and cleaned, and another set of points representing people who can move along the same line. Each person starts at a fixed coordinate and can move one unit per second left or right.

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 1 ›

CF 105455B - Bureaucratic Games

We are given a linear sequence of service windows, and at each window there is exactly one possible transformation between documents: if you currently hold a specific document, you may choose to perform a procedure that converts it into another document.

Practice › Codeforces Solutions › XXIII Spain Olympiad in Informatics, Day 1 ›

CF 105455A - Juan's Femur

We are given multiple independent scenarios. Each scenario provides three positive integers representing the lengths of three bone fragments left after a fracture.