Codeforces Round 145 (Div. 1, ACM-ICPC Rules)

2 problems from Codeforces Round 145 (Div. 1, ACM-ICPC Rules) (contest 240), difficulty 2600-2800. 2/2 solutions verified against sample I/O.

2 items

Codeforces Round 145 (Div. 1, ACM-ICPC Rules)

Div. 1 | 2 problems | 2/2 verified | Difficulty 2600-2800 | 3m 3s

#	Problem	Rating	Tags	Accepted	Time	✓
E	Road Repairs	2800	dfs-and-similar, graphs, greedy	430	1m 58s	✓
F	TorCoder	2600	data-structures	2,259	1m 5s	✓

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 1, ACM-ICPC Rules) ›

CF 240E - Road Repairs

We have a directed graph of cities and roads. City 1 is the capital. Every road is either already usable or broken. A broken road may be repaired, after which it behaves like a normal directed edge. The government wants every city to become reachable from the capital.

Practice › Codeforces Solutions › Codeforces Round 145 (Div. 1, ACM-ICPC Rules) ›

CF 240F - TorCoder

We are given a string of lowercase English letters and a sequence of queries. Each query specifies a substring, and for each substring, we are asked to rearrange its letters into a palindrome if possible.