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 6
values | all_subtasks_points float64 0 67 | all_subtasks_results listlengths 0 9 | subtask stringclasses 35
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
2,024 | day2 | Hieroglyphs | hieroglyphs | 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, so I need to find the universal common subsequence (UCS) of two sequences A and B. Hmm, let's think about what the problem says. The UCS has to be a common subsequence of both A and B, and every other common subsequence must be a subsequence of it. Oh right, and there can be at most one such sequence. So the task... | c90e4a64-5825-4e67-8d4c-089e360750b3 | {
"seed": 0
} | {
"stop_reason": "unknown",
"timestamp": "2025-03-06T23:33:50.575200",
"usage": {
"completion_tokens": 20341,
"cost": 0,
"prompt_tokens": 1619,
"total_tokens": 21960
}
} | #include <bits/stdc++.h>
#include "hieroglyphs.h"
#include <vector>
#include <unordered_map>
#include <algorithm>
std::vector<int> ucs(std::vector<int> A, std::vector<int> B) {
int N = A.size();
std::unordered_map<int, int> pos_B;
for (int i = 0; i < N; ++i) {
pos_B[B[i]] = i;
}
std::vector... | true | 0 | WA | 0 | [
{
"points": 0,
"problem": "hieroglyphs",
"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: '4', found: '2'\n",
"score": 0,
"status"... | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence (UCS) of t(...TRUNCATED) | b7732c4c-b16a-43e6-ab66-0ffddc601475 | {
"seed": 1
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:35:41.425910","usage":{"completion_tokens":23703(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\n\nus(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence of two seq(...TRUNCATED) | 2421dfc0-facb-4e5c-a592-55901cfb1a02 | {
"seed": 2
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:31:30.793567","usage":{"completion_tokens":11738(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n\nstd::vector<int> ucs(std(...TRUNCATED) | true | 1 | AC | 3 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence (UCS) of t(...TRUNCATED) | 5eae25c6-6535-4c3b-ac15-f2eb27a4965b | {
"seed": 3
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:31:15.531479","usage":{"completion_tokens":10670(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <unordered_set>\n(...TRUNCATED) | true | 1 | AC | 3 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence of two seq(...TRUNCATED) | da041f3c-05e3-4a8c-89aa-2faebd201bfd | {
"seed": 4
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:30:51.478889","usage":{"completion_tokens":8698,(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n\nstd::vector<int> ucs(std(...TRUNCATED) | true | 1 | AC | 3 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence of two seq(...TRUNCATED) | 320afdfa-089d-4bf7-a1dc-ac37ca40f430 | {
"seed": 5
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:35:34.199780","usage":{"completion_tokens":19559(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\nusin(...TRUNCATED) | true | 1 | AC | 3 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence (UCS) of t(...TRUNCATED) | 8ff57f98-1c88-499a-ac97-b03a21a056ca | {
"seed": 6
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:36:21.388096","usage":{"completion_tokens":19824(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\n#inc(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "You are an expert competitive programmer. You will be given a problem statement, test case constrai(...TRUNCATED) | "Okay, so I need to solve this problem where I have to find the universal common subsequence of two (...TRUNCATED) | d742ea0e-7938-434f-aff5-cea21b3cf4a9 | {
"seed": 7
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:35:58.273192","usage":{"completion_tokens":17726(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\nusin(...TRUNCATED) | true | 1 | AC | 3 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"RE","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence of two seq(...TRUNCATED) | 3812ab7b-585f-4e63-aa6d-61500dbfdc06 | {
"seed": 8
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:47:12.466034","usage":{"completion_tokens":20006(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\n\nst(...TRUNCATED) | false | 0 | CE | 0 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"CE","subtask":"00-sam(...TRUNCATED) | 01-perm |
2,024 | day2 | Hieroglyphs | hieroglyphs | "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 find the universal common subsequence between tw(...TRUNCATED) | 53c6fb9a-bc75-483c-ac13-f2467d18d96d | {
"seed": 9
} | {"stop_reason":"unknown","timestamp":"2025-03-06T23:37:50.318958","usage":{"completion_tokens":19640(...TRUNCATED) | "#include <bits/stdc++.h>\n#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\n\nst(...TRUNCATED) | true | 0 | WA | 0 | [{"points":0,"problem":"hieroglyphs","score":0.0,"score_precision":2,"status":"WA","subtask":"00-sam(...TRUNCATED) | 01-perm |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5