Submission #1185852

#	Time	Username	Problem	Language	Result	Execution time	Memory
1185852		hmms127	Divide and conquer (IZhO14_divide)	C++20	48 / 100	1096 ms	1604 KiB

divide

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename key>
// for ordered set or indexed set
using ordered_set= tree<key, null_type, less<key>, rb_tree_tag, tree_order_statistics_node_update>; // less_equal
#define f1(n) for(int i=0;i<n;i++)
#define e '\n'
#define f2(m,n,q) for(int i=m;i<n;i+=q)
#define f3(n) for(int j=0;j<n;j++)
#define f4(m,n,q) for(int j=m;j<n;j+=q)
#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#define int long long
#define pb push_back
//f^=1 == if(f==0)f=1 else f=0
typedef long long ll;
const int N=15000001;
const int mod=1e9+7;
const int inf=1e9,sqr=448;
int32_t main()
{
     speed;
     int tt=1;//cin>>tt;
     while(tt--){
        //freopen("herding.in","r",stdin);
        //freopen("herding.out","w",stdout);
        int n;cin>>n;
        array<int,3>a[n];f1(n)cin>>a[i][0]>>a[i][1]>>a[i][2];
        int ans=0;
        f1(n){
         int c=0,c1=0;
         f4(i,n,1){
          c+=a[j][1],c1+=a[j][2];
          if(c1>=a[j][0]-a[i][0])ans=max(ans,c);
         }
        }
        cout<<ans;

     }
}

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