제출 #1135048

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1135048		Lemser	드문 곤충 (IOI22_insects)	C++20	10 / 100	98 ms	492 KiB

insects

#include "insects.h"
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using lld = long double;
using ii = pair<int,int>;
using pll = pair<ll, ll>;

using vi = vector<int>;
using vll = vector<ll>;
using vii = vector<ii>;
using vpll = vector<pll>;
using vlld = vector<lld>;

// #define endl '\n'
#define all(x) x.begin(),x.end()
#define lsb(x) x&(-x)
#define gcd(a,b) __gcd(a,b)
#define sz(x) (int)x.size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define fls cout.flush()

#define fore(i,l,r) for(auto i=l;i<r;i++)
#define fo(i,n) fore(i,0,n)
#define forex(i,r,l) for(auto i=r; i>=l;i--)
#define ffo(i,n) forex(i,n-1,0)

bool cmin(ll &a, ll b) { if(b<a){a=b;return 1;}return 0; }
bool cmax(ll &a, ll b) { if(b>a){a=b;return 1;}return 0; }
void valid(ll in) { cout<<((in)?"Yes\n":"No\n"); }
ll lcm(ll a, ll b) { return (a/gcd(a,b))*b; }
ll gauss(ll n) { return (n*(n+1))/2; }

int min_cardinality(int n) {
  vector<vll> dfs(n);
  dfs[0].pb(0);
  fore (i, 1, n) {
    // machine empty 
    move_inside(i);
    ll f = 1;
    fo (j, i) {
      if (sz(dfs[j]) == 0) continue;
      move_inside(dfs[j][0]);
      ll x = press_button();
      move_outside(dfs[j][0]);
      if (x > 1) {
        dfs[j].pb(i);
        f = 0;
        break;
      }
    }
    if (f) dfs[i].pb(i);
    move_outside(i);
  }
  ll ans = n+1;
  fo (i, n) if (sz(dfs[i])) ans = min(ans, ll(sz(dfs[i])));
  return ans;
}

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