oj.uz

Submission #722781

# Submission time Handle Problem Language Result Execution time Memory
722781 2023-04-12T20:31:18 Z Mr_Husanboy Distributing Candies (IOI21_candies) C++17
100 / 100
 1457 ms 55248 KB 
#include "candies.h"
#include <bits/stdc++.h>
 
using namespace std;
using ll = long long;
template<typename T>
int len(T &a){
    return a.size();
}
 
const ll infl = 1e18;
 
// struct Segtree{
//     struct node{
//         ll mx = 0, mn = 0, add = 0;
//         void apply(ll x){
//             mn += x; mx += x;
//             add += x;
//         }
//     };
 
//     vector<node> t;
//     int n;
 
//     Segtree(int _n){
//         n = _n;
//         t.resize(4 * n);
//     }
 
//     void push(int x){
//         if(t[x].add){
//             t[x << 1].apply(t[x].add);
//             t[x << 1 | 1].apply(t[x].add);
//             t[x].add = 0;
//         }
//     }
 
//     node merge(node a, node b){
//         return {max(a.mx, b.mx), min(a.mn, b.mn), 0ll};
//     }
 
//     void upd(int x, int lx, int rx, int l, int r, ll val){
//         if(l <= lx && rx <= r){
//             t[x].apply(val);
//             return;
//         }
//         if(r < lx || l > rx){
//             return;
//         }
//         int m = (rx + lx) >> 1;
//         push(x);
//         upd(x << 1, lx, m, l, r, val);
//         upd(x << 1 | 1, m + 1, rx, l, r, val);
//         t[x] = merge(t[x << 1], t[x << 1 | 1]);
//     }
 
//     node get(int x, int lx, int rx, int l, int r){
//         if(l <= lx && rx <= r){
//             return t[x];
//         }
//         if(r < lx || l > rx){
//             return {0,0,0};
//         }
//         push(x);
//         int m = (lx + rx) >> 1;
//         return merge(get(x << 1, lx, m, l, r),
//             get(x << 1 | 1, m + 1, rx, l, r));
//     }
 
//     void upd(int l, int r, ll val){
//         upd(1, 0, n - 1, l, r, val);
//     }
 
//     node get(int l, int r){
//         return get(1, 0, n - 1, l, r);
//     }
// };
 
 
 
struct SegmentTree{
 
    //To change
    struct Node{
        //defaults
        ll mn = 0, mx = 0, add = 0, sum = 0; bool marked = false;
        void apply(ll val){
            sum += val;
            mn += val;
            mx += val;
            add += val;
            marked = true;
        }
    };
 
    void push(ll x){
        if(t[x].marked){
                t[x << 1].apply(t[x].add);
                t[x << 1 | 1].apply(t[x].add);
                t[x].add = 0; t[x].marked = false;
        }
    }
 
    Node merge(Node a, Node b){
        Node res;
        res.mn = min(a.mn, b.mn);
        res.mx = max(a.mx, b.mx);
        res.sum = a.sum + b.sum;
        return res;
    }
    Node neutral;
    vector<Node> t;
    int n;
 
    //construction
 
    void init(int _n){
        n = _n;
        t.assign(4 * n, neutral);
    }
 
    void build(vector<int> &a, int x, int lx, int rx){
        if(lx == rx){
            t[x].mn = a[lx];
            return;
        }
        int mx = (lx + rx) >> 1;
        build(a, x << 1, lx, mx);
        build(a, x << 1 | 1, mx + 1, rx);
        t[x] = merge(t[x << 1], t[x << 1 | 1]);
    }
 
    void upd(int x, int lx, int rx, int l, int r, ll val){
        if(rx < l || r < lx) return;
        if(l <= lx && rx <= r){
            t[x].apply(val); return;
        }
        push(x);
        int mx = (lx + rx) >> 1;
        upd(x << 1, lx, mx, l, r, val);
        upd(x << 1 | 1, mx + 1, rx, l, r, val);
        t[x] = merge(t[x << 1], t[x << 1 | 1]);
    }
 
    Node get(int x, int lx, int rx, int l, int r){
        if(rx < l || r < lx){
            return neutral;
        }
        if(l <= lx && rx <= r){
            return t[x];
        }
        push(x);
        int mx = (lx + rx) >> 1;
        return merge(get(x << 1, lx, mx, l, r), 
            get(x << 1 | 1, mx + 1, rx, l, r));
    }
 
    // lessen
 
    void build(vector<int> &a){
        int sz = len(a);
        init(sz);
        build(a, 1, 0, n - 1);
    }
 
    void upd(int l, int r, ll val){
        upd(1, 0, n - 1, l, r, val);
    }
 
    Node get(int l, int r){
        return get(1, 0, n - 1, l, r);
    }
};
 
 
 
vector<int> distribute_candies(vector<int> c, vector<int> l,
                                    vector<int> r, vector<int> v) {
    #define int long long
    int n = c.size();
    int m = len(v);
    SegmentTree t;
    t.init(m + 1);
    vector<vector<int>> in(n), out(n);
    for(int i = 0; i < m; i ++){
        in[l[i]].push_back(i);
        out[r[i]].push_back(i);
    }
    for(int i = 0; i < n; i ++){
        for(auto u : in[i]){
            t.upd(0, u, -v[u]);
        }
        int l = 0, r = m;
        while(l <= r){
            int mid = (l + r) >> 1;
            auto res = t.get(mid, m);
            if(res.mx - res.mn > c[i]){
                l = mid + 1;
            }else r = mid - 1;
        }
        // r ++;
        // cout << r << ": " << ' ';
        // for(int j = 0; j <= m; j ++){
        //     cout << t.get(j, j).sum << ' ';
        // }cout << endl;
        r ++;
        if(r == 0 || t.get(r - 1, r - 1).sum > 0){
            c[i] = -t.get(r, m).mn;
        }else{
            c[i] = c[i] - t.get(r, m).mx;
        }
 
        for(auto u : out[i]){
            t.upd(0, u, v[u]);
        }
    }
    //for(auto u : suf) cout << u << ' ';cout << endl;
    return c;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 6 ms 852 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1333 ms 55216 KB Output is correct
2 Correct 1457 ms 55244 KB Output is correct
3 Correct 1418 ms 55212 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 342 ms 42088 KB Output is correct
3 Correct 355 ms 11724 KB Output is correct
4 Correct 1382 ms 55200 KB Output is correct
5 Correct 1305 ms 55204 KB Output is correct
6 Correct 1308 ms 55248 KB Output is correct
7 Correct 1323 ms 55216 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 175 ms 39824 KB Output is correct
4 Correct 332 ms 11580 KB Output is correct
5 Correct 979 ms 50640 KB Output is correct
6 Correct 1016 ms 50632 KB Output is correct
7 Correct 1044 ms 50632 KB Output is correct
8 Correct 1014 ms 50636 KB Output is correct
9 Correct 1053 ms 50632 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 724 KB Output is correct
4 Correct 2 ms 724 KB Output is correct
5 Correct 6 ms 852 KB Output is correct
6 Correct 1333 ms 55216 KB Output is correct
7 Correct 1457 ms 55244 KB Output is correct
8 Correct 1418 ms 55212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 342 ms 42088 KB Output is correct
11 Correct 355 ms 11724 KB Output is correct
12 Correct 1382 ms 55200 KB Output is correct
13 Correct 1305 ms 55204 KB Output is correct
14 Correct 1308 ms 55248 KB Output is correct
15 Correct 1323 ms 55216 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 175 ms 39824 KB Output is correct
19 Correct 332 ms 11580 KB Output is correct
20 Correct 979 ms 50640 KB Output is correct
21 Correct 1016 ms 50632 KB Output is correct
22 Correct 1044 ms 50632 KB Output is correct
23 Correct 1014 ms 50636 KB Output is correct
24 Correct 1053 ms 50632 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 315 ms 11740 KB Output is correct
27 Correct 296 ms 41996 KB Output is correct
28 Correct 1350 ms 55244 KB Output is correct
29 Correct 1284 ms 55224 KB Output is correct
30 Correct 1326 ms 55212 KB Output is correct
31 Correct 1304 ms 55244 KB Output is correct
32 Correct 1348 ms 55224 KB Output is correct