prob_zh stringclasses 3
values | prob_en stringclasses 3
values | algorithm_tag_zh stringclasses 3
values | algorithm_tag_en stringclasses 3
values | level_zh stringclasses 2
values | level_en stringclasses 2
values | canonical_solution stringclasses 3
values | test_case listlengths 10 10 | pseudo_code stringclasses 3
values | buggy_code stringclasses 3
values | corrupted_code stringclasses 3
values | id stringclasses 3
values |
|---|---|---|---|---|---|---|---|---|---|---|---|
"时间限制：1s\n\n空间限制：256MB\n\n**算法标签** 树状数组\n\n**难度划分** 省(...TRUNCATED) | "Time Limit: 1s\n\nSpace Limit: 256MB\n\n**Algorithm Tags** Tree DP, Greedy\n\n**Difficulty Level** (...TRUNCATED) | 树状数组 | Tree DP, Greedy | 省选 | Provincial Selection | "#include<iostream>\n#include<vector>\nconst int maxn = 200001;\nstd::vector<int> G[maxn];\nlong lon(...TRUNCATED) | [{"input":"12 5 9\n12 9\n2 3\n4 3\n3 5\n1 2\n11 9\n7 8\n7 2\n7 10\n9 2\n1 6","output":"67"},{"input"(...TRUNCATED) | "```\n\n\n\n\n\n\nfunction main():\n read n, a, b\n build adjacency list for the tree from n-1(...TRUNCATED) | "#include<iostream>\n#include<vector>\nconst int maxn = 200001;\nstd::vector<int> G[maxn];\nlong lon(...TRUNCATED) | "#include<iostream>\n#include<vector>\nconst int maxn = 200001;\nstd::vector<int> G[maxn];\nlong lon(...TRUNCATED) | 000 |
"时间限制：1s\n\n空间限制：256MB\n\n**算法标签** DP，斜率优化\n\n**难度划分**(...TRUNCATED) | "Time Limit: 1s\n\nSpace Limit: 256MB\n\n**Algorithm Tags** DP, Convex Hull Optimization\n\n**Diffic(...TRUNCATED) | DP，斜率优化 | DP, Convex Hull Optimization | 省选 | Provincial Selection | "#include<iostream>\nconst int maxn = 2000005;\nlong long s[maxn];\nlong long f[maxn];\nlong long x[(...TRUNCATED) | [{"input":"11 574\n49 37 90 12 24 35 86 39 20 27 86","output":"4761"},{"input":"21 607\n61 70 47 54 (...TRUNCATED) | "```\n\n\n\n\n\n\nfunction main:\n read n, a\n read list of integers w_1 to w_n\n compute p(...TRUNCATED) | "#include<iostream>\nconst int maxn = 2000005;\nlong long s[maxn];\nlong long f[maxn];\nlong long x[(...TRUNCATED) | "#include<iostream>\n//There is one line of the code missing. \nlong long s[maxn];\nlong long f[max(...TRUNCATED) | 001 |
"时间限制：1s\n\n空间限制：256MB\n\n**算法标签** 字符串，同余\n\n**难度划分*(...TRUNCATED) | "Time Limit: 1s\n\nSpace Limit: 256MB\n\n**Algorithm Tags** String, Congruence\n\n**Difficulty Level(...TRUNCATED) | 字符串，同余 | String, Congruence | NOI | NOI | "#include<iostream>\n#include<string>\nusing namespace std;\nconst int maxn = 500001;\nint s[maxn], (...TRUNCATED) | [{"input":"20\n00001010110101000010","output":"1048642"},{"input":"20\n10111011010111011101","output(...TRUNCATED) | "```\n\n\n\n\n\n\nfunction main:\n n = input integer\n p = input string\n s = array where e(...TRUNCATED) | "#include<iostream>\n#include<string>\nusing namespace std;\nconst int maxn = 500001;\nint s[maxn], (...TRUNCATED) | "#include<iostream>\n#include<string>\nusing namespace std;\nconst int maxn = 500001;\n//There is on(...TRUNCATED) | 002 |
README.md exists but content is empty.
- Downloads last month
- 9