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;
void run(int n) {
set<pair<int,int>> edges;
for(int i = 0; i < n - 1; i++) {
for(int a = 1; a <= n; ++a) {
for(int b = a + 1; b <= n; ++b) {
int* arr1 = new int[1];
arr1[0] = a;
int* arr2 = new int[1];
arr2[0] = b;
if(edges.count({a,b}) == 0 && query(1, 1, arr1, arr2) == 1) {
edges.insert({a,b});
cerr << a << " " << b << endl;
setRoad(a, b);
a = n + 1;
b = n + 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... |