Algo Cup 2025 by csspace.io (Qualification Round)

6 problems from Algo Cup 2025 by csspace.io (Qualification Round) (contest 106235), difficulty -. 3/6 solutions verified against sample I/O.

6 items

Algo Cup 2025 by csspace.io (Qualification Round)

Special | 6 problems | 3/6 verified | Difficulty - | 8m 28s

#	Problem	Time	✓
A	Athletes	50s	✓
B	Proof of Incorrectness	28s
C	Mafia Cafe	39s	✓
D	Three Subsegments	5m 24s
E	Shortest Non-Shortest Path	43s	✓
F	Almost Bipartite Graph	24s

Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Qualification Round) ›

CF 106235D - Three Subsegments

Codeforces 106235D: Three Subsegments

Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Qualification Round) ›

CF 106235E - Shortest Non-Shortest Path

We are given a weighted graph where moving along an edge has a cost, and we care about paths from a fixed start node to a fixed target node. Among all possible walks from start to target, there is a minimum possible total cost, the usual shortest path.

Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Qualification Round) ›

CF 106235F - Almost Bipartite Graph

Got it. Please paste the Codeforces problem statement (or link + full text), and I’ll write a full competitive programming editorial for it.

Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Qualification Round) ›

CF 106235C - Mafia Cafe

We are simulating a seating system in a cafe where both people and tables are ordered by importance. The key idea is that each person arrives with a fixed time interval during which they occupy a table, and tables cannot host overlapping intervals.

Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Qualification Round) ›

CF 106235B - Proof of Incorrectness

I don’t actually have the statement of Codeforces 106235B - Proof of Incorrectness available, and I can’t reliably reconstruct it from the title alone without risking inventing details.

Practice › Codeforces Solutions › Algo Cup 2025 by csspace.io (Qualification Round) ›

CF 106235A - Athletes

We are given a collection of athletes, each described by two attributes: strength and endurance. From these athletes we must choose exactly k individuals.