Submission #1087222

#TimeUsernameProblemLanguageResultExecution timeMemory
1087222KasymKDivide and conquer (IZhO14_divide)C++17
100 / 100
30 ms7376 KiB
#include "bits/stdc++.h"
using namespace std;
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define ll long long
#define pb push_back
#define pii pair<int, int>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define tr(i, c) for(auto i = c.begin(); i != c.end(); ++i)
#define wr puts("----------------")
template<class T>bool umin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool umax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
const int N = 1e5+5;
int x[N];
ll g[N], e[N];

int main(){
    int n;
    scanf("%d", &n);
    for(int i = 1; i <= n; ++i)
        scanf("%d%lld%lld", &x[i], &g[i], &e[i]), g[i] += g[i-1], e[i] += e[i-1];
    priority_queue<pli> pq;
    for(int i = 1; i <= n; ++i)
        pq.push({e[i]-x[i], i});
    ll answer = 0;
    for(int i = 1; i <= n; ++i)
        while(!pq.empty()){
            auto [a, b] = pq.top();
            if(a+x[i]-e[i-1] < 0)
                break;
            pq.pop();
            umax(answer, g[b]-g[i-1]);
        }
    printf("%lld\n", answer);
    return 0;
}

Compilation message (stderr)

divide.cpp: In function 'int main()':
divide.cpp:21:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   21 |     scanf("%d", &n);
      |     ~~~~~^~~~~~~~~~
divide.cpp:23:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   23 |         scanf("%d%lld%lld", &x[i], &g[i], &e[i]), g[i] += g[i-1], e[i] += e[i-1];
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...