oj.uz

Submission #337852

# Submission time Handle Problem Language Result Execution time Memory
337852 2020-12-22T03:29:35 Z Dilshod_Imomov Divide and conquer (IZhO14_divide) C++17
48 / 100
 1000 ms 2412 KB 
# include <bits/stdc++.h>
# define speed ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
# define int long long
# define fi first
# define se second

using namespace std;

const int N = 1e6 + 7;
const int mod = 1e9 + 7;

int x[N], g[N], d[N], psg[N], psd[N];

int32_t main() {
    speed;
    int n;
    cin >> n;
    for ( int i = 1; i <= n; i++ ) {
        cin >> x[i] >> g[i] >> d[i];
        psg[i] = psg[i - 1] + g[i];
        psd[i] = psd[i - 1] + d[i];
    }
    int ans = 0;
    for ( int i = 1; i <= n; i++ ) {
        for ( int j = i; j > 0; j-- ) {
            if ( x[i] - x[j] <= psd[i] - psd[j - 1] ) {
                ans = max( ans, psg[i] - psg[j - 1] );
            }
        }
    }
    cout << ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 412 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 492 KB Output is correct
22 Correct 4 ms 492 KB Output is correct
23 Correct 21 ms 620 KB Output is correct
24 Correct 21 ms 620 KB Output is correct

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 412 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 2 ms 492 KB Output is correct
18 Correct 2 ms 364 KB Output is correct
19 Correct 1 ms 364 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 492 KB Output is correct
22 Correct 4 ms 492 KB Output is correct
23 Correct 21 ms 620 KB Output is correct
24 Correct 21 ms 620 KB Output is correct
25 Correct 17 ms 620 KB Output is correct
26 Correct 69 ms 876 KB Output is correct
27 Correct 66 ms 748 KB Output is correct
28 Execution timed out 1088 ms 2412 KB Time limit exceeded
29 Halted 0 ms 0 KB -