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 12 8.94k | 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 | c833d08c-bd4f-c345-ac86-7132962bfecb | #include "nile.h"
#include <vector>
#include <algorithm>
using namespace std;
vector<long long> calculate_costs(vector<int> W, vector<int> A, vector<int> B, vector<int> E) {
int N = W.size();
long long initial_sum = 0;
for (int a : A) initial_sum += a;
vector<int> indices(N);
iota(indices.begi... | 06-minpack | 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\ngraders/nile.cpp: In function 'std::vector<long long int> calculate_costs(std::vector<int>, std::vect... |
nile | 2024 | b317f46c-5d18-c51c-bf1c-e81b189f31cc | #include "nile.h"
#include <vector>
#include <algorithm>
#include <utility>
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<pair<int, int>> sorted; // (weight, index)
for (int i = 0; i < N; ++i) {
sorted.... | 06-minpack | 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: '8'\n",
"score": 0,
"status": "WA"... |
nile | 2024 | 7aa2a81b-b862-ed67-7328-b61e9931d13c | #include <vector>
#include <algorithm>
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<pair<int, int>> sorted;
for (int i = 0; i < N; ++i) {
sorted.emplace_back(W[i], i);
}
sort(sorted.begin(), sor... | 06-minpack | 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: '14'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 3c1f7297-60df-aad1-8fdf-ff7b0e0a498e | #include <vector>
#include <algorithm>
using namespace std;
struct Artifact {
int W;
};
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 = W[i];
}
... | 06-minpack | 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: '8'\n",
"score": 0,
"status": "WA"... |
nile | 2024 | 1e075efe-934c-794f-7b64-828bca33a2e8 | #include <vector>
#include <algorithm>
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<pair<int, int>> sorted_pairs;
for (int i = 0; i < N; ++i) {
sorted_pairs.emplace_back(W[i], i);
}
sort(sorted_... | 06-minpack | 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: '14'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 4645baf8-e814-7f5e-cd49-48575355d7c1 | #include <vector>
#include <algorithm>
using namespace std;
struct Artifact {
int W;
int A;
int 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... | 06-minpack | 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 | f561ccd5-d300-a458-b37b-22b40318cb72 | #include "nile.h"
#include <vector>
#include <algorithm>
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<pair<int, int>> sorted_pairs;
for (int i = 0; i < N; ++i) {
sorted_pairs.emplace_back(W[i], i);
... | 02-permutation | 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 | ee0fb7ed-1986-8fce-6cdb-f5548130e7e8 | #include <vector>
#include <algorithm>
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<pair<int, int>> sorted;
for (int i = 0; i < N; ++i) {
sorted.emplace_back(W[i], i);
}
sort(sorted.begin(), sor... | 06-minpack | 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: '21'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 71094dcb-75d4-fc87-2b34-2a733b30a72f | #include "nile.h"
#include <vector>
#include <algorithm>
#include <utility>
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<pair<int, int>> sorted; // (weight, index)
for (int i = 0; i < N; ++i) {
sorted.... | 06-minpack | 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: '8'\n",
"score": 0,
"status": "WA"... |
nile | 2024 | eaed0edf-d40f-16f9-9793-1af87b893bcf | #include <vector>
#include <algorithm>
#include <deque>
#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<int> indices(n);
iota(indices.begin(), indices.end(), 0);
sort(indices.begin(), indic... | 02-permutation | 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: '0'\n",
"score": 0,
"status": "WA"... |
nile | 2024 | dd6fbd58-85aa-038e-0c31-2f7fb9234034 | #include <vector>
#include <algorithm>
using namespace std;
struct Artifact {
int W;
int s;
};
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) {
artifacts.push_back({W... | 06-minpack | 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: '14'\n",
"score": 0,
"status": "WA... |
nile | 2024 | e57ba447-e78e-0912-ec7e-5ff65b1e05b0 | #include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
struct SegmentTree {
int n;
vector<long long> tree;
SegmentTree(int size) {
n = 1;
while (n < size) n <<= 1;
tree.assign(2 * n, -1e18);
}
void update(int pos, long long value) {
pos +=... | 06-minpack | 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: '12'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 66e5325b-215c-79cd-539f-11d7fda2d135 | #include <vector>
#include <algorithm>
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<pair<int, int>> sorted_pairs(N);
for (int i = 0; i < N; ++i) {
sorted_pairs[i] = {W[i], i};
}
sort(sorted_pair... | 02-permutation | 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: '18'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 5a1a9cbc-8a98-153c-3112-38bbc611489c | #include <vector>
#include <algorithm>
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<tuple<int, int, int>> sorted; // (W, A, B)
for (int i = 0; i < N; ++i) {
sorted.emplace_back(W[i], A[i], B[i]);
}
... | 06-minpack | 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: '14'\n",
"score": 0,
"status": "WA... |
nile | 2024 | 914bb4dc-baed-6ea5-cccd-d7406967b232 | #include <vector>
#include <algorithm>
#include <tuple>
using namespace std;
struct SegmentTree {
vector<pair<int, int>> tree; // (value, index)
int n;
SegmentTree(const vector<int>& s) {
n = s.size();
tree.resize(4 * n);
build(1, 0, n-1, s);
}
void build(int node, int sta... | 06-minpack | 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":... |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 4