제출 #242521

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
242521		dantoh000	Magic Tree (CEOI19_magictree)	C++14	100 / 100	182 ms	36984 KiB

magictree

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> ii;
typedef long long ll;
int n,m,k;
vector<int> G[100005];
ii V[100005];
map<int,ll> dp[100005];
void dfs(int u){
    auto& cur = dp[u];
    for (auto v: G[u]){
        dfs(v);
        if (dp[v].size() > cur.size()){
            swap(dp[v],cur);
        }
        for (auto x : dp[v]){
            cur[x.first] += x.second;
        }
    }
    if (V[u] == ii(0,0)) return;
    cur[V[u].first] += V[u].second;
    int bad = V[u].second;
    auto it = cur.find(V[u].first);
    it++;
    while (it != cur.end()){
        if (it->second < bad){
            bad -= it->second;
            it = cur.erase(it);
        }
        else{
            it->second -= bad;
            break;
        }
    }
    return;
}
int main(){
    scanf("%d%d%d",&n,&m,&k);
    for (int i = 2,p; i <= n; i++){
        scanf("%d",&p);
        G[p].push_back(i);
    }
    for (int i = 0; i < m; i++){
        int v,d,w;
        scanf("%d%d%d",&v,&d,&w);
        V[v] = ii(d,w);
    }
    dfs(1);
    ll ans = 0;
    for (auto x : dp[1]) ans += x.second;
    printf("%lld\n",ans);
}

컴파일 시 표준 에러 (stderr) 메시지

magictree.cpp: In function 'int main()':
magictree.cpp:38:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d%d",&n,&m,&k);
     ~~~~~^~~~~~~~~~~~~~~~~~~
magictree.cpp:40:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d",&p);
         ~~~~~^~~~~~~~~
magictree.cpp:45:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d%d",&v,&d,&w);
         ~~~~~^~~~~~~~~~~~~~~~~~~

• Subtask 1: 6 / 6
• Subtask 2: 3 / 3
• Subtask 3: 11 / 11
• Subtask 4: 12 / 12
• Subtask 5: 16 / 16
• Subtask 6: 13 / 13
• Subtask 7: 22 / 22
• Subtask 8: 17 / 17