Submission #979873

#	Time	Username	Problem	Language	Result	Execution time	Memory
979873		hariaakas646	Feast (NOI19_feast)	C++14	100 / 100	246 ms	11720 KiB

feast

#include <bits/stdc++.h>

using namespace std;

#define scd(t) scanf("%d", &t)
#define sclld(t) scanf("%lld", &t)
#define forr(i, j, k) for (int i = j; i < k; i++)
#define frange(i, j) forr(i, 0, j)
#define all(cont) cont.begin(), cont.end()
#define mp make_pair
#define pb push_back
#define f first
#define s second
typedef long long int lli;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<lli> vll;
typedef vector<string> vs;
typedef vector<pii> vii;
typedef vector<vi> vvi;
typedef map<int, int> mpii;
typedef set<int> seti;
typedef multiset<int> mseti;
typedef long double ld;


void usaco()
{
    freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
//    freopen("problem.out", "w", stdout);
}

int main() {
    // usaco();
    int n, k;
    scd(n);
    scd(k);

    
    vll pref(n+1);

    forr(i, 1, n+1) {
        lli a;
        sclld(a);
        pref[i] = pref[i-1] + a;
    }

    
    lli lo = 0;
    lli hi = 1e12;
    while(lo != hi) {
        lli mid = (lo+hi)/2;
        deque<pair<lli, int>> stk;
        stk.pb(mp(0, 0));

        vll dp(n+1);
        vi cnt(n+1);

        forr(j, 1, n+1) {
            dp[j] = dp[j-1];
            cnt[j] = cnt[j-1];
            if(stk.front().f + pref[j] - mid > dp[j]) {
                dp[j] = stk.front().f + pref[j] - mid;
                cnt[j] = cnt[stk.front().s]+1;
            }
            while(stk.size() && stk.back().f <= dp[j] - pref[j]) {
                stk.pop_back();
            }
            stk.pb(mp(dp[j] - pref[j], j));
            // printf("%lld ", dp[i][j]);
        }
        if(cnt[n] <= k) hi = mid;
        else lo = mid+1;
    }

    deque<pair<lli, int>> stk;
    stk.pb(mp(0, 0));

    vll dp(n+1);
    vi cnt(n+1);

    forr(j, 1, n+1) {
        dp[j] = dp[j-1];
        cnt[j] = cnt[j-1];
        if(stk.front().f + pref[j] - lo > dp[j]) {
            dp[j] = stk.front().f + pref[j] - lo;
            cnt[j] = cnt[stk.front().s]+1;
        }
        while(stk.size() && stk.back().f <= dp[j] - pref[j]) {
            stk.pop_back();
        }
        stk.pb(mp(dp[j] - pref[j], j));
        // printf("%lld ", dp[i][j]);
    }

    printf("%lld", dp[n] + lo * cnt[n]);
}

Compilation message (stderr)

feast.cpp: In function 'void usaco()':
feast.cpp:30:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     freopen("/media/hariaakash646/785EF1075EF0BF46/CompetitiveProgramming/input.in", "r", stdin);
      |     ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
feast.cpp: In function 'int main()':
feast.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
feast.cpp:37:5: note: in expansion of macro 'scd'
   37 |     scd(n);
      |     ^~~
feast.cpp:5:21: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    5 | #define scd(t) scanf("%d", &t)
      |                ~~~~~^~~~~~~~~~
feast.cpp:38:5: note: in expansion of macro 'scd'
   38 |     scd(k);
      |     ^~~
feast.cpp:6:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    6 | #define sclld(t) scanf("%lld", &t)
      |                  ~~~~~^~~~~~~~~~~~
feast.cpp:45:9: note: in expansion of macro 'sclld'
   45 |         sclld(a);
      |         ^~~~~

• Subtask 1: 4 / 4
• Subtask 2: 8 / 8
• Subtask 3: 18 / 18
• Subtask 4: 10 / 10
• Subtask 5: 11 / 11
• Subtask 6: 20 / 20
• Subtask 7: 29 / 29