# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
799240 | aymanrs | Rarest Insects (IOI22_insects) | C++17 | 53 ms | 336 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<bits/stdc++.h>
const int MOD = 1e9+7;
using namespace std;
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int N){
int t = 0;
vector<int> v;
bool vis[N] = {false};
for(int i = 0;i < N;i++){
move_inside(i);
if(press_button() == 2){
move_outside(i);
} else {
vis[i] = true;
t++;
v.push_back(i);
}
}
int ans = N;
if(t <= 2){
for(int i : v) if(i) move_outside(i);
for(int i : v){
if(i) move_inside(i);
t = 1;
for(int j = i+1;j < N;j++){
if(vis[j]) continue;
move_inside(j);
if(press_button() == 2){
t++;
vis[j] = true;
}
move_outside(j);
}
ans = min(ans, t);
}
return ans;
}
int l = 2, r = N/t, b = 1, m, rbm = 0;
bool broke[N] = {false};
while(l <= r){
m = l+r>>1;
int rb = rbm;
bool s[N] = {false};
int ind = N;
for(int i = 0;i < N;i++){
if(vis[i]) continue;
move_inside(i);
if(i >= m && press_button() > m){
rb++;
move_outside(i);
} else s[i] = true;
if(rb > N-t*m) {
ind = i+1;
break;
}
}
if(rb == N-t*m) {
b = m;
l = m+1;
for(int i = 0;i < N;i++) if(s[i]) vis[i] = true;
} else {
r = min(m-1, (N-rb)/t);
if(l <= r) {
for(int i = 0;i < ind;i++) {
if(s[i]) move_outside(i);
else if (!vis[i]) {
vis[i] = true;
rbm++;
}
}
}
}
}
return b;
}
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... |