oj.uz

Submission #143010

# Submission time Handle Problem Language Result Execution time Memory
143010 2019-08-12T15:02:56 Z shayan_p Fireworks (APIO16_fireworks) C++14
0 / 100
 9 ms 7416 KB 
// only miss the sun when it starts to snow

#include<bits/stdc++.h>

#define F first
#define S second
#define PB push_back
#define sz(s) int((s).size())
#define bit(n,k) (((n)>>(k))&1)

using namespace std;

typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const int maxn=3e5+10,mod=1e9+7;
const ll inf=1e18;

vector<pii> v[maxn];
vector<ll> vec;
pll s[maxn];
ll ans;

void dfs(int u){
    for(pii p:v[u]){
	dfs(p.F);
	s[p.F].F+= p.S;
	s[p.F].S+= p.S;
    }
    vec.clear();
    ll num=0, lim=0;
    for(pii p:v[u]){
	num+= s[p.F].S - s[p.F].F;
	vec.PB( s[p.F].F ), vec.PB( s[p.F].S );
	lim=max(lim, s[p.F].F);
    }
    sort(vec.begin(), vec.end() );
    if(sz(vec)){
	int mid=sz(vec)/2;
	s[u]={ vec[mid-1], vec[mid] };
	s[u].F= max(s[u].F, lim);
	s[u].S= max(s[u].S, lim);
	
	ans-=num;

	for(ll x:vec){
	    ans+= abs( s[u].F - x );
	}
    }
}

int main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie();

    int n,m; cin>>n>>m;

    for(int i=1;i<n+m;i++){
	int x,y; cin>>x>>y;
	v[--x].PB({i,y});
    }
    dfs(0);
    return cout<<(ans/2)<<endl,0;
}
// Deathly mistakes:
//  * Read the problem carefully.
//  * Check maxn.
//  * Overflows.


// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Incorrect 9 ms 7416 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Incorrect 8 ms 7416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Incorrect 9 ms 7416 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 7416 KB Output is correct
2 Incorrect 9 ms 7416 KB Output isn't correct
3 Halted 0 ms 0 KB -