Submission #1034376

#TimeUsernameProblemLanguageResultExecution timeMemory
1034376Mr_Husanboy드문 곤충 (IOI22_insects)C++17
0 / 100
3 ms596 KiB
#include "insects.h" #include <bits/stdc++.h> using namespace std; #define ff first #define ss second #define all(a) (a).begin(), (a).end() #define ll long long const int mod = 1000002022; vector<int> state, p; int n, m; vector<vector<int>> g; template<typename T> int len(T &a){return a.size();} int min_cardinality(int n) { vector<int> cnt(n); vector<int> type(n); int cur = 0; for(int i = 0; i < n; i ++){ move_inside(i); if(press_button() == 1){ type[cur] = i; cnt[cur] ++; cur ++; continue; } int l = -1, r = cur - 1; int j = cur - 1; while(r - l > 1){ int m = (l + r) / 2; while(j < m){ j ++; move_inside(type[j]); } while(j > m){ move_outside(type[j]); j --; } if(press_button() == 2){ r = m; }else l = m; } while(j + 1 < cur){ j ++; move_inside(j); } move_outside(i); cnt[r] ++; } int ans = n; for(int i = 0; i < cur; i ++){ ans = min(ans, cnt[i]); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...