# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
63587 | Vahan | Parachute rings (IOI12_rings) | C++17 | 3220 ms | 173036 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<vector>
#include<iostream>
using namespace std;
vector<int> g[2000000];
int n,u[2000000],q[8],p[8];
int sz[2000000][8],pa[2000000][8],kq[2000000][8],ynt1[5],ynt2=-1,minchev2=1,y=0,kk[7],ee;
int CountCritical();
void crset(int a,int c)
{
sz[a][c]=1;
pa[a][c]=a;
}
int getparent(int a,int c)
{
if(pa[a][c]==a)
return a;
pa[a][c]=getparent(pa[a][c],c);
return pa[a][c];
}
void setunion(int a,int b,int c)
{
a=getparent(a,c);
b=getparent(b,c);
if(a==b)
{
q[c]++;
p[c]+=sz[a][c];
}
if(a>b)
{
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... |