제출 #1057792

#제출 시각아이디문제언어결과실행 시간메모리
1057792fuad27드문 곤충 (IOI22_insects)C++17
0 / 100
109 ms1644 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; int min_cardinality(int N) { int distcnt = 0; set<int> idxs; for(int i = 0;i<N;i++) { move_inside(i); if(press_button() <= 1){ idxs.insert(i); distcnt++; continue; } move_outside(i); } set<int> all_idxs[N+1]; all_idxs[1] = idxs; int ans=1; int prev = 1; int lo = 2, hi = N/distcnt; while(lo <= hi) { int mid = (lo+hi)/2; if(prev < mid) { for(int j = 0;j<N;j++) { if(idxs.find(j)!=idxs.end())continue; move_inside(j); if(press_button() <= mid) { idxs.insert(j); continue; } move_outside(j); } } else { int cur = 1; for(int j = 1;j<mid;j++) { if(all_idxs[j].size() > all_idxs[cur].size()) { cur=j; } } vector<int> er; for(int j:idxs) { if(all_idxs[cur].find(j)==all_idxs[cur].end()) { er.push_back(j); } } for(int j:er)idxs.erase(j); for(int j = 0;j<N;j++) { if(idxs.find(j)!=idxs.end())continue; move_inside(j); if(press_button() <= mid) { idxs.insert(j); continue; } move_outside(j); } } if(idxs.size() == distcnt*mid) { lo = mid+1; ans=mid; } else { hi=mid-1; } all_idxs[mid] = idxs; prev=mid; } return ans; }

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

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:58:18: warning: comparison of integer expressions of different signedness: 'std::set<int>::size_type' {aka 'long unsigned int'} and 'int' [-Wsign-compare]
   58 |   if(idxs.size() == distcnt*mid) {
      |      ~~~~~~~~~~~~^~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...