Codeforces Round 111 (Div. 2)

Solutions for Codeforces Round 111 (Div. 2) (contest 160). 5/5 problems verified against sample I/O. Difficulty range: 900-2400.

5 items

Codeforces Round 111 (Div. 2)

Type: Div. 2 | Problems: 5 | Verified: 5/5 | Rating range: 900-2400 | Time: 8m 5s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Twins	900	greedy, sortings	1m 15s	✓
B	Unlucky Ticket	1100	greedy, sortings	1m 29s	✓
C	Find Pair	1700	implementation, math, sortings	1m 47s	✓
D	Edges in MST	2300	dfs-and-similar, dsu, graphs	1m 21s	✓
E	Buses and People	2400	binary-search, data-structures, sortings	2m 13s	✓

Practice › Codeforces Solutions › Codeforces Round 111 (Div. 2) ›

CF 160A - Twins

We are given a collection of coins, each with a positive integer value. The task is to choose a subset of these coins such that the total value of our chosen coins is strictly greater than the total value of the coins left for the other person.

Practice › Codeforces Solutions › Codeforces Round 111 (Div. 2) ›

CF 160B - Unlucky Ticket

We are given a ticket represented as a string of 2n digits, where n is between 1 and 100. The first half of the ticket contains the first n digits and the second half contains the remaining n digits. We are asked to determine whether the ticket is “definitely unlucky.

Practice › Codeforces Solutions › Codeforces Round 111 (Div. 2) ›

CF 160C - Find Pair

We are given an array of n integers. From this array, we form every ordered pair (a[i], a[j]), including pairs where i = j. Since both positions are chosen independently, there are exactly n² pairs. All these pairs are sorted lexicographically.

Practice › Codeforces Solutions › Codeforces Round 111 (Div. 2) ›

CF 160D - Edges in MST

We are given a connected weighted undirected graph with no loops or multiple edges. Each edge has a positive weight.

Practice › Codeforces Solutions › Codeforces Round 111 (Div. 2) ›

CF 160E - Buses and People

Each bus is active at exactly one moment in time. A bus starting at stop s and ending at stop f can carry any passenger whose trip interval [l, r] is fully contained inside [s, f]. A person arrives at stop l at time b, so they can only use buses whose time t satisfies t = b.