제출 #977465

#제출 시각아이디문제언어결과실행 시간메모리
977465SiliconSquaredRarest Insects (IOI22_insects)C++17
0 / 100
190 ms588 KiB
#include "insects.h" using namespace std; #include <vector> int min_cardinality(int N) { int a,b,c,q; vector<bool> g; vector<bool> h; bool f; g.resize(N,false); h.resize(N); for (int i=0;i<N;i++){ move_inside(i); } b=press_button(); for (int i=0;i<N;i++){ move_outside(i); } a=1; while (a!=b){ c=(a+b)/2; for (int i=0;i<N;i++){h[i]=false;} for (int i=0;i<N;i++){ if (!g[i]){ move_inside(i); q=press_button(); if (q>c){ move_outside(i); h[i]=true; } } } for (int i=0;i<N;i++){ if (!g[i]){ if (h[i]){ move_inside(i); if (press_button()==2){ move_outside(i); } }else{ move_outside(i); } } } f=true; for (int i=0;i<N;i++){ if ((!g[i])&&(!h[i])){ move_inside(i); if (press_button()==2){ h[i]=true; }else{ f=false; } move_outside(i); } } if (f){ //all bugs eliminated a=c+1; }else{ //some bugs remain b=c; for (int i=0;i<N;i++){ if (h[i]){ g[i]=true; } } } } return a; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...