Submission #1167412

#	TimeUTC-0	Username	Problem	Language	Result	Execution time	Memory
1167412	2025-03-16 05:20:46	Almonther	Divide and conquer (IZhO14_divide)	C++20	48 / 100	1093 ms	1864 KiB

divide

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define co cout<<
// stuff
struct smth{
    ll last,ans,extra;
};
void solve(){
    ll n;
    cin>>n;
    smth ans[n+5];
    ll cords[n+5];
    ll mx=0;
    for(int i=0;i<n;i++){
        cin>>cords[i]>>ans[i].ans>>ans[i].extra;
        ll sum=0,sum1=0;
        for(int j=i;j>=0;j--){
            sum+=ans[j].ans;
            sum1+=ans[j].extra;
            // co i<<' '<<j<<' '<<sum<<' '<<sum1<<'\n';
            if(sum1>=cords[i]-cords[j]) mx=max(mx,sum);
        }
        continue;
        ans[i].last=i;
        while(ans[i].last!=0){
            if(cords[ans[i].last]-cords[ans[i].last-1]<=ans[i].extra+ans[ans[i].last-1].extra){
                ans[i].extra-=cords[ans[i].last]-cords[ans[i].last-1];
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

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