The 18th Jilin Provincial Collegiate Programming Contest

12 problems from The 18th Jilin Provincial Collegiate Programming Contest (contest 105922), difficulty -. 12/12 solutions verified against sample I/O.

12 items

The 18th Jilin Provincial Collegiate Programming Contest

Special | 12 problems | 12/12 verified | Difficulty - | 10m 59s

#	Problem	Time	✓
A	Genius Cirno's Genius Computer	59s	✓
B	Triangle Uika	53s	✓
C	SSPPSPSP	50s	✓
D	Coprime	51s	✓
E	Eternal Feather	1m 14s	✓
F	Ever Forever	45s	✓
G	Rock-Paper-Scissors	51s	✓
H	Another Palindromes Problem	50s	✓
I	Black and White Coloring	1m 9s	✓
J	Odd-Even Game	53s	✓
K	Maximum Profit	45s	✓
L	Good Matrix	59s	✓

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922L - Good Matrix

We are working with a binary matrix of size $n times m$, where each cell contains either 0 or 1. For every position $(i, j)$, we define two quantities: the XOR of all elements in row $i$, and the XOR of all elements in column $j$.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922A - Genius Cirno's Genius Computer

We are given an interactive system that behaves like a tiny register machine. Four registers start with unknown positive integers, and four auxiliary registers start at zero.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922J - Odd-Even Game

We are given two integers, and we are told a strict structural property about them: one of them is guaranteed to be odd and the other is guaranteed to be even. Each number represents a “player’s choice” in a very simple comparison game.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922E - Eternal Feather

We are given a second-order linear recurrence sequence defined by two parameters $p$ and $q$. The sequence starts with $f(0)=0$, $f(1)=1$, and each next term is a linear combination of the previous two terms: $f(i)=p f(i-1)+q f(i-2)$. This is a Lucas-type sequence.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922K - Maximum Profit

We are given a square assignment problem where there are as many employees as jobs. Each employee-job pair has a profit that comes from two parts: a structural part derived from the employee’s skill value and the job’s requirement value, and an optional bonus that applies…

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922H - Another Palindromes Problem

We are given a mutable integer array. Two types of operations are applied over time. One operation increases every element in a contiguous segment by the same value.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922G - Rock-Paper-Scissors

We are given two players who each hold a multiset of Rock, Paper, and Scissors cards. Both players will play all their cards over n rounds, one card per round per player, and each round is evaluated by the usual Rock-Paper-Scissors rules.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922C - SSPPSPSP

We are given an array $a$ of length $n$, and a sequence of $k$ operators, each being either a sum operation or a product operation.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922D - Coprime

We are given two integers $x$ and $y$ such that there is at least one integer strictly between them. The task is to pick an integer $z$ that lies strictly inside the interval $(x, y)$, and at the same time is “compatible” with both endpoints in the sense that it shares no…

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922I - Black and White Coloring

We are given a simple undirected graph with maximum degree at most three. Initially every vertex is uncolored. Two players interact with this graph in two stages.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922F - Ever Forever

We are given a single string of lowercase letters. The task is to look at all ordered pairs of positions where the first position contains the character e, the second position contains the character f, and the e appears earlier in the string than the f.

Practice › Codeforces Solutions › The 18th Jilin Provincial Collegiate Programming Contest ›

CF 105922B - Triangle Uika

We are given three independent “moving points”, each controlled by its own polyline path. Each path is a sequence of coordinates, and the corresponding point starts at the first coordinate and moves along straight segments at constant unit speed until it reaches the last…