Submission #1359419

#TimeUsernameProblemLanguageResultExecution timeMemory
1359419opeleklanos드문 곤충 (IOI22_insects)C++20
10 / 100
73 ms344 KiB
#include <iostream>
#include <vector>
using namespace std;

#include "insects.h"

int min_cardinality(int n){
    vector<int> types(n, -1);

    int count = 0;

    int ans = n;
    while(true){
        int startInd = 0;
        while(types[startInd] != -1 && startInd<n) startInd++;
        if(startInd>=n) break;
        types[startInd] = count;
        move_inside(startInd);
        int found = 1;
        for(int i = startInd+1; i<n; i++){
            if(types[i] != -1) continue;
            move_inside(i);
            if(press_button() == 2){
                types[i] = count;
                found++;
            }
            move_outside(i);
        }
        ans = min(ans, found);
    }

    return ans;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...