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

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

3 items

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

Type: ICPC/IOI | Problems: 3 | Verified: 2/3 | Rating range: - | Time: 12m 44s

Problem	Name	Rating	Tags	Solve Time	Verified
A	Building Skyscrapers	-	*special	1m 29s	✓
B	Dynamic Diameter	-	*special, data-structures, dfs-and-similar	3m 58s	✗
C	Cubeword	-	*special, brute-force, dp	7m 17s	✓

Practice › Codeforces Solutions › CEOI 2019 day 1 online mirror (unrated, IOI format) ›

CF 1192C - Cubeword

We are given a collection of strings that can be placed on the edges of a cube. Each string has length between 3 and 10, and we are allowed to use any of them repeatedly. A valid construction consists of taking a cube and assigning one string to each of its 12 edges.

Practice › Codeforces Solutions › CEOI 2019 day 1 online mirror (unrated, IOI format) ›

CF 1192B - Dynamic Diameter

Codeforces 1192B: Dynamic Diameter

Practice › Codeforces Solutions › CEOI 2019 day 1 online mirror (unrated, IOI format) ›

CF 1192A - Building Skyscrapers

We are given a set of points on an infinite grid. Each point represents a building site that must eventually be occupied by a skyscraper. We must decide an order to construct these skyscrapers one by one. Two constraints govern whether a building step is valid.