# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
873321 | PagodePaiva | Joker (BOI20_joker) | C++17 | 2057 ms | 6260 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define N 300010
using namespace std;
const int B = 500;
int n, m, q;
struct DSU{
int pai[N], sz[N], val[N];
void init(int n){
for(int i = 1;i <= n;i++){
pai[i] = i;
sz[i] = 1;
val[i] = 0;
}
}
int find(int x){
if(x == pai[x]) return x;
int p = find(pai[x]);
val[x] += val[p];
val[x] %= 2;
pai[x] = p;
return pai[x];
}
void join(int a, int b){
int va, vb;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |