XXI Open Cup, Grand Prix of Korea

12 problems from XXI Open Cup, Grand Prix of Korea (contest 102759), difficulty -. 4/12 solutions verified against sample I/O.

12 items

XXI Open Cup, Grand Prix of Korea

Special | 12 problems | 4/12 verified | Difficulty - | 12m 53s

#	Problem	Time	✓
A	Advertisement Matching	44s
B	Cactus Competition	1m 12s
C	Economic One-way Roads	1m 15s	✓
D	Just Meeting	43s
E	Chemistry	2m 23s
F	Interval Graph	44s
G	LCS 8	1m 1s	✓
H	Alchemy	54s
I	Query On A Tree 17	1m 28s	✓
J	Remote Control	43s
K	Sewing Graph	1m 5s	✓
L	Steel Slicing 2	41s

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759A - Advertisement Matching

I can absolutely write a full editorial of that form, but I don't have enough information to do it correctly from the problem title alone.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759D - Just Meeting

I can't write a correct editorial for Codeforces 102759D - Just Meeting because the actual problem statement is missing. The prompt contains only the title and empty sections for "Problem Statement", "Input", and "Output".

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759L - Steel Slicing 2

I can't produce the editorial requested because it requires reconstructing the complete algorithm and code for a specific competitive programming problem whose full solution is not contained in your prompt.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759J - Remote Control

I don't have enough information to write a correct editorial for this problem because the actual problem statement is missing.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759H - Alchemy

I don't have enough information to write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes the title, "Codeforces 102759H - Alchemy", with empty Problem Statement, Input, and Output sections.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759F - Interval Graph

I don't have enough information to write a correct editorial for this problem. The prompt only provides the problem title, "Codeforces 102759F - Interval Graph", but the actual problem statement, input format, output format, and constraints are missing.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759E - Chemistry

I don't have enough information to write a correct editorial for this problem. The prompt includes only the problem title, but the actual statement, input format, constraints, and samples are missing.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759B - Cactus Competition

I can't write a correct editorial for this problem because the actual problem statement is missing. The prompt only includes the title: Codeforces 102759B - Cactus Competition but the Problem Statement, Input, and Output sections are empty.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759I - Query On A Tree 17

I’ll provide the editorial as a standalone document. The problem details used here are from the Codeforces statement and the standard solution idea for this problem. Edit We have a rooted tree with vertex 1 as the root. Every vertex stores a number of people, initially zero.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759K - Sewing Graph

We have a set of points on a plane representing dots on a cloth. A sewing sequence describes a walk through these dots. Every consecutive pair of dots in the sequence creates one edge, but the edges alternate between the front and back side of the cloth.

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759G - LCS 8

We are given an uppercase string S and a small integer k. We have to count how many different uppercase strings T of the same length as S have a longest common subsequence with S of length at least The condition says that T may differ from S only by a small amount when viewed…

Practice › Codeforces Solutions › XXI Open Cup, Grand Prix of Korea ›

CF 102759C - Economic One-way Roads

We have an undirected road network with at most 18 cities. Every existing road must be assigned one of its two possible directions, and the chosen directions must make the entire directed graph strongly connected.