oj.uz

답안 #1025465

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1025465 2024-07-17T04:22:59 Z sopaconk Fireworks (APIO16_fireworks) C++17
100 / 100
 172 ms 73300 KB 
    #include<bits/stdc++.h>
    using namespace std;
    #define pb push_back
    using lli=long long int;
    #define deb(x) cout<<#x<<": "<<x<<endl;
   // #define endl '\n'
  

    void dfs(lli x, lli d, vector<vector<pair<lli,lli>>> &sons, priority_queue<lli> &pq){
       // deb(x);
        for(auto y: sons[x]){
      //      deb(y.first);
            priority_queue<lli> aux;
            dfs(y.first,y.second,sons, aux);
            if(aux.size() >pq.size()){
                swap(aux, pq);
            }
            
            while(!aux.empty()){
                pq.push(aux.top());
                aux.pop();
            }
          
        }
        if(pq.empty()){
            pq.push(0);
            pq.push(0);
//            deb(pq.size());
        }
    
            for(lli i=0; i<((lli) sons[x].size())-1; ++i){
            //    deb(i);
                pq.pop();
            }
            lli a=pq.top();
            pq.pop();
            lli b=pq.top();
            pq.pop();
  //          deb(a);
    //        deb(b);
            a+=d;
            b+=d;
            pq.push(a);
            pq.push(b);

        
    }
    void solve(){
       lli n,m;
       cin>>n>>m;
       vector<vector<pair<lli,lli>>> sons (n+m+1);
       lli sum=0;
       for(lli i=2; i<=n+m; ++i){
        lli p, c;
        cin>>p>>c;
        sum+=c;
        sons[p].pb({i,c});
       }
       priority_queue<lli> ans;
       dfs(1,0,sons,ans);
       lli val=sum;
        lli pend=1-ans.size();
        lli ant=0;
        stack<lli> v;
        while(!ans.empty()){
            v.push(ans.top());
            ans.pop();
        }
        while(!v.empty()){
            sum+=pend*(v.top()-ant);
            val=min(val, sum);
            pend++;
            ant=v.top();
            v.pop();
        }
        cout<<val<<endl;


    }




    int main(){
        ios_base::sync_with_stdio(0);
        cin.tie(0);
        lli t=1;
     //   cin>>t;
        while(t--){
            solve();
        }
    }

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 600 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 1628 KB Output is correct
41 Correct 1 ms 1628 KB Output is correct
42 Correct 2 ms 776 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1108 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 2 ms 860 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 3 ms 860 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 2 ms 604 KB Output is correct
52 Correct 2 ms 604 KB Output is correct
53 Correct 2 ms 860 KB Output is correct
54 Correct 2 ms 856 KB Output is correct

Subtask #4
45.0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 1 ms 456 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 600 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 344 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 1 ms 448 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 600 KB Output is correct
35 Correct 2 ms 604 KB Output is correct
36 Correct 1 ms 604 KB Output is correct
37 Correct 2 ms 604 KB Output is correct
38 Correct 2 ms 724 KB Output is correct
39 Correct 2 ms 604 KB Output is correct
40 Correct 2 ms 1628 KB Output is correct
41 Correct 1 ms 1628 KB Output is correct
42 Correct 2 ms 776 KB Output is correct
43 Correct 2 ms 1116 KB Output is correct
44 Correct 3 ms 1108 KB Output is correct
45 Correct 2 ms 1116 KB Output is correct
46 Correct 2 ms 860 KB Output is correct
47 Correct 2 ms 860 KB Output is correct
48 Correct 2 ms 604 KB Output is correct
49 Correct 3 ms 860 KB Output is correct
50 Correct 2 ms 600 KB Output is correct
51 Correct 2 ms 604 KB Output is correct
52 Correct 2 ms 604 KB Output is correct
53 Correct 2 ms 860 KB Output is correct
54 Correct 2 ms 856 KB Output is correct
55 Correct 5 ms 1368 KB Output is correct
56 Correct 17 ms 4080 KB Output is correct
57 Correct 31 ms 6428 KB Output is correct
58 Correct 40 ms 8252 KB Output is correct
59 Correct 53 ms 10780 KB Output is correct
60 Correct 62 ms 13224 KB Output is correct
61 Correct 74 ms 15444 KB Output is correct
62 Correct 98 ms 16708 KB Output is correct
63 Correct 109 ms 19756 KB Output is correct
64 Correct 116 ms 20752 KB Output is correct
65 Correct 103 ms 73300 KB Output is correct
66 Correct 105 ms 73296 KB Output is correct
67 Correct 69 ms 21680 KB Output is correct
68 Correct 125 ms 47300 KB Output is correct
69 Correct 135 ms 43724 KB Output is correct
70 Correct 148 ms 43716 KB Output is correct
71 Correct 172 ms 24804 KB Output is correct
72 Correct 144 ms 24892 KB Output is correct
73 Correct 126 ms 22636 KB Output is correct
74 Correct 145 ms 22968 KB Output is correct
75 Correct 139 ms 21916 KB Output is correct
76 Correct 119 ms 21732 KB Output is correct
77 Correct 128 ms 23512 KB Output is correct
78 Correct 125 ms 23080 KB Output is correct
79 Correct 127 ms 29528 KB Output is correct