problem_id large_stringclasses 6
values | subtask large_stringclasses 35
values | prompt large_stringclasses 41
values | generation large_stringlengths 9.03k 198k | code large_stringlengths 0 6.15k | language large_stringclasses 2
values | solution_number int64 0 49 | uuid large_stringlengths 36 36 | model_kwargs dict | metadata dict |
|---|---|---|---|---|---|---|---|---|---|
hieroglyphs | 01-perm | 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... | #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<int> C(N);
for (int ... | cpp | 0 | c90e4a64-5825-4e67-8d4c-089e360750b3 | {
"seed": 0
} | {
"usage": {
"completion_tokens": 20341,
"prompt_tokens": 1619,
"total_tokens": 21960,
"cost": 0
},
"timestamp": "2025-03-06T23:33:50.575200",
"stop_reason": "unknown"
} |
hieroglyphs | 01-perm | "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) | "#include <vector>\n#include <algorithm>\n\nusing namespace std;\n\nvector<int> ucs(vector<int> A, v(...TRUNCATED) | cpp | 1 | b7732c4c-b16a-43e6-ab66-0ffddc601475 | {
"seed": 1
} | {"usage":{"completion_tokens":23703,"prompt_tokens":1619,"total_tokens":25322,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include \"hieroglyphs.h\"\n#include <vector>\n\nstd::vector<int> ucs(std::vector<int> A, std::vect(...TRUNCATED) | cpp | 2 | 2421dfc0-facb-4e5c-a592-55901cfb1a02 | {
"seed": 2
} | {"usage":{"completion_tokens":11738,"prompt_tokens":1619,"total_tokens":13357,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include \"hieroglyphs.h\"\n#include <vector>\n#include <unordered_set>\n\nstd::vector<int> ucs(std(...TRUNCATED) | cpp | 3 | 5eae25c6-6535-4c3b-ac15-f2eb27a4965b | {
"seed": 3
} | {"usage":{"completion_tokens":10670,"prompt_tokens":1619,"total_tokens":12289,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include \"hieroglyphs.h\"\n#include <vector>\n\nstd::vector<int> ucs(std::vector<int> A, std::vect(...TRUNCATED) | cpp | 4 | da041f3c-05e3-4a8c-89aa-2faebd201bfd | {
"seed": 4
} | {"usage":{"completion_tokens":8698,"prompt_tokens":1619,"total_tokens":10317,"cost":0.0},"timestamp"(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include <vector>\n#include <algorithm>\nusing namespace std;\n\nvector<int> ucs(vector<int> A, vec(...TRUNCATED) | cpp | 5 | 320afdfa-089d-4bf7-a1dc-ac37ca40f430 | {
"seed": 5
} | {"usage":{"completion_tokens":19559,"prompt_tokens":1619,"total_tokens":21178,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\n#include <climits>\n\nusing na(...TRUNCATED) | cpp | 6 | 8ff57f98-1c88-499a-ac97-b03a21a056ca | {
"seed": 6
} | {"usage":{"completion_tokens":19824,"prompt_tokens":1619,"total_tokens":21443,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include <vector>\n#include <algorithm>\nusing namespace std;\n\nstruct Node {\n int max_len;\n (...TRUNCATED) | cpp | 7 | d742ea0e-7938-434f-aff5-cea21b3cf4a9 | {
"seed": 7
} | {"usage":{"completion_tokens":17726,"prompt_tokens":1619,"total_tokens":19345,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include \"hieroglyphs.h\"\n#include <vector>\n#include <algorithm>\n\nstd::vector<int> ucs(std::ve(...TRUNCATED) | cpp | 8 | 3812ab7b-585f-4e63-aa6d-61500dbfdc06 | {
"seed": 8
} | {"usage":{"completion_tokens":20006,"prompt_tokens":1619,"total_tokens":21625,"cost":0.0},"timestamp(...TRUNCATED) |
hieroglyphs | 01-perm | "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) | "#include <vector>\n#include <algorithm>\n\nstd::vector<int> ucs(std::vector<int> A, std::vector<int(...TRUNCATED) | cpp | 9 | 53c6fb9a-bc75-483c-ac13-f2467d18d96d | {
"seed": 9
} | {"usage":{"completion_tokens":19640,"prompt_tokens":1619,"total_tokens":21259,"cost":0.0},"timestamp(...TRUNCATED) |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 5