2022 SYSU School Contest

13 problems from 2022 SYSU School Contest (contest 104531), difficulty -. 13/13 solutions verified against sample I/O.

13 items

2022 SYSU School Contest

Special | 13 problems | 13/13 verified | Difficulty - | 14m 33s

#	Problem	Time	✓
A	Everfree Forest	1m 8s	✓
B	a math problem	1m 58s	✓
C	Catch	45s	✓
D	Coffee	45s	✓
E	A Counting Problem	1m 3s	✓
F	Fighting in Group	1m 9s	✓
G	MicrosoftHearts	1m 32s	✓
H	coprime	49s	✓
I	Bracket	51s	✓
J	intervals	56s	✓
K	Xor-permutation	47s	✓
L	FYC`s luv letter	2m	✓
M	Water	50s	✓

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531L - FYC`s luv letter

This failure is no longer about the algorithm or even parsing logic. It is a pure implementation error introduced in the previous “fix”. The traceback is explicit: So the code uses: without importing sys. That is the immediate crash.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531M - Water

A line of people is served sequentially by a water dispenser. Each person has a demand in liters, and a single water bucket on the dispenser contains a fixed capacity of $C$ liters. People are served one after another using the current bucket until it runs out.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531K - Xor-permutation

We are given a permutation of numbers from 1 to n, and we are allowed to reorder them arbitrarily. For any chosen ordering, we compute a score by pairing each position i with the value placed there and taking the bitwise XOR of the two, then summing these values across all…

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531J - intervals

We are given a long array of integers and many queries on subsegments. For any interval inside the array, we call it “good” if that segment contains at least one even number and at least one odd number.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531G - MicrosoftHearts

We are given a two-player deterministic card game played with perfect information. Each player starts with their own hand of $n le 13$ cards, and all cards are known to both players. Every card has a suit among four types and a rank from 2 up to Ace.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531I - Bracket

We are given a string of length $n$ consisting of three types of characters: open brackets, close brackets, and wildcard characters. Each wildcard can later be turned into either an open or a close bracket.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531H - coprime

We are asked to count how many sequences of length n we can build using integers from 1 to m, with the restriction that every pair of adjacent elements must be coprime.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531F - Fighting in Group

We are given a line of cats labeled from 1 to n. Each cat wants to fight with every other cat except its immediate neighbors on the line. So cat i wants fights with all j such that the distance A fight does not happen directly in pairs one by one. Instead, we schedule rounds.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531E - A Counting Problem

We are counting how many integers lie in the range from 0 up to but not including $10^n$, with the extra requirement that each chosen number is divisible by a fixed integer of the form $3 cdot 2^a$.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531B - a math problem

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531D - Coffee

We are given a sequence of days, each day having a base cost for buying coffee. We are also given a collection of coupons. Each coupon has a deadline day and a discount value.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531A - Everfree Forest

We are given a connected undirected simple graph on $n$ labeled vertices, with the restriction that no vertex is allowed to have degree larger than 3. Among these vertices, exactly $k$ of them must have degree exactly 3, while every other vertex must have degree at most 2.

Practice › Codeforces Solutions › 2022 SYSU School Contest ›

CF 104531C - Catch

We are given an undirected tree where some nodes may contain hamsters. Each hamster is not static, it keeps moving forever.