SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
Solutions for SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred) (contest 1662). 5/15 problems verified against sample I/O. Difficulty range: -.
SWERC 2021-2022 - Online Mirror (Unrated, ICPC Rules, Teams Preferred)
Type: ICPC/IOI | Problems: 15 | Verified: 5/15 | Rating range: - | Time: 37m 36s
| Problem | Name | Rating | Tags | Solve Time | Verified |
|---|---|---|---|---|---|
| A | Organizing SWERC | - | brute-force, implementation | 1m 28s | ✓ |
| B | Toys | - | greedy, strings | 1m 54s | ✗ |
| C | European Trip | - | dp, graphs, math | 5m 17s | ✗ |
| D | Evolution of Weasels | - | greedy, implementation, strings | 1m 29s | ✓ |
| E | Round Table | - | math | 1m 50s | ✗ |
| F | Antennas | - | data-structures, dfs-and-similar, graphs | 1m 37s | ✓ |
| G | Gastronomic Event | - | dp, greedy, trees | 2m 5s | ✗ |
| H | Boundary | - | brute-force, math | 2m 2s | ✗ |
| I | Ice Cream Shop | - | brute-force, implementation, sortings | 5m 45s | ✗ |
| J | Training Camp | - | flows, graphs | 2m 3s | ✗ |
| K | Pandemic Restrictions | - | geometry, ternary-search | 2m 11s | ✗ |
| L | Il Derby della Madonnina | - | data-structures, dp, math | 1m 39s | ✓ |
| M | Bottle Arrangements | - | constructive-algorithms | 4m 49s | ✗ |
| N | Drone Photo | - | combinatorics, math, sortings | 1m 27s | ✓ |
| O | Circular Maze | - | brute-force, dfs-and-similar, graphs | 2m | ✗ |
CF 1662M - Bottle Arrangements
We must build a row of n wine bottles. Each bottle is either red (R) or white (W). Every critic wants to find some contiguous segment of bottles whose contents match a requested pair (r, w), where r is the number of red bottles and w is the number of white bottles in that…
CF 1662O - Circular Maze
The maze is drawn in polar coordinates with the center as the starting point. Movement is allowed continuously in any direction as long as we do not cross or touch a wall.
CF 1662I - Ice Cream Shop
We are asked to place a new ice cream shop along a beach where huts are positioned at regular intervals of 100 meters. Each hut contains a certain number of people who will buy ice cream only from the shop that is strictly closest to their hut.
CF 1662N - Drone Photo
We are asked to count the number of ways to select four contestants standing on the vertices of a rectangle in an $n times n$ grid, such that when forming a banner using the two youngest contestants as one pole and the two oldest as another, the poles do not cross.
CF 1662L - Il Derby della Madonnina
We are given a sequence of moments in a football match when kicks happen, each kick occurring at a fixed time and a fixed position along the touch-line. At time zero, we start at position zero, and then we are allowed to move continuously along the line with a bounded speed.
CF 1662K - Pandemic Restrictions
We are tasked with finding a residence point in a 2D plane from which you can meet any pair of three friends such that the sum of distances from each attendee to the meeting point does not exceed a certain threshold $r$.
CF 1662J - Training Camp
We are given an $n times n$ grid of kids. Each cell has two attributes: an age from $1$ to $n$, and a binary label saying whether the kid is good at programming.
CF 1662H - Boundary
Bethany wants to tile her rectangular bathroom with a specific pattern. The interior, excluding the boundary, must be covered with standard $1 times 1$ tiles. The boundary is a one-tile-thick frame around the interior.
CF 1662G - Gastronomic Event
We are given a tree with n rooms, connected by n-1 corridors, forming a connected acyclic graph. Each room must host a unique Italian dish rated from 1 to n. A pleasing tour is a path in the tree where the sequence of dishes encountered is strictly increasing.
CF 1662C - European Trip
We are asked to count special trips on a graph of cities. Each city is a node, and each road is an undirected edge connecting two cities. A trip of length k is a sequence of k+1 cities such that each consecutive pair is connected by a road.
CF 1662F - Antennas
We are given a line of antennas indexed from left to right. Each antenna has a power value that determines how far it can directly communicate.
CF 1662E - Round Table
We have n people sitting at a round table, numbered from 1 to n. The initial seating is the natural order [1, 2, 3, …, n] clockwise around the table. We are given a desired seating order in the form of a permutation p.
CF 1662D - Evolution of Weasels
We are given two DNA strings over the alphabet {A, B, C}. The goal is to decide whether we can transform the first string into the second using a sequence of operations.
CF 1662B - Toys
We are given three strings, each representing a name. Think of each string as a multiset of letters we need to be able to reconstruct. We are allowed to manufacture “sheets”, and each sheet has two letters written on its two sides.