제출 #628847

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628847		phathnv	드문 곤충 (IOI22_insects)	C++17	99.80 / 100	85 ms	436 KiB

insects

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

using namespace std;

const int MAX_N = 2000;

bool isIn[MAX_N], nxt[MAX_N];
map<vector<int>, int> his;

int ask(const vector<int> &a) {
//    if (his.count(a)) {
//        return his[a];
//    }

    for (int i = 0; i < MAX_N; ++i) {
        nxt[i] = 0;
    }
    for (auto x : a) {
        nxt[x] = 1;
    }
    for (int i = 0; i < MAX_N; ++i) {
        if (isIn[i] > nxt[i]) {
            move_outside(i);
        }
        if (isIn[i] < nxt[i]) {
            move_inside(i);
        }
        isIn[i] = nxt[i];
    }
    //return his[a] = press_button();
    return press_button();
}

int min_cardinality(int n) {
    vector<int> a(n);
    iota(a.begin(), a.end(), 0);

    vector<int> nxt, inside;
    for (auto x : a) {
        inside.push_back(x);
        if (ask(inside) > 1) {
            inside.pop_back();
            nxt.push_back(x);
        }
    }
    int numDistinct = inside.size();
    int res = 1;
    a = nxt;

    srand(123);
    int l = 1, r = (int) a.size() / numDistinct;
    while (l <= r) {
        int mid = (l + r + rand() % 2) >> 1;

        vector<int> outside;
        inside.clear();
        for (auto x : a) {
            inside.push_back(x);
//            if ((int)inside.size() <= mid) {
//                continue;
//            }
            if (ask(inside) > mid) {
                inside.pop_back();
                outside.push_back(x);
            }
        }
        if ((int)inside.size() == numDistinct * mid) {
            res += mid;
            a = outside;
            l = 1;
            r = (int)a.size() / numDistinct;
            //allIn = false;
            //cerr << "to r" << endl;
        } else {
            a = inside;
            l = max(1, (int)a.size() - mid * (numDistinct - 1));
            r = (int)a.size() / numDistinct;
            //allIn = true;
            //cerr << "to l" << endl;
        }
    }

    return res;
}

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