oj.uz

답안 #283474

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
283474 2020-08-25T19:43:23 Z doowey Magic Tree (CEOI19_magictree) C++14
20 / 100
 900 ms 57904 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int, 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)1e5 + 10;
vector<int> T[N];

struct Node{
    ll val;
    ll lazy;
};

Node G[N * 4 + 512];

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

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

ll get(int node, int cl, int cr, int tl, int tr){
    push(node, cl, cr);
    if(cr < tl || cl > tr)
        return 0ll;
    if(cl >= tl && cr <= tr){
        return G[node].val;
    }
    int mid = (cl + cr) / 2;
    return max(get(node * 2, cl, mid, tl, tr), get(node * 2 + 1, mid + 1, cr, tl, tr));
}

int k;

int sub[N];

void dfs(int u){
    sub[u] = 1;
    for(auto x : T[u]){
        dfs(x);
        sub[u] += sub[x];
    }
}

set<int> ff[N];
set<pii> res[N];
int tr[N], ww[N];

struct R{
    int lef;
    int rig;
    ll ch;
};

vector<R> rev[N];

void dfs1(int u, bool keep){
    int id = -1;
    for(auto x : T[u]){
        if(id == -1 || sub[x] > sub[id])
            id = x;
    }
    for(auto x : T[u]){
        if(x != id){
            dfs1(x, false);
            for(auto y : ff[x]){
                ff[u].insert(y);
            }
            ff[x].clear();
        }
    }
    if(id != -1){
        dfs1(id, true);
        swap(ff[u], ff[id]);
        for(auto y : ff[id]){
            ff[u].insert(y);
        }
        ff[id].clear();
        swap(rev[u], rev[id]);
    }
    for(auto x : T[u]){
        if(x != id){
            int las = 0;
            ll cv = -1;
            for(auto y : res[x]){
                if(las != 0){
                    upd(1, 1, k, las, y.fi - 1, y.se);
                    rev[u].push_back({las, y.fi - 1, y.se});
                }
                las = y.fi;
                cv = y.se;
            }
            if(las != 0){
                upd(1, 1, k, las, k, cv);
                rev[u].push_back({las, k, cv});
            }
        }
    }
    if(tr[u] > 0){
        ff[u].insert(tr[u]);
        auto it = ff[u].lower_bound(tr[u]);
        ll upd_val = get(1, 1, k, tr[u], tr[u]) + ww[u];
        int en;
        ll cur;
        int st;
        while(it != ff[u].end()){
            st = (*it);
            cur = get(1, 1, k, st, st);
            if(upd_val > cur){
                auto nx = ff[u].erase(it);
                if(nx == ff[u].end())
                    en = k;
                else
                    en = (*nx) - 1;
                upd(1, 1, k, st, en, upd_val - cur);
                rev[u].push_back({st, en, upd_val - cur});
                it = nx;
            }
            else{
                break;
            }
        }
        ff[u].insert(tr[u]);
    }
    if(!keep){
        for(auto x : ff[u]){
            res[u].insert(mp(x, get(1, 1, k, x, x)));
        }
        for(auto f : rev[u]){
            upd(1, 1, k, f.lef, f.rig, -f.ch);
        }
        rev[u].clear();
    }
}

int main(){
    fastIO;
    int n, m;
    cin >> n >> m >> k;
    int p;
    for(int i = 2; i <= n; i ++ ){
        cin >> p;
        T[p].push_back(i);
    }
    int id;
    for(int i = 1; i <= m ; i ++ ){
        cin >> id >> tr[id] >> ww[id];
    }
    dfs(1);
    dfs1(1, true);
    cout << G[1].val << "\n";
    return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 10 ms 14464 KB Output is correct
8 Correct 10 ms 14464 KB Output is correct
9 Correct 10 ms 14464 KB Output is correct

Subtask #2
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 33648 KB Output is correct
2 Correct 150 ms 33396 KB Output is correct
3 Correct 900 ms 57904 KB Output is correct
4 Correct 386 ms 38400 KB Output is correct
5 Correct 463 ms 39144 KB Output is correct

Subtask #3
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14720 KB Output is correct
2 Correct 12 ms 14848 KB Output is correct
3 Correct 11 ms 14720 KB Output is correct
4 Correct 233 ms 43876 KB Output is correct
5 Correct 196 ms 44900 KB Output is correct
6 Correct 360 ms 44772 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 159 ms 27000 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 10 ms 14464 KB Output is correct
8 Correct 10 ms 14464 KB Output is correct
9 Correct 10 ms 14464 KB Output is correct
10 Incorrect 259 ms 31864 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #6
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 24 ms 17528 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 10 ms 14464 KB Output is correct
8 Correct 10 ms 14464 KB Output is correct
9 Correct 10 ms 14464 KB Output is correct
10 Correct 11 ms 14720 KB Output is correct
11 Correct 12 ms 14848 KB Output is correct
12 Correct 11 ms 14720 KB Output is correct
13 Correct 233 ms 43876 KB Output is correct
14 Correct 196 ms 44900 KB Output is correct
15 Correct 360 ms 44772 KB Output is correct
16 Incorrect 259 ms 31864 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #8
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 10 ms 14464 KB Output is correct
2 Correct 10 ms 14464 KB Output is correct
3 Correct 10 ms 14464 KB Output is correct
4 Correct 10 ms 14464 KB Output is correct
5 Correct 10 ms 14464 KB Output is correct
6 Correct 10 ms 14464 KB Output is correct
7 Correct 10 ms 14464 KB Output is correct
8 Correct 10 ms 14464 KB Output is correct
9 Correct 10 ms 14464 KB Output is correct
10 Correct 324 ms 33648 KB Output is correct
11 Correct 150 ms 33396 KB Output is correct
12 Correct 900 ms 57904 KB Output is correct
13 Correct 386 ms 38400 KB Output is correct
14 Correct 463 ms 39144 KB Output is correct
15 Correct 11 ms 14720 KB Output is correct
16 Correct 12 ms 14848 KB Output is correct
17 Correct 11 ms 14720 KB Output is correct
18 Correct 233 ms 43876 KB Output is correct
19 Correct 196 ms 44900 KB Output is correct
20 Correct 360 ms 44772 KB Output is correct
21 Incorrect 159 ms 27000 KB Output isn't correct
22 Halted 0 ms 0 KB -