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 "meetings.h"
using namespace std;
int n;
void Solve (int N) {
n = N;
for (int a = 0; a < n; a++) {
for (int b = a + 1; b < n; b++) {
int cnt = 0;
for (int c = 0; c < n; c++) {
if (c == a || c == b) continue;
int res = Query(a, b, c);
if (res == a || res == b) cnt++;
}
if (cnt == n-2) Bridge(a, b);
}
}
}
# | 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... |