Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2]

Solutions for Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] (contest 1424). 0/2 problems verified against sample I/O. Difficulty range: 1300-2200.

2 items

Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2]

Type: Div. 2 | Problems: 2 | Verified: 0/2 | Rating range: 1300-2200 | Time: 8m 22s

Problem	Name	Rating	Tags	Solve Time	Verified
G	Years	1300	data-structures, sortings	6m 51s	✗
M	Ancient Language	2200	graphs, sortings	1m 31s	✗

Practice › Codeforces Solutions › Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] ›

CF 1424G - Years

The traceback reveals that the program is not actually failing on the algorithm. It is failing before any meaningful computation starts. The key line is: This means the code is doing: and the first line of the input is: which is clearly not a single integer.

Practice › Codeforces Solutions › Bubble Cup 13 - Finals [Online Mirror, unrated, Div. 2] ›

CF 1424M - Ancient Language

We are given a collection of pages from a fragmented dictionary. Each page has an identifier and contains a fixed number of words. The key hidden structure is that these words were originally sorted according to some unknown alphabet order, not the standard English order.