problem_id stringlengths 1 3 | statement stringlengths 1.44k 21.4k | type stringclasses 2
values | time_limit stringclasses 14
values | memory_limit stringclasses 5
values | config_yaml stringlengths 89 381 | checker_file stringclasses 6
values | interactor_file stringclasses 3
values | num_test_inputs int64 1 293 | num_test_answers int64 1 293 | archive_path stringclasses 1
value | source_url stringlengths 110 112 | source_commit stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
0 | # Pack the Polyominoes (Reflections Allowed)
## Problem
You are given a set of n polyominoes placed on a unit square grid. Each polyomino consists of between 1 and 10 unit cells, connected edge-to-edge (4-connectivity). Your task is to place all polyominoes—allowing **rotations, reflections, and translations**—into an... | default | 2s | 256m |
type: default
checker: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 70 | chk.cc | null | 70 | 70 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/0 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
1 | Problem F: Treasure Packing
A dragon has terrorized the region for decades, breathing fire and stealing treasures. A hero has decided to steal back the treasures and return them to the community. However, they drastically underestimated the size of the dragon's hoard, bringing only a single 25 liter bag, only strong e... | default | 1s | 1024m | type: default
# The time limit is now 1 second.
time: 1s
memory: 1024m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 20 | chk.cc | null | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/1 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
2 | Permutation
This is an interactive problem.
There is a hidden permutation of n. Recall that a permutation of n is a sequence where each integer from 1 to n (both inclusive) appears exactly once. Piggy wants to unravel the permutation with some queries.
Each query must consist of a sequence (not necessarily a permuta... | interactive | 4s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 4s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ..... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/2 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
3 | This is an interactive question.
time limit: 10 seconds (up to 5 seconds for interactive library)
Space limitations: 1GB (up to 64MB for interactive library)
Description
Hope City is a city built on a floating island. At the edge of the floating island, there are n lamp sockets evenly distributed, forming a ring shap... | interactive | 10s | 1024m | type: interactive
time: 10s
memory: 1024m
# A custom checker is required for the special scoring.
interactor: interactor.cc
subtasks:
- score: 100
n_cases: 20 | null | interactor.cc | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/3 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
4 | Problem: Matrix k-th Smallest (Interactive)
You are given an unknown n×n matrix a. You must find the k-th smallest value among all a[i][j].
You cannot read the matrix directly. Instead, you must interact with the judge using the protocol below.
The matrix satisfies:
for all i<=n and j<n: a{i,j}<=a{i,j+1}
for all i<n a... | interactive | 5s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 5 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 5 | 5 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/4 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
5 | Hamiltonian Path Challenge
Given a directed graph with n vertices and m edges, find a path visiting as
many distinct vertices as possible. Vertices may not be repeated. Every
consecutive pair must be a directed edge in the graph.
Input
The first line contains n and m.
The second line contains ten legacy integers. Rea... | default | 4s | 512m | type: default
time: 4s
memory: 512m
checker: chk.cc
cheker_type: SPJ
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/5 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
6 | worldmap
Day 1 Tasks
English (ISC)
World Map
Mr. Pacha, a Bolivian archeologist, discovered an ancient document near Tiwanaku that describes
the world during the Tiwanaku Period (300-1000 CE). At that time, there were N countries,
numbered from 1 to N.
In the document, there is a list of M different pairs of adjacent co... | default | 1s | 2048m | type: default
time: 1s
memory: 2048m
subtasks:
- score: 100
n_cases: 10
checker: chk.cc
checker_type: testlib
filename: std.cc | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/6 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
7 | Build a Computer
Input file: standard input
Output file: standard output
Time limit: 1 second
Memory limit: 1024 megabytes
You want to build a computer to achieve a specific functionality: Given an integerx, determine whether
x lies within the interval[L, R]. To accomplish this, you designed a directed acyclic graph (DAG)... | default | 1s | 1024m | type: default
time: 1s
memory: 1024m
subtasks:
- score: 100
n_cases: 1
checker: chk.cc
checker_type: testlib
filename: std.cc | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/7 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
8 | The Empress
Capoo invented an interesting language named Push-Pop. This language is an interpreted language. The interpreter starts with an empty stack with infinite capacity and reads the first instruction of the custom program. There are only two kinds of instructions in this language:
POP a GOTO x PUSH b GOTO y
I... | default | 2s | 1024m | # Set the problem type to interactive
type: default
# Specify the interactor source file
interactor: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, ... 5.in | null | chk.cc | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/8 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
9 | Time limit:1 second Memory limit:1024 megabytes
Bobo is given a tree T = (V, E) of n vertices, where there is a number pi on vertex i initially, and p1, p2,..., pn is a permutation of 1 to n, meaning that all integers from 1 to n appear exactly once in p1, p2, ..., pn.
In each operation, Bobo can select a matching M... | default | 1s | 1024m | type: default
time: 1s
memory: 1024m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 20 | chk.cc | null | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/9 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
10 | Problem: Tree distance
Time limit: 2 second
Memory limit: 512 MB
This is an interactive problem.
Little Cyan Fish has a weighted tree of n verticies generated in the following way:
- First, generate a random labeled tree: uniformly randomly select from all nn−2 possible labeled trees.
- Then, independently assign r... | interactive | 2s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/10 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
11 | # Palindrome Path
**Input file:** standard input
**Output file:** standard output
**Time limit:** 1 second
**Memory limit:** 256 megabytes
## Problem Description
Given an \( n \times m \) grid maze, each cell \((i,j)\) is either blank or blocked. George starts at cell \((sr,sc)\) and needs to visit all blank cells i... | default | 2s | 512m | type: default
time: 2s
memory: 512m
checker: chk.cc
cheker_type: testlib
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/11 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
13 | Time limit: 2 seconds
Memory limit: 1024 megabytes
This is an interactive problem.
A mischievous robot is navigating an infinitely large 2D grid. However, its movement is confined to the first quadrant, meaning its coordinates (x, y) must always satisfy x > 0 and y > 0. Initially, the robot is located at grid coordinat... | interactive | 2s | 1024m | type: interactive
time: 2s
memory: 1024m
# A custom checker is required for the special scoring.
checker: interactor.cc
subtasks:
- score: 100
n_cases: 10 | interactor.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/13 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
14 | Problem Statement
There are n vertices forming a simple cycle. It is guaranteed that the graph satisfies the following property:
- There exists a permutation p of length n such that for every i (1 ≤ i < n), the vertices p_i and p_{i+1} are adjacent in the graph, and also p_n and p_1 are adjacent.
At the beginning of... | interactive | 5s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, .... | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/14 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
15 | Problem Statement
You are given a sequence p of length n, which is a permutation of the numbers 1, 2, ..., n.
Your goal is to make the permutation lexicographically as small as possible by performing a specific operation at most 4n times, and then minimize the number of operations needed to reach that.
More specifica... | default | 1s | 512m | type: default
# The time limit is now 1 second.
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/15 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
16 | Problem: Identify Chord
This is an interactive problem.
Grammy has an undirected cyclic graph of n (4 ≤ n ≤ 10^9) vertices numbered from 1 to n.
An undirected cyclic graph is a graph of n vertices and n undirected edges that form one cycle. Specifically, there is a bidirectional edge between vertex i and vertex ((i m... | interactive | 5s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, .... | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/16 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
17 | Permutation (Interactive Problem)
Time limit: 10s
Memory limit: 1024MB
You are given an unknown permutation of length n. Your task is to determine the position of number n
in this permutation.
Interaction Protocol
--------------------
To help you find the position of n, you may ask queries of the following form:
? ... | interactive | 10s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for... | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/17 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
22 | Problem C. A+B Problem
Input file: standard input
Output file: standard output
Time limit: 2 seconds
Memory limit: 1024 mebibytes
In the era of constructives and ad-hocs, what could be more sacrilegious than combining two query problems
into one?
KOI City consists of N intersections and N − 1 two-way roads. You can t... | default | 2s | 512m | type: default
time: 2s
memory: 512m
checker: checker.cpp
cheker_type: testlib
subtasks:
- score: 100
n_cases: 10 | checker.cpp | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/22 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
23 | # A=B
**Input file:** standard input
**Output file:** standard output
**Time limit:** 1 second
**Memory limit:** 512 megabytes
Marisa has learned an interesting language called **A=B**. She finds that this language has the advantages of simple syntax, easy to learn and convenient to code.
Here is the user manual of ... | default | 2s | 512m | type: default
time: 2s
memory: 512m
checker: check.cpp
cheker_type: testlib
subtasks:
- score: 100
n_cases: 16
| check.cpp | null | 16 | 16 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/23 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
24 | Time limit: 1 seconds
Memory limit: 512 megabytes
Bobo has an n×n symmetric matrix C consisting of zeros and ones. For a permutation p_1, ..., p_n of 1, ..., n, let c_i=(C_{p_i, p_{i+1}} for 1 ≤ i < n, C_{p_n, p_1} for i = n).
The permutation p is almost monochromatic if and only if the number of indices i (1 ≤ i < n) ... | default | 1s | 512m | type: default
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/24 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
25 | Time limit: 2 seconds
Memory limit: 512 megabytes
This is an interactive problem, where your program and the judge interact via standard input and output.
In the kingdom of Duloc, Lord Farquaad is developing a network of watchtowers to monitor every corner of his land. He has a map of towers and the roads that connect ... | interactive | 2s | 512m | type: interactive
time: 2s
memory: 512m
# A custom checker is required for the special scoring.
checker: interactor.cc
subtasks:
- score: 100
n_cases: 10 | interactor.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/25 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
26 | OgreSort
You need to sort a permutation v of length n. All elements of the permutation are indexed from 1 to n.
The only permitted type of move allows you to take an element from some position x and insert it at
another position y, shifting all elements in between by one. The cost of such a move is y.
Formally, a move... | default | 2s | 512m | type: default
time: 2s
memory: 512m
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/26 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
27 | # Problem
You are given an n by m grid. You want to place as many black points (cells) as possible so that no four of them form the four corners of an axis-parallel rectangle.
Formally, if you place black points at positions (r, c) with 1 ≤ r ≤ n and 1 ≤ c ≤ m, your set S of chosen positions must not contain four dis... | default | 1s | 512m | type: default
# The time limit is now 1 second.
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/27 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
28 | Hacking the Project
Input file: standard input
Output file: standard output
Time limit: 1 second
Memory limit: 512 mebibytes
This is an interactive problem.
Lewis is one of the developers of the new programming language called DiverC. The main feature of the
program written in this language is that the code consists of p... | interactive | 1s | 512m | type: interactive
time: 1s
memory: 512m
subtasks:
- score: 100
n_cases: 10
interactor: interactor.cc
checker_type: testlib | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/28 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
30 | This is an interactive problem.
You are given a tree of n
nodes with node 1
as its root node.
There is a hidden mole in one of the nodes. To find its position, you can pick an integer x
(1≤x≤n
) to make an inquiry to the jury. Next, the jury will return 1
when the mole is in subtree x
. Otherwise, the judge will ... | interactive | 4s | 256m | type: interactive
time: 4s
memory: 256m
subtasks:
- score: 100
n_cases: 10
interactor: interactor.cc
checker_type: testlib | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/30 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
33 | Permutation (Modified Version)
Time Limit: 5 s
Memory Limit: 1024 MB
The Pharaohs use the relative movement and gravity of planets to accelerate their spaceships. Suppose a spaceship will pass by some planets with orbital speeds in order. For each planet, the Pharaohs' scientists can choose whether to accelerate the ... | default | 5s | 1024m | type: default
time: 5s
memory: 1024m
subtasks:
- score: 100
n_cases: 6
checker: checker.cpp
checker_type: testlib | checker.cpp | null | 6 | 6 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/33 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
35 | Language: C++ only
Time limit per test: 5 seconds
Memory limit per test: 1024 megabytes
This is an interactive problem.
There is a hidden array a containing all the numbers from 1 to n, and all of them appear twice except one (which only appears once).
You can ask queries in the following format, where S is a subse... | interactive | 5s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for ... | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/35 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
36 | Hack!
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all output at once. In these problems, the program sends queries (output) to the judge and must immediately read responses (input) before c... | interactive | 3s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 3s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 32 # Looks for 1.in, 2.in, .... | null | interactor.cpp | 32 | 32 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/36 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
40 | Interactive RBS
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all output at once. In these problems, the program sends queries (output) to the judge and must immediately read responses (input... | interactive | 2s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 50 # Looks for 1.in, 2.in, ..... | null | interactor.cpp | 50 | 50 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/40 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
41 | # Problem
Anton owns \(n\) umbrellas, each labeled with a distinct integer from \(1\) to \(n\). He wants to arrange some of them in a line to form a brilliant sequence of umbrellas (BSU).
A sequence of \(k\) umbrellas with numbers \(a_1, a_2, \ldots, a_k\) is a BSU if:
- \(a_i > a_{i-1}\) for all \(2 \le i \le k\);
... | default | 1s | 512m | type: default
# The time limit is now 1 second.
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/41 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
42 | Problem
You are given an integer n. Place n unit squares (side length 1) inside an axis-parallel square container of side length L so that:
- Every unit square lies entirely inside the container.
- Unit squares have no common interior points (touching edges/corners is allowed).
- Each unit square may be rotated by an a... | default | 1s | 512m | type: default
# The time limit is now 1 second.
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 20 | chk.cc | null | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/42 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
43 | Bigger Sokoban 40k
Time Limit: 2 seconds
Memory Limit: 1024 MB
Problem
Sokoban is a famous puzzle game where a player moves around in a grid and pushes boxes to their storage locations.
Bigger Sokoban is a variation of Sokoban where both the boxes and the storage locations are larger than 1×1.
In this version, both b... | default | 2s | 1024m | type: default
time: 2s
memory: 1024m
subtasks:
- score: 100
n_cases: 1
checker: chk.cpp
checker_type: testlib | chk.cpp | null | 1 | 1 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/43 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
44 | Problem: Traveling Santa with Carrot Constraint
Story
Rudolph plans to shorten Santa’s route by choosing a better order to visit cities. Every 10th step takes 10% longer unless that step starts from a prime-numbered city. Your task is to output a valid tour and compete on how much you improve over a strengthened basel... | default | 2.5s | 512m | type: default
# The time limit is now 1 second.
time: 2.5s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 20 | chk.cc | null | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/44 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
45 | Problem: Balanced Graph Partitioning (DIMACS10-style, EC & CV)
Overview
--------
You are given an undirected, unweighted graph G = (V, E) and an integer k (a power of two).
Assign each vertex to one of k parts so that:
1) the balance constraint is satisfied, and
2) two quality measures are minimized with equal imp... | default | 1s | 512m | type: default
time: 1s
memory: 512m
checker: chk.cc
subtasks:
- score: 1
n_cases: 15
| chk.cc | null | 15 | 15 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/45 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
46 | Title: Job Shop Scheduling (JSPLIB-style) — Open Optimization Track
Overview
--------
You are given a classic Job Shop Scheduling Problem (JSSP). There are J jobs and M machines.
Each job must be processed exactly once on each machine, in a job-specific order (its *route*).
Processing is non-preemptive. A machine can ... | default | 1s | 512m | type: default
# The time limit is now 1 second.
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 1
n_cases: 15
| chk.cc | null | 15 | 15 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/46 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
47 | 2D Rectangular Knapsack with (Optional) 90° Rotations — Official Problem Statement (Hard Set)
============================================================================================
Summary
-------
You are given a single rectangular **bin** and several **item types**. Each item type t has
dimensions (w_t, h_t), p... | default | 1s | 512m | type: default
time: 1s
memory: 512m
checker: chk.cc
subtasks:
- score: 1
n_cases: 15
| chk.cc | null | 15 | 15 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/47 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
48 | Sphere Packing in a Cube (Optimization)
You are given an integer n. Place n pairwise-disjoint congruent solid spheres inside the unit cube [0, 1]^3 so that the common radius is as large as possible. You do not need to output the radius explicitly; the checker infers the largest valid common radius from your centers.
... | default | 1s | 512m | type: default
time: 1s
memory: 512m
checker: chk.cc
subtasks:
- score: 1
n_cases: 15
| chk.cc | null | 15 | 15 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/48 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
50 | Time Limit: 10s
Memory Limit: 1024M
Firstly, you are given two integers n (1 <= n <= 400) and m (1 <= m <= 4000), which means that you have n elements and m sets.
After that, there are m integers, the i-th integer is the cost of choosing the i-th set.
After that, for the i-th element, firstly input an integer k_i, w... | default | 10s | 1024m | type: default
time: 10s
memory: 1024m
subtasks:
- score: 100
n_cases: 40
checker: chk.cc
checker_type: testlib
filename: std.cc | chk.cc | null | 40 | 40 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/50 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
52 | Geemu
This is an interactive problem.
Little A has an interesting game.
Initially, there is a permutation p of length n. You don't know the permutation p, and you need to determine the final p through the following operations:
1. Query the number of value-contiguous segments in a given interval.
2. Swap two elements ... | interactive | 2s | 512m | type: interactive
interactor: interactor.cc
time: 2s
memory: 512m
subtasks:
- score: 100
n_cases: 9 | null | interactor.cc | 9 | 9 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/52 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
53 | Problem: G2. Inter Active (Hard Version)
Time limit: 2 seconds
Memory limit: 512 MB
This is the hard version of the problem. The difference between the versions is that in this version, you can make at most 10 * n queries. You can hack only if you solved all versions of this problem.
Ali loved Bahamin's gift (from ... | interactive | 2s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 1 # Looks for 1.in, 2.in, ... ... | null | interactor.cc | 1 | 1 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/53 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
54 | Problem: Centroid Guess
Time limit: 4 seconds
Memory limit: 512 MB
This is an interactive problem.
There is an unknown tree consisting of n nodes, which has exactly one centroid.
You only know n at first, and your task is to find the centroid of the tree.
You can ask the distance between any two vertices. However,... | interactive | 4s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 4s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/54 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
57 | time limit per test: 5 seconds
memory limit per test: 1024 megabytes
**Submissions are only allowed in C++ language.**
This problem is interactive.
Baudelaire is very rich, so he bought a tree of size n, rooted at some arbitrary node. Additionally,
every node has a value of 1 or -1.
Cow the Nerd saw the tree and fe... | interactive | 5s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 15 # Looks for ... | null | interactor.cpp | 15 | 15 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/57 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
58 | Inverse Counting Path
Walk Alone is an expert in dynamic programming, but he gets bored with traditional dynamic programming problem like counting paths on a 2-dimension grid, so he wants to do it in reverse. The problem he raised is as follows:
On a 2-dimension grid of size n*n, originally you are on grid (1,1). The... | default | 1s | 512m | # Set the problem type to interactive
type: default
# Specify the interactor source file
interactor: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, ... 5.in | null | chk.cc | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/58 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
59 | # Limited Shuffle Restoring
**Input file:** standard input
**Output file:** standard output
**Time limit:** 3 seconds
**Memory limit:** 512 meblbytes
**This is an interactive problem.**
Bobo had an array \\( a \\), initially equal to \\((1,2,\ldots,n)\\). He did the following operations with the array.
- For each \... | interactive | 3s | 512m | type: interactive
time: 3s
memory: 512m
interactor: interactor.cpp
interactor_type: testlib
subtasks:
- score: 100
n_cases: 10 | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/59 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
60 | # Problem K: Probing the Disk
**Time Limit: 2 seconds**
*This is an interactive problem.*
A thin black disk is laid flat on the square bottom of a white box. The sides of the box bottom are 10^5 units long.
Somehow, you are not allowed to look into the box, but you want to know how large the disk is and where in th... | interactive | 3s | 512m | type: interactive
time: 3s
memory: 512m
interactor: interactor.cpp
interactor_type: testlib
subtasks:
- score: 100
n_cases: 10 | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/60 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
61 | # Let's Go! New Adventure
**Input file:** standard input
**Output file:** standard output
**Time limit:** 3 seconds
**Memory limit:** 1024 megabytes
In Pigeland, Pishin is a popular open-world action RPG where users can play multiple characters. Each character has an independent adventure rank, which increases ... | default | 3s | 1024m | type: default
time: 3s
memory: 1024m
checker: check.cpp
cheker_type: testlib
subtasks:
- score: 100
n_cases: 57 | check.cpp | null | 57 | 57 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/61 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
62 | Ball Moving Game
Xiao C is playing a ball-moving game. In front of him, there are n + 1 pillars, numbered from 1 to n + 1. On each of the first n pillars, there are m balls placed from bottom to top, while pillar (n + 1) initially has no balls. Altogether there are n × m balls in n different colors, with exactly m bal... | default | 1s | 512m | # Set the problem type to interactive
type: default
# Specify the interactor source file
interactor: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 20 # Looks for 1.in, 2.in, ... 5.in | null | chk.cc | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/62 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
63 | Space Thief
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all output at once. In these problems, the program sends queries (output) to the judge and must immediately read responses (input) be... | interactive | 2s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 293 # Looks for 1.in, 2.in, ... | null | interactor.cpp | 293 | 293 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/63 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
68 | Pen
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all output at once. In these problems, the program sends queries (output) to the judge and must immediately read responses (input) before con... | interactive | 5s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ..... | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/68 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
69 | Time limit per test: 10 seconds
Memory limit per test: 256 megabytes
Note: The only difference between versions of this problem is the maximum value of n.
Overview
Professor Vector is preparing to teach her Arithmancy class. She needs to prepare n distinct magic words for the class. Each magic word is a string over th... | interactive | 10s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ..... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/69 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
70 | Problem: Treasure Hunt
Time limit: 5 seconds
Memory limit: 256 MB
This is an interactive problem.
Imagine you are a treasure hunter exploring an ancient map represented as an undirected graph with n vertices (junctions) and m edges (roads). You start at a known fixed vertex. Your goal is to visit every vertex in th... | interactive | 5s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 11 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 11 | 11 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/70 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
72 | Puzzle
There is a puzzle game. The board is a 6 × 6 grid with grooves in the tiles to allow vehicles to slide. Cars and trucks are both one square wide, but cars are two squares long and trucks are three squares long. Vehicles can only be moved forward or backward along a straight line on the grid. The goal of the gam... | default | 2s | 1024m | type: default
time: 2s
memory: 1024m
checker: chk.cc
subtasks:
- score: 100
n_cases: 13 | chk.cc | null | 13 | 13 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/72 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
73 | Inversion
Description
This is an interactive problem.
There is a hidden permutation p1, p2, ..., pn of {1, 2, ..., n}.
You want to find it by asking for the parity (even or odd) of the number of inversions in a subarray pl, ..., pr.
You can query in the format:
0 l r
and the interactor will respond with
(sum over a... | interactive | 1s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, ... | null | interactor.cpp | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/73 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
75 | Black and White
Time limit: 2 seconds
Memory limit: 256 megabytes
------------------------------------------------------------
The jury has a great artistic idea — to create a rectangular
panel out of a huge pile of black and white squares of the
same size. The panel should have exactly b 4-connected areas
made of bl... | default | 2s | 256m | # Set the problem type to interactive
type: default
# Specify the interactor source file
interactor: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 1 # Looks for 1.in, 2.in, ... 5.in | null | chk.cc | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/75 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
77 | Problem:
Time limit: 3 seconds
Memory limit: 512 megabytes
The popular improv website Interpretation Impetus hosts regular improv contests and maintains a rating
of the best performers. However, since improv can often go horribly wrong, the website is notorious for
declaring improv contests unrated. It now holds a wage... | interactive | 3s | 512m | type: interactive
time: 3s
memory: 512m
subtasks:
- score: 100
n_cases: 10
interactor: interactor.cc
checker_type: testlib | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/77 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
79 | Problem H. Hack
Time limit: 10 seconds
Heidi is analyzing a peculiar device. This device takes an `a` as input and computes `a^d (mod n)` using the following pseudocode and some integers `d` and `n` stored in this device:
```
1 modPow(a, d, n) {
2 r=1;
3 for (i=0;i<60;++i) {
4 if ((d&(1<<i))!=0) {
5 r=r... | interactive | 10s | 128m | type: interactive
time: 10s
memory: 128m
subtasks:
- score: 100
n_cases: 10
interactor: interactor.cc
checker_type: testlib | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/79 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
80 | Indiana Jones and the Uniform Cave
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all output at once. In these problems, the program sends queries (output) to the judge and must immediately re... | interactive | 2s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 1 # Looks for 1.in, 2.in, ...... | null | interactor.cpp | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/80 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
81 | Time Limit: 2 s
Memory Limit: 1024 MB
This is an interactive problem.
Bitaro found out that a string S of length N was written on the stone slate. Each character of the string is either ‘0’ or ‘1’. However, he does not yet know each character of the string S.
Bibako found out how to use the machine. To use it, we put t... | interactive | 2s | 1024m | type: interactive
time: 2s
memory: 1024m
# A custom checker is required for the special scoring.
checker: interactor.cc
subtasks:
- score: 100
n_cases: 10 | interactor.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/81 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
82 | Problem
Joe chose a hidden permutation p of length n consisting of all integers from 0 to n−1 (each used exactly once).
Your goal is to recover the entire permutation.
Interactive Protocol
• You may query two distinct indices i and j (1 ≤ i, j ≤ n, i ≠ j).
• To ask a question, print: ? i j
• The interactor replies ... | interactive | 1s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/82 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
83 | # Function
## Problem Description
Construct a **completely multiplicative function** \( f \) (that is, \( f(xy) = f(x)f(y) \)) such that \(|f(i)| = 1\) for all \(i\), and **minimize**
\[
\max_{1 \le k \le n} \left| \sum_{i=1}^k f(i) \right|.
\]
## Input
A single integer \( n \).
## Output
Output \( n \) integers... | default | 3s | 1024m | type: default
time: 3s
memory: 1024m
checker: check.cpp
cheker_type: testlib
subtasks:
- score: 100
n_cases: 1 | check.cpp | null | 1 | 1 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/83 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
85 | Maze
Time limit: 2s
Memory limit: 512MB
3.1 Background
The subject of this work is SCP-167. It is recommended to review information about SCP-167 before proceeding with the work.
3.2 Description
SCP-167 can be roughly described as a point connected to an infinitely deep binary tree, as shown in the figure below.
Lev... | interactive | 2s | 512m | type: interactive
time: 2s
memory: 512m
subtasks:
- score: 100
n_cases: 1
interactor: interactor.cc
checker_type: testlib | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/85 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
86 | Hidden Tree
This is an interactive problem.
There is a hidden tree with n nodes. The nodes are numbered from 1 to n. Your task is to discover the structure of this tree by asking queries.
Each query consists of three distinct node numbers. The interactor will return the node that minimizes the sum of distances to th... | interactive | 2s | 512m | type: interactive
interactor: interactor.cc
time: 2s
memory: 512m
subtasks:
- score: 100
n_cases: 10 | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/86 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
87 | Graph Coloring
You are given an undirected graph G with n nodes. Each node is colored either black (0) or white (1). You are given the initial coloring state and the target coloring state. Your task is to transform the graph from the initial state to the final state using a sequence of valid transformations.
In one t... | default | 2s | 512m | type: default
time: 2s
memory: 512m
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/87 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
89 | Problem: Tree Reconstruction via Steiner-Membership Queries
Time limit: 3 seconds
Memory limit: 512 MB
This is an interactive problem.
You are given an unknown unweighted tree T with n labeled vertices V = {1, 2, ..., n}. Your task is to determine all edges of T by interacting with a judge.
Definition
For any subse... | interactive | 3s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 3s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 20 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/89 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
93 | Greedy
Time limit: 7 seconds
Memory limit: 512 MB
This is an interactive problem. All communication is via standard input/output (no input/output files).
Story
Little U tackles an optimization on trees but only has a greedy “black box.” You must reconstruct the hidden tree using queries to this black box.
Core Probl... | interactive | 7s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 7s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/93 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
101 | Problem Name: Circuit
Description:
You are given a circuit board consisting of N component slots and R external switches.
Each slot contains either an AND gate (&) or an OR gate (|). The actual type of each slot is hidden.
Your task is to determine the true type of every slot by interacting with the judge.
Specificat... | interactive | 5s | 1024m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 5s
memory: 1024m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 16 # Looks for ... | null | interactor.cpp | 16 | 16 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/101 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
104 | Time Limit: 2 s
Memory Limit: 256 MB
This is an interactive problem.
There are n students, having roll numbers 1 to n. Mr. 1048576 knows that exactly 1 student is absent today. In order to determine who is absent, he can ask some queries to the class. In each query, he provide two integers l and r (1≤l≤r≤n) and all stu... | interactive | 2s | 256m | type: interactive
time: 2s
memory: 256m
# A custom checker is required for the special scoring.
checker: interactor.cc
subtasks:
- score: 100
n_cases: 10 | interactor.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/104 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
106 | Hidden Bipartite Graph
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all output at once. In these problems, the program sends queries (output) to the judge and must immediately read responses... | interactive | 10s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, ... | null | interactor.cpp | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/106 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
107 | F. Guess Divisors Count
time limit per test: 2 seconds
memory limit per test: 256 megabytes
input: standard input
output: standard output
This is an I/O interactive problem. I/O interaction refers to interactive problems, where the program communicates with a special judge during execution instead of producing all ou... | interactive | 2s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ..... | null | interactor.cpp | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/107 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
108 | time limit per test: 1 second
memory limit per test: 256 megabytes
This is an interactive problem.
Zookeeper has set up a special lock for the rabbit enclosure.
The lock consists of n concentric rings numbered from 0 to n−1. The innermost ring is ring 0 and the outermost ring is ring n−1. All rings are split equally in... | interactive | 1s | 256m | type: interactive
time: 1s
memory: 256m
# A custom checker is required for the special scoring.
checker: interactor.cc
subtasks:
- score: 100
n_cases: 10 | interactor.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/108 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
109 | Time Limit: 1 second
Memory Limit: 128 MB
Description
A knight moves on an N×N chessboard and must try to visit every square exactly once (no revisiting). Given the board size and the starting square, output the longest possible path.
Note that this problem doesn't require a full complete path. It only asks you to fin... | default | 1s | 128m | type: default
time: 1s
memory: 128m
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 # auto-picks 1.in…10.in and (logically) 1.out…10.out,
# but your JudgeEngine first tries "X.ans" before "X.out".
| chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/109 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
110 | TIME LIMIT: 1 minute
MEMORY LIMIT: 814 MB
Description
Create and print an 8 × 14 table (grid) whose cells contain only digits 0–9. We say a number can be “read” from the grid if it can be formed as follows:
- Start at any cell in the grid.
- Move to an adjacent cell each step, where adjacency includes up, down, left,... | default | 1s | 128m | type: default
time: 1s
memory: 128m
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 # auto-picks 1.in…10.in and (logically) 1.out…10.out,
# but your JudgeEngine first tries "X.ans" before "X.out".
| chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/110 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
111 | Problem: Distinct Pairwise XOR Set
Time Limit: 1 second
Memory Limit: 512 MB
Description
Given an integer n, find a subset S ⊆ {1, 2, ..., n} such that:
1) For all pairs (a, b) with a, b ∈ S and a < b, the values (a XOR b) are all distinct (i.e., no two different unordered pairs produce the same XOR).
2) |S| ≥ floor(... | default | 1s | 128m | type: default
time: 1s
memory: 128m
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 # auto-picks 1.in…10.in and (logically) 1.out…10.out,
# but your JudgeEngine first tries "X.ans" before "X.out".
| chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/111 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
112 | SphereSpread
You are given an integer n. You need to place n points in 3D space such that all points lie within or on
a unit sphere centered at the origin (i.e., the distance from each point to the origin is at most 1).
Your goal is to maximize the minimum pairwise distance between any two points. In other words, you... | default | 2s | 512m | type: default
time: 2s
memory: 512m
checker: chk.cc
subtasks:
- score: 100
n_cases: 20 | chk.cc | null | 20 | 20 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/112 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
113 | Problem
There are $N$ balls numbered from $1$ to $N$, and three baskets numbered from $1$ to $3$. Initially, all $N$ balls are in basket $1$.
Balls can be moved from one basket to another according to the following rules:
When the balls in a basket are arranged in numerical order, the ball in the middle is called the... | default | 1s | 512m | type: default
time: 1s
memory: 512m
subtasks:
- score: 100
n_cases: 10
checker: chk.cc
checker_type: testlib
filename: std.cc | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/113 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
117 | Line
The territory of country P is a square with side length 2 * 10^12.
The origin is placed at the center of the square, and a Cartesian coordinate system is established so that the sides of the square are parallel to the axes.
Thus, the territory of country P is the region [-10^12, 10^12] × [-10^12, 10^12].
There a... | interactive | 1s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, .... | null | interactor.cpp | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/117 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
119 | Operators
- You are given n operators op₁, op₂, …, opₙ. For an input sequence of
n+1 integers a₀, a₁, …, aₙ, you need to compute the following value:
(((…(a₀ op₁ a₁) op₂ a₂) op₃ a₃)… opₙ aₙ) mod (10⁹ + 7).
- For any 0 ≤ i ≤ n, we have 0 ≤ aᵢ < 10⁹ + 7.
- For any 1 ≤ i ≤ n, opᵢ ∈ {+, ×}; that is, each ope... | interactive | 1s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, .... | null | interactor.cpp | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/119 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
120 | “Da Bai” (Interactive)
There is an undirected simple graph with 100 vertices.
In each query, you can ask the interactor by choosing three distinct vertices a, b, c.
The interactor will tell you how many edges exist among the three vertices {a, b, c}, i.e., the number of edges in the induced sub-graph on {a, b, c}. Th... | interactive | 1s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cpp
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100 # Looks for 1.in, 2.in, .... | null | interactor.cpp | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/120 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
121 | DNA Matching
Time Limit: 2 s
Memory Limit: 512 MB
A string s is called a “DNA sequence” if and only if s consists only of the characters A, C, G, T.
You are given m strings s1, s2, ..., sm, each of length n, and each of them consists only of the characters A, C, G, T, ?.
For a DNA sequence t of length n, we call t ... | default | 2s | 512m | # Set the problem type to interactive
type: default
# Specify the interactor source file
interactor: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 21 # Looks for 1.in, 2.in, ... 5.in | null | chk.cc | 21 | 21 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/121 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
122 | This is an interactive problem.
The RiOI Team has recently developed a text editor named RiOI Editor. The editor works with exactly one integer parameter W
— the width of each line. It is known that 1≤W≤10^5
.
As you cannot understand the RiOI Language, from your point of view, words differ from each other only by t... | interactive | 3s | 512m | type: interactive
time: 3s
memory: 512m
subtasks:
- score: 100
n_cases: 10
interactor: interactor.cc
checker_type: testlib | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/122 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
123 | Time limit per test: 1 second
Memory limit per test: 256 megabytes
Goal
-----
There is a hidden integer x with 1 ≤ x ≤ n that you must determine.
What you can do
----------------
1) Ask membership questions (up to 53 total):
- Choose any non-empty set S ⊆ {1, 2, …, n}.
- Ask whether x ∈ S.
- The judge replie... | interactive | 1s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 1s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/123 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
124 | AveragePermutation
This is an interactive problem.
There is a hidden permutation p of n, where n is even. You want to discover this permutation using queries.
Each query consists of asking about k specific positions a1, a2, ..., ak. The query is answered with 1 if the average of the elements at these positions is an ... | interactive | 4s | 256m | type: interactive
interactor: interactor.cc
time: 4s
memory: 256m
subtasks:
- score: 100
n_cases: 10 | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/124 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
125 | Time Limit: 1 second
Memory Limit: 256 MB
Overview
This is an INTERACTIVE PROBLEM. There are N kinds of minerals. For each kind there are exactly 2 slices, for a total of 2N slices numbered 1..2N. The judge fixes a hidden pairing: for each kind, the two slices of that kind form one pair. Your task is to determine all ... | interactive | 20s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 20s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ..... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/125 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
127 | Time Limit: 1 second
Memory Limit: 256 mb
Interactive Problem
YOU MUST USE INTERACTIVE FORMAT FOR THIS PROBLEM.
You are standing in front of a row of n boxes, labeled 0 through n−1 from left to right.
Each box contains a prize that cannot be seen until the box is opened. There are v ≥ 2
different prize types, number... | interactive | 8s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 8s # Giving buffer for grading time
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_case... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/127 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
132 | time limit per test: 0.25 second
memory limit per test: 512 megabytes
This is an interactive problem.
You have 𝑅 vacuum cleaner robots left over from your trade with your fellow contestants. You want to use these robots to locate the two chairmen. You can instruct each robot to scout several of 1000 positions where th... | interactive | 0.25s | 512m | type: interactive
time: 0.25s
memory: 512m
# A custom checker is required for the special scoring.
checker: interactor.cc
subtasks:
- score: 100
n_cases: 10 | interactor.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/132 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
133 | Time limit:20 second
Memory limit:1024 megabytes
One day, Little Z selected n points on a piece of paper and connected them pairwise with a pencil to form n*(n-1)/2 line segments. Due to the thinness of the pencil, it can be assumed that the width of these line segments is 0.
Looking at these line segments, Little Z fe... | default | 20s | 1024m | type: default
time: 20s
memory: 1024m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/133 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
134 | Guess Number
This is an interactive problem.
Vasya has thought of two secret integers a and b, both in the range [1, n]. Your task is to determine these two numbers by asking queries.
Each query consists of two integers x and y (both in the range [1, n]). The interactor will respond with one of the following:
- 0: ... | interactive | 2s | 512m | type: interactive
interactor: interactor.cc
time: 2s
memory: 512m
subtasks:
- score: 100
n_cases: 10 | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/134 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
135 | Problem Type: INTERACTIVE(STANDARD SOLUTIONS WILL NOT WORK)
There are many legends concerning the Leaning Tower of Toruń. The wall of the tower is a circle with N ≥ 3 evenly spaced doors (in other words, the doors are the vertices of a regular N-gon). The doors are numbered from 0 to N−1, but in a random order. Please... | interactive | 2s | 256m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 2s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, ...... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/135 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
137 | Title: Kangaroos
Goal
You must print a grid (“map”) on which a simple multi-agent movement game is played. The judge will run 500 random control sequences on your map. Your valid map is scored by how often those sequences fail to gather all agents into a single cell.
World
- The world is an n-by-m grid (1 ≤ n, m ≤ 20... | default | 1s | 512m | type: default
# The time limit is now 1 second.
time: 1s
memory: 512m
# A custom checker is required for the special scoring.
checker: chk.cc
subtasks:
- score: 100
n_cases: 1 | chk.cc | null | 1 | 1 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/137 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
138 | ### Problem C. Fabulous Fungus Frenzy
As the Traveler in the game Genshin Impact, you are exploring Sumeru. You are invited to the Nilotpala Cup Beast Tamers Tournament. To win, you must pass the Coruscating Potential challenge to cultivate Fungi.
During this challenge, you must use Floral Jellies to form blends for ... | default | 5s | 1024m | type: default
time: 5s
memory: 1024m
subtasks:
- score: 100
n_cases: 10
checker: chk.cpp
checker_type: testlib | chk.cpp | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/138 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
141 | Bakery Survey
This is an interactive problem.
Your city has n bakeries (where n is a power of 2), and bakery i specializes in one type of cake a_i.
You want to determine d — the number of distinct cake types available in the city.
You don't know the values of a_1, ..., a_n. However, your friend can help you by tast... | interactive | 4s | 512m | type: interactive
interactor: interactor.cc
time: 4s
memory: 512m
subtasks:
- score: 100
n_cases: 10 | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/141 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
142 | Ball Game
You are given n+1 poles numbered from 1 to n+1. Initially, poles 1 through n each contain m balls stacked vertically, while pole n+1 is empty. There are n*m balls in total, with n different colors, where each color appears exactly m times.
Your task is to rearrange the balls so that all balls of the same co... | default | 4s | 512m | type: default
time: 4s
memory: 512m
checker: chk.cc
subtasks:
- score: 100
n_cases: 10 | chk.cc | null | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/142 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
143 | Problem: Texas Hold’em Training (Terminal I/O Interactive)
Time limit: 10 seconds
Memory limit: 512 MB
Overview
You will write a program that plays a large number of very simplified heads-up Texas Hold’em hands against a fixed opponent policy. The judge runs the game and reveals exactly the information you are allowe... | interactive | 100s | 512m | # Set the problem type to interactive
type: interactive
# Specify the interactor source file
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 100s
memory: 512m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 10 # Looks for 1.in, 2.in, .... | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/143 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
144 | Find Median
This is an interactive problem.
There is a hidden permutation p of length n, where n is even.
You are allowed to make queries by choosing a subsequence of indices with even length k (where 4 ≤ k ≤ n). For a chosen subsequence, the interactor will return the two median values.
For a subsequence of even len... | interactive | 4s | 512m | type: interactive
interactor: interactor.cc
time: 4s
memory: 512m
subtasks:
- score: 100
n_cases: 10 | null | interactor.cc | 10 | 10 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/144 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
145 | # Number Loop Construction
You are given a fixed 12 by 12 clue template. Some cells are clue cells, and the
remaining cells are blank. Your task is to fill every clue cell with a digit and
construct a Number Loop puzzle.
The goal has two levels:
1. Make the puzzle have as few valid loop solutions as possible.
2. Amo... | default | 3s | 1024m | type: default
time: 3s
memory: 1024m
checker: checker.cpp
cheker_type: testlib
subtasks:
- score: 100
n_cases: 2 | checker.cpp | null | 2 | 2 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/145 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
147 | Problem Statement
--------
AtCoder has decided to place web advertisements of $n$ companies on the top page.
The space for placing advertisements is a square of size 10000 x 10000.
The space for each company must be an axis-parallel rectangle with positive area, and the coordinates of the vertices must be integer value... | default | 10s | 256m |
type: default
checker: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100
| chk.cc | null | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/147 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
148 | Problem Statement
--------
There is a floor consisting of $50\times 50$ squares.
The floor is covered with rectangular tiles without any gaps.
Each tile has a size of either $1\times 1$, $1\times 2$, or $2\times 1$ squares.
Let $(0, 0)$ denote the top-left square, and $(i, j)$ denote the square at the $i$-th row from t... | default | 10s | 256m |
type: default
checker: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100
| chk.cc | null | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/148 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
149 | Story
--------
AtCoder is developing a route navigation application that utilizes shortest path algorithms.
The service area is represented as a road network of 30x30 vertices connected in a grid.
When a user specifies the vertex of the current location and the vertex of the destination, the app will output the shortes... | interactive | 10s | 256m |
type: interactive
interactor: interactor.cc
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 75
| null | interactor.cc | 75 | 75 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/149 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
150 | Story
--------
Human genetic information is recorded in DNA with a double helix structure and is represented by a very long string consisting of four characters, `A`, `G`, `C`, and `T`.
Recently, alien cells were found in a meteorite.
As a result of research, it was found that the genetic information of this alien is r... | default | 10s | 256m |
type: default
checker: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100
| chk.cc | null | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/150 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
151 | Story
--------
To solve the shortage of police officers, the Takahashi City Police Department has decided to introduce automated patrols with unmanned patrol cars.
The unmanned patrol car is equipped with a high-resolution omnidirectional camera on the roof, which can see the entire road at once in a straight line from... | default | 10s | 256m |
type: default
checker: chk.cc
# Time and memory limits still apply to the contestant's solution
time: 10s
memory: 256m
# The subtasks section works the same way
subtasks:
- score: 100
n_cases: 100
| chk.cc | null | 100 | 100 | problems.tar.gz | https://github.com/FrontierCS/Frontier-CS/tree/aec2aff05f3ece1b150c7c40827b0cea449e0b28/algorithmic/problems/151 | aec2aff05f3ece1b150c7c40827b0cea449e0b28 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.