oj.uz

답안 #544661

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
544661 2022-04-02T14:17:20 Z leaked Worst Reporter 4 (JOI21_worst_reporter4) C++14
79 / 100
 585 ms 524288 KB 
#include <bits/stdc++.h>

#define f first
#define s second
#define m_p make_pair
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define vec vector
#define pb push_back
#define sz(x) (int)(x).size()
#define pw(x) (1LL<<(x))
#define fast_resp ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef long double ld;
typedef pair<int,ll> pil;
template<class T> bool umin(T &a,const T &b){return (a>b?a=b,1:0);}
template<class T> bool umax(T &a,const T &b){return (a<b?a=b,1:0);}
const int N=2e5+1;
const ll inf=1e18;
vec<int> g[N];
int c[N],a[N],h[N];
int tt=1;
struct segtree{
    ll t[40*N],p[40*N];
    int l[40*N],r[40*N];
    ll d1,d2;
    segtree(){
        t[0]=0;
        fill(t,t+40*N,0);
        fill(l,l+40*N,0);
        fill(r,r+40*N,0);
        fill(p,p+40*N,0);
    }
    void push(int v,int tl,int tr){
        if(!p[v])
            return;
        if(!l[v]) l[v]=tt++;
        if(!r[v]) r[v]=tt++;
        assert(tt<40*N);
        for(auto &u : {l[v],r[v]})
            p[u]+=p[v],t[u]+=p[v];
        p[v]=0;
        return;
    }
    void upd(int i,ll x,int &v,int tl=0,int tr=N-1){
        if(!v)
            v=tt++;
        assert(tt<40*N);
        if(tl==tr){
            t[v]=x;
            return;
        }
        int tm=(tl+tr)>>1;push(v,tl,tr);
        if(tm>=i)
            upd(i,x,l[v],tl,tm);
        else
            upd(i,x,r[v],tm+1,tr);
        t[v]=min(t[l[v]],t[r[v]]);
    }
    ll get(int l1,int r1,int v,int tl=0,int tr=N-1){
        if(!v || tl>r1 || tr<l1)
            return 0;
        if(tl>=l1&&tr<=r1)
            return t[v];
        int tm=(tl+tr)>>1;push(v,tl,tr);
        return min(get(l1,r1,l[v],tl,tm),get(l1,r1,r[v],tm+1,tr));
    }
    int mg(int v,int u,int tl,int tr){
        if(!v && !u)
            return 0;
        if(tl==tr){
            umin(d1,t[v]);umin(d2,t[u]);
            if(!v){
                t[u]=d1+d2;
                return u;
            }
            t[v]=d1+d2;
            return v;
        }

        if(!v){
            umin(d2,t[u]);
            p[u]+=d1;
            t[u]+=d1;
            return u;
        }
        if(!u){
            umin(d1,t[v]);
            p[v]+=d2;
            t[v]+=d2;
            return v;
        }
        int tm=(tl+tr)>>1;
        if(l[u] || r[u]) push(u,tl,tr);
        if(l[v] || r[v]) push(v,tl,tr);
        p[v]=p[u]=0;
        r[v]=mg(r[v],r[u],tm+1,tr);
        l[v]=mg(l[v],l[u],tl,tm);
        t[v]=d1+d2;
        return v;
    }
    int Merge(int v,int u){
        d1=d2=0;
        return mg(v,u,0,N-1);
    }
}sega;
ll toadd=0;
//map<int,ll> mp;
int root[N];

void dfs(int v){
//    cout<<"DFS "<<v<<endl;
    for(auto &z : g[v]){
        dfs(z);
        root[v]=sega.Merge(root[v],root[z]);
//        cerr<<"EBAL "<<root[v]<<endl;
    }
//    cout<<"W "<<root[v]<<endl;
//    cout<<sega.get(roo)
//    cout<<"HEY "<<sega.get(root[v],h[v],N-1)<<endl;
    sega.upd(h[v],sega.get(h[v],N-1,root[v])-c[v],root[v]);
}
signed main(){
    fast_resp;
    int n;
    cin>>n;
    vec<int>kek;
    ll sm=0;
    for(int i=0;i<n;i++){
        cin>>a[i]>>h[i]>>c[i];--a[i];
        if(a[i]!=i) g[a[i]].pb(i);
        kek.pb(h[i]);sm+=c[i];
    }
    sort(all(kek));kek.erase(unique(all(kek)),kek.end());
    for(int i=0;i<n;i++) h[i]=lower_bound(all(kek),h[i])-kek.begin();
    dfs(0);
    cout<<sm+sega.get(0,N-1,root[0]);
    return 0;
}
/*
3
1 3 6
1 2 5
1 5 6
6
1 6 5
1 3 6
1 8 4
3 4 9
2 2 5
2 5 6
2
1 89 964898447
2 40 952129455
*/

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 192808 KB Output is correct
2 Correct 100 ms 192832 KB Output is correct
3 Correct 80 ms 192768 KB Output is correct
4 Correct 81 ms 192888 KB Output is correct
5 Correct 94 ms 193200 KB Output is correct
6 Correct 104 ms 193216 KB Output is correct
7 Correct 90 ms 193100 KB Output is correct
8 Correct 97 ms 193148 KB Output is correct
9 Correct 91 ms 193168 KB Output is correct
10 Correct 88 ms 193180 KB Output is correct
11 Correct 83 ms 193152 KB Output is correct
12 Correct 84 ms 193584 KB Output is correct
13 Correct 92 ms 193656 KB Output is correct
14 Correct 91 ms 193460 KB Output is correct
15 Correct 105 ms 193436 KB Output is correct
16 Correct 100 ms 193088 KB Output is correct
17 Correct 101 ms 193152 KB Output is correct
18 Correct 91 ms 193152 KB Output is correct
19 Correct 93 ms 193328 KB Output is correct
20 Correct 86 ms 193336 KB Output is correct
21 Correct 90 ms 193356 KB Output is correct
22 Correct 82 ms 193068 KB Output is correct
23 Correct 86 ms 193068 KB Output is correct
24 Correct 90 ms 193376 KB Output is correct
25 Correct 77 ms 193408 KB Output is correct
26 Correct 78 ms 193608 KB Output is correct
27 Correct 83 ms 193312 KB Output is correct
28 Correct 84 ms 193416 KB Output is correct
29 Correct 81 ms 193540 KB Output is correct
30 Correct 79 ms 193456 KB Output is correct
31 Correct 82 ms 193332 KB Output is correct

Subtask #2
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 192808 KB Output is correct
2 Correct 100 ms 192832 KB Output is correct
3 Correct 80 ms 192768 KB Output is correct
4 Correct 81 ms 192888 KB Output is correct
5 Correct 94 ms 193200 KB Output is correct
6 Correct 104 ms 193216 KB Output is correct
7 Correct 90 ms 193100 KB Output is correct
8 Correct 97 ms 193148 KB Output is correct
9 Correct 91 ms 193168 KB Output is correct
10 Correct 88 ms 193180 KB Output is correct
11 Correct 83 ms 193152 KB Output is correct
12 Correct 84 ms 193584 KB Output is correct
13 Correct 92 ms 193656 KB Output is correct
14 Correct 91 ms 193460 KB Output is correct
15 Correct 105 ms 193436 KB Output is correct
16 Correct 100 ms 193088 KB Output is correct
17 Correct 101 ms 193152 KB Output is correct
18 Correct 91 ms 193152 KB Output is correct
19 Correct 93 ms 193328 KB Output is correct
20 Correct 86 ms 193336 KB Output is correct
21 Correct 90 ms 193356 KB Output is correct
22 Correct 82 ms 193068 KB Output is correct
23 Correct 86 ms 193068 KB Output is correct
24 Correct 90 ms 193376 KB Output is correct
25 Correct 77 ms 193408 KB Output is correct
26 Correct 78 ms 193608 KB Output is correct
27 Correct 83 ms 193312 KB Output is correct
28 Correct 84 ms 193416 KB Output is correct
29 Correct 81 ms 193540 KB Output is correct
30 Correct 79 ms 193456 KB Output is correct
31 Correct 82 ms 193332 KB Output is correct
32 Correct 84 ms 193200 KB Output is correct
33 Correct 578 ms 200832 KB Output is correct
34 Correct 370 ms 204992 KB Output is correct
35 Correct 585 ms 205052 KB Output is correct
36 Correct 389 ms 205128 KB Output is correct
37 Correct 265 ms 205036 KB Output is correct
38 Correct 280 ms 204784 KB Output is correct
39 Correct 306 ms 223936 KB Output is correct
40 Correct 254 ms 223768 KB Output is correct
41 Correct 217 ms 223972 KB Output is correct
42 Correct 308 ms 216000 KB Output is correct
43 Correct 257 ms 215972 KB Output is correct
44 Correct 521 ms 204836 KB Output is correct
45 Correct 324 ms 204956 KB Output is correct
46 Correct 214 ms 204872 KB Output is correct
47 Correct 368 ms 212776 KB Output is correct
48 Correct 271 ms 212716 KB Output is correct
49 Correct 221 ms 212720 KB Output is correct
50 Correct 409 ms 202156 KB Output is correct
51 Correct 250 ms 201940 KB Output is correct
52 Correct 386 ms 213704 KB Output is correct
53 Correct 268 ms 213756 KB Output is correct
54 Correct 234 ms 224104 KB Output is correct
55 Correct 346 ms 212288 KB Output is correct
56 Correct 295 ms 217348 KB Output is correct
57 Correct 282 ms 219516 KB Output is correct
58 Correct 268 ms 215248 KB Output is correct
59 Correct 279 ms 215320 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 192808 KB Output is correct
2 Correct 100 ms 192832 KB Output is correct
3 Correct 80 ms 192768 KB Output is correct
4 Correct 81 ms 192888 KB Output is correct
5 Correct 94 ms 193200 KB Output is correct
6 Correct 104 ms 193216 KB Output is correct
7 Correct 90 ms 193100 KB Output is correct
8 Correct 97 ms 193148 KB Output is correct
9 Correct 91 ms 193168 KB Output is correct
10 Correct 88 ms 193180 KB Output is correct
11 Correct 83 ms 193152 KB Output is correct
12 Correct 84 ms 193584 KB Output is correct
13 Correct 92 ms 193656 KB Output is correct
14 Correct 91 ms 193460 KB Output is correct
15 Correct 105 ms 193436 KB Output is correct
16 Correct 100 ms 193088 KB Output is correct
17 Correct 101 ms 193152 KB Output is correct
18 Correct 91 ms 193152 KB Output is correct
19 Correct 93 ms 193328 KB Output is correct
20 Correct 86 ms 193336 KB Output is correct
21 Correct 90 ms 193356 KB Output is correct
22 Correct 82 ms 193068 KB Output is correct
23 Correct 86 ms 193068 KB Output is correct
24 Correct 90 ms 193376 KB Output is correct
25 Correct 77 ms 193408 KB Output is correct
26 Correct 78 ms 193608 KB Output is correct
27 Correct 83 ms 193312 KB Output is correct
28 Correct 84 ms 193416 KB Output is correct
29 Correct 81 ms 193540 KB Output is correct
30 Correct 79 ms 193456 KB Output is correct
31 Correct 82 ms 193332 KB Output is correct
32 Correct 84 ms 193200 KB Output is correct
33 Correct 578 ms 200832 KB Output is correct
34 Correct 370 ms 204992 KB Output is correct
35 Correct 585 ms 205052 KB Output is correct
36 Correct 389 ms 205128 KB Output is correct
37 Correct 265 ms 205036 KB Output is correct
38 Correct 280 ms 204784 KB Output is correct
39 Correct 306 ms 223936 KB Output is correct
40 Correct 254 ms 223768 KB Output is correct
41 Correct 217 ms 223972 KB Output is correct
42 Correct 308 ms 216000 KB Output is correct
43 Correct 257 ms 215972 KB Output is correct
44 Correct 521 ms 204836 KB Output is correct
45 Correct 324 ms 204956 KB Output is correct
46 Correct 214 ms 204872 KB Output is correct
47 Correct 368 ms 212776 KB Output is correct
48 Correct 271 ms 212716 KB Output is correct
49 Correct 221 ms 212720 KB Output is correct
50 Correct 409 ms 202156 KB Output is correct
51 Correct 250 ms 201940 KB Output is correct
52 Correct 386 ms 213704 KB Output is correct
53 Correct 268 ms 213756 KB Output is correct
54 Correct 234 ms 224104 KB Output is correct
55 Correct 346 ms 212288 KB Output is correct
56 Correct 295 ms 217348 KB Output is correct
57 Correct 282 ms 219516 KB Output is correct
58 Correct 268 ms 215248 KB Output is correct
59 Correct 279 ms 215320 KB Output is correct
60 Runtime error 266 ms 524288 KB Execution killed with signal 9
61 Halted 0 ms 0 KB -