Submission #859050

#	Time	Username	Problem	Language	Result	Execution time	Memory
859050		thinknoexit	Rarest Insects (IOI22_insects)	C++17	38.31 / 100	192 ms	856 KiB

insects

#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
using ll = long long;
int in[2020];
int min_cardinality(int n) {
    int type = 0;
    for (int i = 0;i < n;i++) {
        move_inside(i);
        if (press_button() == 2) {
            move_outside(i);
        }
        else in[i] = 1, type++;
    }
    if (type == 1) return n;
    if (type == n) return 1;
    if (type > n / 2) return 1;
    int mxans = n / type;
    int sq = sqrt(n);
    int now = 1;
    while (now + sq <= mxans) {
        now += sq;
        int cnt = 0;
        for (int i = 0;i < n;i++) {
            if (in[i]) continue;
            move_inside(i);
            if (press_button() > now) {
                move_outside(i);
            }
            else in[i] = now, cnt++;
        }
        if (cnt < type * sq) {
            for (int i = 0;i < n;i++) {
                if (in[i] == now) move_outside(i), in[i] = 0;
            }
            now -= sq;
            while (1) {
                now++;
                int cnt = 0;
                for (int i = 0;i < n;i++) {
                    if (in[i]) continue;
                    move_inside(i);
                    if (press_button() > now) {
                        move_outside(i);
                    }
                    else in[i] = now, cnt++;
                }
                if (cnt != type) return now - 1;
            }
        }
    }
    while (now <= mxans) {
        now++;
        int cnt = 0;
        for (int i = 0;i < n;i++) {
            if (in[i]) continue;
            move_inside(i);
            if (press_button() > now) {
                move_outside(i);
            }
            else in[i] = now, cnt++;
        }
        if (cnt != type) return now - 1;
    }
    // n , n , n
    /*
        ans <= n / type
        ans <= n - mx
    */
    return -1;
}

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