# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796355 | ln_e | Rarest Insects (IOI22_insects) | C++17 | 210 ms | 440 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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=0,n;
ll check(ll mx){
vector<ll>v;
for(ll i=0;i<n;i++){
move_inside(i);
ll x=press_button();
if(x>mx){
move_outside(i);
}else {
v.pb(i);
}
}
for(auto it : v){
move_outside(it);
}
if(v.size()==cnt*mx){
return 0;
}else return 1;
}
int min_cardinality(int N) {
vector<ll>v;
v.pb(0);
n=N;
move_inside(0);
cnt=1;
for(ll i=1;i<N;i++){
move_inside(i);
ll x=press_button();
if(x>1){
move_outside(i);
}else {
v.pb(i);
cnt++;
}
}
for(auto it : v){
move_outside(it);
}
ll l=1,r=N,ans=0;
while(l<=r){
ll mid=(l+r)/2;
if(check(mid)==0){
ans=mid;
l=mid+1;
}else r=mid-1;
}
return ans;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |