Codeforces Round 934 (Div. 2)

Solutions for Codeforces Round 934 (Div. 2) (contest 1944). 1/2 problems verified against sample I/O. Difficulty range: 800-1100.

2 items

Codeforces Round 934 (Div. 2)

Type: Div. 2 | Problems: 2 | Verified: 1/2 | Rating range: 800-1100 | Time: 2m 14s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Destroying Bridges	800	graphs, greedy, math	55s	✓
B	Equal XOR	1100	bitmasks, constructive-algorithms	1m 19s	✗

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

CF 1944A - Destroying Bridges

We are asked to consider a network of islands where initially every pair of islands is connected by a bridge. There are n islands, numbered from 1 to n, and Everule lives on island 1. Dominater can destroy up to k bridges to reduce the number of islands that Everule can reach.

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

CF 1944B - Equal XOR

We are given an array of length $2n$ where every number from $1$ to $n$ appears exactly twice. You can think of it as $n$ paired cards scattered in a line. The first $n$ positions form a left block and the last $n$ positions form a right block.