Submission #826235

#	Time	Username	Problem	Language	Result	Execution time	Memory
826235		PixelCat	드문 곤충 (IOI22_insects)	C++17	100 / 100	50 ms	440 KiB

insects

#include "insects.h"

#ifdef NYAOWO
#include "stub.cpp"
#endif

#include <bits/stdc++.h>
#define For(i, a, b) for(int i = a; i <= b; i++)
#define Forr(i, a, b) for(int i = a; i >= b; i--)
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define eb emplace_back
// #define int LL
using namespace std;
using i32 = int32_t;
using LL = long long;
using pii = pair<int, int>;

int find_types(vector<int> &sus) {
    vector<int> rep;
    vector<int> uwu;
    for(auto &i:sus) {
        move_inside(i);
        if(press_button() == 1) {
            rep.eb(i);
        } else {
            move_outside(i);
            uwu.eb(i);
        }
    }
    sus = uwu;
    // for(auto &i:rep) move_outside(i);
    return sz(rep);
}

// # of all types >= k ?
bool check(int k, int m, vector<int> &sus, int good) {
    if(sz(sus) < k * m) return false;
    // for(auto &i:sus) cerr << i << " ";
    vector<int> owo;
    vector<int> uwu;
    bool broken = false;
    for(auto &i:sus) {
        if(broken) {
            uwu.eb(i);
            continue;
        }
        move_inside(i);
        if(press_button() > k + good) {
            uwu.eb(i);
            move_outside(i);
        } else {
            owo.eb(i);
        }
        if(sz(owo) == m * k) broken = true;
    }
    // cerr << " - " << k << " " << sz(owo) + good << " " << (m * k == sz(owo) + good) << "\n";
    if(m * k == sz(owo)) {
        sus = uwu;
        return true;
    }
    sus = owo;
    for(auto &i:owo) move_outside(i);
    return false;
}

int min_cardinality(int n) {

    vector<int> sus;
    For(i, 0, n - 1) sus.eb(i);
    random_shuffle(all(sus));

    int m = find_types(sus);
    cerr << m << "\n";

    int hi = n / m + 1, lo = 1;
    while(hi - lo > 1) {
        int mi = (hi - lo) / 2;
        if(check(mi, m, sus, lo)) lo += mi;
        else hi = lo + mi;
    }
    return lo;
}

/*

6
5 8 9 5 9 9

1
7

*/

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