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) {
int arra[n+1], arrb[n+1];
vector<vector<bool>> ed(n+1, vector<bool>(n+1));
for(int i = 0; i < n - 1; i++) {
int u = -1, v = -1;
for (int j = 1; j <= n; ++j){
arra[0] = j;
int x = 0;
for (int k = 1; k <= n; ++k){
if (ed[j][k] || j == k) continue;
arrb[x++] = k;
}
if (query(1, x, arra, arrb)) {
if (u == -1) u = j;
else v = j;
}
}
setRoad(u, v);
ed[u][v] = ed[v][u] = true;
}
}
# | 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... |