Submission #412361

#	Time	Username	Problem	Language	Result	Execution time	Memory
412361		soroush	Fireworks (APIO16_fireworks)	C++17	26 / 100	1 ms	468 KiB

fireworks

//叫んで 藻掻もがいて 瞼まぶたを腫らしても
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll , ll> pii;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

const int maxn = 300 + 10;
const ll mod = 1e9+7;

#define pb push_back
#define endl '\n'
#define dokme(x) cout << x , exit(0)
#define ms(x , y) memset(x , y , sizeof x)
ll pw(ll a, ll b, ll md = mod){ll res = 1;while(b){if(b&1){res=(a*res)%md;}a=(a*a)%md;b>>=1;}return(res);}

int n , m;
vector < pii > adj[maxn];
priority_queue < int > slope[maxn];
ll ans = 0;

void merge(int u , int v){
	if(slope[u].size() > slope[v].size())
		swap(slope[u] , slope[v]);
	while(slope[u].size())
		slope[v].push(slope[u].top()) , slope[u].pop();
}

void dfs(int v, int w = 0){
	if(adj[v].empty())
		slope[v].push(0), slope[v].push(0);
	for(auto uw : adj[v]){
		int u = uw.first , w = uw.second;
		dfs(u , w);
		merge(u , v);
	}
	for(int i = 0 ; i < int(adj[v].size()) - 1 ; i ++)
		slope[v].pop();
	int a = slope[v].top();slope[v].pop();
	int b = slope[v].top();slope[v].pop();
	slope[v].push(a + w);
	slope[v].push(b + w);
}

int32_t main(){
	ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
	cin >> n >> m;
	n += m;
	for(int i = 2 ; i <= n ; i ++){
		int v , w;
		cin >> v >> w;
		adj[v].pb({i , w});
		ans += w;
	}
	dfs(1);
	slope[1].pop();
	while(slope[1].size())
		ans-=slope[1].top() , slope[1].pop();
	cout << ans;
	return(0);
}

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