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;
int n,cnt=0;
set<pair<int,int>> s;
void answer(int a,int b){
setRoad(a,b);
s.insert({a,b});
cnt++;
if(cnt==n-1){
exit(0);
}
}
void run(int N){
n=N;
for(int _=0;_<n-1;_++){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)continue;
int a[1],b[1];
a[0]=i,b[0]=j;
if(s.find({i,j})==s.end()&&query(1,1,a,b)){
answer(i,j);
}
}
}
}
}
# | 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... |