제출 #1024460

#제출 시각아이디문제언어결과실행 시간메모리
1024460vjudge1Rarest Insects (IOI22_insects)C++17
10 / 100
276 ms600 KiB
#include <bits/stdc++.h>
#define ent '\n'

void move_inside(int i);
void move_outside(int i);
int press_button();

using namespace std;
typedef long long ll;
const int maxn = 1e5 + 12;

struct Q{
    int mid, l, r, i;
};

int cnt[maxn];
bool is[maxn];
int p[maxn];

int min_cardinality(int n){
    int ans = 1e9;
    for(int i=0;i<n;i++){
        if(is[i]) continue;
        vector<int> v = {i};
        move_inside(i);
        int val = 1;
        for(int j=i+1;j<n;j++){
            move_inside(j);
            if(press_button() == val){
                move_outside(j);
                continue;
            }
            is[j] = 1;
            v.push_back(j);
            val++;
        }
        ans = min(ans, val);
        while(v.size()){
            move_outside(v.back());
            v.pop_back();
        }
    }
    return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...