# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
852289 | 2023-09-21T14:28:59 Z | fadi57 | Rarest Insects (IOI22_insects) | C++17 | 180 ms | 344 KB |
#include<bits/stdc++.h> #include "insects.h" using namespace std; int n; const int mx=2e7+10; map<int,int>in; long long dp[mx]; int sz=0; int d=0; bool check(int x){ for(int i=0;i<n;i++){ if(!in[i]){ move_inside(i); int z=press_button(); if(z>x){ move_outside(i); }else{in[i]=1;sz++;} } } int z=press_button(); if(sz==d*x){return 1;}else{return 0;} } int min_cardinality(int N){ int arr[N+1];n=N; for(int i=0;i<N;i++){ arr[i]=-1; } for(int i=0;i<N;i++){ move_inside(i); in[i]=1; d++; int z= press_button(); if(z>1){ move_outside(i); in[i]=0; }else{sz++;} } int l=1;int r=N; int ans=0; while(l<=r){ int mid=(l+r)/2; if(check(mid)){ l=mid;ans=l; }else{ r=mid-1; } } return ans; } /* int main(){ cout<<min_cardinality(9); }*/
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong answer. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 344 KB | Wrong answer. |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 180 ms | 344 KB | Too many queries. |
2 | Halted | 0 ms | 0 KB | - |