제출 #892535

#제출 시각아이디문제언어결과실행 시간메모리
892535iskhakkutbilimSuper Dango Maker (JOI22_dango3)C++17
0 / 100
73 ms920 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; } } if(ans.size() != n) assert(false); } for(int i = 0;i < m; i++){ Answer(ans[i]); } }

컴파일 시 표준 에러 (stderr) 메시지

dango3.cpp: In function 'void Solve(int, int)':
dango3.cpp:25:17: warning: comparison of integer expressions of different signedness: 'std::vector<std::vector<int> >::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   25 |   if(ans.size() != n) 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...