Submission #628667

#	Time	Username	Problem	Language	Result	Execution time	Memory
628667		whynotshadow	Rarest Insects (IOI22_insects)	C++17	47.50 / 100	231 ms	536 KiB

insects

#include "insects.h"

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,tune=native")

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef long long LL;
typedef long double ld;

#define el "\n"
#define se " "
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(), x.end()
#define mkp make_pair
#define srt(x,y) sort(x+1,x+1+y)
#define srtt(x,y,cmp) sort(x+1,x+1+y,cmp)
#define rev(x,y) reverse(x+1,x+1+y)
#define revv(x,y,cmp) reverse(x+1,x+1+y,cmp)
#define print(x) for (auto it : x) cout<<it<<se
#define ordered_set tree<ll, null_type,less_equal<ll>, rb_tree_tag,tree_order_statistics_node_update>

const ll NN=2000+9;
const ll NNN=109;
const ll INF=1e9;
const ld PI=3.141592653589793238462643;
const ll MOD=1e9+7;

ll zero=0;
ll a,b,c,d,a1,b1,c1,val,i,sum1,j,n,m,pos,ans,sum,cur,res,ans1,res1;
ll k,kk,kkk,cnt,cnt1,l,r,x,y,mn,t,fl,q;
bool used[2009];
ll signn[2009];
deque<ll>dek;
int min_cardinality(int N) {
    ll ans=N;
    for(ll i=0;i<N;i++){
       move_inside(i),dek.pb(i);

       if(press_button()>1){
           ans--;
           move_outside(i),dek.pop_back();
       }
    }
    while(!dek.empty()){
//        cout<<dek.front()<<se;
        move_outside(dek.front()),dek.pop_front();
    }
//    cout<<"SDS "<<dek.size()<<el;
    if(ans==N || N/ans<=1) return 1;
    ll l=2,r=N/ans;
    ll cur=1;
    while(r-l>=0){
        ll mid=(l+r)>>1;
        ll povt=0;
        memset(used,0,sizeof used);
        for(ll i=0;i<N;i++){
            if(signn[i]==1){
                povt++;
                continue;
            }
            move_inside(i),dek.pb(i);
            if(press_button()>mid) move_outside(i),povt++,dek.pop_back(),used[i]=1;
        }
//        cout<<dek.size()<<" DEK\n";
        if(ans*mid==N-povt){
            cur=mid,l=mid+1;
        }
        else{
            for(ll i=0;i<N;i++){
                if(used[i]==1) signn[i]=1;
            }
            r=mid-1;
        }
        while(!dek.empty()){
            move_outside(dek.front()),dek.pop_front();
        }
    }
    return cur;
}

• Subtask 1: 10 / 10
• Subtask 2: 15 / 15
• Subtask 3: 22.5 / 75