Submission #631056

#TimeUsernameProblemLanguageResultExecution timeMemory
631056garam1732Rarest Insects (IOI22_insects)C++17
0 / 100
64 ms476 KiB
#include "insects.h" #include <iostream> #include <vector> #include <stack> #include <set> #include <algorithm> #define ff first #define ss second using namespace std; typedef pair<int, int> pi; //vector<int> ans; //stack<pi> S, v; vector<int> v, w, u[2020]; set<int> s; int min_cardinality(int N) { int num = 0; for(int i = 0; i < N; i++) { move_inside(i); num++; if(press_button() > 1) { move_outside(i); num--; s.insert(i); } } //cout<<num<<endl; int sum = num; int lb = 1, ub = N, mid; while(lb < ub) { for(int i : s) { move_inside(i); u[press_button()].push_back(i); sum++; } while(lb < ub) { mid = lb+ub+1>>1; // for(int i = lb; i <= ub+1; i++) { // cout<<i<<" : "; // for(int t:u[i])cout<<t<<" "; // cout<<endl; // } // cout<<endl; for(int i = ub+1; i > mid; i--) { for(int t : u[i]) { move_outside(t); sum--; } } for(int i = mid+1; i <= ub+1; i++) { for(int t : u[i]) { move_inside(t); if(press_button() > mid) { move_outside(t); w.push_back(t); } else { sum++; u[mid].push_back(t); } } } if(sum == mid*num) { for(int i = lb+1; i <= mid; i++) for(int t : u[i]) s.erase(t); for(int i = lb+1; i <= ub+1; i++) u[i].clear(); lb = mid; break; } else { for(int t : w) s.erase(t); // for(int t : u[mid]) move_outside(t); // sum -= u[mid].size(); for(int i = mid+1; i <= ub+1; i++) u[i].clear(); w.clear(); ub = mid-1; } } } return lb; }

Compilation message (stderr)

insects.cpp: In function 'int min_cardinality(int)':
insects.cpp:40:24: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |             mid = lb+ub+1>>1;
      |                   ~~~~~^~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...