제출 #628855

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628855		I_love_Hoang_Yen	드문 곤충 (IOI22_insects)	C++17	99.91 / 100	84 ms	1200 KiB

insects

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

#define SZ(s) ((int) s.size())
using namespace std;

#ifndef RR
#define DEBUG(X)
#endif

mt19937_64 rng(58);
int min_cardinality(int n) {
    std::set<int> insides;  // set of insects inside machine

    std::vector<int> order(n);
    std::iota(order.begin(), order.end(), 0);
    shuffle(order.begin(), order.end(), rng);

    // lambda functions {{{
    // lambda function to add one insect to machine
    auto add = [&] (int i) { move_inside(order[i]); insides.insert(i); };
    // lambda function to remove one insect from machine
    auto remove = [&] (int i) { move_outside(order[i]); insides.erase(i); };
    // }}}

    // machine_states(f) = set of insects inside machine after we
    //                     binary search with value f
    std::map<int, std::set<int>> machine_states;

    // Step 1: Find set containing unique insects {{{
    for (int i = 0; i < n; ++i) {
        add(i);
        if (press_button() > 1) {  // this species appeared before
            remove(i);
        }
    }
    int unique_vals = SZ(insides);
    DEBUG(unique_vals);
    // }}}

    machine_states[1] = insides;
    machine_states[n] = std::set<int>();
    for (int i = 0; i < n; ++i) if (!insides.count(i)) machine_states[n].insert(i);

    // Step 2: Binary search for min f
    int l = 1, r = n / unique_vals, res = 1;
    while (l <= r) {
        int mid = (l + r + 1) / 2;
        if (mid == res) break;

        auto it = machine_states.lower_bound(mid);
        std::set<int> just_added;
        for (int i : it->second) if (!insides.count(i)) {
            add(i);
            if (press_button() > mid) remove(i);
            else just_added.insert(i);
        }
        int total = SZ(insides);
        machine_states[mid] = insides;

        if (total >= unique_vals * mid) {
            res = mid;
            l = mid + 1;
        } else {
            r = mid - 1;
            for (int i : just_added) {
                remove(i);
            }
        }
    }
    return res;
}

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