Submission #1215220

#TimeUsernameProblemLanguageResultExecution timeMemory
1215220dostsRarest Insects (IOI22_insects)C++20
47.50 / 100
61 ms4332 KiB
#include "insects.h" #include <bits/stdc++.h> #pragma GCC optimize("O3,unroll-loops") #pragma GCC target("avx2") //#define int long long #define pii pair<int,int> #define vi vector<int> #define ff first #define ss second #define sp << " " << #define all(x) x.begin(),x.end() #define big(x) ((int)(x.size())) using namespace std; const int MOD = 1e9+7, LIM = 1e6+1, inf = 2e9; vi inside(LIM,0); void add(int p) { if (inside[p]) return; inside[p] = 1; move_inside(p); } void remove(int p) { if (!inside[p]) return; inside[p] = 0; move_outside(p); } int D = 0; bool check(int N,int x) { for (int i = 0;i<N;i++) remove(i); int total = 0; for (int i = 0;i<N;i++) { add(i); total++; int y = press_button(); if (y > x) { total--; remove(i); } } return (total == D*x); } int min_cardinality(int N) { for (int i = 0;i<N;i++) { add(i); int y = press_button(); if (y == 1) { D++; continue; } remove(i); } int l = 1; int r = N; while (l<=r) { int m = (l+r) >> 1; if (check(N,m)) l = m+1; else r = m-1; } return r; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...