Codeforces Round 244 (Div. 2)

5 problems from Codeforces Round 244 (Div. 2) (contest 427), difficulty 800-2200. 5/5 solutions verified against sample I/O.

5 items

Codeforces Round 244 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 800-2200 | 7m 50s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Police Recruits	800	implementation	97,206	1m 22s	✓
B	Prison Transfer	1100	data-structures, implementation	15,510	1m 33s	✓
C	Checkposts	1700	dfs-and-similar, graphs, two-pointers	16,884	1m 34s	✓
D	Match & Catch	2200	dp, string-suffix-structures, strings	2,423	1m 27s	✓
E	Police Patrol	2000	greedy, implementation, math	1,611	1m 54s	✓

Practice › Codeforces Solutions › Codeforces Round 244 (Div. 2) ›

CF 427A - Police Recruits

We are given a sequence of events happening in time order in a city. Each event is either the arrival of one or more new police recruits, or the occurrence of a crime. When recruits arrive, they increase the number of available officers.

Practice › Codeforces Solutions › Codeforces Round 244 (Div. 2) ›

CF 427B - Prison Transfer

We have a line of prisoners, and each prisoner has a crime severity value. We must choose exactly c consecutive prisoners for transfer. Every prisoner inside the chosen segment must have severity at most t.

Practice › Codeforces Solutions › Codeforces Round 244 (Div. 2) ›

CF 427C - Checkposts

We are given a directed graph where each node represents a city junction, and each directed edge represents a one-way road. Each junction has a cost to build a police checkpost.

Practice › Codeforces Solutions › Codeforces Round 244 (Div. 2) ›

CF 427D - Match & Catch

We are given two lowercase strings. From each string we can look at every contiguous segment, and we care about those segments that behave unusually: a segment is considered special if it appears exactly once in its own string.

Practice › Codeforces Solutions › Codeforces Round 244 (Div. 2) ›

CF 427E - Police Patrol

All criminals stand on the x-axis, and we must choose one integer coordinate for the police station. The patrol car starts from the station, visits some criminals, brings them back to the station, then repeats until everyone is arrested. Each trip can carry at most m criminals.