2020 KAIST 10th ICPC Mock Contest (XXI Open Cup. Grand Prix of Korea. Division 2)
12 problems from 2020 KAIST 10th ICPC Mock Contest (XXI Open Cup. Grand Prix of Korea. Division 2) (contest 102760), difficulty -. 9/12 solutions verified against sample I/O.
2020 KAIST 10th ICPC Mock Contest (XXI Open Cup. Grand Prix of Korea. Division 2)
ICPC/IOI | 12 problems | 9/12 verified | Difficulty - | 16m 16s
| # | Problem | Rating | Tags | Accepted | Time | ✓ |
|---|---|---|---|---|---|---|
| A | Advertisement Matching | 45s | ||||
| B | Bombs In My Deck | 1m 20s | ✓ | |||
| C | Economic One-way Roads | 1m 12s | ✓ | |||
| D | Fix Wiring | 1m 6s | ✓ | |||
| E | Min-hashing | 1m 5s | ✓ | |||
| F | Square, Not Rectangle | 58s | ✓ | |||
| G | LCS 8 | 2m 22s | ||||
| H | Mock Competition Marketing | 1m 17s | ✓ | |||
| I | Query On A Tree 17 | 1m 54s | ✓ | |||
| J | Remote Control | 1m 17s | ✓ | |||
| K | Sewing Graph | 1m 27s | ✓ | |||
| L | Steel Slicing 2 | 1m 33s |
CF 102760G - LCS 8
The full editorial you requested is too long to fit reliably in a single response while preserving all required sections, the proof explanation, the Python implementation, worked traces, and test harness.
CF 102760C - Economic One-way Roads
We have an undirected graph of cities. Every existing road must be assigned one direction, and the direction chosen for a road has a given cost.
CF 102760L - Steel Slicing 2
I can write the editorial, but the problem statement section in your prompt is empty, so I do not have the exact geometric details needed to produce a reliable explanation, proof, implementation, and test cases.
CF 102760H - Mock Competition Marketing
The problem models a sequence of advertisement auctions. There are only six possible advertisement types. Each type has a fixed price, and the company has a limited budget before the auctions start.
CF 102760A - Advertisement Matching
I can't write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes the title, "Codeforces 102760A - Advertisement Matching", with empty Problem Statement, Input, and Output sections.
CF 102760I - Query On A Tree 17
We have a rooted tree with root 1. Every vertex stores a nonnegative number of people. Initially every vertex has value zero. Each operation increases the values on either an entire subtree or an entire simple path.
CF 102760J - Remote Control
The grid is infinite, except that the cell (0,0) contains a wall. A remote control contains one fixed sequence of moves.
CF 102760K - Sewing Graph
The cloth contains $N$ points in the plane. A sewing sequence is a list of point indices. Consecutive points in this list define segments, and the side of the cloth on which a segment is drawn depends on whether its position in the sequence is odd or even.
CF 102760F - Square, Not Rectangle
We are given a histogram made of adjacent vertical tiles. The i-th tile has width 1 and height Hi, so a group of consecutive tiles forms a rectangle whose width is the number of chosen tiles and whose height is limited by the shortest tile in that group.
CF 102760E - Min-hashing
We have an undirected graph. Every vertex starts with a unique label, and the label values are a permutation of the numbers from 1 to n. In each round of the process, every vertex looks at its neighbors and keeps the smallest value currently present among them.
CF 102760D - Fix Wiring
The installation is a complete graph: every pair of nodes has a wire between them. The only missing information is which tag value belongs to which wire. We receive all tag values, and we must decide two different assignments of these values.
CF 102760B - Bombs In My Deck
We have a deck containing A cards. Among them, B are bombs and the remaining cards are safe. The order of the deck is random, so every possible placement of bombs has the same probability.