oj.uz

Submission #546313

# Submission time Handle Problem Language Result Execution time Memory
546313 2022-04-07T08:05:35 Z zaneyu Fireworks (APIO16_fireworks) C++14
100 / 100
 206 ms 69760 KB 
/*input
4 6
1 5
2 5
2 8
3 3
3 2
3 3
2 9
4 4
4 3
*/
#include<bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
typedef tree<long long,null_type,less_equal<long long>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
#pragma GCC optimize("O2")
//order_of_key #of elements less than x
// find_by_order kth element
using ll=long long;
using ld=long double;
using pii=pair<ll,ll>;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(ll i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()),c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
const ll maxn=3e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int INF=0x3f3f3f3f;
const ll MOD=1e9+7;
const ld PI=acos(-1);
const ld eps=1e-6;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    return a*b%MOD;
}
ll mypow(ll a,ll b){
    a%=MOD;
    if(a==0) return 0;
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=(res*a)%MOD;
        a=(a*a)%MOD;
        b>>=1;
    }
    return res;
}
int par[maxn];
int n;
vector<int> v[maxn];
void dfs(int u,priority_queue<ll> &pq){
    if(u<n){
        for(int x:v[u]){
            priority_queue<ll> p;
            dfs(x,p);
            if(sz(p)>sz(pq)) p.swap(pq);
            while(sz(p)) pq.push(p.top()),p.pop();
        }
        REP(j,sz(v[u])-1) pq.pop();
        ll x=pq.top()+par[u];
        pq.pop();
        ll y=pq.top()+par[u];
        pq.pop();
        pq.push(x),pq.push(y);
    }
    else pq.push(par[u]),pq.push(par[u]);
}
int32_t main(){
    ios::sync_with_stdio(false),cin.tie(0);
    int m;
    cin>>n>>m;
    ll s=0;
    REP1(i,n+m-1){
        int a,b;
        cin>>a>>b;
        --a;
        v[a].pb(i);
        par[i]=b;
        s+=b;
    }
    priority_queue<ll> pq;
    dfs(0,pq);
    int k=0;
    ll pv=pq.top();
    pq.pop();
    while(sz(pq)){
        s-=(pv-pq.top())*k;
        pv=pq.top();
        pq.pop();
        ++k;
    }
    cout<<s-k*pv<<'\n';
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 6 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct

Subtask #2
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 7252 KB Output is correct
2 Correct 4 ms 7252 KB Output is correct
3 Correct 5 ms 7252 KB Output is correct
4 Correct 6 ms 7380 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 4 ms 7252 KB Output is correct
7 Correct 4 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 6 ms 7252 KB Output is correct
12 Correct 5 ms 7252 KB Output is correct
13 Correct 4 ms 7252 KB Output is correct
14 Correct 4 ms 7380 KB Output is correct
15 Correct 4 ms 7252 KB Output is correct
16 Correct 4 ms 7380 KB Output is correct
17 Correct 4 ms 7252 KB Output is correct
18 Correct 4 ms 7252 KB Output is correct
19 Correct 5 ms 7252 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 6 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 4 ms 7252 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Correct 5 ms 7252 KB Output is correct
14 Correct 6 ms 7380 KB Output is correct
15 Correct 4 ms 7252 KB Output is correct
16 Correct 4 ms 7252 KB Output is correct
17 Correct 4 ms 7252 KB Output is correct
18 Correct 4 ms 7252 KB Output is correct
19 Correct 4 ms 7252 KB Output is correct
20 Correct 4 ms 7252 KB Output is correct
21 Correct 6 ms 7252 KB Output is correct
22 Correct 5 ms 7252 KB Output is correct
23 Correct 4 ms 7252 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7252 KB Output is correct
26 Correct 4 ms 7380 KB Output is correct
27 Correct 4 ms 7252 KB Output is correct
28 Correct 4 ms 7252 KB Output is correct
29 Correct 5 ms 7252 KB Output is correct
30 Correct 5 ms 7380 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7384 KB Output is correct
33 Correct 7 ms 7380 KB Output is correct
34 Correct 5 ms 7508 KB Output is correct
35 Correct 6 ms 7508 KB Output is correct
36 Correct 6 ms 7508 KB Output is correct
37 Correct 7 ms 7508 KB Output is correct
38 Correct 7 ms 7488 KB Output is correct
39 Correct 6 ms 7508 KB Output is correct
40 Correct 8 ms 8276 KB Output is correct
41 Correct 6 ms 8404 KB Output is correct
42 Correct 6 ms 7636 KB Output is correct
43 Correct 6 ms 7896 KB Output is correct
44 Correct 6 ms 7772 KB Output is correct
45 Correct 8 ms 7892 KB Output is correct
46 Correct 6 ms 7508 KB Output is correct
47 Correct 7 ms 7508 KB Output is correct
48 Correct 7 ms 7512 KB Output is correct
49 Correct 9 ms 7512 KB Output is correct
50 Correct 6 ms 7508 KB Output is correct
51 Correct 7 ms 7508 KB Output is correct
52 Correct 7 ms 7508 KB Output is correct
53 Correct 6 ms 7572 KB Output is correct
54 Correct 7 ms 7700 KB Output is correct

Subtask #4
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 7252 KB Output is correct
2 Correct 5 ms 7252 KB Output is correct
3 Correct 4 ms 7380 KB Output is correct
4 Correct 4 ms 7376 KB Output is correct
5 Correct 4 ms 7252 KB Output is correct
6 Correct 5 ms 7380 KB Output is correct
7 Correct 6 ms 7252 KB Output is correct
8 Correct 4 ms 7252 KB Output is correct
9 Correct 4 ms 7252 KB Output is correct
10 Correct 4 ms 7252 KB Output is correct
11 Correct 4 ms 7252 KB Output is correct
12 Correct 4 ms 7252 KB Output is correct
13 Correct 5 ms 7252 KB Output is correct
14 Correct 6 ms 7380 KB Output is correct
15 Correct 4 ms 7252 KB Output is correct
16 Correct 4 ms 7252 KB Output is correct
17 Correct 4 ms 7252 KB Output is correct
18 Correct 4 ms 7252 KB Output is correct
19 Correct 4 ms 7252 KB Output is correct
20 Correct 4 ms 7252 KB Output is correct
21 Correct 6 ms 7252 KB Output is correct
22 Correct 5 ms 7252 KB Output is correct
23 Correct 4 ms 7252 KB Output is correct
24 Correct 4 ms 7380 KB Output is correct
25 Correct 4 ms 7252 KB Output is correct
26 Correct 4 ms 7380 KB Output is correct
27 Correct 4 ms 7252 KB Output is correct
28 Correct 4 ms 7252 KB Output is correct
29 Correct 5 ms 7252 KB Output is correct
30 Correct 5 ms 7380 KB Output is correct
31 Correct 4 ms 7380 KB Output is correct
32 Correct 5 ms 7384 KB Output is correct
33 Correct 7 ms 7380 KB Output is correct
34 Correct 5 ms 7508 KB Output is correct
35 Correct 6 ms 7508 KB Output is correct
36 Correct 6 ms 7508 KB Output is correct
37 Correct 7 ms 7508 KB Output is correct
38 Correct 7 ms 7488 KB Output is correct
39 Correct 6 ms 7508 KB Output is correct
40 Correct 8 ms 8276 KB Output is correct
41 Correct 6 ms 8404 KB Output is correct
42 Correct 6 ms 7636 KB Output is correct
43 Correct 6 ms 7896 KB Output is correct
44 Correct 6 ms 7772 KB Output is correct
45 Correct 8 ms 7892 KB Output is correct
46 Correct 6 ms 7508 KB Output is correct
47 Correct 7 ms 7508 KB Output is correct
48 Correct 7 ms 7512 KB Output is correct
49 Correct 9 ms 7512 KB Output is correct
50 Correct 6 ms 7508 KB Output is correct
51 Correct 7 ms 7508 KB Output is correct
52 Correct 7 ms 7508 KB Output is correct
53 Correct 6 ms 7572 KB Output is correct
54 Correct 7 ms 7700 KB Output is correct
55 Correct 10 ms 8020 KB Output is correct
56 Correct 26 ms 9764 KB Output is correct
57 Correct 48 ms 11180 KB Output is correct
58 Correct 77 ms 12364 KB Output is correct
59 Correct 118 ms 13940 KB Output is correct
60 Correct 112 ms 15384 KB Output is correct
61 Correct 117 ms 16916 KB Output is correct
62 Correct 133 ms 17732 KB Output is correct
63 Correct 176 ms 19496 KB Output is correct
64 Correct 178 ms 19828 KB Output is correct
65 Correct 130 ms 69760 KB Output is correct
66 Correct 119 ms 69652 KB Output is correct
67 Correct 105 ms 23004 KB Output is correct
68 Correct 165 ms 43608 KB Output is correct
69 Correct 206 ms 39616 KB Output is correct
70 Correct 176 ms 39588 KB Output is correct
71 Correct 190 ms 19000 KB Output is correct
72 Correct 190 ms 19024 KB Output is correct
73 Correct 196 ms 18396 KB Output is correct
74 Correct 180 ms 18424 KB Output is correct
75 Correct 169 ms 18060 KB Output is correct
76 Correct 172 ms 18240 KB Output is correct
77 Correct 197 ms 19044 KB Output is correct
78 Correct 179 ms 18804 KB Output is correct
79 Correct 176 ms 21492 KB Output is correct