# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
478300 | rainboy | Praktični (COCI18_prakticni) | C11 | 113 ms | 3532 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 <stdio.h>
#include <string.h>
#define N 100000
#define M 100000
#define L 30
int ds[N], xx[N];
int find(int i) {
int p, r;
if (ds[i] < 0)
return i;
p = ds[i], r = find(p);
xx[i] ^= xx[p];
ds[i] = p;
return r;
}
int join(int i, int j, int x) {
int ri = find(i), rj = find(j);
x ^= xx[i] ^ xx[j], i = ri, j = rj;
if (i == j)
return x;
if (ds[i] > ds[j])
ds[i] = j, xx[i] = x;
else {
if (ds[i] == ds[j])
Compilation message (stderr)
# | 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... |
# | 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... |