제출 #46975

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
46975		ngkan146	Fireworks (APIO16_fireworks)	C++11	26 / 100	19 ms	17356 KiB

fireworks

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int n,m,c[300005];
priority_queue<int> slope[300005];
vector <int> G[300005];
ll val[300005];
// numkid = startslope ?
void dfs(int u){
    if (u > n){
        return;
    }

    for(auto v: G[u]){
        dfs(v);
        val[u] += val[v] + c[v];
        if (v > n){
            slope[v].push(c[v]);
            slope[v].push(c[v]);
        }
        else{
            int x = slope[v].top();
            slope[v].pop();
            int y = slope[v].top();
            slope[v].pop();

            slope[v].push(x + c[v]);
            slope[v].push(y + c[v]);
        }
    }

    for(auto v: G[u]){
        if (slope[v].size() > slope[u].size())
            slope[u].swap(slope[v]);
    }

    for(auto v: G[u]){
        while(slope[v].size())
            slope[u].push(slope[v].top()),
            slope[v].pop();
    }

    for(int _=0;_<G[u].size()-1;_++)
        slope[u].pop();

     //cout << u << ' ' << slope[u].size() << endl;
}
int main(){
    iostream::sync_with_stdio(0);
    cin >> n >> m;
    for(int i=2;i<=n+m;i++){
        int p;
        cin >> p >> c[i];
        G[p].push_back(i);
    }
    dfs(1);
    vector <int> mjk;
    while(!slope[1].empty()){
        mjk.push_back(slope[1].top());
        slope[1].pop();
    }
    mjk.push_back(0);
    reverse(mjk.begin(), mjk.end());
    for(int i=1;i<mjk.size();i++){
        //cout << mjk[i] << ' ';
        val[1] -= 1ll * (m+1-i) * (mjk[i] - mjk[i-1]);
    }//cout << endl;
    cout << val[1];
}

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

fireworks.cpp: In function 'void dfs(int)':
fireworks.cpp:43:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int _=0;_<G[u].size()-1;_++)
                 ~^~~~~~~~~~~~~~
fireworks.cpp: In function 'int main()':
fireworks.cpp:64:18: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i=1;i<mjk.size();i++){
                 ~^~~~~~~~~~~

• Subtask 1: 7 / 7
• Subtask 2: 19 / 19
• Subtask 3: 0 / 29
• Subtask 4: 0 / 45