제출 #874234

#제출 시각아이디문제언어결과실행 시간메모리
874234LucaLucaMSuper Dango Maker (JOI22_dango3)C++17
2 / 100
73 ms612 KiB
#include "dango3.h" #ifdef LOCAL #include "grader.cpp" #endif // LOCAL #include <vector> void Solve(int n, int m) { auto query = [&] (std::vector<int> v) { return Query(v); }; bool taken[n * m + 1] = {}; for (int baubau = 0; baubau < m; baubau++) { std::vector<int> cur = {}; for (int i = 1; i <= n * m; i++) { if (!taken[i]) { cur.push_back(i); taken[i] = true; break; } } taken[1] = true; for (int rep = 2; rep <= n; rep++) { std::vector<int> ask = cur; for (int i = 1; i <= n * m; i++) { if (taken[i]) { continue; } ask.push_back(i); if (query(ask) == 1) { cur.push_back(i); taken[i] = true; break; } } } Answer(cur); } } /** 3 2 3 3 1 2 1 2 4 4 2 2 3 2 4 4 3 2 3 1 1 3 4 1 4 1 **/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...