#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 |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
0 ms |
200 KB |
Output is correct |
3 |
Incorrect |
141 ms |
276 KB |
Wrong Answer [3] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
0 ms |
200 KB |
Output is correct |
3 |
Correct |
0 ms |
200 KB |
Output is correct |
4 |
Correct |
0 ms |
200 KB |
Output is correct |
5 |
Correct |
0 ms |
200 KB |
Output is correct |
6 |
Correct |
0 ms |
200 KB |
Output is correct |
7 |
Correct |
0 ms |
200 KB |
Output is correct |
8 |
Correct |
0 ms |
200 KB |
Output is correct |
9 |
Correct |
0 ms |
200 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
0 ms |
200 KB |
Output is correct |
3 |
Correct |
0 ms |
200 KB |
Output is correct |
4 |
Correct |
0 ms |
200 KB |
Output is correct |
5 |
Correct |
0 ms |
200 KB |
Output is correct |
6 |
Correct |
0 ms |
200 KB |
Output is correct |
7 |
Correct |
0 ms |
200 KB |
Output is correct |
8 |
Correct |
0 ms |
200 KB |
Output is correct |
9 |
Correct |
0 ms |
200 KB |
Output is correct |
10 |
Correct |
6 ms |
200 KB |
Output is correct |
11 |
Correct |
6 ms |
200 KB |
Output is correct |
12 |
Correct |
8 ms |
296 KB |
Output is correct |
13 |
Correct |
6 ms |
200 KB |
Output is correct |
14 |
Correct |
6 ms |
200 KB |
Output is correct |
15 |
Correct |
6 ms |
200 KB |
Output is correct |
16 |
Correct |
7 ms |
200 KB |
Output is correct |
17 |
Correct |
7 ms |
296 KB |
Output is correct |
18 |
Correct |
7 ms |
292 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
0 ms |
200 KB |
Output is correct |
3 |
Incorrect |
138 ms |
320 KB |
Wrong Answer [3] |
4 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
200 KB |
Output is correct |
2 |
Correct |
0 ms |
200 KB |
Output is correct |
3 |
Incorrect |
141 ms |
276 KB |
Wrong Answer [3] |
4 |
Halted |
0 ms |
0 KB |
- |