The 2019 ICPC Asia Nanjing Regional Contest

11 problems from The 2019 ICPC Asia Nanjing Regional Contest (contest 103466), difficulty -. 6/11 solutions verified against sample I/O.

11 items

The 2019 ICPC Asia Nanjing Regional Contest

ICPC/IOI | 11 problems | 6/11 verified | Difficulty - | 10m 16s

#	Problem	Time	✓
A	A Hard Problem	46s	✓
B	Chessboard	2m 3s
C	Digital Path	35s	✓
D	Holes	48s	✓
E	Observation	1m 8s	✓
F	Paper Grading	26s
G	Poker Game	31s
H	Prince and Princess	45s	✓
I	Space Station	19s
J	Spy	2m 8s
K	Triangle	47s	✓

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466J - Spy

Let $S{s,t}$ denote the set of all bitstrings $a{n-1}cdots a0$ with $n=s+t$ containing exactly $t$ ones, and let $C{s,t}$ denote the corresponding set of index lists $ctcdots c1$ with $nctcdotsc1ge 0$, ordered lexicographically as in (3).

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466K - Triangle

We are given a fixed triangle in the plane, defined by three vertices with integer coordinates. Along with this triangle, we are given a point $P$, which is supposed to lie on the boundary of the triangle.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466I - Space Station

We are given a collection of space stations indexed from 0 to n. Each station has an integer energy value, and station 0 is our starting point.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466H - Prince and Princess

We are given a closed world consisting of people distributed across rooms, with no empty rooms. Every person belongs to exactly one of three behavioral types: supporters of the marriage, opponents of the marriage, and neutral participants.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466B - Chessboard

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466G - Poker Game

This is a simulated poker tournament where five fixed-strategy players repeatedly participate in a series of independent rounds.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466E - Observation

We are given several test cases. In each test case, there is a range of integer distances from L to R. For each integer distance d in this range, the problem defines a value f(d), which counts how many integer-coordinate points in 3D space lie exactly at Euclidean distance d…

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466F - Paper Grading

We maintain a dynamic list of strings, indexed from 1 to n, which can be reordered by swap operations. Alongside this evolving list, we receive queries asking about a segment of indices [l, r] and a query string q together with a threshold k.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466D - Holes

We are given an $n times n$ grid where a subset of cells are marked as absorbing “holes”. A token starts from a fixed cell $(r, c)$ that is guaranteed not to be a hole.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466A - A Hard Problem

We are given a set of integers from 1 up to n. The task is to determine the smallest number k such that no matter how we choose any subset of size k from this range, we are guaranteed to find two distinct numbers u and v inside that subset where one divides the other.

Practice › Codeforces Solutions › The 2019 ICPC Asia Nanjing Regional Contest ›

CF 103466C - Digital Path

We are given an integer grid where each cell contains a value, and we need to count certain special paths formed by moving through adjacent cells in the grid.