Submission #1008583

#TimeUsernameProblemLanguageResultExecution timeMemory
1008583oyberRarest Insects (IOI22_insects)C++17
0 / 100
1 ms344 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; vector<int> uniqu; vector<int> insects; int N; bool check_num(int num) { vector<bool> used(N, false); for (int i = 0; i < int(insects.size()); i++) { move_inside(insects[i]); if (press_button() >= num) { move_outside(insects[i]); continue; } used[i] = true; } bool valid = true; for (int i = 0; i < int(uniqu.size()); i++) { move_inside(uniqu[i]); if (press_button() != num) { move_outside(uniqu[i]); valid = false; break; } move_outside(uniqu[i]); } for (int i = 0; i < N; i++) { if (used[i]) { move_outside(i); } } return valid; } int min_cardinality(int n) { N = n; int types = 0; for (int i = 0; i < N; i++) { move_inside(i); if (press_button() > 1) { move_outside(i); insects.push_back(i); continue; } types++; uniqu.push_back(i); } int l = 1; int r = N/types+1; while (l < r) { int m = (l+r)/2; if (check_num(m)) { r = m; } else { l = m+1; } } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...