2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest

13 problems from 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest (contest 104345), difficulty -. 5/13 solutions verified against sample I/O.

13 items

2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest

Special | 13 problems | 5/13 verified | Difficulty - | 20m 57s

# Problem Rating Tags Accepted Time ✓
A Ring Road 30s
B Query on a Tree 1m 18s ✓
C A+B Problem 1m 36s ✓
D Building Bombing 1m 50s
E Double-Colored Papers 1m 34s
F Making Number 2m 44s
G One Path 3m 56s ✓
H Permutation Arrangement 1m 1s ✓
I Similarity Graph 1m 5s ✓
J Squirrel Game 32s
K Two Paths 1m 51s
L Village Planning 28s
M Window Arrangement 2m 32s
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345M - Window Arrangement

We are given an $N times M$ grid where each cell represents a room. Every room has a required number of windows $w{i,j}$, and each window is placed on one of the four sides of that room.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345K - Two Paths

We are working on a weighted tree where every pair of vertices is connected by exactly one simple path, and each edge contributes a positive cost. For any path, its value is just the sum of edge weights along that path.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345G - One Path

We start with a weighted tree, so initially there is exactly one simple path between every pair of vertices and the distance between two vertices is just the sum of weights along that unique path.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345L - Village Planning

I can’t produce a correct, detailed editorial for that problem yet because the actual problem statement is missing. Right now I don’t know what “Village Planning” is asking: whether it’s a graph construction task, geometry, greedy arrangement, or something else.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345I - Similarity Graph

We are given an undirected graph on vertices labeled from 1 to N. The task is to decide whether this graph can be generated from two hidden permutations of the vertices, p and q. The construction rule is based on comparing vertex labels under both permutations.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345J - Squirrel Game

I can’t write a correct editorial for Codeforces 104345J - Squirrel Game because the actual problem statement (rules, input format, and required output) is missing from your prompt.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345F - Making Number

We are given a fixed multiset of digits coming from a number $X$, and a second number $Y$ of the same length that changes over time.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345H - Permutation Arrangement

We are given a partially filled sequence of length $N$. Some positions are fixed to specific values, while others are free and marked as $-1$.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345E - Double-Colored Papers

We are given two strings, one representing a red strip and the other a blue strip. From each strip, we are allowed to choose a non-empty contiguous substring.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345D - Building Bombing

We are given a row of buildings with fixed heights. A building is considered “visible from the left” if it is strictly taller than every building before it. In other words, if we scan from left to right, a building becomes visible exactly when it sets a new prefix maximum.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345C - A+B Problem

We are given a rooted tree on $N$ vertices where the structure is encoded incrementally: each node $i+1$ has a parent $pi$, forming a connected acyclic graph.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345B - Query on a Tree

We are given a tree where each vertex is a distinct node and edges connect them without cycles. For any chosen subset of vertices, we only “allow ourselves to walk” through vertices inside that subset.
codeforces competitive-programming Jul 1, 2026
Practice › Codeforces Solutions › 2022-2023 Winter Petrozavodsk Camp, Day 4: KAIST+KOI Contest ›

CF 104345A - Ring Road

I can write the full editorial in the exact format you want, but I’m missing the actual problem statement for Codeforces 104345A - Ring Road.
codeforces competitive-programming Jul 1, 2026