oj.uz

Submission #444391

# Submission time Handle Problem Language Result Execution time Memory
444391 2021-07-14T00:22:35 Z JvThunder Distributing Candies (IOI21_candies) C++17
100 / 100
 1345 ms 48292 KB 
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
 
const int MAXQ = 1000005;
const ll INF = (ll)(1e18);
 
struct SegmentTree 
{
    int n;
    ll vmin[MAXQ] = {0};
    ll vmax[MAXQ] = {0};
    ll lazy[MAXQ] = {0};
 
    void init(int _n) { n = _n; }
 
    void lazy_update(int node, int from, int to)
    {
        vmin[node] += lazy[node]; vmax[node] += lazy[node];
        if (from < to) 
        {
            lazy[2*node] += lazy[node];
            lazy[2*node+1] += lazy[node];
        }
        lazy[node] = 0;
    }
 
    void update(int node, int from, int to, int L, int R, int add)
    {
        lazy_update(node, from, to);
        if (from > R || to < L) return;
        if (L <= from && to <= R) {
            lazy[node] += add;
            lazy_update(node, from, to);
            return;
        }
        int mid = (from + to) / 2;
        update(node * 2, from, mid, L, R, add);
        update(node * 2 + 1, mid + 1, to, L, R, add);
        vmin[node] = min(vmin[node * 2], vmin[node * 2 + 1]);
        vmax[node] = max(vmax[node * 2], vmax[node * 2 + 1]);
    }
 
    ll get(int node, int from, int to, int lowerbound) 
    {
        lazy_update(node, from, to);
        if (from == to) return vmin[node];
        int mid = (from + to) / 2;
        if (vmax[node * 2 + 1] + lazy[node * 2 + 1] >= lowerbound)
            return get(node * 2 + 1, mid + 1, to, lowerbound);
        return min( vmin[node * 2 + 1] + lazy[node * 2 + 1], get(node * 2, from, mid, lowerbound) );
    }
 
    void add_range(int L, int R, int add) 
    {
        update(1, 0, n - 1, L, R, add);
    }
 
    ll min_suffix(int lowerbound) 
    {
        if (vmax[1] < lowerbound) return -INF;
        return min(0LL, get(1, 0, n - 1, lowerbound));
    }
} T;
 
vector<int> distribute_candies(vector<int> C, vector<int> L, vector<int> R, vector<int> V) 
{
    int n = C.size(); int q = L.size();
    vector<int> A(n);
    
    vector<vector<int>> begin_at(n,vector<int>()), end_at(n,vector<int>());
    for(int i=0;i<q;i++) 
    {
        begin_at[L[i]].push_back(i);
        end_at[R[i]].push_back(i);
    }
 
    T.init(q+1);
    vector<int> final_A(n);
    for(int i=0;i<n;i++)
    {
        if (i>0) 
        {
            T.add_range(0,0,-A[i-1]);
            for(int j:end_at[i-1]) T.add_range(0,1+j,-V[j]);
        }
        T.add_range(0,0,A[i]);
        for(int j : begin_at[i]) T.add_range(0,1+j,V[j]);
 
        int low = 1, high = C[i] + 1;
        while (low <= high) 
        {
            int mid = (low + high) / 2;
            ll smin = T.min_suffix(mid);
            if (-smin + mid > C[i]) high = mid - 1;
            else low = mid + 1;
        }
        final_A[i] = high;
    }
 
    return final_A;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23752 KB Output is correct
2 Correct 12 ms 23696 KB Output is correct
3 Correct 13 ms 23844 KB Output is correct
4 Correct 14 ms 23800 KB Output is correct
5 Correct 16 ms 24016 KB Output is correct

Subtask #2
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1114 ms 48196 KB Output is correct
2 Correct 1108 ms 48208 KB Output is correct
3 Correct 1110 ms 48068 KB Output is correct

Subtask #3
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23720 KB Output is correct
2 Correct 354 ms 31436 KB Output is correct
3 Correct 511 ms 36476 KB Output is correct
4 Correct 1345 ms 48192 KB Output is correct
5 Correct 1286 ms 48200 KB Output is correct
6 Correct 1329 ms 48196 KB Output is correct
7 Correct 748 ms 48120 KB Output is correct

Subtask #4
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 149 ms 30384 KB Output is correct
4 Correct 262 ms 36336 KB Output is correct
5 Correct 553 ms 42888 KB Output is correct
6 Correct 596 ms 42808 KB Output is correct
7 Correct 700 ms 42808 KB Output is correct
8 Correct 533 ms 42804 KB Output is correct
9 Correct 1072 ms 42828 KB Output is correct

Subtask #5
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23752 KB Output is correct
2 Correct 12 ms 23696 KB Output is correct
3 Correct 13 ms 23844 KB Output is correct
4 Correct 14 ms 23800 KB Output is correct
5 Correct 16 ms 24016 KB Output is correct
6 Correct 1114 ms 48196 KB Output is correct
7 Correct 1108 ms 48208 KB Output is correct
8 Correct 1110 ms 48068 KB Output is correct
9 Correct 12 ms 23720 KB Output is correct
10 Correct 354 ms 31436 KB Output is correct
11 Correct 511 ms 36476 KB Output is correct
12 Correct 1345 ms 48192 KB Output is correct
13 Correct 1286 ms 48200 KB Output is correct
14 Correct 1329 ms 48196 KB Output is correct
15 Correct 748 ms 48120 KB Output is correct
16 Correct 12 ms 23756 KB Output is correct
17 Correct 13 ms 23756 KB Output is correct
18 Correct 149 ms 30384 KB Output is correct
19 Correct 262 ms 36336 KB Output is correct
20 Correct 553 ms 42888 KB Output is correct
21 Correct 596 ms 42808 KB Output is correct
22 Correct 700 ms 42808 KB Output is correct
23 Correct 533 ms 42804 KB Output is correct
24 Correct 1072 ms 42828 KB Output is correct
25 Correct 12 ms 23708 KB Output is correct
26 Correct 229 ms 36596 KB Output is correct
27 Correct 344 ms 31520 KB Output is correct
28 Correct 909 ms 48292 KB Output is correct
29 Correct 977 ms 48200 KB Output is correct
30 Correct 997 ms 48232 KB Output is correct
31 Correct 1044 ms 48192 KB Output is correct
32 Correct 1095 ms 48220 KB Output is correct