Submission #1059504

#TimeUsernameProblemLanguageResultExecution timeMemory
1059504shiomusubi496Rarest Insects (IOI22_insects)C++17
47.50 / 100
169 ms900 KiB
#include "insects.h"
#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (int)(n); ++i)
#define rep2(i, a, b) for (int i = (int)(a); i < (int)(b); ++i)
#define rrep(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define rrep2(i, a, b) for (int i = (int)(b) - 1; i >= (int)(a); --i)

#define all(v) begin(v), end(v)
#define rall(v) rbegin(v), rend(v)

using namespace std;

using ll = long long;

template<class T, class U> bool chmin(T& a, const U& b) { return a > b ? a = b, true : false; }
template<class T, class U> bool chmax(T& a, const U& b) { return a < b ? a = b, true : false; }

int min_cardinality(int N) {
    int nk = 0;
    {
        vector<bool> used(N);
        rep (i, N) {
            move_inside(i);
            if (press_button() == 2) move_outside(i);
            else ++nk, used[i] = true;
        }
        rep (i, N) {
            if (used[i]) move_outside(i);
        }
    }
    int ok = 1, ng = N / nk + 1;
    while (ng - ok > 1) {
        int mid = (ok + ng) / 2;
        vector<bool> used(N);
        int cnt = 0;
        rep (i, N) {
            move_inside(i);
            if (press_button() > mid) move_outside(i);
            else cnt++, used[i] = true;
        }
        rep (i, N) {
            if (used[i]) move_outside(i);
        }
        if (cnt == nk * mid) ok = mid;
        else ng = mid;
    }
    return ok;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...