oj.uz

Submission #971258

# Submission time Handle Problem Language Result Execution time Memory
971258 2024-04-28T09:17:38 Z saidpon Divide and conquer (IZhO14_divide) C++14
17 / 100
 1000 ms 4700 KB 
#include <bits/stdc++.h>
#define ordered_set tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update>
#define nemeshay ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define allr(pon) pon.rbegin(), pon.rend()
#include <ext/pb_ds/assoc_container.hpp>
#define all(pon) pon.begin(), pon.end()
#include <ext/pb_ds/tree_policy.hpp>
#define pii pair <int, int>
#define nosolve puts("-1")
#define YES puts("YES")
#define pf push_front
#define int long long
#define OK puts("OK")
#define NO puts("NO")
#define pb push_back
#define sigma signed
#define sc second
#define fr first
using namespace __gnu_pbds;
using namespace std;
const int N = 1e6 + 20, INF = 2e9 + 7;
int a[N], b[N], c[N];
sigma main(){
    nemeshay
    map <int, int> pon;
    int n, ans = 0;
    cin >> n;
    for (int i = 0; i < n; i++){
        cin >> a[i] >> b[i] >> c[i];
    }
    for (int i = 0; i < n; i++){
        for (int j = i; j < n; j++){
            int e = 0, g = 0, l = a[j] - a[i];
            for (int k = i; k <= j; k++){
                g += b[k];
                e += c[k];
            }
            if (e >= l) ans = max(g, ans);
        }
    }
    cout << ans;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4564 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 10 ms 4444 KB Output is correct
16 Correct 27 ms 4444 KB Output is correct
17 Correct 51 ms 4444 KB Output is correct
18 Correct 118 ms 4596 KB Output is correct
19 Correct 69 ms 4440 KB Output is correct
20 Correct 70 ms 4444 KB Output is correct
21 Correct 237 ms 4596 KB Output is correct
22 Correct 549 ms 4588 KB Output is correct
23 Execution timed out 1047 ms 4700 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4564 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4444 KB Output is correct
10 Correct 1 ms 4572 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4444 KB Output is correct
13 Correct 2 ms 4696 KB Output is correct
14 Correct 2 ms 4444 KB Output is correct
15 Correct 10 ms 4444 KB Output is correct
16 Correct 27 ms 4444 KB Output is correct
17 Correct 51 ms 4444 KB Output is correct
18 Correct 118 ms 4596 KB Output is correct
19 Correct 69 ms 4440 KB Output is correct
20 Correct 70 ms 4444 KB Output is correct
21 Correct 237 ms 4596 KB Output is correct
22 Correct 549 ms 4588 KB Output is correct
23 Execution timed out 1047 ms 4700 KB Time limit exceeded
24 Halted 0 ms 0 KB -