| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1173205 | davele | 드문 곤충 (IOI22_insects) | C++20 | 0 ms | 0 KiB |
#ifndef davele
#include "insects.h"
#endif // davele
#include <bits/stdc++.h>
//#define int long long
#define pii pair<int, int>
#define fi first
#define se second
#define vi vector <int>
#define pq priority_queue
#define MASK(i) (1ll<<(i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define x0 ___x0
#define y0 ___y0
#define div ___div
#define next ___next
#define prev ___prev
#define left ___left
#define right ___right
#define pos pisosi
#define pb push_back
#define pf push_front
using namespace std;
//const int mod = ;
//void add (int &a, const int&b){
// a+=b;
// if (a>=mod) a-=mod;
//}
//
//void sub (int&a, const int&b){
// a-=b;
// if (a<0) a+=mod;
//}
//
//void mul (int&a, const int&b){
// a*=b;
// a%=mod;
//}
template<class X, class Y>
bool minimize(X &x, const Y&y){
if (x<=y) return false;
else{
x = y;
return true;
}
}
template<class X, class Y>
bool maximize (X &x, const Y&y){
if (x>=y) return false;
else{
x = y;
return true;
}
}
////////////////////////////////////////////////////////////////////////////
const int lim = 2e3, limit = lim+5;
int n, inMachine[limit], ini[limit];
int min_cardinality (int N){
n = N;
//
int numDiff = 0;
for (int i=0; i<n; i++){
move_inside(i);
inMachine[i] = true;
if (press_button()>1){
move_outside(i);
inMachine[i] = false;
ini[i] = false;
}
else{
ini[i] = true;
}
}
int numCur = numDiff;
//
int left = 1, right = N, ret = 1;
while (left<=right){
int mid = (left+right)/2;
vector <int> tmp;
for (i = 0; i < n; i++){
if (inMachine[i]) continue;
move_inside(i);
numCur++;
inMachine[i] = true;
if (press_button()>mid){
move_outside(i);
numCur--;
inMachine[i] = false;
}
}
if (numCur==(numDiff*mid)){
ret = mid;
left = mid+1;
}
else{
right = mid-1;
for (int i=0; i<n; i++) inMachine[i] = ini[i];
numCur = numDiff;
}
}
return ret;
}