제출 #787853

#제출 시각아이디문제언어결과실행 시간메모리
787853Andrey드문 곤충 (IOI22_insects)C++17
0 / 100
46 ms308 KiB
#include "insects.h" #include<bits/stdc++.h> using namespace std; int n,p = 0,l,r,x = 1; vector<bool> idk(10000,true); vector<bool> no(10000,true); void check(int a) { vector<bool> bruh(n,true); vector<int> wut(0); vector<int> yay(0); int br = x*p; for(int i = 0; i < n && br < p*a; i++) { if(idk[i] && no[i]) { move_inside(i); if(press_button() > a) { bruh[i] = false; yay.push_back(i); move_outside(i); } else { br++; wut.push_back(i); } } } if(br == p*a) { l = a+1; for(int i = 0; i < wut.size(); i++) { idk[wut[i]] = false; } x = a; return; } else { r = a-((p*a-br)/p); l = br/p+1; if(l == r) { return; } for(int i = 0; i < n; i++) { if(bruh[i] && idk[i] && no[i]) { move_outside(i); } } for(int i = 0; i < yay.size(); i++) { no[yay[i]] = false; } return; } } int min_cardinality(int N) { n = N; int m; l = 1; vector<bool> bruh(n,true); vector<int> yay(0); for(int i = 0; i < n; i++) { move_inside(i); if(press_button() > 1) { move_outside(i); bruh[i] = false; } else { p++; yay.push_back(i); } } for(int i = 0; i < p; i++) { idk[yay[i]] = false; } r = n/p+1; if(p == 1) { return n; } while(l < r) { m = (l+r)/2; check(m); } return l-1; }

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

insects.cpp: In function 'void check(int)':
insects.cpp:30:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |         for(int i = 0; i < wut.size(); i++) {
      |                        ~~^~~~~~~~~~~~
insects.cpp:47:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |         for(int i = 0; i < yay.size(); i++) {
      |                        ~~^~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...