2024 ICPC ShaanXi Provincial Contest

13 problems from 2024 ICPC ShaanXi Provincial Contest (contest 105257), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2024 ICPC ShaanXi Provincial Contest

ICPC/IOI | 13 problems | 13/13 verified | Difficulty - | 12m 55s

#	Problem	Time	✓
A	chmod	53s	✓
B	Expression Matrix	53s	✓
C	Seats	1m 10s	✓
D	Double Subsequence	1m 11s	✓
E	Trade Road	1m 9s	✓
F	Try a try, AC is OK	43s	✓
G	Disappearing Number	52s	✓
H	Maximum Flow	1m 15s	✓
I	Prime Guess I	1m 9s	✓
J	Prime Guess II	52s	✓
K	Lethal Company	53s	✓
L	Chess	52s	✓
M	Window Decoration	1m 3s	✓

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257C - Seats

We are given $n$ people and a fixed initial seating arrangement where person $i$ starts at seat $i$. Each seat is unique and every person occupies exactly one seat. Each person also has a preferred seat $ai$, which lies somewhere in a larger pool of seats $1 ldots 2n$.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257M - Window Decoration

We are given up to ten thousand identical decorations placed inside a 100 by 100 square window. Each decoration is centered at an integer coordinate strictly inside the boundary, and each one is a rotated square whose diagonals align with the coordinate axes and have total…

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257L - Chess

We are given a game that depends on a chosen base $k$. For each test, there are $x$ coins on the table. Before the game starts, the first player selects an integer base $k ge 2$. After that, two players alternate moves.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257K - Lethal Company

We are standing at a junction that connects multiple independent corridors. Each corridor is an infinite line extending away from us, and threats appear over time on these corridors.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257J - Prime Guess II

We are given an array of integers $a1, a2, ldots, an$. For each query, we are also given a value $u$ and a starting position $l$.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257I - Prime Guess I

We are interacting with a hidden prime power value. In each test case, the judge fixes an unknown prime $p$ and an exponent $k$, forming $q = p^k$. We are allowed to query powers of this hidden number: for any exponent $a$ we choose, we receive a transformed value $g(q^a)$.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257H - Maximum Flow

We are given a directed acyclic graph where every edge can carry at most one unit of flow. From the source node 1, we are interested in every other node i and want to know how many edge-disjoint paths exist from 1 to i.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257G - Disappearing Number

We are working with the natural numbers in increasing order, but one digit has been completely erased from existence. Any number that contains this forbidden digit is removed from the sequence.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257F - Try a try, AC is OK

We are given several independent test cases. In each one, there is a list of integers representing scores of different code submissions. The player must submit code twice, and the final score is not a sum or maximum, but a bitwise AND of the two chosen submissions’ scores.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257D - Double Subsequence

We are given a long string S and two short patterns s1 and s2. For every substring T of S, we look at how many times s1 appears in T as a subsequence and how many times s2 appears in T as a subsequence.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257E - Trade Road

We are given a circle split into $K$ equally spaced positions, and a subset of $n$ of these positions contain markets. Each market sits at a fixed point on the circle, so we can think of the input as an increasing sequence of indices on a circular array.

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257A - chmod

Each input line describes a Unix-like permission configuration encoded in a compact numeric form. Instead of directly giving permissions for a file, the system uses a three-digit number, where each digit independently describes the access rights for one of three user classes…

Practice › Codeforces Solutions › 2024 ICPC ShaanXi Provincial Contest ›

CF 105257B - Expression Matrix

We are asked to construct an $n times m$ grid filled with only three symbols: 1, +, and . The grid is not just a static object, it defines expressions in two directions. Every row, read left to right, becomes a valid arithmetic expression.