This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
int k = 0;
int min_cardinality(int n) {
move_inside(0);
k++;
vector<bool>in_m(2001,0);
in_m[0]=1;
for(int i = 1; i < n; i++){
move_inside(i);
int rt = press_button();
if(rt==2){
move_outside(i);
}
else{
k++;
in_m[i]=1;
}
}
int ansl = 0, ansr = n/k,inmn=0,linmn;
vector<int>nc;
for(int i = 0; i < n; i++){
nc.push_back(i);
}
while(ansl < ansr){
linmn=inmn;
int mid =ansl+((nc.size()/k)+1)/2;
vector<int>im;
vector<int>om;
for(int i : nc){
if(in_m[i]){
inmn++;
im.push_back(i);
continue;
}
move_inside(i);
int rt = press_button();
if(rt > mid){
move_outside(i);
om.push_back(i);
}
else{
in_m[i]=1;
im.push_back(i);
inmn++;
}
}
if(inmn < k*mid){
inmn = linmn;
ansr = mid-1;
for(int i : im){
in_m[i]=0;
move_outside(i);
}
nc.assign(im.begin(),im.end());
}
else{
ansl = mid;
nc.assign(om.begin(),om.end());
}
}
return ansl;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |