Croc Champ 2013 - Round 1

Solutions for Croc Champ 2013 - Round 1 (contest 292). 4/4 problems verified against sample I/O. Difficulty range: 1100-2000.

4 items

Croc Champ 2013 - Round 1

Type: Special | Problems: 4 | Verified: 4/4 | Rating range: 1100-2000 | Time: 6m 34s

Problem	Name	Rating	Tags	Solve Time	Verified
A	SMSC	1100	implementation	1m 18s	✓
C	Beautiful IP Addresses	2000	brute-force	1m 33s	✓
D	Connected Components	1900	data-structures, dfs-and-similar, dp	1m 47s	✓
E	Copying Data	1900	data-structures	1m 56s	✓

Practice › Codeforces Solutions › Croc Champ 2013 - Round 1 ›

CF 292A - SMSC

We are asked to simulate the operation of a short message service center (SMSC) that receives tasks, each consisting of a timestamp and a number of messages to send. Each second, if there are messages waiting in the queue, the SMSC sends exactly one message.

Practice › Codeforces Solutions › Croc Champ 2013 - Round 1 ›

CF 292C - Beautiful IP Addresses

We are asked to generate "beautiful" IP addresses under a very specific definition. Each IP address consists of four decimal numbers between 0 and 255, written without leading zeroes, separated by periods.

Practice › Codeforces Solutions › Croc Champ 2013 - Round 1 ›

CF 292D - Connected Components

We have an undirected graph representing a computer network. The vertices are computers and the edges are cables. The edges are stored in a fixed order from 1 to m.

Practice › Codeforces Solutions › Croc Champ 2013 - Round 1 ›

CF 292E - Copying Data

We have two arrays, a and b, both of length n. Queries arrive online. One type of query copies a contiguous segment from a into a segment of b. If the query is (x, y, k), then: The second type asks for the current value at a single position in b.