CROC-MBTU 2012, Elimination Round (ACM-ICPC)

Solutions for CROC-MBTU 2012, Elimination Round (ACM-ICPC) (contest 245). 8/8 problems verified against sample I/O. Difficulty range: 800-2200.

8 items

CROC-MBTU 2012, Elimination Round (ACM-ICPC)

Type: ICPC/IOI | Problems: 8 | Verified: 8/8 | Rating range: 800-2200 | Time: 18m 42s

Problem Name Rating Tags Solve Time Verified
A System Administrator 800 implementation 3m 27s ✓
B Internet Address 1100 implementation, strings 1m 53s ✓
C Game with Coins 1700 greedy 1m 37s ✓
D Restoring Table 1500 constructive-algorithms, greedy 3m 10s ✓
E Mishap in Club 1400 greedy, implementation 1m 24s ✓
F Log Stream Analysis 2000 binary-search, brute-force, implementation 3m 5s ✓
G Suggested Friends 2200 brute-force, graphs 1m 6s ✓
H Queries for Number of Palindromes 1800 dp, hashing, strings 3m ✓
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245A - System Administrator

Polycarpus is running a simple monitoring routine for two servers, which we can call server a and server b. Each "ping" command sends exactly ten packets to one of the servers.
codeforces competitive-programming implementation May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245B - Internet Address

Vasya scribbled an Internet address in his notebook, but he was in a hurry and omitted all punctuation characters like :, /, and ..
codeforces competitive-programming implementation strings May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245C - Game with Coins

We are given a line of numbered chests, each containing some number of coins. On each move, a player chooses an integer position $x$, and that move simultaneously affects three specific chests: $x$, $2x$, and $2x+1$. From each of these chests, one coin is removed if it exists.
codeforces competitive-programming greedy May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245D - Restoring Table

We are given a square table that was originally generated from a hidden array of non-negative integers. Each off-diagonal entry is the bitwise AND of the corresponding pair of hidden values, while diagonal entries are artificially replaced by -1.
codeforces competitive-programming constructive-algorithms greedy May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245E - Mishap in Club

We are given a chronological log of a single night in a club. Every character in the input string represents one event: a “+” means someone entered the club, and a “-” means someone left.
codeforces competitive-programming greedy implementation May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245F - Log Stream Analysis

We are given a chronologically ordered stream of log entries, where each entry has an exact timestamp down to the second and an associated message describing a program warning.
codeforces competitive-programming binary-search brute-force implementation strings May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245G - Suggested Friends

We are given an undirected social network where each user is identified by a string name and friendships are given as pairs of names.
codeforces competitive-programming brute-force graphs May 29, 2026
Practice › Codeforces Solutions › CROC-MBTU 2012, Elimination Round (ACM-ICPC) ›

CF 245H - Queries for Number of Palindromes

We are given a fixed string consisting of lowercase letters, and many independent queries. Each query specifies a contiguous segment of this string, and for that segment we must count how many substrings are palindromes.
codeforces competitive-programming dp hashing strings May 29, 2026