2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest

13 problems from 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest (contest 102460), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 59m 25s

#	Problem	Time	✓
A	Rush Hour Puzzle	1m 46s	✓
B	The Power Monitor System	3m 8s	✓
C	Are They All Integers?	6m 54s	✓
D	Tapioka	3m 14s	✓
E	The League of Sequence Designers	4m 16s	✓
F	Miss Sloane	6m 37s	✓
G	Optimal Selection	5m 4s	✓
H	Mining a	3m 55s	✓
I	The Spectrum	2m 44s	✓
J	Automatic Control Machine	5m 10s	✓
K	Length of Bundle Rope	2m 22s	✓
L	Largest Quadrilateral	5m 31s	✓
M	DivModulo	8m 44s	✓

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460A - Rush Hour Puzzle

Edit We have a 6 by 6 board containing at most 10 vehicles. Every vehicle occupies either two consecutive cells, as a car, or three consecutive cells, as a truck. A vehicle has a fixed orientation, horizontal or vertical, and can slide only along that orientation.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460C - Are They All Integers?

We have a sorted array of positive integers (A), with (3 le n le 50). We must decide whether every choice of three distinct positions (i,j,k) satisfies [ frac{A[i]-A[j]}{A[k]} in mathbb Z.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460G - Optimal Selection

We have an array of (n) distinct values, but we are not given the values themselves. Instead, before the selection algorithm starts, we already know the result of some comparisons. For every given pair ((x,y)), we know that (a[x] < a[y]).

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460K - Length of Bundle Rope

We have a collection of packages, and each package has a positive size. A bundling operation chooses exactly two current bundles, joins them into one new bundle, and consumes rope whose length equals the sum of the two bundle sizes.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460L - Largest Quadrilateral

We have up to 4096 points in the plane, and we may choose four of them as the vertices of a quadrilateral. The four points do not have to be distinct as coordinates because the input itself may contain duplicates, and degenerate quadrilaterals are allowed.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460F - Miss Sloane

For every senator we have an integer (ai), and the final agreement happens exactly when the gcd of all current (ai) values is greater than 1. Sloane may choose a senator once and divide that senator's value by any divisor (d) satisfying (dle k).

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460M - DivModulo

We need to compute a special remainder of a binomial coefficient. Given (M), (N), and (D), with (0 le N le M), consider [ C(M,N)=frac{M!}{N!(M-N)!}. ] The DivModulo operation does not simply take this number modulo (D).

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460J - Automatic Control Machine

Each machine has a set of features that must all be tested. A test dataset can detect some subset of those features, represented by a binary string of length (n). Choosing several datasets means taking the union of all features detected by those datasets.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460I - The Spectrum

We need to reconstruct an increasing integer array (X) from all pairwise distances between its elements. The first element is fixed at zero, and every element is between zero and 999.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460H - Mining a

For each positive integer (n), we need to choose a positive integer (b) and an integer (a) such that [ frac{1}{n}=frac{1}{aoplus b}+frac{1}{b}, ] where (oplus) is bitwise XOR. Among all valid choices, we want the largest possible (a).

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460E - The League of Sequence Designers

We need to construct an integer array, not analyze an array that is already given. For each test case, we receive a target difference (k) and a minimum allowed length (L).

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460D - Tapioka

A dish name contains exactly three lowercase words. Some of those words are part of the tapioka decoration and must be removed. The removable words are exactly bubble and tapioka.

Practice › Codeforces Solutions › 2019-2020 ICPC Asia Taipei-Hsinchu Regional Contest ›

CF 102460B - The Power Monitor System

The electrical network is a tree, so every pair of nodes has exactly one path between them. We need to choose as few nodes as possible for PMU placement. Placing a PMU at a node immediately monitors that node, every incident transmission line, and every neighboring node.