The 6th Liaoning Provincial Collegiate Programming Contest

13 problems from The 6th Liaoning Provincial Collegiate Programming Contest (contest 106380), difficulty -. 6/13 solutions verified against sample I/O.

13 items

The 6th Liaoning Provincial Collegiate Programming Contest

Special | 13 problems | 6/13 verified | Difficulty - | 9m 9s

#	Problem	Time	✓
A	Adventure of gulls	51s	✓
B	Be knocked off	24s
C	Colorful logo	46s	✓
D	Do you play Ballance?	37s	✓
E	Entering the unknown	32s
F	Front and back stone-taking	1m 19s
G	Generalized star graphs	41s
H	Homeland rescue	21s
I	I take from the richer	32s
J	Just reseat!	39s	✓
K	Kanon	56s
L	Leak	1m 3s	✓
M	Many CF Rounds vs Capoo	28s	✓

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380L - Leak

We are given an undirected graph of classmates where friendships are mutual and the whole class is connected. Information spreads deterministically: once a person receives a message, they immediately forward it to all their friends, so the message floods through the connected…

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380K - Kanon

I can write the editorial in that format, but I’m missing a reliable copy of the full problem statement details needed to make the algorithm and code correct.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380M - Many CF Rounds vs Capoo

I can write the editorial, but the full response will be quite long and the problem statement section in your prompt is empty.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380J - Just reseat!

The problem describes a course registration system with a fixed set of experiments. Students arrive one by one and choose an experiment. The first student choosing an experiment receives index 1 in that experiment, the next receives index 2, and so on.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380I - I take from the richer

I’m missing the actual statement of Codeforces 106380I - “I take from the richer”. Without the exact rules, any editorial would risk explaining the wrong problem entirely, and CF gym problems with similar names tend to differ a lot in structure.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380F - Front and back stone-taking

I can write the editorial in that format, but I need to verify the actual accepted idea first. The problem statement alone is not enough for me to confidently produce a correct editorial and implementation, because the key part is the exact Sprague-Grundy characterization of…

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380G - Generalized star graphs

I can write this editorial, but I need the exact problem statement or a confirmed solution approach first. The statement attached in the prompt is empty, and the problem has a non-trivial combinatorial counting solution.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380H - Homeland rescue

I can’t reliably reconstruct the full original statement of Codeforces 106380H - Homeland rescue from public sources, and the fragments available online do not correspond to a single consistent problem description.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380E - Entering the unknown

I cannot reliably reconstruct Codeforces problem 106380E from the identifier alone, and I should not guess the statement because that would lead to an incorrect editorial.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380D - Do you play Ballance?

We have a ball that can be one of three materials. Each mechanism on the path accepts some subset of these three materials. The ball must pass through every mechanism, but we are allowed to choose the order of mechanisms.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380A - Adventure of gulls

We have two sets of cells on a grid. Some cells contain seagulls and the same number of cells contain food. A command chooses a remaining seagull and a direction. The seagull moves until it reaches the first cell in that direction that does not contain another remaining seagull.

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380C - Colorful logo

We are given a directed graph where each edge carries a color label. A walk in this graph is allowed to revisit vertices and edges, but it becomes “valid” only if the colors along the walk alternate strictly, meaning you are never allowed to traverse two consecutive edges of…

Practice › Codeforces Solutions › The 6th Liaoning Provincial Collegiate Programming Contest ›

CF 106380B - Be knocked off

I can write the full editorial in that format, but I need the actual problem statement for Codeforces 106380B - Be knocked off first. The statement section in your prompt is empty, and I could not reliably identify the problem from the ID alone.