CROC-MBTU 2012, Final Round (Online version, Div. 2)

5 problems from CROC-MBTU 2012, Final Round (Online version, Div. 2) (contest 250), difficulty 1000-2000. 2/5 solutions verified against sample I/O.

5 items

CROC-MBTU 2012, Final Round (Online version, Div. 2)

Div. 2 | 5 problems | 2/5 verified | Difficulty 1000-2000 | 11m 54s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Paper Work	1000	greedy	4,804	3m 9s
B	Restoring IPv6	1500	implementation, strings	2,238	1m 5s	✓
C	Movie Critics	1600	greedy	2,229	3m 12s
D	Building Bridge	1900	geometry, ternary-search, two-pointers	1,009	1m 13s	✓
E	Mad Joe	2000	brute-force	503	3m 15s

Practice › Codeforces Solutions › CROC-MBTU 2012, Final Round (Online version, Div. 2) ›

CF 250A - Paper Work

Polycarpus needs to organize daily profit reports into folders, where each folder contains consecutive days. The key restriction is that a folder cannot contain three or more days with negative profit, because the boss cannot tolerate more than two loss days per folder.

Practice › Codeforces Solutions › CROC-MBTU 2012, Final Round (Online version, Div. 2) ›

CF 250B - Restoring IPv6

An IPv6 address in its full form is a fixed structure made of eight blocks. Each block represents 16 bits and is written as exactly four hexadecimal characters, including leading zeros when necessary.

Practice › Codeforces Solutions › CROC-MBTU 2012, Final Round (Online version, Div. 2) ›

CF 250C - Movie Critics

We are given a sequence of movie genres scheduled over n days, with exactly one movie per day. There are k genres, and each genre appears at least once. Valentine, a critic, experiences stress whenever the genre of consecutive movies he watches changes.

Practice › Codeforces Solutions › CROC-MBTU 2012, Final Round (Online version, Div. 2) ›

CF 250D - Building Bridge

We are choosing a path from a western village at the origin to a river bank located at a vertical line $x = a$, then crossing the river in a straight line to another point on the eastern bank $x = b$, and finally following a pre-determined path back into the eastern village.

Practice › Codeforces Solutions › CROC-MBTU 2012, Final Round (Online version, Div. 2) ›

CF 250E - Mad Joe

Joe is starting on the top floor of a multi-story building represented as a grid of cells. Each floor is a row of m cells, and each cell can either be empty, contain breakable bricks, or be an unbreakable concrete wall.