2020-2021 Russia Team Open, High School Programming Contest (VKOSHP 20)
12 problems from 2020-2021 Russia Team Open, High School Programming Contest (VKOSHP 20) (contest 102893), difficulty -. 4/12 solutions verified against sample I/O.
2020-2021 Russia Team Open, High School Programming Contest (VKOSHP 20)
Special | 12 problems | 4/12 verified | Difficulty - | 8m 39s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Bank Transfer | 29s | ||||
| B | Bacteria | 2m 2s | ||||
| C | Check Markers | 35s | ||||
| D | Multiple Subject Lessons | 28s | ||||
| E | Prank at IKEA | 29s | ||||
| F | SMS from MCHS | 46s | ✓ | |||
| G | Cooking | 47s | ✓ | |||
| H | Hard Work | 23s | ||||
| I | Points and Segments | 25s | ||||
| J | Straight | 24s | ||||
| K | New Level | 1m 3s | ✓ | |||
| L | The Firm Knapsack Problem | 48s | ✓ |
CF 102893H - Hard Work
I’m missing the actual statement for Codeforces 102893H - Hard Work. Without the problem description (input/output definition and constraints), I can’t produce a correct editorial or even infer the intended solution reliably.
CF 102893J - Straight
The problem statement section is empty, so there isn’t enough information to reconstruct what Codeforces 102893J - Straight actually asks.
CF 102893E - Prank at IKEA
I can’t write a correct editorial yet because the actual problem statement for Codeforces 102893E - Prank at IKEA is missing.
CF 102893D - Multiple Subject Lessons
I can’t write a correct Codeforces editorial for this yet because the actual problem statement is missing. Right now I only see the title “102893D - Multiple Subject Lessons” but no description of: what the input contains, what decisions we’re making, or what the output…
CF 102893A - Bank Transfer
I’m missing the actual problem statement for Codeforces 102893A “Bank Transfer”, so I can’t reliably reconstruct the task or write a correct editorial.
CF 102893B - Bacteria
I can’t write a correct editorial yet because the problem statement is missing. “Codeforces 102893B - Bacteria” alone isn’t enough to reconstruct the task reliably, and guessing would risk producing a completely wrong solution and explanation.
CF 102893C - Check Markers
The problem statement is missing from your prompt, so there’s no way to correctly reconstruct the task, constraints, or required output for “Codeforces 102893C - Check Markers”.
CF 102893L - The Firm Knapsack Problem
We start from a standard 0-1 knapsack setting: each item has a weight and a value, and there is a capacity limit. The classical goal is to maximize total value without exceeding that limit.
CF 102893F - SMS from MCHS
The system is simulating a very small “SMS center” that processes events over time. Each event either injects a batch of messages into a queue at a specific second or triggers the processing of a single message from the front of that queue.
CF 102893I - Points and Segments
I don’t have the actual problem statement for Codeforces 102893I - Points and Segments, so I can’t reliably reconstruct the task or derive a correct solution.
CF 102893K - New Level
We are given a connected undirected graph with n vertices and m edges. Each vertex already has an integer label in the range 1 to k, and we are allowed to completely reassign these labels as long as we still use only values from 1 to k.
CF 102893G - Cooking
We are given a small collection of dishes, each of which must be prepared a fixed number of times. Cooking is done in pairs: on any day, the chefs choose two dishes, possibly the same one, and cook both together.