School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)
Solutions for School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules) (contest 46). 6/7 problems verified against sample I/O. Difficulty range: 800-2500.
School Personal Contest #2 (Winter Computer School 2010/11) - Codeforces Beta Round 43 (ACM-ICPC Rules)
Type: Beta | Problems: 7 | Verified: 6/7 | Rating range: 800-2500 | Time: 10m 14s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Ball Game | 800 | brute-force, implementation | 1m 23s | ✓ |
| B | T-shirts from Sponsor | 1100 | implementation | 1m 13s | ✓ |
| C | Hamsters and Tigers | 1600 | two-pointers | 1m 18s | ✓ |
| D | Parking Lot | 1800 | data-structures, implementation | 1m 54s | ✓ |
| E | Comb | 1900 | data-structures, dp | 1m 52s | ✓ |
| F | Hercule Poirot Problem | 2300 | dsu, graphs | 1m 1s | ✓ |
| G | Emperor's Problem | 2500 | geometry | 1m 33s | ✗ |
CF 46A - Ball Game
The children stand in a circle numbered from 1 to n. Child 1 starts with the ball. The first throw moves the ball forward by 1 position, the second throw moves it forward by 2 positions, the third throw by 3 positions, and so on.
CF 46B - T-shirts from Sponsor
We are given a limited stock of T-shirts in five sizes: S, M, L, XL, and XXL. Each participant in the contest has a preferred size. Participants arrive in a fixed order and try to pick the T-shirt closest to their preferred size.
CF 46D - Parking Lot
We have a parking segment represented by the interval [0, L]. Cars arrive one at a time, always driving from left to right, and each driver wants to park at the earliest possible position.
CF 46E - Comb
Each row of the table contains integers, and from every row we must take a positive-length prefix. If we choose c[i] cells from row i, then the selected cells in that row are exactly the first c[i] entries.
CF 46F - Hercule Poirot Problem
We are given a house with a certain number of rooms connected by doors, and each door has a unique key. There are several residents in the house, each initially in some room with some keys. We also know the positions and key holdings of every resident at a later time.
CF 46G - Emperor's Problem
We are asked to construct a convex polygon with vertices that satisfies three conditions. First, all vertices must lie on lattice points, meaning each coordinate is an integer. Second, all sides must have distinct lengths.