Submission #344602

#	Time	Username	Problem	Language	Result	Execution time	Memory
344602		pragmatist	Divide and conquer (IZhO14_divide)	C++14	17 / 100	1 ms	364 KiB

divide

// turmak-_-
#include<bits/stdc++.h>

/*
#pragma optimize ("g",on)
#pragma GCC optimize("O3")
#pragma GCC target ("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
*/

#define all(v) v.begin(),v.end()
#define sz(a) a.size()
#define nl "\n"
#define IOI return 0;
#define pb push_back
#define ppb pop_back()
#define ll long long
#define ull unsigned long long
#define ld long double
#define IOS ios_base :: sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define pii pair<int,int>
#define X first
#define Y second


using namespace std;
const int N = (int)1e5 + 7 ;
const ll MOD = (ll)998244353;
const ll INF = (ll)1e18 + 7;
const int inf = (int)1e9 + 7;

pii dx[] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};

ll x[N],g[N],d[N],p[N],p1[N],p2[N];

void solve() {
    int n;
    cin>>n;

    ll mx = 0;
    for(int i=1; i<=n; ++i) {
        cin>>x[i]>>g[i]>>d[i];
        if(d[i]>=1) mx = max(mx, g[i]);
        p[i]=p[i-1] + g[i];
        p1[i]=p1[i-1] + d[i];
    }
    for(int i=1; i<=n; ++i) {
        int r = i+1;
        while(r<=n && x[r]-x[i]<=p1[r]-p1[i-1]) {
            mx = max(mx, p[r]-p[i-1]);
            r++;
        }
    }
    cout<<mx;
}
int main() {
    IOS
    //freopen("cinema.in", "r", stdin);
    //freopen("cinema.out", "w", stdout);
    int tt=1;
    //  cin>>tt;
    while(tt--) {
        solve();
    }
    IOI
}

• Subtask 1: 17 / 17
• Subtask 2: 0 / 31
• Subtask 3: 0 / 52