year int64 2.02k 2.02k | day stringclasses 2
values | problem_name stringclasses 6
values | problem_id stringclasses 6
values | prompt stringclasses 41
values | generation stringlengths 9.03k 198k | uuid stringlengths 36 36 | model_kwargs dict | metadata dict | code stringlengths 193 6.17k ⌀ | code_compiles bool 2
classes | target_subtask_score float64 0 1 | target_subtask_status stringclasses 7
values | all_subtasks_points float64 0 67 | all_subtasks_results listlengths 3 9 | target_subtask stringclasses 35
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2,024 | day1 | Nile | nile | You are an expert competitive programmer. You will be given a problem statement, test case constraints and example test inputs and outputs. Please reason step by step about the solution, then provide a complete implementation in C++17. You should correctly implement the routine(s) described in Implementation Details, w... | Okay, let's tackle this problem. Hmm, the goal is to compute the minimum cost for each query D (given in E) where we can pair artifacts in boats if their weight difference is at most D. Each pair contributes B[p] + B[q], and singles contribute A[i]. The challenge is to find the optimal way to pair artifacts for each D ... | dd2e0c71-0bb9-473f-a7d1-6cfc4a234958 | {
"seed": 7
} | {
"stop_reason": "unknown",
"timestamp": "2025-03-06T22:01:34.484801",
"usage": {
"completion_tokens": 18668,
"cost": 0,
"prompt_tokens": 1588,
"total_tokens": 20256
}
} | #include <bits/stdc++.h>
#include "nile.h"
#include <deque>
#include <vector>
std::vector<long long> calculate_costs(
std::vector<int> W, std::vector<int> A,
std::vector<int> B, std::vector<int> E) {
int N = W.size();
std::vector<long long> R(E.size());
for (int q = 0; q < E.size(); ++q) {
... | 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: '15'\n",
"score": 0,
"status": "WA... | 02-permutation |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem. Let me read the problem statement carefully again. \n\nThe prob(...TRUNCATED) | bada6d33-ec0c-40ff-b6e0-c95644988c10 | {
"seed": 17
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:16:48.063399","usage":{"completion_tokens":19465(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <algorithm>\n#include <c(...TRUNCATED) | false | 0 | CE | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"CE","subtask":"00-samples","(...TRUNCATED) | 04-n2 |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem. Let's read the problem carefully again.\n\nSo the task is, for (...TRUNCATED) | 4fe9338f-94b2-495a-b92a-bc6579cdc2c1 | {
"seed": 10
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:03:35.959574","usage":{"completion_tokens":21847(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <algorithm>\n#include <l(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 04-n2 |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem where I have to calculate the minimum cost for transporting arti(...TRUNCATED) | e2c6f738-241e-45c3-a5c3-a735da54e8eb | {
"seed": 11
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:11:33.574357","usage":{"completion_tokens":14292(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <algorithm>\n#include <c(...TRUNCATED) | false | 0 | CE | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"CE","subtask":"00-samples","(...TRUNCATED) | 04-n2 |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, let's tackle this problem. Hmm, the goal is to compute the minimal total cost for each query (...TRUNCATED) | c3ec4d48-9f54-47fc-b3a2-59128604118c | {
"seed": 13
} | {"stop_reason":"unknown","timestamp":"2025-03-06T22:02:55.648773","usage":{"completion_tokens":20377(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <set>\n#include <algorit(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 02-permutation |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem where I have to calculate the minimum cost for transporting arti(...TRUNCATED) | 79b0eba0-c0f6-4a43-b1de-1af61e0c5308 | {
"seed": 3
} | {"stop_reason":"unknown","timestamp":"2025-03-06T22:01:27.805168","usage":{"completion_tokens":19765(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <algorithm>\n\nstd::vect(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 02-permutation |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem. Let's read through the problem carefully again. \n\nThe task is(...TRUNCATED) | 6c74a547-ae0b-4931-98d5-a9ba891f6e40 | {
"seed": 15
} | {"stop_reason":"unknown","timestamp":"2025-03-06T22:01:43.675092","usage":{"completion_tokens":16810(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <deque>\n#include <vector>\n\nstd::vector<l(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 02-permutation |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, let's tackle this problem. Hmm, the goal is to find the minimum total cost for each D given i(...TRUNCATED) | f0f85e8f-7d8a-4bf8-b80c-66305f997669 | {
"seed": 24
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:20:22.579445","usage":{"completion_tokens":18724(...TRUNCATED) | "#include <bits/stdc++.h>\n#include <vector>\n#include <algorithm>\n#include <climits>\n#include \"n(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 04-n2 |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem where I have to calculate the minimum cost for transporting arti(...TRUNCATED) | 8727a477-1180-4ebf-995b-a7cf3335e8b8 | {
"seed": 12
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:05:18.888993","usage":{"completion_tokens":22883(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <algorithm>\nusing names(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 04-n2 |
2,024 | day1 | Nile | nile | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, I need to solve this problem where I have to calculate the minimum cost for transporting arti(...TRUNCATED) | 0084bda7-a604-42fa-83fc-1de8e684fa5c | {
"seed": 42
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:22:36.144803","usage":{"completion_tokens":22304(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"nile.h\"\n#include <vector>\n#include <algorithm>\n#include <c(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"nile","score":0.0,"score_precision":2,"status":"WA","subtask":"00-samples","(...TRUNCATED) | 04-n2 |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 9