Submission #825828

#TimeUsernameProblemLanguageResultExecution timeMemory
825828nasamFeast (NOI19_feast)C++17
100 / 100
85 ms2652 KiB
#include <bits/stdc++.h> #define ll long long #define FOR(i,a,b) for (int i = (a), _b = (b); i <= _b; i++) #define FOD(i,b,a) for (int i = (b), _a = (a); i >= _a; i--) #define FORE(i, v) for (__typeof((v).begin()) i = (v).begin(); i != (v).end(); i++) #define ALL(v) (v).begin(), (v).end() #define BIT(x, i) (((x) >> (i)) & 1) #define MASK(i) (1LL << (i)) #define CNTBIT(x) __builtin_popcount(x) #define fi first #define se second #define pb push_back #define eb emplace_back #define left ___left #define right ___right #define pii pair<int, int> #define pll pair<ll, ll> #define DEBUG(n, a) FOR (i, 1, n) cout << a[i] << ' '; cout << endl; #define lob lower_bound // >= #define upb upper_bound // > #define endl "\n" #define NAME "main" using namespace std; template<class X, class Y> bool maximize(X &x, Y y){ if (x < y){ x = y; return true; } return false; } template<class X, class Y> bool minimize(X &x, Y y){ if (x > y){ x = y; return true; } return false; } #define gogobruhbruh ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); #define file(name) if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); } const int MOD = 1e9 + 7; void add(int &a, int b){ if ((a += b) >= MOD) a -= MOD; } int sub(int a, int b){ if ((a -= b) < 0) a += MOD; return a; } int muti(int a, int b){ return (1LL * a * b) % MOD; } int Pow(int x, int y){ int res = 1; for (; y; y >>= 1){ if (y & 1) res = muti(res, x); x = muti(x, x); } return res; } const int MAX = 3e5 + 7; const ll INF = 1e18 + 5; int num, lim; ll pre[MAX], left, right; #define state pair<ll, int> void maxx(state &a, state b, ll val, bool ok){ b.fi += val; b.se += ok; if (a.fi < b.fi) a = b; } state calc(ll cost){ state Max, res; Max = res = {0, 0}; FOR (i, 1, num){ maxx(res, Max, pre[i] + cost, 1); maxx(Max, res, -pre[i], 0); } return res; } void solve(){ left = -left; right = 0; ll res = 0; while (left <= right){ ll mid = (left + right) >> 1; auto[cost, k] = calc(mid); if (k <= lim){ left = mid + 1; res = cost - mid * k; }else right = mid - 1; } cout << res; } void read(){ cin >> num >> lim; ll Min = 0; FOR (i, 1, num) cin >> pre[i], pre[i] += pre[i - 1], maximize(left, pre[i] - Min), minimize(Min, pre[i]); } int main(){ gogobruhbruh; file("main"); int test = 1; // cin >> test; while (test--) read(), solve(); }

Compilation message (stderr)

feast.cpp: In function 'int main()':
feast.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                     ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:90:5: note: in expansion of macro 'file'
   90 |     file("main");
      |     ^~~~
feast.cpp:30:95: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 | #define  file(name)  if (fopen (name".inp", "r")) { freopen (name".inp", "r", stdin); freopen (name".out", "w", stdout); }
      |                                                                                       ~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp:90:5: note: in expansion of macro 'file'
   90 |     file("main");
      |     ^~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...