# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
522700 | FronPaw | KOVANICE (COI15_kovanice) | C++14 | 346 ms | 35700 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>
using namespace std;
int lg, n, m;
int unde[300001];
struct T
{
int nr1, nr2;
char cmp;
};
T op[300001];
int tata[300001], rang[300001];
int in[300001], in1[300001];
vector <int> v[300001];
vector <int> trans[300001];
bool viz[300001];
int ans[300001];
int find_tata (int nod)
{
int rez = nod;
while (nod != tata[nod])
nod = tata[nod];
while (rez != nod)
{
int cop = tata[rez];
tata[rez] = nod;
rez = cop;
}
return nod;
}
void uneste (int a, int b)
# | 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... |