problem_id stringclasses 6
values | year stringdate 2024-01-01 00:00:00 2024-01-01 00:00:00 | uuid stringlengths 36 36 | code stringlengths 160 43.4k | target_subtask stringclasses 35
values | code_compiles bool 2
classes | target_subtask_score float64 0 1 | target_subtask_status stringclasses 6
values | all_subtasks_points float64 0 67 | all_subtasks_results listlengths 3 9 |
|---|---|---|---|---|---|---|---|---|---|
nile | 2024 | 811d2da1-d573-612c-23d0-0ad87998ed96 | #include <vector>
#include <algorithm>
using namespace std;
struct Artifact {
int W, A, B;
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<Artifact> sorted_art(N);
for (int i = 0; i < N; ++i) {
sorted_art[i] = {W[i], A... | 04-n2 | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "WA",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output isn't correct\n3rd lines differ - on the 1st token, expected: '16', found: '17'\n",
"score": 0,
"status": "WA... |
nile | 2024 | e5bea8f6-ec28-1f75-58c2-d8a6852762b1 | #include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
struct Pair {
int i, j;
long long s;
Pair(int i, int j, long long s) : i(i), j(j), s(s) {}
bool operator<(const Pair& other) const {
return s > other.s;
}
};
vector<long long> calculate_costs(vector<int> W, ve... | 01-equal | false | 0 | CE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "CE",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Compilation error exit code 1\n/usr/bin/ld: /tmp/ccgm7pvS.o: in function `main':\ngrader.cpp:(.text.startup+0x0): multiple definitio... |
nile | 2024 | bde2298a-49fa-6563-e606-aeef8de38a28 | #include <vector>
#include <algorithm>
using namespace std;
struct Artifact {
int W, A, B;
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<Artifact> sorted_art(N);
for (int i = 0; i < N; ++i) {
sorted_art[i] = {W[i], A... | 04-n2 | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "WA",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output isn't correct\n3rd lines differ - on the 1st token, expected: '16', found: '17'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 90b66580-8d68-9cfd-c9f4-fb5a3042c5c4 | #include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
vector<long long> res;
for (int d : E) {
vector<int> order(W.size());
iota(order.begin(), order.end(... | 01-equal | false | 0 | CE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "CE",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Compilation error exit code 1\n/usr/bin/ld: /tmp/ccmSwaZT.o: in function `main':\ngrader.cpp:(.text.startup+0x0): multiple definitio... |
nile | 2024 | 9bcd1f0d-3ca7-17fa-0eb0-6297f47d9035 | #include <vector>
#include <algorithm>
#include <tuple>
#include <iostream>
using namespace std;
struct Artifact {
int W, A, B, index;
bool operator<(const Artifact& other) const {
return W < other.W;
}
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> ... | 01-equal | false | 0 | CE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "CE",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Compilation error exit code 1\n/usr/bin/ld: /tmp/ccqD1ytS.o: in function `main':\ngrader.cpp:(.text.startup+0x0): multiple definitio... |
nile | 2024 | 0e8f1337-7f4e-96d8-2b52-89c383bed733 | #include <bits/stdc++.h>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<int> indices(N);
iota(indices.begin(), indices.end(), 0);
sort(indices.begin(), indices.end(), [&](int i, int j) { return W[i] < W[j]; }... | 04-n2 | false | 0 | CE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "CE",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Compilation error exit code 1\n/usr/bin/ld: /tmp/ccoEJb8U.o: in function `main':\ngrader.cpp:(.text.startup+0x0): multiple definitio... |
nile | 2024 | b45010fd-c5d5-5450-4685-ea2b37e0f267 | #include <vector>
#include <algorithm>
#include <tuple>
#include <unordered_set>
using namespace std;
struct Artifact {
int W, A, B, idx;
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
long long initial_cost = 0;
for (int a : A) in... | 01-equal | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "WA",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output isn't correct\n4th lines differ - on the 1st token, expected: '11', found: '13'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 077fd080-3098-2d93-c713-043b49d57637 | #include <vector>
#include <algorithm>
#include <tuple>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<long long> R;
long long sum_A = 0;
vector<int> s(N);
for (int i = 0; i < N; ++i) {
sum_A += ... | 01-equal | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "WA",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output isn't correct\n4th lines differ - on the 1st token, expected: '11', found: '13'\n",
"score": 0,
"status": "WA... |
nile | 2024 | bd532453-f096-08b3-51c7-869e7e6e1a3e | #include <vector>
#include <algorithm>
#include <tuple>
using namespace std;
struct Artifact {
int W, A, B;
int index;
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<Artifact> artifacts;
for (int i = 0; i < N; ++i) {
... | 01-equal | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "WA",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output isn't correct\n4th lines differ - on the 1st token, expected: '11', found: '13'\n",
"score": 0,
"status": "WA... |
nile | 2024 | da0f6cbb-985f-cbd1-17bd-769770c88448 | #include <bits/stdc++.h>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<int> indices(N);
iota(indices.begin(), indices.end(), 0);
sort(indices.begin(), indices.end(), [&](int i, int j) { return W[i] < W[j]; }... | 04-n2 | false | 0 | CE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "CE",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Compilation error exit code 1\n/usr/bin/ld: /tmp/ccvJoMle.o: in function `main':\ngrader.cpp:(.text.startup+0x0): multiple definitio... |
nile | 2024 | 7adf43a9-c158-9c8b-251b-f135710f0639 | #include <bits/stdc++.h>
using namespace std;
struct Artifact {
int w, a, b;
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int n = W.size();
long long sum_A = 0;
for (int a : A) sum_A += a;
vector<long long> res;
for (int D : E) {
... | 01-equal | false | 0 | CE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "CE",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Compilation error exit code 1\n/usr/bin/ld: /tmp/ccgsHc88.o: in function `main':\ngrader.cpp:(.text.startup+0x0): multiple definitio... |
nile | 2024 | 5c818b89-f9f5-fdd7-45f3-bae9836a7307 | #include <vector>
#include <cmath>
#include <numeric>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<long long> result;
for (int D : E) {
long long sum_A = accumulate(A.begin(), A.end(), 0LL);
v... | 01-equal | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "nile",
"score": 1,
"score_precision": 2,
"status": "AC",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output is correct\n\n",
"score": 1,
"status": "AC",
"test_name": "0-01"
}
],
"weighted_score":... |
nile | 2024 | 44b6d2d0-8a9c-c62b-dfa9-8973f5d4d80d | #include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
struct Pair {
int q;
int p;
int s;
Pair(int q, int p, int s) : q(q), p(p), s(s) {}
bool operator<(const Pair& other) const {
return q < other.q;
}
};
vector<long long> calculate_costs(vector<int> W, vector<in... | 04-n2 | true | 0 | TLE | 0 | [
{
"points": 0,
"problem": "nile",
"score": 1,
"score_precision": 2,
"status": "AC",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output is correct\n\n",
"score": 1,
"status": "AC",
"test_name": "0-01"
}
],
"weighted_score":... |
nile | 2024 | b5208c34-fcf5-2606-2e4b-9eb7ebe167f2 | #include <vector>
#include <algorithm>
using namespace std;
struct Artifact {
int W, A, B;
};
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
vector<Artifact> artifacts(N);
for (int i = 0; i < N; ++i) {
artifacts[i] = {W[i], A[i... | 01-equal | true | 1 | AC | 6 | [
{
"points": 0,
"problem": "nile",
"score": 0,
"score_precision": 2,
"status": "WA",
"subtask": "00-samples",
"test_results": [
{
"feedback": "Output isn't correct\n3rd lines differ - on the 1st token, expected: '16', found: '11'\n",
"score": 0,
"status": "WA... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 12