year stringdate 2020-01-01 00:00:00 2024-01-01 00:00:00 | day stringclasses 3
values | problem_name stringclasses 42
values | problem_id stringclasses 42
values | label stringlengths 11 69 | code stringlengths 108 21.5k | status stringclasses 5
values | subtask_score float64 0 1 | subtask_points float64 0 0 | subtask_max_points int64 0 0 | test_case_scores listlengths 1 3 | test_case_status listlengths 1 3 | test_case_feedbacks listlengths 1 3 | target_subtask stringclasses 1
value | code_compiles bool 1
class | target_subtask_score float64 0 0 | target_subtask_status stringclasses 1
value | all_subtasks_points float64 0 0 | all_subtasks_results listlengths 2 10 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2023 | day1 | Beech Tree | beechtree | incorrect/subtask-shallow-wa1.cpp | #include "beechtree.h"
#include <set>
#include <algorithm>
using namespace std;
vector<int> beechtree(int N, int /*M*/, vector<int> P, vector<int> C)
{
vector<set<int>> ch_colors(N);
vector<int> t(N, 1);
for (int v = 1; v < N; ++v)
{
int u = P[v], c = C[v];
if (ch_colors[u].count(c))
... | WA | 0 | 0 | 0 | [
1,
0,
0
] | [
"AC",
"WA",
"SKIPPED"
] | [
"Output is correct\n\n",
"Output isn't correct\n2nd lines differ - on the 1st token, expected: '0', found: '1'\n",
null
] | 00-samples | true | 0 | SKIPPED | 0 | [
{
"points": 0,
"problem": "beechtree",
"score": 0,
"score_precision": 2,
"status": "SKIPPED",
"subtask": "00-samples",
"test_results": [
{
"feedback": null,
"score": 0,
"status": "SKIPPED",
"test_name": "0-01"
},
{
"feedback": nul... |
2023 | day1 | Beech Tree | beechtree | incorrect/sol_na_wa3.cpp | #include "beechtree.h"
#include <algorithm>
#include <iostream>
#include <map>
#define xx first
#define yy second
#define all(x) (x).begin(), (x).end()
std::vector<std::vector<std::pair<int, int>>> adj;
struct data
{
bool ok = true;
int sz = 0;
std::map<int, int> cnt;
data() {}
data(int ind)
... | AC | 1 | 0 | 0 | [
1,
1,
1
] | [
"AC",
"AC",
"AC"
] | [
"Output is correct\n\n",
"Output is correct\n\n",
"Output is correct\n\n"
] | 00-samples | true | 0 | SKIPPED | 0 | [
{
"points": 0,
"problem": "beechtree",
"score": 0,
"score_precision": 2,
"status": "SKIPPED",
"subtask": "00-samples",
"test_results": [
{
"feedback": null,
"score": 0,
"status": "SKIPPED",
"test_name": "0-01"
},
{
"feedback": nul... |
2023 | day1 | Beech Tree | beechtree | incorrect/subtask-shallow-wa2.cpp | #include "beechtree.h"
#include <set>
#include <algorithm>
using namespace std;
vector<int> beechtree(int N, int /*M*/, vector<int> P, vector<int> C)
{
vector<set<int>> ch_colors(N);
vector<int> t(N, 1);
for (int v = 1; v < N; ++v)
{
int u = P[v], c = C[v];
if (ch_colors[u].count(c))
... | WA | 0 | 0 | 0 | [
1,
0,
0
] | [
"AC",
"WA",
"SKIPPED"
] | [
"Output is correct\n\n",
"Output isn't correct\n2nd lines differ - on the 4th token, expected: '0', found: '1'\n",
null
] | 00-samples | true | 0 | SKIPPED | 0 | [
{
"points": 0,
"problem": "beechtree",
"score": 0,
"score_precision": 2,
"status": "SKIPPED",
"subtask": "00-samples",
"test_results": [
{
"feedback": null,
"score": 0,
"status": "SKIPPED",
"test_name": "0-01"
},
{
"feedback": nul... |
2023 | day1 | Beech Tree | beechtree | incorrect/sol_db_wa1.cpp | #include "beechtree.h"
#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
#define xx first
#define yy second
using namespace std;
typedef pair<int, int> pii;
const int N = 2e5 + 1;
struct Graph
{
int cnt[N];
bool con[N];
set<pii> srt[N];
map<int, vector<int>> col[N];
} graph;
bool check... | AC | 1 | 0 | 0 | [
1,
1,
1
] | [
"AC",
"AC",
"AC"
] | [
"Output is correct\n\n",
"Output is correct\n\n",
"Output is correct\n\n"
] | 00-samples | true | 0 | SKIPPED | 0 | [
{
"points": 0,
"problem": "beechtree",
"score": 0,
"score_precision": 2,
"status": "SKIPPED",
"subtask": "00-samples",
"test_results": [
{
"feedback": null,
"score": 0,
"status": "SKIPPED",
"test_name": "0-01"
},
{
"feedback": nul... |
2023 | day1 | Beech Tree | beechtree | failed/sol_gyp_wa.cpp | "// #include \"beechtree.h\"\n#include <bits/stdc++.h>\nusing namespace std;\n\nconst int c = 200005(...TRUNCATED) | AC | 1 | 0 | 0 | [
1,
1,
1
] | [
"AC",
"AC",
"AC"
] | [
"Output is correct\n\n",
"Output is correct\n\n",
"Output is correct\n\n"
] | 00-samples | true | 0 | SKIPPED | 0 | [{"points":0,"problem":"beechtree","score":0.0,"score_precision":2,"status":"SKIPPED","subtask":"00-(...TRUNCATED) |
2023 | day1 | Beech Tree | beechtree | failed/subtask-smallN-wa1.cpp | "#include \"beechtree.h\"\n\n#include <set>\n#include <algorithm>\n\nusing namespace std;\nusing pii(...TRUNCATED) | WA | 0 | 0 | 0 | [
1,
1,
0
] | [
"AC",
"AC",
"WA"
] | ["Output is correct\n\n","Output is correct\n\n","Output isn't correct\n2nd lines differ - on the 1s(...TRUNCATED) | 00-samples | true | 0 | SKIPPED | 0 | [{"points":0,"problem":"beechtree","score":0.0,"score_precision":2,"status":"SKIPPED","subtask":"00-(...TRUNCATED) |
2023 | day1 | Beech Tree | beechtree | incorrect/subtask-shallow-wa3.cpp | "#include \"beechtree.h\"\n\n#include <set>\n#include <algorithm>\n\nusing namespace std;\n\nvector<(...TRUNCATED) | WA | 0 | 0 | 0 | [
0,
0,
0
] | [
"WA",
"SKIPPED",
"SKIPPED"
] | [
"Output isn't correct\n2nd lines differ - on the 1st token, expected: '0', found: '1'\n",
null,
null
] | 00-samples | true | 0 | SKIPPED | 0 | [{"points":0,"problem":"beechtree","score":0.0,"score_precision":2,"status":"SKIPPED","subtask":"00-(...TRUNCATED) |
2023 | day1 | Beech Tree | beechtree | correct/subtask-colorTwice-1.cpp | "#include \"beechtree.h\"\n\n#include <set>\n\nusing namespace std;\n\nvector<int> t, dep;\nvector<v(...TRUNCATED) | WA | 0 | 0 | 0 | [
1,
0,
0
] | [
"AC",
"WA",
"SKIPPED"
] | ["Output is correct\n\n","Output isn't correct\n2nd lines differ - on the 2nd token, expected: '1', (...TRUNCATED) | 00-samples | true | 0 | SKIPPED | 0 | [{"points":0,"problem":"beechtree","score":0.0,"score_precision":2,"status":"SKIPPED","subtask":"00-(...TRUNCATED) |
2023 | day1 | Beech Tree | beechtree | correct/subtask-line.cpp | "#include \"beechtree.h\"\n\nusing namespace std;\n\nvector<int> beechtree(int N, int /*M*/, vector<(...TRUNCATED) | WA | 0 | 0 | 0 | [
0,
0,
0
] | [
"WA",
"SKIPPED",
"SKIPPED"
] | [
"Output isn't correct\n2nd lines differ - on the 2nd token, expected: '1', found: '0'\n",
null,
null
] | 00-samples | true | 0 | SKIPPED | 0 | [{"points":0,"problem":"beechtree","score":0.0,"score_precision":2,"status":"SKIPPED","subtask":"00-(...TRUNCATED) |
2023 | day1 | Beech Tree | beechtree | failed/subtask-smallN-wa2.cpp | "#include \"beechtree.h\"\n\n#include <set>\n#include <algorithm>\n\nusing namespace std;\nusing pii(...TRUNCATED) | AC | 1 | 0 | 0 | [
1,
1,
1
] | [
"AC",
"AC",
"AC"
] | [
"Output is correct\n\n",
"Output is correct\n\n",
"Output is correct\n\n"
] | 00-samples | true | 0 | SKIPPED | 0 | [{"points":0,"problem":"beechtree","score":0.0,"score_precision":2,"status":"SKIPPED","subtask":"00-(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9