제출 #807218

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807218		YassirSalama	드문 곤충 (IOI22_insects)	C++17	0 / 100	1 ms	976 KiB

insects

#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define OVL(v,s) for(auto x:v) cout<<x<<s;cout<<endl;
#define all(v) v.begin(),v.end()
#define F first
#define S second
#define pb push_back
void dbg_out() { cout << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cout << ' ' << H; dbg_out(T...); }
#define dbg(...) cout << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__);
#define endl "\n"
#define mod 1000000007
const ll INF=1e18;
const int MAXN=1e5+100;
int par[MAXN];
int sz[MAXN];
void make_set(){
    for(int i=0;i<MAXN;i++) par[i]=i,sz[i]=1;
}
int find(int node){
    if(node==par[node]) return node;
    return par[node]=find(par[node]);
}
int min_cardinality(int N) {
    make_set();
    for(int i=0;i<N;i++){
        for(int j=0;j<N;j++){
            if(!(i^j)) continue;
            move_inside(i);
            move_inside(j);
            int x=press_button();
            if(x==2){
                //same element
                int jj=find(j);
                int ii=find(i);
                if(sz[ii]<sz[jj]) swap(ii,jj);
                par[jj]=ii;
                sz[ii]+=sz[jj];
            }
            move_outside(i);
            move_outside(j);
        }
    }
    set<int> roots;
    for(int i=0;i<N;i++) roots.insert(find(i));
    ll ans=INF;
    for(auto x:roots) ans=min(ans,(ll)sz[x]);
    return (int)ans;
}

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