# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1033141 | 2024-07-24T13:18:26 Z | adaawf | Super Dango Maker (JOI22_dango3) | C++17 | 1555 ms | 1028 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 Print(vector<int> v) { for (int w : v) cout << w << " "; cout << '\n'; } int Query(vector<int> v) { Print(v); int k; cin >> k; return k; } void Answer(vector<int> v) { Print(v); }*/ 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 = v; 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); } /*int main() { int n = 3, m = 3; Solve(n, m); }*/
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 0 ms | 348 KB | Output is correct |
3 | Correct | 0 ms | 348 KB | Output is correct |
4 | Correct | 0 ms | 344 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |
6 | Correct | 0 ms | 348 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 12 ms | 440 KB | Output is correct |
2 | Correct | 12 ms | 552 KB | Output is correct |
3 | Correct | 12 ms | 344 KB | Output is correct |
4 | Correct | 12 ms | 344 KB | Output is correct |
5 | Correct | 14 ms | 348 KB | Output is correct |
6 | Correct | 11 ms | 344 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 595 ms | 676 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 1555 ms | 1028 KB | Wrong Answer [3] |
2 | Halted | 0 ms | 0 KB | - |