Testing Round 11

3 problems from Testing Round 11 (contest 491), difficulty 1000-2300. 1/3 solutions verified against sample I/O.

3 items

Testing Round 11

Special | 3 problems | 1/3 verified | Difficulty 1000-2300 | 17m 39s

# Problem Rating Tags Accepted Time ✓
A Up the hill 1000 constructive-algorithms, implementation 3,485 5m 18s
B New York Hotel 2100 greedy, math 655 11m 40s
C Deciphering 2300 flows, graph-matchings 519 41s ✓
Practice › Codeforces Solutions › Testing Round 11 ›

CF 491A - Up the hill

Codeforces 491A: Up the hill
codeforces competitive-programming constructive-algorithms implementation May 31, 2026
Practice › Codeforces Solutions › Testing Round 11 ›

CF 491B - New York Hotel

The city is a rectangular grid. Every hotel and every restaurant is located at an intersection with coordinates $(x,y)$.
codeforces competitive-programming greedy math May 31, 2026
Practice › Codeforces Solutions › Testing Round 11 ›

CF 491C - Deciphering

We are asked to decipher a message that has been encoded by a simple substitution cipher. Each letter in the original message is replaced with a fixed letter, so the mapping is one-to-one: different letters map to different letters, and the same letter always maps to the same…
codeforces competitive-programming flows graph-matchings May 31, 2026