oj.uz

Submission #1028235

# Submission time Handle Problem Language Result Execution time Memory
1028235 2024-07-19T15:26:49 Z andrewp Divide and conquer (IZhO14_divide) C++14
48 / 100
 1000 ms 5464 KB 
//Dedicated to my love, ivaziva
#include <bits/stdc++.h>
using namespace std;

#define ll int64_t
#define ar array

const int mxN=1e5;
ll n, x[mxN], g[mxN], e[mxN];

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);

    cin >> n;
    for(int i=0; i<n; ++i) {
        cin >> x[i] >> g[i] >> e[i];
    }
    ll ans=0;
    for(int i=0; i<n; ++i) {
        ll en=e[i], cur=g[i];
        ans=max(ans, g[i]);
        for(int j=i-1; j>=0; --j) {
            en+=e[j], cur+=g[j];
            if(en>=(x[i]-x[j])) ans=max(ans, cur);
        }
    }
    cout << ans << "\n";
	return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 516 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 10 ms 604 KB Output is correct
24 Correct 9 ms 604 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 516 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 476 KB Output is correct
22 Correct 2 ms 348 KB Output is correct
23 Correct 10 ms 604 KB Output is correct
24 Correct 9 ms 604 KB Output is correct
25 Correct 10 ms 604 KB Output is correct
26 Correct 46 ms 604 KB Output is correct
27 Correct 50 ms 860 KB Output is correct
28 Correct 883 ms 2652 KB Output is correct
29 Correct 903 ms 3156 KB Output is correct
30 Execution timed out 1060 ms 5464 KB Time limit exceeded
31 Halted 0 ms 0 KB -