Cupertino Informatics Tournament

7 problems from Cupertino Informatics Tournament (contest 104395), difficulty -. 5/7 solutions verified against sample I/O.

7 items

Cupertino Informatics Tournament

Special | 7 problems | 5/7 verified | Difficulty - | 10m 37s

# Problem Rating Tags Accepted Time ✓
A Cow Treats 1m 21s
B Spilling the Juice 57s ✓
C String Keyboard 1m 26s ✓
D Reds and Blues 1m 31s ✓
E Vacation Planning 59s ✓
F Cycles 3m 24s
G Lines 59s ✓
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395F - Cycles

Now we finally have a clean arithmetic discrepancy, not a parsing failure. The program is correctly producing most outputs, but one value is off: So the structure is correct, input is correct, and indexing is correct.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395C - String Keyboard

We are given a line of N distinct keyboard keys, each labeled with a unique uppercase letter. We want to construct a string by repeatedly “pressing” keys, but the key action is slightly unusual: pressing an internal key produces a pair of adjacent characters, namely the…
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395A - Cow Treats

We are given a chronological log of a barn where cows repeatedly enter and leave. Each line of input describes a single event for a specific cow: if the cow is currently outside, the event means it enters; if it is currently inside, it leaves.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395G - Lines

We are given a static array of integers, and for each query value $x$, we look at every adjacent pair in the array and evaluate a quadratic expression formed by shifting both endpoints by $x$. For a fixed pair $(i, i+1)$, the value is $(A[i] - x)(A[i+1] - x)$.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395E - Vacation Planning

We are given a set of activities, each described by a duration in hours and a happiness value. Trotles has exactly three days of vacation, and each day he has 16 usable hours.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395D - Reds and Blues

We are given an undirected weighted graph where each vertex represents a city and each edge represents a possible road with a construction cost. Every city is marked either red or blue.
codeforces competitive-programming Jun 30, 2026
Practice › Codeforces Solutions › Cupertino Informatics Tournament ›

CF 104395B - Spilling the Juice

We are given an array where each position does not necessarily store a single fixed number. Some positions are known exactly, while others are uncertain and described as a closed interval.
codeforces competitive-programming Jun 30, 2026