# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
254659 | MKopchev | Parachute rings (IOI12_rings) | C++14 | 1640 ms | 109432 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;
const int nmax=1e6+42;
int n;
int deg[10][nmax];
int ret;
vector< int > adj[nmax];
int parent[10][nmax];
int SZ[nmax];
void Init(int N)
{
n=N;
ret=n;
for(int i=0;i<n;i++)
{
parent[0][i]=i;
SZ[i]=1;
}
}
set<int> big;
# | 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... |