VK Cup 2012 Round 3

Solutions for VK Cup 2012 Round 3 (contest 164). 3/5 problems verified against sample I/O. Difficulty range: 1700-3100.

5 items

VK Cup 2012 Round 3

Type: Special | Problems: 5 | Verified: 3/5 | Rating range: 1700-3100 | Time: 9m 50s

Problem Name Rating Tags Solve Time Verified
A Variable, or There and Back Again 1700 dfs-and-similar, graphs 1m 51s ✓
B Ancient Berland Hieroglyphs 2000 two-pointers 1m 30s ✓
C Machine Programming 2400 flows, graphs 2m 16s ✓
D Minimum Diameter 3100 binary-search, brute-force 2m 18s ✗
E Polycarpus and Tasks 3100 - 1m 55s ✗
Practice › Codeforces Solutions › VK Cup 2012 Round 3 ›

CF 164A - Variable, or There and Back Again

We are given a directed graph where every node represents a program state. Each state does one of three things to a variable: 0 means the variable is ignored. 1 means the variable is assigned a new value. 2 means the variable is used.
codeforces competitive-programming dfs-and-similar graphs May 29, 2026
Practice › Codeforces Solutions › VK Cup 2012 Round 3 ›

CF 164B - Ancient Berland Hieroglyphs

The problem involves two circular sequences of unique hieroglyphs. We are asked to "cut" these circles at some point to turn them into linear arrays, then find the longest contiguous segment from the first array that appears as a subsequence in the second array.
codeforces competitive-programming two-pointers May 29, 2026
Practice › Codeforces Solutions › VK Cup 2012 Round 3 ›

CF 164C - Machine Programming

We have several jobs, each with a start time, a duration, and a profit. A machine that starts a job stays occupied for the entire interval from s through s + t - 1. At most k jobs may run simultaneously because we only own k machines. The goal is not to schedule all jobs.
codeforces competitive-programming flows graphs May 29, 2026
Practice › Codeforces Solutions › VK Cup 2012 Round 3 ›

CF 164D - Minimum Diameter

We are given up to 1000 points on the plane, and we must remove exactly k of them. After removing those points, the remaining set should have the smallest possible diameter. The diameter of a set is the maximum Euclidean distance between any two remaining points.
codeforces competitive-programming binary-search brute-force May 29, 2026
Practice › Codeforces Solutions › VK Cup 2012 Round 3 ›

CF 164E - Polycarpus and Tasks

Polycarpus has a sequence of tasks, each with a start window, an end window, and a duration. Formally, task i is represented by (li, ri, ti).
codeforces competitive-programming May 29, 2026