Submission #1040386

#	Time	Username	Problem	Language	Result	Execution time	Memory
1040386		vjudge1	Divide and conquer (IZhO14_divide)	C++14	100 / 100	167 ms	7260 KiB

divide

#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e5 + 7;
int n;
pair<int, pair<int, int> > a[N];
long long pref_d[N], pref_x[N];
signed main() 
{
    ios_base::sync_with_stdio(NULL);
    cin.tie(NULL);
    cin>>n;
    for(int i = 1; i <= n; i++) 
	{
        int pos, d, x;
        cin>>pos>>d>>x;
        a[i].first = pos, a[i].second.first = d, a[i].second.second = x;
    }
    sort(a + 1, a + 1 + n);
    for(int i = 1; i <= n; i++) 
	{
        pref_d[i] = pref_d[i - 1] + a[i].second.first;
        pref_x[i] = pref_x[i - 1] + a[i].second.second;
    }
    long long ans = 0;
    for(int i = 1; i <= n; i++) 
	{
        for(int j = i; j <= min(i + 1000, n); j++) 
		{
            long long sum_x = pref_x[j] - pref_x[i - 1], sum_d = pref_d[j] - pref_d[i - 1];
            int len = a[j].first - a[i].first;
            if(len <= sum_x) 
                ans = max(ans, sum_d);
        }
        for(int j = n; j >= max(i, n - 1000); j--) 
		{
            long long sum_x = pref_x[j] - pref_x[i - 1], sum_d = pref_d[j] - pref_d[i - 1];
            int len = a[j].first - a[i].first;
            if(len <= sum_x)
                ans = max(ans, sum_d);
        }
    }
    cout << ans;
    return 0;
}

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