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 "monster.h"
#include <iostream>
namespace {
} // namespace
std::vector<int> Solve(int N) {
std::vector<int> T(N);
std::vector<int> counter(N);
for (int i = 0; i < N-1; i++) {
for (int j = i + 1; j < N; j++) {
if (Query(i, j)) {
counter[i]++;
}
else {
counter[j]++;
}
}
}
int a=-1, b=-1;
for (int i = 0; i < N; i++) {
if (counter[i] == 1) {
if (a == -1) {
a = i;
}
else {
b = i;
}
}
}
if (Query(a, b)) {
counter[a] = 0;
}
else {
counter[b] = 0;
}
int x = -1, y = -1;
for (int i = 0; i < N; i++) {
if (counter[i] == N-2) {
if (x == -1) {
x = i;
}
else {
y = i;
}
}
}
if (Query(x, y)) {
counter[y] = N-1;
}
else {
counter[x] = N-1;
}
return counter;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |