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 pair<int,int> ii;
void run(int n) {
set<ii> s;
int a[1],b[1];
for (int k = 0; k < n-1; k++){
int done = 0;
for (int i =1; i <= n; i++){
if (done) break;
for (int j = i+1; j <= n; j++){
if (s.find(ii(i,j)) != s.end()) continue;
a[0] = i,b[0] = j;
if (query(1,1,a,b)){
setRoad(i,j);
s.insert(ii(i,j));
done = 1;
break;
}
}
}
}
}
# | 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... |