# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
830532 | 2023-08-19T07:47:11 Z | FatihSolak | Rarest Insects (IOI22_insects) | C++17 | 295 ms | 412 KB |
#include "insects.h" #include <bits/stdc++.h> using namespace std; int min_cardinality(int N){ vector<int> v; int now = 0; int dif = 0; auto add = [&](int x){ v.push_back(x); move_inside(x); now = press_button(); }; auto del = [&](){ move_outside(v.back()); v.pop_back(); now = press_button(); }; add(0); dif = 1; for(int i = 1;i<N;i++){ add(i); if(now == 2){ del(); } else dif++; } int last = 1; int l = 1,r = N/dif; while(l < r){ int m = (l + r + 1)/2; if(last < m){ for(int i = 0;i<N;i++){ if(find(v.begin(),v.end(),i) == v.end()){ add(i); if(now > m) del(); } } } if(last > m){ vector<int> tmp; while(now != m){ tmp.push_back(v.back()); del(); } for(int i = 0;i<N;i++){ if(find(tmp.begin(),tmp.end(),i) == tmp.end() && find(v.begin(),v.end(),i) == v.end()){ add(i); if(now > m) del(); } } } last = m; if(v.size() == m * dif){ l = m; } else r = m -1; } return l; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 0 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
5 | Correct | 0 ms | 208 KB | Output is correct |
6 | Correct | 10 ms | 208 KB | Output is correct |
7 | Correct | 2 ms | 208 KB | Output is correct |
8 | Correct | 8 ms | 208 KB | Output is correct |
9 | Incorrect | 13 ms | 208 KB | Wrong answer. |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 208 KB | Output is correct |
2 | Correct | 0 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
5 | Correct | 0 ms | 208 KB | Output is correct |
6 | Correct | 10 ms | 208 KB | Output is correct |
7 | Correct | 2 ms | 208 KB | Output is correct |
8 | Correct | 8 ms | 208 KB | Output is correct |
9 | Incorrect | 13 ms | 208 KB | Wrong answer. |
10 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 208 KB | Output is correct |
2 | Correct | 0 ms | 208 KB | Output is correct |
3 | Correct | 0 ms | 208 KB | Output is correct |
4 | Correct | 0 ms | 208 KB | Output is correct |
5 | Correct | 0 ms | 208 KB | Output is correct |
6 | Partially correct | 1 ms | 208 KB | Output is partially correct |
7 | Partially correct | 93 ms | 288 KB | Output is partially correct |
8 | Correct | 12 ms | 208 KB | Output is correct |
9 | Partially correct | 81 ms | 280 KB | Output is partially correct |
10 | Partially correct | 92 ms | 412 KB | Output is partially correct |
11 | Partially correct | 295 ms | 280 KB | Output is partially correct |
12 | Correct | 41 ms | 296 KB | Output is correct |
13 | Incorrect | 272 ms | 280 KB | Wrong answer. |
14 | Halted | 0 ms | 0 KB | - |