Submission #403180

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
403180	2021-05-12T22:03:47 Z	fadi57	Divide and conquer (IZhO14_divide)	C++14	17 / 100	3 ms	332 KB

divide

#include<bits/stdc++.h>
using namespace std;
const int mx=1002;
typedef long long ll;
int inf=1e9+10;
const int mod=1e9+7;
int d[mx];
int g[mx];
int x[mx];
int n,m;

int main(){
cin>>n;
ll ans=0;
for(int i=0;i<n;i++){
    cin>>x[i]>>g[i]>>d[i];
   // if(d[i]>=1){ans=max(ans,g[i]);}
}

for(int i=0;i<n;i++){
        ll sum=0;ll sum2=0;
    for(int j=i;j<n;j++){
        sum+=d[j];
        sum2+=g[j];
if(x[j]-x[i]<=sum){
    ans=max(ans,sum2);
}

    }
}
cout<<ans;
 }

Subtask #1

17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	288 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct

Subtask #2

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	288 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Correct	3 ms	204 KB	Output is correct
18	Incorrect	3 ms	332 KB	Output isn't correct
19	Halted	0 ms	0 KB	-

Subtask #3

0 / 52.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	288 KB	Output is correct
3	Correct	1 ms	204 KB	Output is correct
4	Correct	1 ms	204 KB	Output is correct
5	Correct	1 ms	296 KB	Output is correct
6	Correct	1 ms	296 KB	Output is correct
7	Correct	1 ms	288 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	1 ms	204 KB	Output is correct
11	Correct	1 ms	296 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct
13	Correct	1 ms	204 KB	Output is correct
14	Correct	1 ms	204 KB	Output is correct
15	Correct	1 ms	204 KB	Output is correct
16	Correct	2 ms	204 KB	Output is correct
17	Correct	3 ms	204 KB	Output is correct
18	Incorrect	3 ms	332 KB	Output isn't correct
19	Halted	0 ms	0 KB	-