Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)
7 problems from Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements) (contest 241), difficulty 1300-2900. 4/7 solutions verified against sample I/O.
Bayan 2012-2013 Elimination Round (ACM ICPC Rules, English statements)
ICPC/IOI | 7 problems | 4/7 verified | Difficulty 1300-2900 | 12m 49s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Old Peykan | 1300 | greedy | 2,409 | 1m 12s | ✓ |
| B | Friends | 2700 | binary-search, bitmasks, data-structures | 982 | 2m 23s | |
| C | Mirror Box | 2000 | geometry, implementation | 533 | 1m 27s | |
| D | Numbers | 2900 | 395 | 2m 21s | ||
| E | Flights | 2600 | graphs, shortest-paths | 1,383 | 1m 54s | ✓ |
| F | Race | 2300 | brute-force, implementation | 289 | 2m 26s | ✓ |
| G | Challenging Balloons | 1900 | constructive-algorithms | 564 | 1m 6s | ✓ |
CF 241A - Old Peykan
We are asked to model a journey along a straight line of cities connected by one-way roads, where a car travels at a constant speed of one kilometer per hour and consumes one liter of fuel per kilometer.
CF 241B - Friends
We have an array of friend attractiveness values. Every unordered pair of distinct friends produces one possible picture, and the value of that picture is the xor of the two attractiveness values.
CF 241C - Mirror Box
The system describes a rectangular box where a laser beam enters through one small hole on the left wall and must exit through another hole on the right wall. Inside the box, there are horizontal mirror segments placed either on the floor or on the ceiling.
CF 241D - Numbers
We are given a sequence of distinct integers. We may keep any subsequence, preserving the original order, and remove the rest. The remaining sequence must satisfy two conditions simultaneously. First, the xor of all remaining numbers must be zero.
CF 241E - Flights
We are given a directed acyclic graph of cities and one-way flights. Every flight initially takes 1 hour. We may independently change any flight duration to either 1 or 2 hours.
CF 241F - Race
The city is represented by a grid. Every cell is either a building, a street tile with a traversal cost from 1 to 9, or a junction labeled by a lowercase letter. Movement rules are unusual.
CF 241G - Challenging Balloons
We have a row of balloons placed at increasing positions on a line. Each balloon has a pressure endurance, which limits how large its radius can grow. We inflate balloons sequentially from left to right.