# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1037254 | 2024-07-28T11:41:39 Z | juicy | Super Dango Maker (JOI22_dango3) | C++17 | 428 ms | 632 KB |
#include <bits/stdc++.h> #include "dango3.h" using namespace std; #ifdef LOCAL #include "debug.h" #else #define debug(...) 42 #endif void dc(vector<int> cands, int lay) { if (lay == 1) { Answer(cands); return; } int md = lay / 2; vector<bool> vs(cands.size()); vector<int> lt, rt; for (int i = 0; i < cands.size(); ++i) { vector<int> nw; for (int j = 0; j < cands.size(); ++j) { if (!vs[j] && i != j) { nw.push_back(j); } } if (Query(nw) >= md) { vs[i] = 1; rt.push_back(i); } else { lt.push_back(i); } } dc(lt, md); dc(rt, lay - md); } void Solve(int N, int M) { vector<int> res(N * M); iota(res.begin(), res.end(), 1); dc(res, M); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong Answer [5] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 4 ms | 344 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 87 ms | 632 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 428 ms | 600 KB | Wrong Answer [1] |
2 | Halted | 0 ms | 0 KB | - |