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 <bits/stdc++.h>
#include "icc.h"
using namespace std;
const int N = 105;
int n;
bool edge[N][N];
void run(int nn){
n = nn;
for (int i=1; i<n; i++){
bool done = 0;
for (int u = 1; u <= n; u++){
for (int v = u + 1; v <= n; v++){
int a[1] = {u};
int b[1] = {v};
if (!done and !edge[u][v] and query(1, 1, a, b)){
done = 1;
edge[u][v] = 1;
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... |