제출 #725628

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
725628		aykhn	드문 곤충 (IOI22_insects)	C++17	47.50 / 100	311 ms	468 KiB

insects

#include <bits/stdc++.h>
#include "insects.h"

using namespace std;

typedef long long ll;

#define OPT ios_base::sync_with_stdio(0); \
            cin.tie(0); \
            cout.tie(0)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define all(v) v.begin(), v.end()
#define mpr make_pair
#define pb push_back
#define ts to_string
#define fi first
#define se second
#define inf 0x3F3F3F3F
#define infll 0x3F3F3F3F3F3F3F3FLL
#define bpc __builtin_popcount
#define print(v) for(int i = 0; i < v.size(); i++) cout << v[i] << " "; cout<<endl;

int min_cardinality(int n)
{
    int l = 1;
    int r = n;

    int sz = 0;

    vector<bool> mark(n, 0);

    for (int i = 0; i < n; i++)
    {
        move_inside(i);
        int x = press_button();
        if (x > 1) move_outside(i);
        else
        {
            sz++;
            mark[i] = true;
        }
    }

    for (int i = 0; i < n; i++)
    {
        if (mark[i]) move_outside(i);
        mark[i] = false;
    }

    int best = 1;
    int rn = 0;

    while (l <= r)
    {
        int mid = (l + r) >> 1;

        for (int i = 0; i < n; i++)
        {
            if (mark[i]) continue;
            move_inside(i);
            int x = press_button();
            if (x > mid) move_outside(i);
            else
            {
                rn++;
                mark[i] = true;
            }
        }

        if (rn == mid * sz)
        {
            best = max(best, mid);
            l = mid + 1;
        }
        else
        {
            r = mid - 1;
            rn = 0;
            for (int i = 0; i < n; i++)
            {
                if (!mark[i]) continue;
                move_outside(i);
                mark[i] = false;
            }
        }
    }

    return best;
}

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