제출 #796217

#제출 시각아이디문제언어결과실행 시간메모리
796217ln_eRarest Insects (IOI22_insects)C++17
10 / 100
256 ms400 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 min_cardinality(int N) { vector<ll>v; set<ll>s; for(ll i=0;i<N;i++) { s.insert(i); } vector<int>ans; for(ll i=0;i<N;i++){ if(s.find(i)==s.end()){ continue; } vector<ll>remove; move_inside(i); remove.pb(i); ll res=1; for(auto it : s){ if(it==i){ continue; } move_inside(it); ll x=press_button(); if(x==2){ res++; remove.pb(it); } move_outside(it); } ans.pb(res); for(auto it : remove){ s.erase(s.find(it)); } } sort(ans.begin(),ans.end()); return ans[0]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...