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;
#ifdef B01
#include "debb.h"
#else
#define deb(...)
#endif
const int N = 101;
int n;
int a[N], b[2];
bitset<N> g[N];
void run(int n_) {
n = n_;
for (int iter = 0; iter < n - 1; iter++) {
for (int u = 0; u < n; u++) {
b[0] = u + 1;
int sz = 0;
for (int v = u + 1; v < n; v++) {
if (!g[u][v]) {
a[sz++] = v + 1;
}
}
for (int i = 0; i < sz; i++) {
if (query(1, 1, a + i, b)) {
setRoad(a[i], b[0]);
g[a[i] - 1][u] = g[u][a[i] - 1] = 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... |