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 "icc.h"
#include <bits/stdc++.h>
using namespace std;
typedef vector<int>vi;
#define pb push_back
vi par;
int get(int x){return par[x]=(x==par[x]?x:get(par[x]));}
void unite(int u,int v){
u=get(u),v=get(v);
if(u==v)return;
par[u]=v;
}
void run(int n){
par.resize(n+1);
for(int i=0; i<=n; i++)
par[i]=i;
for(int i=1; i<=n; i++)
for(int j=i+1; j<=n; j++)
if(get(i)!=get(j)){
int I[1]={i},J[1]={j};
if(query(1,1,I,J))
unite(i,j);
}
for(int i=1; i<=n; i++)
if(get(i)!=get(1))
setRoad(i,1);
}
# | 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... |