Codeforces Beta Round 63 (Div. 2)

5 problems from Codeforces Beta Round 63 (Div. 2) (contest 69), difficulty 1000-2000. 5/5 solutions verified against sample I/O.

5 items

Codeforces Beta Round 63 (Div. 2)

Div. 2 | 5 problems | 5/5 verified | Difficulty 1000-2000 | 9m 17s

#	Problem	Rating	Tags	Accepted	Time	✓
A	Young Physicist	1000	implementation, math	202,257	1m 43s	✓
B	Bets	1200	greedy, implementation	3,619	2m 1s	✓
C	Game	2000	implementation	674	2m 15s	✓
D	Dot	1900	dp, games	1,129	1m 56s	✓
E	Subsegments	1800	data-structures, implementation	5,086	1m 22s	✓

Practice › Codeforces Solutions › Codeforces Beta Round 63 (Div. 2) ›

CF 69A - Young Physicist

We are given several force vectors acting on a body in three-dimensional space. Each vector has three components: its effect along the x-axis, y-axis, and z-axis. A body is in equilibrium only if the total force acting on it is zero in every direction.

Practice › Codeforces Solutions › Codeforces Beta Round 63 (Div. 2) ›

CF 69B - Bets

Each athlete runs through a contiguous interval of sections. While an athlete is inside a section, they spend exactly t[i] time on that section, so the winner of a section is simply the active athlete with the smallest t.

Practice › Codeforces Solutions › Codeforces Beta Round 63 (Div. 2) ›

CF 69C - Game

Each player owns a multiset of artifacts. Some artifacts are basic and can be purchased directly. Some are composite and can be crafted from several basic artifacts in fixed quantities. Whenever a player buys a basic artifact, it is added to their inventory.

Practice › Codeforces Solutions › Codeforces Beta Round 63 (Div. 2) ›

CF 69D - Dot

We start with a point on the plane at coordinates (x, y). Players alternate turns, and on each turn they may do one of two things. They may add one of the given movement vectors to the current position.

Practice › Codeforces Solutions › Codeforces Beta Round 63 (Div. 2) ›

CF 69E - Subsegments

We are given an array of integers and a fixed window size k. For each contiguous subarray (segment) of length k, we need to find the largest element that appears exactly once within that segment. If no element appears exactly once, we output "Nothing".