CEOI 2019 day 2 online mirror (unrated, IOI format)

Solutions for CEOI 2019 day 2 online mirror (unrated, IOI format) (contest 1193). 1/3 problems verified against sample I/O. Difficulty range: -.

3 items

CEOI 2019 day 2 online mirror (unrated, IOI format)

Type: ICPC/IOI | Problems: 3 | Verified: 1/3 | Rating range: - | Time: 15m 20s

Problem Name Rating Tags Solve Time Verified
A Amusement Park - *special, dp, math 4m 1s ✓
B Magic Tree - *special, data-structures, dp 3m 55s ✗
C Scissors and Tape - *special, constructive-algorithms, geometry 7m 24s ✗
Practice › Codeforces Solutions › CEOI 2019 day 2 online mirror (unrated, IOI format) ›

CF 1193C - Scissors and Tape

We are given two simple polygons in the plane, an initial shape and a target shape. Both polygons have equal area, but their geometry can be completely different.
codeforces competitive-programming *special constructive-algorithms geometry Jun 13, 2026
Practice › Codeforces Solutions › CEOI 2019 day 2 online mirror (unrated, IOI format) ›

CF 1193A - Amusement Park

We are given a set of attractions and some planned one-way slides between pairs of them. After construction, each slide can be reversed or kept as is, independently of others. What we ultimately choose is therefore just a direction for every existing edge.
codeforces competitive-programming *special dp math Jun 13, 2026
Practice › Codeforces Solutions › CEOI 2019 day 2 online mirror (unrated, IOI format) ›

CF 1193B - Magic Tree

We are given a rooted tree where vertex 1 is the root, and each other vertex has exactly one parent, so the structure is fixed and acyclic. Some non-root vertices contain a single fruit.
codeforces competitive-programming *special data-structures dp trees Jun 13, 2026