Submission #409632

#TimeUsernameProblemLanguageResultExecution timeMemory
409632codebuster_10Happiness (Balkan15_HAPPINESS)C++17
0 / 100
2106 ms313320 KiB
#include "happiness.h" #include <bits/stdc++.h> using namespace std ; #define int int64_t //be careful about this #define endl "\n" #define f(i,a,b) for(int i=int(a);i<int(b);++i) #define pr pair #define ar array #define fr first #define sc second #define vt vector #define pb push_back #define eb emplace_back #define LB lower_bound #define UB upper_bound #define PQ priority_queue #define sz(x) ((int)(x).size()) #define all(a) (a).begin(),(a).end() #define allr(a) (a).rbegin(),(a).rend() #define mem0(a) memset(a, 0, sizeof(a)) #define mem1(a) memset(a, -1, sizeof(a)) template<class A> void rd(vt<A>& v); template<class T> void rd(T& x){ cin >> x; } template<class H, class... T> void rd(H& h, T&... t) { rd(h) ; rd(t...) ;} template<class A> void rd(vt<A>& x) { for(auto& a : x) rd(a) ;} template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template<typename T> void __p(T a) { cout<<a; } template<typename T, typename F> void __p(pair<T, F> a) { cout<<"{"; __p(a.first); cout<<","; __p(a.second); cout<<"}\n"; } template<typename T> void __p(std::vector<T> a) { cout<<"{"; for(auto it=a.begin(); it<a.end(); it++) __p(*it),cout<<",}\n"[it+1==a.end()]; } template<typename T, typename ...Arg> void __p(T a1, Arg ...a) { __p(a1); __p(a...); } template<typename Arg1> void __f(const char *name, Arg1 &&arg1) { cout<<name<<" : "; __p(arg1); cout<<endl; } template<typename Arg1, typename ... Args> void __f(const char *names, Arg1 &&arg1, Args &&... args) { int bracket=0,i=0; for(;; i++) if(names[i]==','&&bracket==0) break; else if(names[i]=='(') bracket++; else if(names[i]==')') bracket--; const char *comma=names+i; cout.write(names,comma-names)<<" : "; __p(arg1); cout<<" | "; __f(comma+1,args...); } void setIO(string s = "") { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); cin.exceptions(cin.failbit); cout.precision(15); cout << fixed; #ifdef ONLINE_JUDGE if(sz(s)){ freopen((s+".in").c_str(),"r",stdin); freopen((s+".out").c_str(),"w",stdout); } #define __f(...) 0 #endif } /* Description :- Sparse lazy segment tree Source :- https://usaco.guide/plat/sparse-seg?lang=cpp Verification :- https://oj.uz/submission/409297 */ struct Node { int sum, tl, tr, l, r;// node cover [tl,tr], also lazy is not added to current node; Node() : sum(0), l(-1), r(-1) {} }; const int BEST = 8e6; Node st[BEST]; int cnt = 2; void update(int x, int l, int r, int val) { if (l == st[x].tl && r == st[x].tr) { st[x].sum += val; assert(l == r); } else { int mid = (st[x].tl + st[x].tr) / 2; if (st[x].l == -1) { st[x].l = cnt++; st[st[x].l].tl = st[x].tl; st[st[x].l].tr = mid; } if (st[x].r == -1) { st[x].r = cnt++; st[st[x].r].tl = mid + 1; st[st[x].r].tr = st[x].tr; } if (l > mid) update(st[x].r, l, r, val); else if (r <= mid) update(st[x].l, l, r, val); else { update(st[x].l, l, mid, val); update(st[x].r, mid + 1, r, val); } st[x].sum = st[st[x].l].sum + st[st[x].r].sum; } } int query(int x, int l, int r) { if (l == st[x].tl && r == st[x].tr) return st[x].sum; else { int mid = (st[x].tl + st[x].tr) / 2; if (st[x].l == -1) { st[x].l = cnt++; st[st[x].l].tl = st[x].tl; st[st[x].l].tr = mid; } if (st[x].r == -1) { st[x].r = cnt++; st[st[x].r].tl = mid + 1; st[st[x].r].tr = st[x].tr; } if (l > mid) return query(st[x].r, l, r); else if (r <= mid) return query(st[x].l, l, r); else return query(st[x].l, l, mid) + query(st[x].r, mid + 1, r); } } int W; #undef int bool init(int coinsCount, long long maxCoinSize, long long coins[]) { #define int int64_t int n = coinsCount, M = maxCoinSize; //rd(n,M); st[1].tl = 1, st[1].tr = M; vt<int> a(n); f(i,0,n) a[i] = coins[i]; W = accumulate(all(a),int(0)); for(auto i : a){ update(1,i,i,i); } auto go = [&]() -> bool { for(int now = W; now; now/=2){ if(query(1,1,now) < now){ return false; } } return true; }; return go(); } #undef int bool is_happy(int event, int coinsCount, long long coins[]) { #define int int64_t auto go = [&]() -> bool { for(int now = W; now; now/=2){ if(query(1,1,now) < now){ return false; } } return true; }; int t = event; //rd(t); if(t == -1){ int N = coinsCount; //rd(N); vt<int> b(N); f(i,0,N) b[i] = coins[i]; W -= accumulate(all(b),int(0)); for(auto i : b){ update(1,i,i,-i); } return go(); }else{ int N = coinsCount; //rd(N); vt<int> b(N); f(i,0,N) b[i] = coins[i]; W += accumulate(all(b),int(0)); for(auto i : b){ update(1,i,i,i); } return go(); } }

Compilation message (stderr)

grader.cpp: In function 'int main()':
grader.cpp:16:12: warning: unused variable 'max_code' [-Wunused-variable]
   16 |  long long max_code;
      |            ^~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...