# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1174785 | vicvic | Pictionary (COCI18_pictionary) | C++20 | 1595 ms | 1096 KiB |
#include <iostream>
using namespace std;
const int NMAX=1e5;
int n, m, q, union_day[NMAX+5], t[NMAX+5];
int tatal (int nod)
{
return t[nod]==0?nod:tatal (t[nod]);
}
void join (int a, int b, int d)
{
a=tatal (a);
b=tatal (b);
if (a==b)
return;
t[a]=b;
union_day[a]=d;
}
int query (int x, int y)
{
int ret=0;
while (x!=y)
{
if (union_day[x]>union_day[y])
ret=union_day[x], x=t[x];
else
ret=union_day[y], y=t[y];
}
return ret;
}
# | 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... |