# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
66394 | ansol4328 | 문명 (KOI17_civilization) | C++98 | 1056 ms | 38144 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<memory.h>
#include<queue>
using namespace std;
int n, k;
int visit[2002][2002];
int p[4000002];
int cnt;
bool st[4000002];
void setup(int a)
{
cnt=a;
memset(p,-1,sizeof(p));
memset(st,false,sizeof(st));
}
int f(int v)
{
if(p[v]==-1) return v;
p[v]=f(p[v]);
return p[v];
}
void u(int v1, int v2) // v2 subtree -> v1 subtree
{
v1=f(v1);
v2=f(v2);
if(v1==v2) return;
if(st[v2]) cnt--;
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... |