제출 #628937

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
628937		dqhungdl	드문 곤충 (IOI22_insects)	C++17	53.11 / 100	165 ms	404 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

int diff = 0;
vector<bool> mark;

void countDiff(int N) {
    for (int i = 0; i < N; i++) {
        move_inside(i);
        if (press_button() == 1) {
            diff++;
            mark[i] = true;
        } else
            move_outside(i);
    }
}

bool check(int lim, int N) {
    if (press_button() > lim) {
        for (int i = 0; i < N; i++)
            if (mark[i]) {
                mark[i] = false;
                move_outside(i);
            }
    }
    int cnt = accumulate(mark.begin(), mark.end(), 0);
    for (int i = 0; i < N; i++)
        if (!mark[i]) {
            move_inside(i);
            if (press_button() > lim)
                move_outside(i);
            else {
                cnt++;
                mark[i] = true;
                if (cnt == lim * diff)
                    break;
            }
        }
    return cnt < lim * diff;
}

int min_cardinality(int N) {
    mark.resize(N);
    countDiff(N);
    int l = 2, r = N / diff, rs = 1;
    double scale = (double) diff / N * 2 + 2;
    while (l <= r) {
        int mid = l + (r - l) / scale;
        if (check(mid, N))
            r = mid - 1;
        else {
            rs = mid;
            l = mid + 1;
        }
    }
    return rs;
}

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