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 "chameleon.h"
#include <vector>
using namespace std;
void Solve(int n) {
int i, j;
for (i = 1; i <= 2*n; i++) {
for (j = i + 1; j <= 2*n; j++) {
vector<int>qr;
for (int p = 1; p <= 2*n; p++) {
if (i == p || j == p)continue;
qr.push_back(p);
}
int Q = Query(qr);
qr.clear();
qr.push_back(i);
qr.push_back(j);
int P = Query(qr);
if (Q != n && P == 1) {
Answer(i, j);
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... |