# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444747 | 2021-07-15T04:09:35 Z | ics0503 | Chameleon's Love (JOI20_chameleon) | C++17 | 42 ms | 452 KB |
#include "chameleon.h" #include <vector> using namespace std; int cck[1212]; void validation(int n, int i, int 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); if (Q != n) { cck[i] = cck[j] = 1; Answer(i, j); } } void S4(int who, vector<int>Y,int n) { int sz = Y.size(), i, j; if (sz == 1) { validation(n, who, Y[0]); return; } vector<int>L, R; for (i = 0; i < sz / 2; i++)L.push_back(Y[i]); for (i = sz/2; i < sz; i++)R.push_back(Y[i]); L.push_back(who); R.push_back(who); int a = Query(L); int b = Query(R); L.pop_back(); R.pop_back(); if (a != L.size() + 1)S4(who, L, n); if (b != R.size() + 1)S4(who, R, n); } vector<int>AX, AY; int pk[1212]; void Solve(int n) { int i, j; vector<int>X; X.push_back(1); pk[1] = 1; for (i = 2; i <= 2 * n; i++) { X.push_back(i); if (Query(X) != X.size()) { X.pop_back(); } else { pk[i] = 1; } } for (i = 1; i <= 2 * n; i++) { if (pk[i])AX.push_back(i); else AY.push_back(i); } for (i = 0; i < n; i++) { int who = AX[i]; vector<int>Y; for (j = 0; j < n; j++) { int v = AY[j]; if (cck[v])continue; Y.push_back(v); } S4(who, Y, n); } }
Compilation message
# | 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 | 25 ms | 328 KB | Output is correct |
4 | Correct | 25 ms | 356 KB | Output is correct |
5 | Correct | 25 ms | 360 KB | Output is correct |
6 | Correct | 25 ms | 344 KB | Output is correct |
7 | Correct | 31 ms | 452 KB | Output is correct |
8 | Correct | 30 ms | 352 KB | Output is correct |
9 | Correct | 25 ms | 352 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 | Incorrect | 0 ms | 200 KB | Wrong Answer [1] |
5 | 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 | Incorrect | 0 ms | 200 KB | Wrong Answer [1] |
5 | 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 | 39 ms | 316 KB | Output is correct |
4 | Correct | 39 ms | 332 KB | Output is correct |
5 | Correct | 42 ms | 332 KB | Output is correct |
6 | Correct | 39 ms | 364 KB | Output is correct |
7 | Correct | 39 ms | 336 KB | Output is correct |
8 | Correct | 39 ms | 328 KB | Output is correct |
9 | Correct | 38 ms | 328 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 | 25 ms | 328 KB | Output is correct |
4 | Correct | 25 ms | 356 KB | Output is correct |
5 | Correct | 25 ms | 360 KB | Output is correct |
6 | Correct | 25 ms | 344 KB | Output is correct |
7 | Correct | 31 ms | 452 KB | Output is correct |
8 | Correct | 30 ms | 352 KB | Output is correct |
9 | Correct | 25 ms | 352 KB | Output is correct |
10 | Correct | 0 ms | 200 KB | Output is correct |
11 | Correct | 0 ms | 200 KB | Output is correct |
12 | Correct | 0 ms | 200 KB | Output is correct |
13 | Incorrect | 0 ms | 200 KB | Wrong Answer [1] |
14 | Halted | 0 ms | 0 KB | - |