oj.uz

Submission #831512

# Submission time Handle Problem Language Result Execution time Memory
831512 2023-08-20T10:02:51 Z Cookie Divide and conquer (IZhO14_divide) C++14
100 / 100
 41 ms 7624 KB 
#include<bits/stdc++.h>
#include<fstream>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
//ifstream fin("FEEDING.INP");
//ofstream fout("FEEDING.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const int base = 74;
const int mxn = 2e5 + 5;
const ll inf = 1e18;
struct Cool{
    int x, g, d;
    bool operator <(const Cool &b){
        return(x < b.x);
    }
};
int n;
vt<ll>comp;
Cool a[mxn + 1];
ll bit[mxn + 1], prefd[mxn + 1], prefg[mxn + 1];
void upd(int p, ll v){
    while(p <= sz(comp)){
        bit[p] = min(bit[p], v);
        p += p & (-p);
    }
}
ll get(int p){
    ll ans = inf;
    while(p){
        ans = min(ans, bit[p]);
        p -= p & (-p);
    }
    return(ans);
}

int find(ll x){
    return(lower_bound(comp.begin(), comp.end(), x) - comp.begin() + 1);
}
signed main()
{
     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i].x >> a[i].g >> a[i].d;
    }
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; i++){
        prefd[i] = prefd[i - 1] + a[i].d;
        prefg[i] = prefg[i - 1] + a[i].g;
        comp.pb(prefd[i - 1] - a[i].x);
    }
    sort(comp.begin(), comp.end());
    for(int i = 1; i <= sz(comp); i++)bit[i] = inf;
    upd(find(prefd[0] - a[1].x), 0);
    ll ans = 0;
    for(int i = 1; i <= n; i++){
        ll need = prefd[i] - a[i].x;
        ans = max(ans, prefg[i] - get(find(need + 1) - 1));
        upd(find(prefd[i] - a[i + 1].x), prefg[i]);
    }
    cout << ans;
    return(0);
}

Subtask #1
17.0 / 17.0

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

Subtask #2
31.0 / 31.0

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

Subtask #3
52.0 / 52.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 328 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 328 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 376 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 472 KB Output is correct
23 Correct 3 ms 724 KB Output is correct
24 Correct 2 ms 724 KB Output is correct
25 Correct 2 ms 596 KB Output is correct
26 Correct 4 ms 984 KB Output is correct
27 Correct 4 ms 980 KB Output is correct
28 Correct 19 ms 3588 KB Output is correct
29 Correct 20 ms 3872 KB Output is correct
30 Correct 41 ms 7624 KB Output is correct
31 Correct 36 ms 6412 KB Output is correct
32 Correct 40 ms 6608 KB Output is correct
33 Correct 35 ms 6348 KB Output is correct
34 Correct 36 ms 6352 KB Output is correct
35 Correct 36 ms 6852 KB Output is correct
36 Correct 38 ms 7024 KB Output is correct