# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1077686 | pcc | Rarest Insects (IOI22_insects) | C++17 | 0 ms | 344 KiB |
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;
const int mxn = 2022;
vector<int> v[mxn];
set<int> machine;
int N;
void del(int k){
assert(machine.find(k) != machine.end());
machine.erase(k);
move_outside(k);
return;
}
void add(int k){
assert(machine.find(k) == machine.end());
machine.insert(k);
move_inside(k);
return;
}
int ask(){
int re = press_button();
return re;
}
bool check(int lim){
for(int i = lim+1;i<=N;i++){
while(!v[i].empty()){
auto now = v[i].back();
v[i].pop_back();
del(now);
}
}
for(int i = 0;i<N;i++){
if(machine.find(i) == machine.end()){
add(i);
int re = ask();
if(re>lim)del(i);
v[re].push_back(i);
}
}
return lim*N == machine.size();
}
int min_cardinality(int NN) {
N = NN;
int l = 1,r = N;
while(l != r){
int mid = (l+r+1)>>1;
if(check(mid))l = mid;
else r = mid-1;
}
return l;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |