# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
631220 | fuad27 | Rarest Insects (IOI22_insects) | C++17 | 1 ms | 208 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;
int min_cardinality(int N) {
vector<int> idx_type;
idx_type.push_back(0);
move_inside(0);
for(int i = 1;i<N;i++) {
move_inside(i);
int val=press_button();
if(val == 2)move_outside(i);
else idx_type.push_back(i);
}
for(int i:idx_type) {
move_outside(i);
//~ cout << i << " ";
}
//~ cout << endl;
vector<int> l(N, -1), r(N, idx_type.size()-1);
for(int i:idx_type) {
l[i]=i-1;
r[i]=i;
}
vector<pair<int,int>> que;
while(1) {
que.clear();
int cnt=0;
bool check=false;
for(int i = 0;i<N;i++) {
if(r[i]-l[i]<=1)continue;
que.push_back({(r[i]+l[i])/2, i});
check=true;
}
sort(que.begin(), que.end());
for(int i = 0;i<que.size();i++) {
int mid = que[i].first;
while(cnt <= mid) {
move_inside(idx_type[cnt++]);
}
move_inside(que[i].second);
int val=press_button();
if(val == 2) {
r[que[i].second]=que[i].first;
//~ cout << que[i].second << " " << mid << " " << val << endl;
}
else {
l[que[i].second]=que[i].first;
//~ cout << que[i].second << " " << mid << " " << val << endl;
}
move_outside(que[i].second);
}
for(int i = 0;i<cnt;i++) {
move_outside(idx_type[i]);
}
if(!check)break;
}
vector<int> cnt(N+1, 0);
for(int i = 0;i<N;i++) {
cnt[idx_type[r[i]]]++;
}
int ans=20000;
for(int i = 0;i<N;i++) {
if(cnt[i]==0)continue;
ans=min(ans, cnt[i]);
}
return ans;
}
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... |