Submission #708782

#TimeUsernameProblemLanguageResultExecution timeMemory
708782t6twotwoRarest Insects (IOI22_insects)C++17
0 / 100
52 ms208 KiB
#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;
    vector<bool> blocked(n);
    for (int i = 0; i < n; i++) {
        if (in[i]) {
            type++;
            blocked[i] = 1;
        }
    }
    int lo = 1, hi = n / type, cnt = type;
    while (lo < hi) {
        int x = (lo + hi + 1) / 2; 
        for (int i = 0; i < n; i++) {
            if (blocked[i]) continue;
            move_inside(i);
            // if (cnt == x * type) continue;
            if (press_button() == x + 1) move_outside(i);
            else in[i] = 1, cnt++;
        }
        for (int i = 0; i < n; i++) {
            if (blocked[i]) continue;
            if (in[i]) {
                if (cnt == x * type) {
                    blocked[i] = 1;
                } else {
                    in[i] = 0;
                    cnt--;
                    move_outside(i);
                }
            } else if (cnt != x * type) {
                blocked[i] = 1;
            }
        }
        if (cnt == x * type) lo = x;
        else hi = cnt / type;
    }
    return lo;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...