VK Cup 2012 Qualification Round 1

5 problems from VK Cup 2012 Qualification Round 1 (contest 158), difficulty 800-1900. 5/5 solutions verified against sample I/O.

5 items

VK Cup 2012 Qualification Round 1

Special | 5 problems | 5/5 verified | Difficulty 800-1900 | 7m 26s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Next Round	800	*special, implementation	320,277	1m 29s	✓
B	Taxi	1100	*special, greedy, implementation	103,758	1m 21s	✓
C	Cd and pwd commands	1400	*special, data-structures, implementation	10,386	1m 45s	✓
D	Ice Sculptures	1300	*special, brute-force, number-theory	6,492	1m 38s	✓
E	Phone Talks	1900	*special, dp, sortings	1,538	1m 13s	✓

Practice › Codeforces Solutions › VK Cup 2012 Qualification Round 1 ›

CF 158A - Next Round

We are given the final standings of a programming contest. The scores are already sorted in non-increasing order, meaning each participant has a score greater than or equal to the next participant. A participant advances to the next round if two conditions are true.

Practice › Codeforces Solutions › VK Cup 2012 Qualification Round 1 ›

CF 158B - Taxi

We have a collection of schoolchildren organized into groups, and each group wants to travel together in a taxi. Each group has between one and four children, and each taxi can carry at most four children.

Practice › Codeforces Solutions › VK Cup 2012 Qualification Round 1 ›

CF 158C - Cd and pwd commands

We need to simulate a tiny shell that supports only two commands. The command cd path changes the current directory. The path may be absolute, meaning it starts from the root /, or relative, meaning it starts from the current directory. Inside a path, the token ..

Practice › Codeforces Solutions › VK Cup 2012 Qualification Round 1 ›

CF 158D - Ice Sculptures

We have n ice sculptures placed evenly on a circle. Each sculpture has a value, which may be positive or negative. We may remove some sculptures, but the remaining ones must still form a regular polygon.

Practice › Codeforces Solutions › VK Cup 2012 Qualification Round 1 ›

CF 158E - Phone Talks

We are asked to schedule a day of phone calls for Mr. Jackson in a way that maximizes the longest uninterrupted segment of sleep. Each call has a specific start time and duration.