Testing Round 11

Solutions for Testing Round 11 (contest 491). 1/3 problems verified against sample I/O. Difficulty range: 1000-2300.

3 items

Testing Round 11

Type: Special | Problems: 3 | Verified: 1/3 | Rating range: 1000-2300 | Time: 17m 39s

Problem Name Rating Tags Solve Time Verified
A Up the hill 1000 constructive-algorithms, implementation 5m 18s ✗
B New York Hotel 2100 greedy, math 11m 40s ✗
C Deciphering 2300 flows, graph-matchings 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