제출 #708762

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
708762		t6twotwo	드문 곤충 (IOI22_insects)	C++17	0 / 100	369 ms	208 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int min_cardinality(int n) {
    vector<bool> in(n);
    for (int i = 0; i < n; i++) {
        move_inside(i);
        if (press_button() == 2) move_outside(i);
        else in[i] = 1;
    }
    int type = 0;
    for (int i = 0; i < n; i++) {
        if (in[i]) {
            type++;
            in[i] = 0;
            move_outside(i);
        }
    }
    vector<bool> blocked(n);
    int lo = 1, hi = n / type, add = 0;
    while (lo < hi) {
        int x = (lo + hi + 1) / 2, cnt = add * type; 
        for (int i = 0; i < n; i++) {
            if (blocked[i]) continue;
            move_inside(i);
            if (press_button() == add * type + x + 1) move_outside(i);
            else in[i] = 1, cnt++;
        }
        for (int i = 0; i < n; i++) {
            if (in[i]) {
                if (cnt == x * type) {
                    blocked[i] = 1;
                    continue;
                }
                in[i] = 0;
                move_outside(i);
            } else if (cnt != x * type) {
                blocked[i] = 1;
            }
        }
        if (cnt == (add + x) * type) lo = 0, hi -= x, add += x;
        else hi = cnt / type;
    }
    return lo + add;
}

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