이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho
#include "insects.h"
using ll=long long;
using ld=long double;
int const INF=1000000005;
ll const LINF=1000000000000000005;
ll const mod=1000000007;
ld const PI=3.14159265359;
ll const MAX_N=3e5+5;
ld const EPS=0.00000001;
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define endl '\n'
#define sz(a) (int)a.size()
#define CODE_START ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
int min_cardinality(int N) {
vector<ll>v;
set<ll>s;
for(ll i=1;i<N;i++)
{
s.insert(i);
}
vector<int>ans;
for(ll i=0;i<N;i++){
if(s.find(i)==s.end()){
continue;
}
vector<ll>remove;
move_inside(i);
remove.pb(i);
ll res=1;
for(auto it : s){
if(it==i){
continue;
}
move_inside(it);
ll x=press_button();
if(x==2){
res++;
remove.pb(it);
}
move_outside(it);
}
ans.pb(res);
for(auto it : remove){
s.erase(s.find(it));
}
}
sort(ans.begin(),ans.end());
return ans[0];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |