Submission #708748

#TimeUsernameProblemLanguageResultExecution timeMemory
708748t6twotwo드문 곤충 (IOI22_insects)C++17
47.50 / 100
177 ms508 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;
    for (int i = 0; i < n; i++) {
        if (in[i]) {
            type++;
            in[i] = 0;
            move_outside(i);
        }
    }
    vector<bool> bad(n);
    int lo = 1, hi = n / type;
    while (lo < hi) {
        int x = (lo + hi + 1) / 2, cnt = 0; 
        for (int i = 0; i < n; i++) {
            if (bad[i]) continue;
            move_inside(i);
            if (press_button() == x + 1) move_outside(i);
            else in[i] = 1, cnt++;
        }
        for (int i = 0; i < n; i++) {
            if (in[i]) {
                in[i] = 0;
                move_outside(i);
            } else if (cnt != x * type) {
                bad[i] = 1;
            }
        }
        if (cnt == x * type) lo = x;
        else hi = min(cnt / type, x - 1);
    }
    return lo;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...