제출 #796340

#제출 시각아이디문제언어결과실행 시간메모리
796340ln_e드문 곤충 (IOI22_insects)C++17
10 / 100
190 ms328 KiB
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho #include "insects.h" using ll=long long; using ld=long double; int const INF=1000000005; ll const LINF=1000000000000000005; ll const mod=1000000007; ld const PI=3.14159265359; ll const MAX_N=3e5+5; ld const EPS=0.00000001; #pragma GCC optimize("O3") #pragma GCC optimize("Ofast") #define f first #define s second #define pb push_back #define mp make_pair #define endl '\n' #define sz(a) (int)a.size() #define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0); using namespace std; int cnt[2005]; int min_cardinality(int N) { vector<ll>v; v.pb(0); move_inside(0); cnt[0]=1; for(ll i=1;i<N;i++){ move_inside(i); ll x=press_button(); if(x>1){ for(auto it : v){ move_outside(it); } ll check=0; for(auto it : v){ move_inside(it); if(check==0){ ll x=press_button(); if(x>=2&&check==0){ cnt[it]++; check=1; } } } move_outside(i); }else { v.pb(i); cnt[i]=1; } } int ans=INF; for(auto it : v){ //cout<<it<<' '<<cnt[it]<<endl; ans=min(ans,cnt[it]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...