Croc Champ 2013 - Round 1

5 problems from Croc Champ 2013 - Round 1 (contest 292), difficulty 1100-2000. 5/5 solutions verified against sample I/O.

5 items

Croc Champ 2013 - Round 1

Special | 5 problems | 5/5 verified | Difficulty 1100-2000 | 9m 28s

#	Problem	Rating	Tags	Accepted	Time	✓
A	SMSC	1100	implementation	2,864	1m 35s	✓
B	Network Topology	1200	graphs, implementation	10,507	1m 51s	✓
C	Beautiful IP Addresses	2000	brute-force	1,312	2m 38s	✓
D	Connected Components	1900	data-structures, dfs-and-similar, dp	2,770	2m 11s	✓
E	Copying Data	1900	data-structures	4,882	1m 13s	✓

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

CF 292B - Network Topology

We are given a connected undirected graph representing a computer network. The task is not to analyze arbitrary graph structure, but to determine whether the graph exactly matches one of three specific topologies. A bus topology is simply a path.

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

CF 292A - SMSC

We are given a sequence of tasks that arrive at a corporation's SMS center. Each task consists of a time ti when it arrives and a number ci of text messages to send. The SMS center can send at most one message per second, and messages are queued in the order they arrive.

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

CF 292E - Copying Data

We are asked to maintain two arrays of integers, a and b, each of length n. The first array a is static: its values never change.

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 cables are numbered from 1 to m in the order they appear in the input.

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

CF 292C - Beautiful IP Addresses

We are given a set of decimal digits. We must find every IP address consisting of four integers between 0 and 255 such that, after writing the four numbers next to each other without dots, the resulting string is a palindrome. The digit restriction is strict.