Submission #1067296

#	Time	Username	Problem	Language	Result	Execution time	Memory
1067296		j_vdd16	Rarest Insects (IOI22_insects)	C++17	10 / 100	249 ms	344 KiB

insects

#include "insects.h"

#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

//#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;

int min_cardinality(int N) {
    int idx = 0;
    vb isDone(N);

    int prevNewTypes = 0;
    for (;; idx++) {
        vb isNewType(N);

        int newTypes = 0;
        loop(i, N) {
            if(isDone[i]) 
                continue;

            move_inside(i);
            
            int res = press_button();
            if (res < 2) {
                newTypes++;
                isNewType[i] = true;
                isDone[i] = true;
            }
            else {
                move_outside(i);
            }
        }

        if (newTypes < prevNewTypes) {
            break;
        }
        prevNewTypes = newTypes;

        loop(i, N) {
            if(isNewType[i])
                move_outside(i);
        }
    }

    return idx;
}

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