2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025)

9 problems from 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) (contest 106151), difficulty -. 9/9 solutions verified against sample I/O.

9 items

2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025)

ICPC/IOI | 9 problems | 9/9 verified | Difficulty - | 8m 21s

# Problem Rating Tags Accepted Time ✓
A zerorush 38s ✓
B foodbreak 47s ✓
C mansion 58s ✓
D packages 1m 8s ✓
E javelins 1m 1s ✓
F audit 59s ✓
G windowmanager 51s ✓
H xorpairs 53s ✓
I runnerups 1m 6s ✓
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151A - zerorush

We are given a sequence of integers. In one move, we pick any single element and change it by exactly plus two or minus two. We repeat this process until at least one element becomes exactly zero.
codeforces competitive-programming Jun 21, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151I - runnerups

We are given an array of distinct performance scores recorded over time. Each query provides a small set of time indices, and from those indices we consider every possible interval formed by choosing two of them as endpoints, including choosing the same index twice only when…
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151G - windowmanager

We are given a collection of axis-aligned rectangles placed on a 2D plane, each representing a window. Every window also has a unique height value, which determines visibility: if two windows overlap, the one with higher height covers the other in the overlapping region.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151D - packages

We are given a collection of packages, each package having two parameters. The first is a base cost that you pay once if you include that package in your delivery batch.
codeforces competitive-programming Jun 20, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151H - xorpairs

We are given an array of integers. For any integer, we define a digit function that takes its decimal digits, computes their bitwise XOR, and returns the result. For example, for 507 we compute 5 ⊕ 0 ⊕ 7, which gives 2. Let this function be g(x).
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151F - audit

We are given a sequence of measurements over time, stored in an array. Each query asks us to look at a contiguous segment of this array. The twist is that every segment length is not arbitrary, it is always one of two fixed lengths, either L1 or L2.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151E - javelins

We are given a set of targets, each target has two parameters: a base energy cost and a fatigue factor. The athlete may choose any subset of these targets and decide the order in which to hit them.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151C - mansion

We are given a directed graph where each vertex represents a room in a mansion and each directed edge represents a one-way door between rooms. Every door has a cost of either 0 or 1 depending on whether it is already unlocked or requires using a badge to pass through.
codeforces competitive-programming Jun 19, 2026
Practice › Codeforces Solutions › 2025 ICPC Greek Collegiate Programming Contest (GRCPC 2025) ›

CF 106151B - foodbreak

We are given a day that starts at time 0 and ends at time T. Inside this interval, there are N scheduled presentations, each occupying a half-open segment [si, ei), meaning it starts at si and ends just before ei. These presentations may overlap or be disjoint.
codeforces competitive-programming Jun 19, 2026