제출 #627433

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
627433		Carmel_Ab1	드문 곤충 (IOI22_insects)	C++17	10 / 100	275 ms	288 KiB

insects

/*
#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("unroll-loops")
 */
#include<bits/stdc++.h>
#include "insects.h"
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int>vi;
typedef vector<vector<int>>vvi;
typedef vector<ll>vl;
typedef vector<vl> vvl;
typedef pair<int,int>pi;
typedef pair<ll,ll> pl;
typedef vector<pl> vpl;
typedef vector<ld> vld;
typedef pair<ld,ld> pld;
typedef vector<pi> vpi;

//typedef tree<ll, null_type, less_equal<ll>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
template<typename T> ostream& operator<<(ostream& os, vector<T>& a){os<<"[";for(int i=0; i<ll(a.size()); i++){os << a[i] << ((i!=ll(a.size()-1)?" ":""));}os << "]\n"; return os;}

#define all(x) x.begin(),x.end()
#define YES out("YES")
#define NO out("NO")
#define out(x){cout << x << "\n"; return;}
#define outfl(x){cout << x << endl;return;}
#define GLHF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define print(x){for(auto ait:x) cout << ait << " "; cout << "\n";}
#define pb push_back
#define umap unordered_map

int min_cardinality(int n){
    vi color(n,-1);

    int c=0;

    while(count(all(color),-1)){
        int cur=0;
        for(int i=0; i<n; i++)
            if(color[i]==-1){
                move_inside(i);
                if(press_button()==cur+1)
                    cur++,color[i]=c;
                else
                    move_outside(i);
            }
        for(int i=0; i<n;i ++)
            if(color[i]==c)
                move_outside(i);
        c++;
    }

    vi cnt(n);
    for(int i=0; i<n; i++)
        cnt[color[i]]++;
    int ans=1e9;
    for(int i=0; i<n;i ++)
        if(cnt[i])
            ans=min(ans,cnt[i]);
    return ans;
}

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