제출 #1281164

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1281164		Faggi	드문 곤충 (IOI22_insects)	C++20	99.89 / 100	513 ms	2532 KiB

insects

#include <bits/stdc++.h>
#define ll long long
#define sz(x) int(x.size())
#define forn(i, n) for (i = 0; i < n; i++)
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define fr first
#define se second
using namespace std;

void move_inside(int i);
void move_outside(int i);
int press_button();

vector<bool> vis, en;
map<vector<bool>, ll> memo;

void mi(ll x)
{
    en[x] = 1;
}

void mo(ll x)
{
    en[x] = 0;
}

ll pBtn()
{
    for (ll i = 0; i < sz(en); i++)
    {
        if (vis[i] != en[i])
        {
            if (vis[i])
                move_outside(i);
            else
                move_inside(i);
            vis[i] = en[i];
        }
    }
    if (memo.find(vis) != memo.end())
        return memo[vis];
    ll x = press_button();
    memo[vis] = x;
    return x;
}

int min_cardinality(int N)
{
    ll i, act = 0, n = N;
    vis.resize(N, 0);
    en.resize(N, 0);
    vector<ll> in, out, ins;
    for (i = 0; i < n; i++)
        ins.pb(i);
    for (auto k : ins)
    {
        mi(k);
        if (pBtn() > 1)
        {
            mo(k);
            out.pb(k);
        }
        else
        {
            in.pb(k);
            act++;
        }
    }
    ll l = 2, r = n / act, piv, pos = 1, tot = act;
    ins = out;
    while (l <= r)
    {
        piv = (l + r) / 2;

        in.resize(0);
        out.resize(0);
        for (auto k : ins)
        {
            mi(k);
            if (pBtn() > piv)
            {
                mo(k);
                out.pb(k);
            }
            else
            {
                in.pb(k);
                act++;
            }
        }

        if (act == tot * piv)
        {
            l = piv + 1;
            pos = piv;
            ins = out;
        }
        else
        {
            r = piv - 1;
            for (auto k : in)
            {
                mo(k);
                act--;
            }
            ins = in;
        }
    }

    return int(pos);
}

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