question stringlengths 29 13k | r1_generation stringlengths 1.05k 92.9k | qwq_critique stringlengths 843 93.7k | solution stringlengths 74 11.7k | judgement stringclasses 2
values | pass_rate stringclasses 431
values | source stringclasses 5
values | license stringclasses 1
value | dataset stringclasses 4
values | split stringclasses 2
values | difficulty stringclasses 43
values | index stringlengths 1 5 | id stringlengths 32 32 | question_id stringlengths 32 32 | filter_tag stringclasses 2
values |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
You are given a functional graph. It is a directed graph, in which from each vertex goes exactly one arc. The vertices are numerated from 0 to n - 1.
Graph is given as the array f0, f1, ..., fn - 1, where fi — the number of vertex to which goes the only arc from the vertex i. Besides you are given array with weights o... | <think>
Okay, so I have this problem where I need to compute for each node in a functional graph two values: the sum of the weights along a path of length k starting at that node, and the minimum weight in that path. The graph is a functional graph, which means each node has exactly one outgoing edge. Hmm, right. So ea... | <think>
Okay, let's see. The problem is about finding for each node the sum and the minimum of the weights along a path of exactly k steps starting from that node. The graph is a functional graph, meaning each node has exactly one outgoing edge.
The solution provided uses some kind of precomputation with binary lifti... | #include <bits/stdc++.h>
using namespace std;
const int MAX_LEVEL = 35;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n;
long long k;
cin >> n >> k;
vector<int> f(n), w(n);
for (int& x : f) cin >> x;
for (int& x : w) cin >> x;
vector<vector<int... | right | 0.8 | codeforces | cc-by-4.0 | code_contests | train | 2100 | 366 | dd7d21f0a0162738a2fac3da3eeb7d19 | be797c47981ebefd5da6e5c7fb05a0c8 | high_pass_rate |
Igor is a post-graduate student of chemistry faculty in Berland State University (BerSU). He needs to conduct a complicated experiment to write his thesis, but laboratory of BerSU doesn't contain all the materials required for this experiment.
Fortunately, chemical laws allow material transformations (yes, chemistry i... | <think>
Okay, let's see. So the problem is about determining whether we can transform the available materials into the required amounts using the given transformation rules. The key here is that each material after the first has a transformation path to some previous material, right?
Hmm. The materials are numbered in... | <think>
Okay, I need to check if the given solution is correct. Let's start by understanding the problem again.
The problem is about determining if Igor can perform his experiment by transforming materials. Each material (except the first) has a transformation that can convert some amount of another material into it, ... | #include <vector>
#include <climits>
#include <cstdio>
using namespace std;
int main() {
int n;
scanf("%d", &n);
vector<long long> b(n+1), a(n+1);
for (int i=1; i<=n; ++i) scanf("%lld", &b[i]);
for (int i=1; i<=n; ++i) scanf("%lld", &a[i]);
vector<int> parent(n+1);
vector<long long> k(n+1);... | wrong | 1.0 | codeforces | cc-by-4.0 | apps | test | interview | 2047 | 2c17096076adef0f4fc4b8aad27105fe | 34067c87ce55351cc0d54ad9cab52966 | high_pass_rate |
In PrimeLand, there existed a very handsome young prince named Prima. He greatly desired the Princess of Mathematics – Facie. However, before accepting his hand in marriage, Facie asked Prima to solve the following problem:
The figure below shows a simple multiplication problem. However, not all the decimal digits ar... | <think>
Okay, let's see. So the problem is to find all valid multiplication setups where the digits used are a subset of the given digits. The input gives N digits, and we need to assign them to the multiplication problem's stars such that the multiplication is correct, and there are no leading zeros. Also, digits can'... | <think>
Okay, I need to check if the provided solution is correct for the given problem. Let me start by understanding the problem again.
The problem is about finding all valid multiplication problems in the format:
* * *
x * *
-------
* * * (partial 1)
* * * (partial 2)
-------
* * * *
Each * m... | #include <iostream>
#include <vector>
#include <unordered_set>
using namespace std;
int main() {
int N;
cin >> N;
unordered_set<int> digits;
for (int i = 0; i < N; ++i) {
int d;
cin >> d;
digits.insert(d);
}
vector<int> ABCs;
for (int a : digits) {
if (a ==... | right | 0.94 | codechef | cc-by-4.0 | taco | train | MEDIUM_HARD | 24967 | ec1bced9a336edc3cbbb865fdff25597 | 13b69d383cf1f518ccc357da218d5ba5 | high_pass_rate |
"Jzzhu have n non-negative integers a1, a2, ..., an. We will call a sequence of indexes i1, i2, ...,(...TRUNCATED) | "<think>\nOkay, so I need to solve this problem where I have to count the number of non-empty subset(...TRUNCATED) | "<think>\nOkay, I need to figure out if the provided solution is correct for the problem. Let me sta(...TRUNCATED) | "#include <bits/stdc++.h>\nusing namespace std;\n\nconst int MOD = 1000000007;\nconst int MAX_BITS =(...TRUNCATED) | right | 1.0 | codeforces | cc-by-4.0 | taco | train | VERY_HARD | 7094 | 12b00e9dbd593c8a291b4fec74782252 | 8b590c5d89556fabdbfaae621d73d5dc | high_pass_rate |
"Given a string s, process q queries, each having one of the following forms:\n\n * 1 i c — Chang(...TRUNCATED) | "<think>\nOkay, let's see. I need to solve this problem where there are two types of queries: updati(...TRUNCATED) | "<think>\nOkay, let's see. The user provided a solution to the problem and wants me to check if it's(...TRUNCATED) | "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<int> computeFailure(const string &pattern)(...TRUNCATED) | wrong | 1.0 | codeforces | cc-by-4.0 | taco | train | VERY_HARD | 12479 | 7b27c92c07b9ee5be2a32731ba72d57d | 87b064e627b7e2bb1e4cd3c109e46380 | high_pass_rate |
"You are given an undirected graph, consisting of n vertices and m edges. The graph does not necessa(...TRUNCATED) | "<think>\nOkay, let's see. The problem is about finding edges that are part of exactly one simple cy(...TRUNCATED) | "<think>\nOkay, I need to check if the provided solution correctly solves the problem. Let me start (...TRUNCATED) | "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<pair<int, int>> edges;\nvector<vector<pair(...TRUNCATED) | right | 1.0 | codeforces | cc-by-4.0 | taco | train | VERY_HARD | 19194 | 7c627551c65eb8762fe70e53358f5b1c | 4b815995aa5ba67f9a48c56579b4e048 | high_pass_rate |
"You are playing a computer card game called Splay the Sire. Currently you are struggling to defeat (...TRUNCATED) | "<think>\nOkay, let's try to figure out this problem. The goal is to maximize the total damage over (...TRUNCATED) | "<think>\nOkay, I need to figure out if the provided solution is correct. Let me start by understand(...TRUNCATED) | "#include <vector>\n#include <algorithm>\n#include <iostream>\n#include <climits>\n\nusing namespace(...TRUNCATED) | right | 1.0 | codeforces | cc-by-4.0 | code_contests | train | 2100 | 117 | b419525ee2c30a16d8f10eabcb423cdb | 992680cf135b1b2b236fecc2be3fad20 | high_pass_rate |
"You are given a table consisting of n rows and m columns. Each cell of the table contains either 0 (...TRUNCATED) | "<think>\nOkay, I need to solve this problem where I have to find the minimum number of 1s in a tabl(...TRUNCATED) | "<think>\nOkay, so I need to figure out if the provided solution to this programming problem is corr(...TRUNCATED) | "#include <vector>\n#include <algorithm>\n#include <iostream>\n\nusing namespace std;\n\nvoid fwht_x(...TRUNCATED) | right | 1.0 | codeforces | cc-by-4.0 | taco | train | VERY_HARD | 11865 | 1cd7400b1583c188193d08aa59bccbe2 | 1772c1235ea4c1222057f484dc972511 | high_pass_rate |
"You are given an undirected graph consisting of n vertices and <image> edges. Instead of giving you(...TRUNCATED) | "<think>\nOkay, so I have this problem where I need to find the number of connected components and t(...TRUNCATED) | "<think>\nOkay, let's see. The problem is to find the number of connected components and their sizes(...TRUNCATED) | "#include <bits/stdc++.h>\nusing namespace std;\n\nint main() {\n ios_base::sync_with_stdio(false(...TRUNCATED) | right | 1.0 | codeforces | cc-by-4.0 | code_contests | train | 2100 | 167 | 8562b50334fd7817e14c85bb2107cc65 | 66b60c2b347b4d2f72d77d741d7aad59 | high_pass_rate |
"You are given two permutations p and q, consisting of n elements, and m queries of the form: l1, r1(...TRUNCATED) | "<think>\nOkay, let's tackle this problem. Hmm, the task is to process multiple queries where each q(...TRUNCATED) | "<think>\nOkay, I need to figure out if the provided solution is correct. Let me start by understand(...TRUNCATED) | "#include <bits/stdc++.h>\nusing namespace std;\n\nvector<vector<int>> tree;\nint n_padded;\n\nvoid (...TRUNCATED) | right | 0.96 | codeforces | cc-by-4.0 | taco | train | VERY_HARD | 12786 | bbf5ff05c8697d16abe9bcc5537cdd52 | add18c49c86b70861abc9385286569fe | high_pass_rate |
End of preview. Expand in Data Studio
README.md exists but content is empty.
- Downloads last month
- 167