oj.uz

Submission #1051976

# Submission time Handle Problem Language Result Execution time Memory
1051976 2024-08-10T10:51:53 Z vjudge1 Divide and conquer (IZhO14_divide) C++17
48 / 100
 19 ms 4288 KB 
#include <bits/stdc++.h>
using namespace std;

#define SPEED ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define str string
#define pb push_back
#define pf push_front
#define nl "\n"
#define ll long long
#define int long long
#define all(v) (v).begin() , (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define ff first
#define ss second
#define len(a) a.size()
#define pii pair<int,int>
const int N = 100000 + 4;
const ll md = 998244353;
const ll mod = 1e9 + 7;
const ll mega = 1e6 + 3;
const ll inf = 100100;
int x[N] , g[N] , d[N] , pref[N] , pref2[N] ,n , ans , mx;
void add(int l){
    ans += d[l];
}
void del(int l){
    ans -= d[l];
}
void solve() {
    cin >> n;
    for(int i = 1; i <= n; ++i){
        cin >> x[i] >> g[i] >> d[i];
        pref[i] = pref[i - 1] + d[i];
        pref2[i] = pref2[i - 1] + g[i];
    }
    int mx = 0;
    if(n <= 5000){
        for(int i = 1; i <= n; ++i){
            for(int j = i; j <= n; ++j){
                if(x[j] - x[i] <= pref[j] - pref[i - 1]){
                    mx = max(mx , pref2[j] - pref2[i - 1]);
                }
            }
        }
        cout << mx;
    }
    else{
        for(int i = 1; i <= n; ++i){
            int l = i , r = n;
            while(l <= r){
                int m = (l + r) / 2;
                if(pref[m] - pref[i - 1] >= x[m] - x[i]){
                    l = m + 1;
                    mx = max(mx , pref2[m] - pref2[i - 1]);
                }
                else{
                    r = m - 1;
                }
            }
        }
        cout << mx;
    }
}
signed main() {
    SPEED;
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
    // #ifndef ONLINE_JUDGE
    // cerr << "\n" << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
    // #endif
    // return 0;
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 0 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 0 ms 2396 KB Output is correct
6 Correct 0 ms 2396 KB Output is correct
7 Correct 0 ms 2396 KB Output is correct
8 Correct 0 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 0 ms 2396 KB Output is correct
11 Correct 0 ms 2396 KB Output is correct
12 Correct 0 ms 2396 KB Output is correct
13 Correct 0 ms 2396 KB Output is correct
14 Correct 0 ms 2396 KB Output is correct
15 Correct 0 ms 2396 KB Output is correct
16 Correct 0 ms 2396 KB Output is correct
17 Correct 1 ms 2396 KB Output is correct
18 Correct 1 ms 2396 KB Output is correct
19 Correct 1 ms 2396 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 1 ms 2396 KB Output is correct
22 Correct 2 ms 2396 KB Output is correct
23 Correct 13 ms 2652 KB Output is correct
24 Correct 8 ms 2652 KB Output is correct
25 Correct 9 ms 2392 KB Output is correct
26 Correct 2 ms 2652 KB Output is correct
27 Correct 2 ms 2620 KB Output is correct
28 Correct 8 ms 3416 KB Output is correct
29 Correct 9 ms 3420 KB Output is correct
30 Correct 19 ms 4188 KB Output is correct
31 Correct 14 ms 4192 KB Output is correct
32 Correct 14 ms 4120 KB Output is correct
33 Correct 13 ms 4156 KB Output is correct
34 Incorrect 19 ms 4288 KB Output isn't correct
35 Halted 0 ms 0 KB -