Submission #403181

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
403181	2021-05-12T22:04:48 Z	fadi57	Divide and conquer (IZhO14_divide)	C++14	48 / 100	1000 ms	1840 KB

divide

#include<bits/stdc++.h>
using namespace std;
const int mx=1e5+5;
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	204 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	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 KB	Output is correct
12	Correct	1 ms	204 KB	Output is correct

Subtask #2

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 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	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 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	2 ms	204 KB	Output is correct
18	Correct	3 ms	204 KB	Output is correct
19	Correct	3 ms	332 KB	Output is correct
20	Correct	3 ms	308 KB	Output is correct
21	Correct	4 ms	332 KB	Output is correct
22	Correct	5 ms	332 KB	Output is correct
23	Correct	24 ms	472 KB	Output is correct
24	Correct	22 ms	480 KB	Output is correct

Subtask #3

0 / 52.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	204 KB	Output is correct
2	Correct	1 ms	204 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	204 KB	Output is correct
6	Correct	1 ms	204 KB	Output is correct
7	Correct	1 ms	204 KB	Output is correct
8	Correct	1 ms	204 KB	Output is correct
9	Correct	1 ms	204 KB	Output is correct
10	Correct	0 ms	204 KB	Output is correct
11	Correct	1 ms	204 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	2 ms	204 KB	Output is correct
18	Correct	3 ms	204 KB	Output is correct
19	Correct	3 ms	332 KB	Output is correct
20	Correct	3 ms	308 KB	Output is correct
21	Correct	4 ms	332 KB	Output is correct
22	Correct	5 ms	332 KB	Output is correct
23	Correct	24 ms	472 KB	Output is correct
24	Correct	22 ms	480 KB	Output is correct
25	Correct	25 ms	292 KB	Output is correct
26	Correct	86 ms	516 KB	Output is correct
27	Correct	92 ms	588 KB	Output is correct
28	Execution timed out	1080 ms	1840 KB	Time limit exceeded
29	Halted	0 ms	0 KB	-