Submission #361848

#TimeUsernameProblemLanguageResultExecution timeMemory
361848ryanseeCounting Mushrooms (IOI20_mushrooms)C++14
25 / 100
41 ms492 KiB
#include "mushrooms.h" #include "bits/stdc++.h" using namespace std; #define FAST ios_base::sync_with_stdio(false); cin.tie(0); #define pb push_back #define eb emplace_back #define ins insert #define f first #define s second #define cbr cerr<<"hi\n" #define mmst(x, v) memset((x), v, sizeof ((x))) #define siz(x) ll(x.size()) #define all(x) (x).begin(), (x).end() #define lbd(x,y) (lower_bound(all(x),y)-x.begin()) #define ubd(x,y) (upper_bound(all(x),y)-x.begin()) mt19937 rng(chrono::steady_clock::now().time_since_epoch().count()); inline long long rand(long long x, long long y) { return rng() % (y+1-x) + x; } //inclusive string inline to_string(char c) {string s(1,c);return s;} template<typename T> inline T gcd(T a,T b){ return a==0?llabs(b):gcd(b%a,a); } using ll=long long; using ld=long double; #define FOR(i,s,e) for(int i=s;i<=ll(e);++i) #define DEC(i,s,e) for(ll i=s;i>=ll(e);--i) using pi=pair<ll,ll>; using spi=pair<ll,pi>; using dpi=pair<pi,pi>; long long LLINF = 1e18; int INF = 1e9+1e6; #define MAXN (200006) const int B = 10, S = 10; int count_mushrooms(int n) { int ans = 1; deque<int> dq, co; FOR(i,1,n-1) dq.eb(i); for(int i = 1; i < n; i += B) { if(co.size() == S - 1) break; vector<int> tmp={0}; FOR(j,i,min(n-1, i+B-1)) tmp.eb(j); int res = use_machine(tmp); if(res == 1) { tmp = {0}; DEC(j,min(n-1, i+B-1),i) tmp.eb(j); res = use_machine(tmp); } if(res == 1) { FOR(j,1,B) if(dq.size()) dq.pop_front(); continue; } else if(res == 0) { ans += min(n-1, i+B-1) - i + 1; FOR(j,1,B) if(dq.size()) dq.pop_front(); co.eb(i); if(i+1 < n && co.size() < S-1) co.eb(i+1); continue; } FOR(j,i,min(n-1, i+B-1)) if(!use_machine({0, j})) { co.eb(j), dq.pop_front(), ++ ans; if(co.size() == S-1) break; } else dq.pop_front(); if(co.size() == S-1) break; } if(co.size() < S-1) { assert(dq.empty()); return ans; } co.push_front(0); for(int i=0;i<siz(dq);i+=S) { vector<int> tmp; FOR(j,i,min((int)siz(dq)-1, i+S-1)) { tmp.eb(co[j-i]); tmp.eb(dq[j]); } int res = use_machine(tmp), B = 0; if(res & 1) ++ B, -- res; res /= 2; B += res; ans += min((int)siz(dq)-1, i+S-1) - i + 1 - B; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...