Submission #836111

#TimeUsernameProblemLanguageResultExecution timeMemory
836111maomao90버섯 세기 (IOI20_mushrooms)C++17
25 / 100
113 ms292 KiB
// I can do all things through Christ who strengthens me // Philippians 4:13 #include "mushrooms.h" #include <bits/stdc++.h> using namespace std; #define REP(i, j, k) for (int i = j; i < (k); i++) #define RREP(i, j, k) for (int i = j; i >= (k); i--) template <class T> inline bool mnto(T &a, const T b) {return a > b ? a = b, 1 : 0;} template <class T> inline bool mxto(T &a, const T b) {return a < b ? a = b, 1 : 0;} typedef long long ll; typedef long double ld; #define FI first #define SE second typedef pair<int, int> ii; typedef pair<ll, ll> pll; #define ALL(x) x.begin(), x.end() #define SZ(x) (int) x.size() #define pb push_back typedef vector<int> vi; typedef vector<ll> vll; typedef vector<ii> vii; typedef tuple<int, int, int> iii; typedef vector<iii> viii; #ifndef DEBUG #define cerr if (0) cerr #endif const int INF = 1000000005; const ll LINF = 1000000000000000005; const int MAXN = 20005; int n; int count_mushrooms(int _n) { n = _n; int ans = 1; for (int i = 1; i < n; i += 2) { vi x; x.pb(i); x.pb(0); if (i + 1 < n) { x.pb(i + 1); } ans += SZ(x) - 1 - use_machine(x); } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...