Submission #892651

#TimeUsernameProblemLanguageResultExecution timeMemory
892651iskhakkutbilimSuper Dango Maker (JOI22_dango3)C++17
2 / 100
397 ms676 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(n); vector<int> asking; for(int i = 0;i < n; i++){ vector<int> idx = asking; for(int j = 1;j <= n * m; j++){ if(used[j]) continue; idx.push_back(j); int cnt = Query(idx); if(cnt == 1){ ans[i].push_back(j); used[j] = 1; idx.pop_back(); } } for(int el : ans[i]){ asking.push_back(el); } } vector<vector<int> > vec(m); for(int i = 0;i < n; i++){ int cur = 0; if(ans[i].size() != m) assert(false); for(int j : ans[i]){ vec[cur++].push_back(j); } } for(int i = 0;i < m; i++) Answer(vec[i]); }

Compilation message (stderr)

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:31:20: warning: comparison of integer expressions of different signedness: 'std::vector<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   31 |   if(ans[i].size() != m) assert(false);
      |      ~~~~~~~~~~~~~~^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...