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;
void setRoad(int a, int b);
int query(int size_a, int size_b, int a[], int b[]);
void run(int n) {
while (true) {
for (int x = 1; x <= n; x++) {
for (int y = x + 1; y <= n; y++) {
int a[1] = {x};
int b[1] = {y};
int ret = query(1, 1, a, b);
if (ret) {
setRoad(x, y);
}
}
}
}
}
# | 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... |