oj.uz

답안 #261135

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
261135 2020-08-11T12:25:26 Z doowey 별자리 3 (JOI20_constellation3) C++14
100 / 100
 718 ms 72424 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pii;

#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);

const int N = (int)2e5 + 10;

int A[N];
int L[N];
int R[N];
int C[N];
int X[N];
int Y[N];

vector<int> id[N];

map<pii, vector<pii>> cont;
vector<pii> ele[N];

bool comp(pii a, pii b){
    return a.se - a.fi < b.se - b.fi;
}

vector<int> F[N];
int ld[N], rd[N];
int tin[N];
int tout[N];
int ti;

set<int> sg;
int stin[N];


void dfs(int u){
    tin[u]=++ti;
    for(auto x : F[u]){
        dfs(x);
    }
    auto it = sg.lower_bound(ld[u]);
    while(it != sg.end() && (*it) <= rd[u]){
        stin[(*it)] = tin[u];
        it=sg.erase(it);
    }
    tout[u]=ti;
}

ll dp[N];

struct Node{
    ll val;
    ll lazy;
};

Node T[N * 4 + 512];

void push(int node, int cl, int cr){
    T[node].val += T[node].lazy;
    if(cl != cr){
        T[node * 2].lazy += T[node].lazy;
        T[node * 2 + 1].lazy += T[node].lazy;
    }
    T[node].lazy = 0;
}

void upd(int node, int cl, int cr, int tl, int tr, ll x){
    push(node, cl, cr);
    if(cr < tl || cl > tr)
        return;
    if(cl >= tl && cr <= tr){
        T[node].lazy = x;
        push(node, cl, cr);
        return;
    }
    int mid = (cl + cr) / 2;
    upd(node * 2, cl, mid, tl, tr, x);
    upd(node * 2 + 1, mid + 1, cr, tl, tr, x);
}

ll get(int node, int cl, int cr, int pos){
    push(node, cl, cr);
    if(cl == cr)
        return T[node].val;
    int mid = (cl + cr) / 2;
    if(mid >= pos)
        return get(node * 2, cl, mid, pos);
    else
        return get(node * 2 + 1, mid + 1, cr, pos);
}

void dfs1(int u){
    dp[u]=0;
    for(auto x : F[u]){
        dfs1(x);
        dp[u] += dp[x];
    }
    for(auto x : F[u]){
        upd(1, 1, ti, tin[u], tout[u], dp[x]);
        upd(1, 1, ti, tin[x], tout[x], -dp[x]);
    }
    for(auto x : ele[u]){
        dp[u]=max(dp[u], x.fi + get(1, 1, ti, stin[x.se]));
    }
}

int main(){
    fastIO;
    int n;
    cin >> n;
    A[0]=A[n+1]=(int)1e9 + 100;
    for(int i = 1; i <= n ; i ++ )
        cin >> A[i];
    int q;
    cin >> q;
    ll res = 0;
    for(int i = 1; i <= q; i ++ ){
        cin >> X[i] >> Y[i] >> C[i];
        res += C[i];
        id[X[i]].push_back(i);
    }
    vector<int> ids;
    ids.push_back(0);
    int sz;
    int nx;
    for(int i = 1; i <= n; i ++ ){
        while(A[ids.back()] <= A[i]){
            ids.pop_back();
        }
        ids.push_back(i);
        for(auto p : id[i]){
            sz = ids.size();
            for(int lg = 19; lg >= 0; lg -- ){
                nx = (sz - (1 << lg));
                if(nx < 0) continue;
                if(A[ids[nx]] < Y[p]){
                    sz = nx;
                }
            }
            L[p] = ids[sz-1]+1;
        }
    }
    ids.clear();
    ids.push_back(n + 1);
    for(int i = n ; i >= 1; i -- ){
        while(A[ids.back()] <= A[i]){
            ids.pop_back();
        }
        ids.push_back(i);
        for(auto p : id[i]){
            sz = ids.size();
            for(int lg = 19; lg >= 0; lg -- ){
                nx = (sz - (1 << lg));
                if(nx < 0) continue;
                if(A[ids[nx]] < Y[p]){
                    sz = nx;
                }
            }
            R[p] = ids[sz-1]-1;
        }
    }
    vector<pii> segs;
    for(int i = 1; i <= q; i ++ ){
        if(!cont.count(mp(L[i], R[i]))){
            segs.push_back(mp(L[i], R[i]));
        }
        cont[mp(L[i], R[i])].push_back(mp(C[i], X[i]));
    }
    sort(segs.begin(), segs.end(), comp);
    set<pii> ccd;
    int id;
    for(auto v : segs){
        auto it = ccd.lower_bound(mp(v.fi, -1));
        while(it != ccd.end() && it->fi <= v.se){
            F[id].push_back(it->se);
            it=ccd.erase(it);
        }
        ele[id] = cont[mp(v.fi, v.se)];
        ld[id] = v.fi;
        rd[id] = v.se;
        ccd.insert(mp(v.fi, id));
        id ++ ;
    }
    ld[id]=1;
    rd[id]=n;
    for(auto x : ccd){
        F[id].push_back(x.se);
    }
    for(int i = 1; i <= n; i ++ ){
        sg.insert(i);
    }
    dfs(id);
    dfs1(id);
    cout << res - dp[id] << "\n";
    return 0;
}

Compilation message

constellation3.cpp: In function 'int main()':
constellation3.cpp:176:9: warning: 'id' may be used uninitialized in this function [-Wmaybe-uninitialized]
     int id;
         ^~

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14592 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 11 ms 14592 KB Output is correct
4 Correct 10 ms 14592 KB Output is correct
5 Correct 10 ms 14592 KB Output is correct
6 Correct 10 ms 14592 KB Output is correct
7 Correct 9 ms 14592 KB Output is correct
8 Correct 10 ms 14592 KB Output is correct
9 Correct 11 ms 14592 KB Output is correct
10 Correct 10 ms 14592 KB Output is correct
11 Correct 10 ms 14592 KB Output is correct
12 Correct 10 ms 14592 KB Output is correct
13 Correct 12 ms 14592 KB Output is correct
14 Correct 9 ms 14592 KB Output is correct
15 Correct 10 ms 14592 KB Output is correct
16 Correct 10 ms 14592 KB Output is correct
17 Correct 11 ms 14592 KB Output is correct
18 Correct 10 ms 14592 KB Output is correct
19 Correct 9 ms 14592 KB Output is correct
20 Correct 10 ms 14592 KB Output is correct
21 Correct 10 ms 14592 KB Output is correct
22 Correct 10 ms 14592 KB Output is correct

Subtask #2
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14592 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 11 ms 14592 KB Output is correct
4 Correct 10 ms 14592 KB Output is correct
5 Correct 10 ms 14592 KB Output is correct
6 Correct 10 ms 14592 KB Output is correct
7 Correct 9 ms 14592 KB Output is correct
8 Correct 10 ms 14592 KB Output is correct
9 Correct 11 ms 14592 KB Output is correct
10 Correct 10 ms 14592 KB Output is correct
11 Correct 10 ms 14592 KB Output is correct
12 Correct 10 ms 14592 KB Output is correct
13 Correct 12 ms 14592 KB Output is correct
14 Correct 9 ms 14592 KB Output is correct
15 Correct 10 ms 14592 KB Output is correct
16 Correct 10 ms 14592 KB Output is correct
17 Correct 11 ms 14592 KB Output is correct
18 Correct 10 ms 14592 KB Output is correct
19 Correct 9 ms 14592 KB Output is correct
20 Correct 10 ms 14592 KB Output is correct
21 Correct 10 ms 14592 KB Output is correct
22 Correct 10 ms 14592 KB Output is correct
23 Correct 13 ms 14976 KB Output is correct
24 Correct 14 ms 14976 KB Output is correct
25 Correct 13 ms 14976 KB Output is correct
26 Correct 13 ms 14976 KB Output is correct
27 Correct 13 ms 14976 KB Output is correct
28 Correct 13 ms 14976 KB Output is correct
29 Correct 13 ms 14976 KB Output is correct
30 Correct 13 ms 14976 KB Output is correct
31 Correct 13 ms 14976 KB Output is correct
32 Correct 12 ms 14976 KB Output is correct
33 Correct 12 ms 14976 KB Output is correct
34 Correct 12 ms 14976 KB Output is correct
35 Correct 12 ms 14976 KB Output is correct
36 Correct 14 ms 14848 KB Output is correct
37 Correct 11 ms 14848 KB Output is correct
38 Correct 12 ms 15104 KB Output is correct
39 Correct 13 ms 14848 KB Output is correct
40 Correct 12 ms 14976 KB Output is correct
41 Correct 12 ms 14848 KB Output is correct
42 Correct 12 ms 14848 KB Output is correct
43 Correct 12 ms 14976 KB Output is correct
44 Correct 14 ms 14848 KB Output is correct

Subtask #3
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14592 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 11 ms 14592 KB Output is correct
4 Correct 10 ms 14592 KB Output is correct
5 Correct 10 ms 14592 KB Output is correct
6 Correct 10 ms 14592 KB Output is correct
7 Correct 9 ms 14592 KB Output is correct
8 Correct 10 ms 14592 KB Output is correct
9 Correct 11 ms 14592 KB Output is correct
10 Correct 10 ms 14592 KB Output is correct
11 Correct 10 ms 14592 KB Output is correct
12 Correct 10 ms 14592 KB Output is correct
13 Correct 12 ms 14592 KB Output is correct
14 Correct 9 ms 14592 KB Output is correct
15 Correct 10 ms 14592 KB Output is correct
16 Correct 10 ms 14592 KB Output is correct
17 Correct 11 ms 14592 KB Output is correct
18 Correct 10 ms 14592 KB Output is correct
19 Correct 9 ms 14592 KB Output is correct
20 Correct 10 ms 14592 KB Output is correct
21 Correct 10 ms 14592 KB Output is correct
22 Correct 10 ms 14592 KB Output is correct
23 Correct 13 ms 14976 KB Output is correct
24 Correct 14 ms 14976 KB Output is correct
25 Correct 13 ms 14976 KB Output is correct
26 Correct 13 ms 14976 KB Output is correct
27 Correct 13 ms 14976 KB Output is correct
28 Correct 13 ms 14976 KB Output is correct
29 Correct 13 ms 14976 KB Output is correct
30 Correct 13 ms 14976 KB Output is correct
31 Correct 13 ms 14976 KB Output is correct
32 Correct 12 ms 14976 KB Output is correct
33 Correct 12 ms 14976 KB Output is correct
34 Correct 12 ms 14976 KB Output is correct
35 Correct 12 ms 14976 KB Output is correct
36 Correct 14 ms 14848 KB Output is correct
37 Correct 11 ms 14848 KB Output is correct
38 Correct 12 ms 15104 KB Output is correct
39 Correct 13 ms 14848 KB Output is correct
40 Correct 12 ms 14976 KB Output is correct
41 Correct 12 ms 14848 KB Output is correct
42 Correct 12 ms 14848 KB Output is correct
43 Correct 12 ms 14976 KB Output is correct
44 Correct 14 ms 14848 KB Output is correct
45 Correct 718 ms 64996 KB Output is correct
46 Correct 651 ms 64180 KB Output is correct
47 Correct 683 ms 64776 KB Output is correct
48 Correct 651 ms 64264 KB Output is correct
49 Correct 691 ms 63972 KB Output is correct
50 Correct 703 ms 63588 KB Output is correct
51 Correct 684 ms 64100 KB Output is correct
52 Correct 651 ms 64936 KB Output is correct
53 Correct 647 ms 64356 KB Output is correct
54 Correct 586 ms 68712 KB Output is correct
55 Correct 544 ms 62996 KB Output is correct
56 Correct 510 ms 60396 KB Output is correct
57 Correct 489 ms 58732 KB Output is correct
58 Correct 301 ms 45560 KB Output is correct
59 Correct 303 ms 45624 KB Output is correct
60 Correct 411 ms 72424 KB Output is correct
61 Correct 412 ms 53196 KB Output is correct
62 Correct 604 ms 68336 KB Output is correct
63 Correct 420 ms 51568 KB Output is correct
64 Correct 414 ms 52076 KB Output is correct
65 Correct 556 ms 67816 KB Output is correct
66 Correct 393 ms 51184 KB Output is correct