Submission #836203

#	Time	Username	Problem	Language	Result	Execution time	Memory
836203		ALeonidou	Rarest Insects (IOI22_insects)	C++17	10 / 100	265 ms	208 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>

using namespace std;
#define ll int
#define sz(x) (ll)x.size()
#define F first
#define S second
#define MID ((l+r)/2)
#define pb push_back
#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;
#define dbg4(x,y,z,w) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<endl;
#define dbg5(x,y,z,w,q) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<" "<<#w<<": "<<w<<" "<<#q<<": "<<q<<endl;


typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;
#define MOD 1000002022
#define inf 1e9

int min_cardinality(int N){
    ll n = N;
    vi vis(n, 0);

    int ans =inf;
    for (ll i =0; i<n; i++){
        if (!vis[i]){
            ll c = 1;

            vis[i] = 1;
            move_inside(i);
            for (ll j=i+1; j<n; j++){
                move_inside(j);
                ll val = press_button();
                if (val == 2){
                    c++;
                    vis[j] = 1;
                }
                move_outside(j);
            }
            move_outside(i);

            ans = min(ans, c);
        }
    }
    return ans;
}

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