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 k=0; k<n-1; k++){
int u=-1,v=-1;
for(int i=1;u==-1 && v==-1 && i<=n; i++){
int a[1]={i};
int b[n-1];
int ix=0;
for(int j=1; j<=n; j++)
if(get(i)!=get(j))
b[ix++]=j;
if(query(1,ix,a,b)){
if(u==-1)
u=i;
else
v=i;
}
}
unite(u,v);
setRoad(u,v);
}
}
# | 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... |