oj.uz

답안 #553812

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553812 2022-04-27T06:37:50 Z topovik 사탕 분배 (IOI21_candies) C++17
100 / 100
 1856 ms 50764 KB 
#include <bits/stdc++.h>
#include "candies.h"
#define pb push_back
#define f first
#define s second
#define pi acos(-1)

using namespace std;

typedef long long ll;
typedef long double ld;

const ll oo = 1e18;
const ld eps = (ld)1 / oo;
const ll N = 2e5 + 100;
const ll M = 1e6;

struct tree
{
    tree *L = NULL;
    tree *R = NULL;
    int l;
    int r;
    int mdl;
    ll lb = 0;
    ll mn = 0;
    ll mx = 0;

    tree (int _l, int _r) : l(_l), r(_r)
    {
        mdl = (l + r) >> 1;
        if (l == r) return;
        L = new tree(l, mdl);
        R = new tree(mdl + 1, r);
    }

    void push()
    {
        if (lb != 0)
        {
            mx += lb;
            mn += lb;
            if (l != r)
            {
                L -> lb += lb;
                R -> lb += lb;
            }
            lb = 0;
        }
    }

    void upd(int _l, int _r, int _vl)
    {
        push();
        if (_l > _r) return ;
        if (_l == l && _r == r)
        {
            lb += _vl;
            push();
            return;
        }
        L -> upd(_l, min(mdl, _r), _vl);
        R -> upd(max(mdl + 1, _l), _r, _vl);
        mn = min(L -> mn, R -> mn);
        mx = max(L -> mx, R -> mx);
    }

    ll calc_mx(int _l, int _r)
    {
        push();
        if (_l > _r) return -oo;
        if (_l == l && _r == r) return mx;
        return max(L -> calc_mx(_l, min(mdl, _r)), R -> calc_mx(max(mdl + 1, _l), _r));
    }

    ll calc_mn(int _l, int _r)
    {
        push();
        if (_l > _r) return oo;
        if (_l == l && _r == r) return mn;
        return min(L -> calc_mn(_l, min(mdl, _r)), R -> calc_mn(max(mdl + 1, _l), _r));
    }

};

std::vector<int> distribute_candies (std::vector<int> c, std::vector<int> l,
                                     std::vector<int> r, std::vector<int> v) {
    int n = c.size();
    int q = l.size();
    vector <pair<int, int> > event[n + 1];
    for (int i = 0; i < q; i++)
    {
        event[l[i]].pb({i + 1, v[i]});
        event[r[i] + 1].pb({i + 1, -v[i]});
    }
    tree *root = new tree(0, q);
    vector <int> ans(n);
    for (int i = 0; i < n; i++)
    {
        for (auto j : event[i]) root -> upd(j.f, q, j.s);
        int l = 0, r = q;
        while (l < r)
        {
            int mdl = (l + r + 1) >> 1;
            if (root -> calc_mx(mdl, q) - root -> calc_mn(mdl, q) < c[i]) r = mdl - 1;
            else l = mdl;
        }
        ll mx = root -> calc_mx(l, q);
        ll mn = root -> calc_mn(l, q);
        if (mx - mn <= c[i])
        {
            ans[i] = root -> calc_mx(q, q) - mn;
            continue;
        }
        else
        {
            ll mx1 = root -> calc_mx(l + 1, q);
            ll mn1 = root -> calc_mn(l + 1, q);
            if (mn < mn1) mn1 = mx1 - c[i];
            ans[i] = root -> calc_mx(q, q) - mn1;
        }
    }
    return ans;
}

//int main()
//{
//    int n;
//    cin >> n;
//    vector <int> a(n);
//    for (int i = 0; i < n; i++) cin >> a[i];
//    int q;
//    cin >> q;
//    vector <int> l(q), r(q), v(q);
//    for (int i = 0; i < q; i++) cin >> l[i] >> r[i] >> v[i];
//    vector <int> ans = distribute_candies(a, l, r, v);
//    for (auto i : ans) cout << i << " ";
//}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 7 ms 732 KB Output is correct

Subtask #2
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1778 ms 44128 KB Output is correct
2 Correct 1823 ms 48196 KB Output is correct
3 Correct 1856 ms 48024 KB Output is correct

Subtask #3
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 360 ms 34196 KB Output is correct
3 Correct 349 ms 8892 KB Output is correct
4 Correct 1405 ms 44116 KB Output is correct
5 Correct 1598 ms 50428 KB Output is correct
6 Correct 1528 ms 50764 KB Output is correct
7 Correct 1576 ms 50208 KB Output is correct

Subtask #4
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 130 ms 33148 KB Output is correct
4 Correct 310 ms 7796 KB Output is correct
5 Correct 1018 ms 40244 KB Output is correct
6 Correct 995 ms 44464 KB Output is correct
7 Correct 901 ms 45008 KB Output is correct
8 Correct 1032 ms 43640 KB Output is correct
9 Correct 942 ms 45120 KB Output is correct

Subtask #5
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 2 ms 596 KB Output is correct
4 Correct 2 ms 596 KB Output is correct
5 Correct 7 ms 732 KB Output is correct
6 Correct 1778 ms 44128 KB Output is correct
7 Correct 1823 ms 48196 KB Output is correct
8 Correct 1856 ms 48024 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 360 ms 34196 KB Output is correct
11 Correct 349 ms 8892 KB Output is correct
12 Correct 1405 ms 44116 KB Output is correct
13 Correct 1598 ms 50428 KB Output is correct
14 Correct 1528 ms 50764 KB Output is correct
15 Correct 1576 ms 50208 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 130 ms 33148 KB Output is correct
19 Correct 310 ms 7796 KB Output is correct
20 Correct 1018 ms 40244 KB Output is correct
21 Correct 995 ms 44464 KB Output is correct
22 Correct 901 ms 45008 KB Output is correct
23 Correct 1032 ms 43640 KB Output is correct
24 Correct 942 ms 45120 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 317 ms 8968 KB Output is correct
27 Correct 362 ms 36812 KB Output is correct
28 Correct 1603 ms 48680 KB Output is correct
29 Correct 1712 ms 48944 KB Output is correct
30 Correct 1754 ms 49368 KB Output is correct
31 Correct 1615 ms 49452 KB Output is correct
32 Correct 1537 ms 49740 KB Output is correct