Dataset Viewer (First 5GB)
time_limit_ms
int64 | title
string | output
string | memory_limit_mb
int64 | description
string | examples
sequence | id
int64 | year
int64 | test_cases
sequence | note
string | type
string | tags
sequence | source
string | qoj_url
string | input
string | problem_label
string | spj_code
string |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1,000 | Arrow a Row | "For each test case, if the given string cannot be obtained by performing no more than n painting op(...TRUNCATED) | 1,024 | "Define an “arrow string” as a string that meets the following conditions:\n\n• The length of (...TRUNCATED) | [
[
"4\n>>->>>\n>>>->\n>>>>>\n>->>>>>>\n",
"Yes 2\n1 5\n2 5\nNo\nNo\nYes 2\n2 7\n1 5\n"
]
] | 0 | 2,024 | [["53\n>->>>>\n>-->>---->-->>>->->->-->>>->--->--->>>-->>>>-->>>>->>>->>---->-->>>----->>>------>>>-(...TRUNCATED) | "For the fourth test case in the example, the painting process is shown below:\n\n$$\n\\ast\\ast\\as(...TRUNCATED) | traditional | [
"Algorithm Basics"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9535 | "The first line contains a single integer T (1 ≤ T ≤ 10^4), indicating the number of test cases.(...TRUNCATED) | A | |
2,500 | Athlete Welcome Ceremony | "Output $Q$ lines, with the $i$ -th line containing an integer that represents the number of valid c(...TRUNCATED) | 1,024 | "Chengdu is about to host the 2025 World Games. During the athlete welcome ceremony at the opening e(...TRUNCATED) | [["6 3\na?b??c\n2 2 2\n1 1 1\n1 0 2","3\n1\n1\n"],["6 3\n??????\n2 2 2\n2 3 3\n3 3 3","30\n72\n96\n"(...TRUNCATED) | 1 | 2,024 | [["300 100000\nb?ba??a?b???????c???cb??c??c??abab?cb?a??ac????c??a??b??c??bc???c??c?b??abab?bac?????(...TRUNCATED) | "In the first sample, the valid costume arrangements for the first custom-making plan are acbabc, ac(...TRUNCATED) | traditional | [
"DP",
"Math"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9536 | "The first line contains two integers $n$ ( $1\\leq n\\leq300$ ) and $Q$ ( $1\\le Q\\le10^{5}$ ), re(...TRUNCATED) | B | |
3,000 | Closest Derangement | "For each test case, if there are at least $k$ closest derangements, output $n$ positive integers $q(...TRUNCATED) | 1,024 | "Blackbird has a permutation $p$ of length $n$. He wants to find a derangement $q$ of $p$, which mea(...TRUNCATED) | [
[
"2\n2 2\n2 1\n3 2\n1 2 3\n",
"-1\n3 1 2\n"
]
] | 2 | 2,024 | [["18\n854 1\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32(...TRUNCATED) | "For the first test case, [1, 2] is the only closest derangement, so output $-1$.\n\nFor the second (...TRUNCATED) | traditional | [
"Algorithm Basics",
"Math",
"Data Structure"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9538 | "The first line contains an integer $T$ ($1\\le T\\le10^{4}$), representing the number of test cases(...TRUNCATED) | D | |
2,000 | Disrupting Communications | "For each test case, output $q$ lines, each containing the result modulo 998244353 for one of the $q(...TRUNCATED) | 1,024 | "The enemy has established communication outposts across several locations, which can be represented(...TRUNCATED) | [
[
"2\n3 2\n1 1\n2 3\n1 2\n5 3\n1 1 2 2\n4 5\n2 4\n2 3\n",
"6\n5\n14\n13\n15\n"
]
] | 3 | 2,024 | [["4\n49229 66495\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 (...TRUNCATED) | "In the first case of the example, 6 connected subgraphs can be selected in total. For the first que(...TRUNCATED) | traditional | [
"DP",
"Data Structure"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9539 | "The first line contains a single integer $T$ ( $1\\le T\\le10^{4}$ ), indicating the number of test(...TRUNCATED) | E | |
6,000 | Double 11 | "Output one real number, indicating the answer. Your output will be considered correct if the relati(...TRUNCATED) | 1,024 | "With the Double 11 Shopping Festival approaching, a store is managing its best-selling products for(...TRUNCATED) | [
[
"4 2\n1 2 3 4\n",
"6.1911471295571"
],
[
"10 3\n1 2 3 4 5 6 7 8 9 10\n",
"22.5916253665141"
]
] | 4 | 2,024 | [["26348 26347\n46368 41698 42514 72134 3433 10286 81157 71742 86066 61993 23451 37386 39383 94435 4(...TRUNCATED) | "For the first example, let $k_{1} = \\frac{1}{3+\\sqrt{21}}$, $k_{2} = \\frac{1}{7+\\sqrt{21}}$, an(...TRUNCATED) | spj | [
"DP"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9540 | "The first line contains two integers $n$ and $m$ ($1\\leq m\\leq n\\leq2\\cdot10^{5}$), indicating (...TRUNCATED) | F | "#include <cstdio>\n#include <fstream>\n#include <sstream>\n#include <string>\n#include <cmath>\n#in(...TRUNCATED) |
2,000 | Expanding Array | "Output a single integer, representing the maximum number of distinct values that can be obtained in(...TRUNCATED) | 1,024 | "Given an integer array $a_{1},a_{2},\\ldots,a_{n}$ of length $n$, you can perform any number of ope(...TRUNCATED) | [
[
"2\n2 3\n",
"4\n"
],
[
"2\n3 4\n",
"4\n"
]
] | 5 | 2,024 | [["2\n934983889 712263209\n","8\n"],["95953\n63767171 525295800 529356864 645135222 611916600 109522(...TRUNCATED) | traditional | [
"Math"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9541 | "The first line contains a single integer $n$ ($2\\leq n\\leq10^{5}$), representing the length of th(...TRUNCATED) | G | ||
1,000 | Friendship is Magic | For each test case, output the answer modulo $10^{9}+7$ in a single line. | 1,024 | "Rockdu is a pony living in Ponyville. His best friend, Macaronlin, also lives there. Rockdu values (...TRUNCATED) | [
[
"2\n108 112\n114514 1919810",
"31\n86328270"
]
] | 6 | 2,024 | [["34\n900000006 900000008\n1999993 2000009\n19995 20020\n316290316287 316290316293\n1730171 1730199(...TRUNCATED) | "For the first test case in the sample:\n\n• $f(108)=\\mathrm{min}(|1-8|,|10-8|)=\\mathrm{min}(7,2(...TRUNCATED) | traditional | [
"Math"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9542 | "The first line contains an integer $T$ ($1 \\le T \\le 1000$), indicating the number of test cases.(...TRUNCATED) | H | |
1,000 | Good Partitions | "For each test case, output $q+1$ lines, representing the number of good partition sizes before any (...TRUNCATED) | 1,024 | "Lawliet has a sequence of numbers of length $n$, denoted as $a_{1},a_{2},\\ldots,a_{n}$, and he wan(...TRUNCATED) | [
[
"1\n5 2\n4 3 2 6 1\n2 5\n3 5\n",
"1\n2\n3\n"
]
] | 7 | 2,024 | [["5\n187797 68\n1282195839 1994060629 475784268 1398426695 1688039589 1189963220 234741809 70275557(...TRUNCATED) | "Initially, the only good partition size is $k=1$.\n\nAfter the first modification, the sequence bec(...TRUNCATED) | traditional | [
"Math",
"DP"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9543 | "The first line contains an integer $T$ ( $1\\leq T\\leq10$ ), representing the number of test cases(...TRUNCATED) | I | |
2,000 | Grand Prix of Ballance | "For each test case, output $m$ lines, each containing two integers: $id$ and $x$, where $id$ is the(...TRUNCATED) | 1,024 | "Ballance is a classic game where players use the keyboard to control a ball through complex structu(...TRUNCATED) | [["3\n3 4 6\n1 2\n2 1 1\n2 2 2\n3 3 2\n2 3 2\n2 1 2\n3 4 8\n1 2\n2 1 1\n2 2 2\n3 3 2\n2 3 2\n2 1 2\n(...TRUNCATED) | 8 | 2,024 | [["21\n63884 56377 94823\n3 51714 2684\n2 14194 11311\n1 53372\n2 50300 53372\n2 46718 53372\n3 2979(...TRUNCATED) | traditional | [
"Algorithm Basics",
"Data Structure"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9544 | "The first line contains an integer $T$ ($1\\le T\\le10^{4}$), indicating the number of test cases.\(...TRUNCATED) | J | ||
1,000 | Magical Set | "Output a single integer indicating the maximum amount of energy that can be generated, i.e., the ma(...TRUNCATED) | 1,024 | "You have a magical set that initially contains $n$ distinct integers. You discover that these numbe(...TRUNCATED) | [
[
"3\n2 4 6\n",
"3\n"
],
[
"6\n2 3 5 6 10 12\n",
"3\n"
]
] | 9 | 2,024 | [["2\n999991832 999995820\n","11\n"],["1\n3\n","1\n"],["1\n999999986\n","2\n"],["288\n458654472 4604(...TRUNCATED) | traditional | [
"Graph",
"Math",
"Data Structure"
] | The 2024 ICPC Asia Chengdu Regional Contest | https://qoj.ac/contest/1821/problem/9545 | "The first line contains an integer $n$ ( $1\\leq n\\leq300$ ), indicating the number of integers in(...TRUNCATED) | K |
End of preview. Expand
in Data Studio
README.md exists but content is empty.
- Downloads last month
- 100