# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1033138 | 2024-07-24T13:15:09 Z | adaawf | Super Dango Maker (JOI22_dango3) | C++17 | 1 ms | 604 KB |
#include <iostream> #include <vector> #include "dango3.h" using namespace std; vector<int> trya(vector<int> v, int x) { vector<int> vv; for (int w : v) { if (w != x) { vv.push_back(w); } } return vv; } void Solve(int n, int m) { vector<int> v; vector<vector<int>> res; for (int i = 1; i <= n * m; i++) { v.push_back(i); } for (int i = 1; i <= m; i++) { vector<int> vv; int h = 0; while (vv.size() > n) { if (Query(trya(vv, vv[h])) != 0) { vv = trya(vv, vv[h]); } else h++; } res.push_back(vv); for (int w : vv) v = trya(v, w); } for (auto w : res) Answer(w); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 348 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 348 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 604 KB | Wrong Answer [4] |
2 | Halted | 0 ms | 0 KB | - |