Submission #892533

#TimeUsernameProblemLanguageResultExecution timeMemory
892533iskhakkutbilimSuper Dango Maker (JOI22_dango3)C++17
0 / 100
174 ms648 KiB
#include "dango3.h" #include <bits/stdc++.h> using namespace std; void Solve(int n, int m){ vector<int> used(n * m + 1, 0); vector<vector<int> > ans(m); for(int i = 0;i < m; i++){ vector<int> idx; for(int j = 1;j <= n * m; j++){ if(used[j]) continue; idx.push_back(j); } while(idx.size()){ int bc = idx.back(); idx.pop_back(); int cnt = Query(idx); if(cnt == 0){ ans[i].push_back(bc); used[bc] = 1; } } } for(int i = 0;i < m; i++){ Answer(ans[i]); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...