Submission #361825

#TimeUsernameProblemLanguageResultExecution timeMemory
361825ryanseeCounting Mushrooms (IOI20_mushrooms)C++14
25 / 100
139 ms384 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) int count_mushrooms(int n) { int ans = 1; FOR(i,1,n-1) { if(i == n-1) { int res = use_machine({0, i}); if(res == 0) ++ ans; break; } int res = use_machine({i, 0, i+1}); if(res == 0) ans += 2; else if(res == 1) ans += 1; ++ i; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...