QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#665055#7578. Salty FishCharizard2021AC ✓1521ms90432kbC++142.2kb2024-10-22 01:24:472024-10-22 01:24:48

Judging History

你现在查看的是最新测评结果

  • [2024-10-22 01:24:48]
  • 评测
  • 测评结果:AC
  • 用时:1521ms
  • 内存:90432kb
  • [2024-10-22 01:24:47]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;
vector<vector<long long> > adj(300010);
vector<vector<pair<long long, long long> > > camera(300010);
vector<long long> dp(300010);
vector<long long> depth(300010);
vector<map<long long, long long> > cur(300010);
vector<long long> a(300010);
void dfs(long long u, long long p){
    for(long long v : adj[u]){
        if(v != p){
            depth[v] = depth[u] + 1;
            dfs(v, u);
            dp[u] += dp[v];
            if((long long)cur[v].size() > (long long)cur[u].size()){
                swap(cur[u], cur[v]);
            }
        }
    }
    for(long long v : adj[u]){
        if(v != p){
            for(auto it : cur[v]){
                cur[u][it.first] += it.second;
            }
            cur[v].clear();
        }
    }
    dp[u] += a[u];
    cur[u][depth[u]] += a[u];
    for(pair<long long, long long>& x : camera[u]){
        x.first += depth[u];
        auto it = cur[u].upper_bound(x.first);
        while(it != cur[u].begin() && 0 < x.second){
            if(x.second >= prev(it)->second){
                x.second -= prev(it)->second;
                cur[u].erase(prev(it));
            }
            else{
                prev(it)->second -= x.second;
                x.second = 0;
            }
        }
        dp[u] += x.second;
    }
}
int main(){
    long long t;
    cin >> t;
    while(t--){
        long long n, m;
        cin >> n >> m;
        for(long long i = 0; i <= n; i++){
            dp[i] = 0;
            adj[i].clear();
            camera[i].clear();
            cur[i].clear();
            depth[i] = 0;
            a[i] = 0;
        }
        for(long long i = 2; i <= n; i++){
            long long p;
            cin >> p;
            adj[p].push_back(i);
            adj[i].push_back(p);
        }
        for(long long i = 1; i <= n; i++){
            cin >> a[i];
        }
        long long res = 0;
        for(long long i = 0; i < m; i++){
            long long a, b, c;
            cin >> a >> b >> c;
            camera[a].push_back(make_pair(b, c));
            res += c;
        }
        dfs(1, 0);
        res -= dp[1];
        cout << -res << "\n";
    }
}

详细

Test #1:

score: 100
Accepted
time: 13ms
memory: 38084kb

input:

1
6 3
1 1 2 2 3
2 5 4 3 3 2
2 1 3
3 1 7
1 2 4

output:

6

result:

ok 1 number(s): "6"

Test #2:

score: 0
Accepted
time: 1521ms
memory: 90432kb

input:

1003
100 100
1 2 3 4 5 6 7 8 9 10 6 1 2 4 1 11 17 14 17 2 13 8 8 5 11 7 18 6 2 10 23 11 13 3 9 1 33 20 3 9 32 35 11 41 42 29 33 45 21 35 9 36 12 54 19 24 57 31 32 5 3 10 46 15 46 48 20 44 5 41 67 7 18 30 27 6 29 69 57 75 62 74 18 64 17 21 38 60 79 69 54 90 83 83 31 96 31 93 53
152 498 653 559 287 38...

output:

20180
17083
14650
19924
15814
20189
20894
18175
18478
13758
20217
23680
15562
12882
18046
18132
20548
17000
23734
18740
24814
16728
20979
19727
16450
21717
15739
22081
17803
23024
14820
21503
23497
15804
18097
17197
21236
21286
14250
11632
18335
12317
16313
22840
18583
15245
19331
25978
22388
17091
...

result:

ok 1003 numbers