oj.uz

Submission #236314

# Submission time Handle Problem Language Result Execution time Memory
236314 2020-06-01T09:32:39 Z lyc Meetings (IOI18_meetings) C++14
100 / 100
 2423 ms 415380 KB 
#include "meetings.h"
#include <bits/stdc++.h>
using namespace std;

#define TRACE(x) cout << #x << " :: " << x << endl;
#define _ << " " <<
#define FOR(i,a,b) for(int i=(a);i<=(b);++i)
#define RFOR(i,a,b) for(int i=(a);i>=(b);--i)
#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()
typedef long long ll;

const int mxN = 750005;
const int lgN = 19;
const int mxQ = 750005;
int N, Q;
vector<int> H;
struct SparseTable {
    int A[mxN][lgN+1];
    void init(vector<int>& H) {
        FOR(i,0,N-1){ A[i][0] = i; }
        FOR(k,1,lgN){
            FOR(i,0,N-(1<<k)){
                int p = A[i][k-1], q = A[i+(1<<(k-1))][k-1];
                A[i][k] = (H[p] > H[q] ? p : q);
            }
        }
    }
    int query(int l, int r) {
        int k = floor(log2(r-l+1));
        int i = A[l][k], j = A[r-(1<<k)+1][k];
        return H[i] > H[j] ? i : j;
    }
} st;
struct Query { int l, r, i; }; vector<Query> query[mxN];
vector<ll> ans;
ll f(int x, ll m, ll c) { return x*m + c; }
struct SegmentTree {
    ll vl[4*mxN], vr[4*mxN], tagM[4*mxN], tagC[4*mxN], add[4*mxN]; bool tag[4*mxN];
    int n;
    void build(int _n) {
        n = _n;
        //fill_n(D,4*n,(Node){0,0,0,0,0,0});
    }
    void replace(int s, int e, int p, ll m, ll c) {
        vl[p] = f(s,m,c);
        vr[p] = f(e,m,c);
        tagM[p] = m;
        tagC[p] = c;
        add[p] = 0;
        tag[p] = true;
    }
    void addTo(int p, ll v) {
        vl[p] += v;
        vr[p] += v;
        add[p] += v;
    }
    void prop(int s, int e, int p) {
        if (tag[p]) {
            if (s != e) {
                int mid = (s+e)/2;
                replace(s,mid,p<<1,tagM[p],tagC[p]);
                replace(mid+1,e,p<<1|1,tagM[p],tagC[p]);
            }
            tag[p] = false;
        }
        if (add[p]) {
            if (s != e) {
                addTo(p<<1,add[p]);
                addTo(p<<1|1,add[p]);
            }
            add[p] = 0;
        }
    }
    void update(int s, int e, int p, int x, int y, ll m, ll c, ll v) {
        if (x > y) return;
        if (s >= x && e <= y) {
            if (f(s,m,c) <= vl[p] + v && f(e,m,c) <= vr[p] + v) return replace(s,e,p,m,c);
            if (vl[p] + v < f(s,m,c) && vr[p] + v < f(e,m,c)) return addTo(p,v);
        }
        int mid = (s+e)/2;
        assert(s != e);
        prop(s,e,p);
        if (mid >= x) update(s,mid,p<<1,x,y,m,c,v);
        if (mid < y) update(mid+1,e,p<<1|1,x,y,m,c,v);
        vl[p] = vl[p<<1];
        vr[p] = vr[p<<1|1];
    }
    inline void update(int x, int y, ll m, ll c, ll v) { return update(0,N-1,1,x,y,m,c,v); }
    ll query(int s, int e, int p, int x) {
        if (s == e) {
            return vl[p];
        } else {
            int mid = (s+e)/2;
            prop(s,e,p);
            if (x <= mid) return query(s,mid,p<<1,x);
            else return query(mid+1,e,p<<1|1,x);
        }
    }
    inline ll query(int x) { return query(0,N-1,1,x); }
} fixr, fixl;

void solve(int l, int r) {
    if (l > r) return;
    int p = st.query(l,r);
    solve(l,p-1);
    solve(p+1,r);
    for (Query q : query[p]) {
        ans[q.i] = (ll) (q.r-q.l+1) * H[p];
        if (q.l < p) ans[q.i] = min(ans[q.i], fixr.query(q.l) + (ll) (q.r-p+1) * H[p]);
        if (q.r > p) ans[q.i] = min(ans[q.i], fixl.query(q.r) + (ll) (p-q.l+1) * H[p]);
    }
    // f(l,p-1) + (i-p+1) * H[p]
    // f(p+1,i) + (p-l+1) * H[p]
    ll lv = (p > l ? fixl.query(p-1) : 0);
    fixl.update(p,r, H[p], lv+(ll)(-p+1)*H[p], (ll)(p-l+1)*H[p]);
    // f(p+1,r) + (p-i+1) * H[p]
    // f(i,p-1) + (r-p+1) * H[p]
    ll rv = (p < r ? fixr.query(p+1) : 0);
    fixr.update(l,p, -H[p], rv+(ll)(p+1)*H[p], (ll)(r-p+1)*H[p]);
}

std::vector<long long> minimum_costs(std::vector<int> _H, std::vector<int> L,
        std::vector<int> R) {
    H = _H;
    N = SZ(H);
    Q = SZ(L);

    st.init(H);

    FOR(i,0,Q-1){
        int p = st.query(L[i],R[i]);
        query[p].push_back({L[i],R[i],i});
    }

    ans.assign(Q,0);
    fixl.build(N);
    fixr.build(N);
    solve(0,N-1);

    return ans;
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18048 KB Output is correct
2 Correct 17 ms 19040 KB Output is correct
3 Correct 17 ms 18944 KB Output is correct
4 Correct 18 ms 18944 KB Output is correct
5 Correct 17 ms 18944 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 17 ms 18944 KB Output is correct
8 Correct 18 ms 19328 KB Output is correct
9 Correct 17 ms 19200 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18048 KB Output is correct
2 Correct 17 ms 19040 KB Output is correct
3 Correct 17 ms 18944 KB Output is correct
4 Correct 18 ms 18944 KB Output is correct
5 Correct 17 ms 18944 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 17 ms 18944 KB Output is correct
8 Correct 18 ms 19328 KB Output is correct
9 Correct 17 ms 19200 KB Output is correct
10 Correct 23 ms 20224 KB Output is correct
11 Correct 22 ms 20224 KB Output is correct
12 Correct 23 ms 20224 KB Output is correct
13 Correct 22 ms 20216 KB Output is correct
14 Correct 23 ms 20608 KB Output is correct
15 Correct 23 ms 20224 KB Output is correct

Subtask #3
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18048 KB Output is correct
2 Correct 59 ms 23928 KB Output is correct
3 Correct 242 ms 62816 KB Output is correct
4 Correct 216 ms 55160 KB Output is correct
5 Correct 206 ms 63864 KB Output is correct
6 Correct 228 ms 64376 KB Output is correct
7 Correct 246 ms 65460 KB Output is correct

Subtask #4
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18048 KB Output is correct
2 Correct 59 ms 23928 KB Output is correct
3 Correct 242 ms 62816 KB Output is correct
4 Correct 216 ms 55160 KB Output is correct
5 Correct 206 ms 63864 KB Output is correct
6 Correct 228 ms 64376 KB Output is correct
7 Correct 246 ms 65460 KB Output is correct
8 Correct 228 ms 55928 KB Output is correct
9 Correct 175 ms 55384 KB Output is correct
10 Correct 203 ms 55928 KB Output is correct
11 Correct 220 ms 54904 KB Output is correct
12 Correct 178 ms 54896 KB Output is correct
13 Correct 196 ms 55288 KB Output is correct
14 Correct 235 ms 61432 KB Output is correct
15 Correct 205 ms 54704 KB Output is correct
16 Correct 238 ms 62200 KB Output is correct

Subtask #5
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 18048 KB Output is correct
2 Correct 17 ms 19040 KB Output is correct
3 Correct 17 ms 18944 KB Output is correct
4 Correct 18 ms 18944 KB Output is correct
5 Correct 17 ms 18944 KB Output is correct
6 Correct 17 ms 19200 KB Output is correct
7 Correct 17 ms 18944 KB Output is correct
8 Correct 18 ms 19328 KB Output is correct
9 Correct 17 ms 19200 KB Output is correct
10 Correct 23 ms 20224 KB Output is correct
11 Correct 22 ms 20224 KB Output is correct
12 Correct 23 ms 20224 KB Output is correct
13 Correct 22 ms 20216 KB Output is correct
14 Correct 23 ms 20608 KB Output is correct
15 Correct 23 ms 20224 KB Output is correct
16 Correct 15 ms 18048 KB Output is correct
17 Correct 59 ms 23928 KB Output is correct
18 Correct 242 ms 62816 KB Output is correct
19 Correct 216 ms 55160 KB Output is correct
20 Correct 206 ms 63864 KB Output is correct
21 Correct 228 ms 64376 KB Output is correct
22 Correct 246 ms 65460 KB Output is correct
23 Correct 228 ms 55928 KB Output is correct
24 Correct 175 ms 55384 KB Output is correct
25 Correct 203 ms 55928 KB Output is correct
26 Correct 220 ms 54904 KB Output is correct
27 Correct 178 ms 54896 KB Output is correct
28 Correct 196 ms 55288 KB Output is correct
29 Correct 235 ms 61432 KB Output is correct
30 Correct 205 ms 54704 KB Output is correct
31 Correct 238 ms 62200 KB Output is correct
32 Correct 1944 ms 309300 KB Output is correct
33 Correct 1460 ms 308196 KB Output is correct
34 Correct 1612 ms 311840 KB Output is correct
35 Correct 1951 ms 311832 KB Output is correct
36 Correct 1439 ms 310252 KB Output is correct
37 Correct 1622 ms 312464 KB Output is correct
38 Correct 2177 ms 366844 KB Output is correct
39 Correct 2388 ms 366820 KB Output is correct
40 Correct 2084 ms 318852 KB Output is correct
41 Correct 2177 ms 412964 KB Output is correct
42 Correct 2387 ms 415248 KB Output is correct
43 Correct 2423 ms 415380 KB Output is correct
44 Correct 2368 ms 368344 KB Output is correct