제출 #819374

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
819374		andrei_boaca	드문 곤충 (IOI22_insects)	C++17	96.37 / 100	66 ms	416 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
//#include "stub.cpp"
using namespace std;
int cul[2005];
int n;
vector<int> spec;
struct date
{
    int nod,l,r;
};
vector<date> need;
bool comp(date a, date b)
{
    return a.l<b.l;
}
bool use[2005];
int f[2005];
int min_cardinality(int N)
{
    n=N;
    cul[0]=1;
    spec.push_back(0);
    move_inside(0);
    int nr=1;
    for(int i=1;i<n;i++)
    {
        move_inside(i);
        int cnt=press_button();
        if(cnt>=2)
            move_outside(i);
        else
        {
            nr++;
            cul[i]=nr;
            spec.push_back(i);
        }
    }
    int D=nr;
    int B=n/D;
    int loga=0;
    for(int i=0;i<20;i++)
        if((1<<i)<=B)
            loga=i;
    int I=0;
    int b=0;
    vector<int> v;
    for(int i=0;i<n;i++)
        v.push_back(i);
    random_shuffle(v.begin(),v.end());
    for(int i=loga;i>=0;i--)
    {
        b+=(1<<i);
        vector<int> added;
        for(int j:v)
            if(!use[j])
            {
                use[j]=1;
                I++;
                move_inside(j);
                added.push_back(j);
                if(press_button()>b)
                {
                    added.pop_back();
                    move_outside(j);
                    use[j]=0;
                    I--;
                }
                if(I==b*D)
                    break;
            }
        if(I<b*D)
        {
            b-=(1<<i);
            for(int j=0;j<n;j++)
                if(!use[j])
                    use[j]=1;
            for(int j:added)
            {
                use[j]=0;
                move_outside(j);
                I--;
            }
        }
    }
    return b;
}

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