oj.uz

Submission #793374

# Submission time Handle Problem Language Result Execution time Memory
793374 2023-07-25T18:44:55 Z ToniB Fireworks (APIO16_fireworks) C++17
0 / 100
 5 ms 1352 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e17;
const int MAXN = 5005;

int n, m;
vector<pair<int, int> > adj[MAXN];
ll val[MAXN], dp[MAXN][MAXN];
vector<ll> walk;

void precalc(int node){
	for(pair<int, int> x : adj[node]){
		val[x.first] = val[node] + x.second;
		precalc(x.first);
	}
	walk.push_back(val[node]);
	walk.push_back(val[node] - 1);
	walk.push_back(val[node] + 1);
}

void dfs(int node){
	if(node >= n){
		for(int i = 0; i < (int)walk.size(); ++i){
			if(val[node] == walk[i]) dp[node][i] = 0;
			else dp[node][i] = inf;
		}
	}
	for(pair<int, int> x : adj[node]){
		dfs(x.first);

		multiset<ll> lo, hi;
		vector<ll> uk ((int)walk.size());

		for(int i = 0; i < (int)walk.size(); ++i){
			lo.insert(dp[x.first][i] - walk[i]);
			uk[i] = walk[i] + *lo.begin();
		}

		int p = (int)walk.size() - 1;
		for(int i = (int)walk.size() - 1; i >= 0; --i){
			hi.insert(dp[x.first][i] + walk[i]);

			while(p > i && x.second + walk[i] - walk[p] < 0){
				assert(hi.find(dp[x.first][p] + walk[p]) != hi.end());
				hi.erase(hi.find(dp[x.first][p] + walk[p]));
				--p;
			}
			uk[i] = min(uk[i], *hi.begin() - walk[i]);
		}

		for(int i = 0; i < (int)walk.size(); ++i){
			dp[node][i] += uk[i];
		}
	}
}

int main(){
	cin >> n >> m;
	for(int i = 1; i < n + m; ++i){
		int p, c;
		cin >> p >> c, --p;
		adj[p].push_back({i, c});
	}
	precalc(0);
	sort(walk.begin(), walk.end());
	walk.erase(unique(walk.begin(), walk.end()), walk.end());

	dfs(0);

	ll ans = dp[0][0];
	for(int i = 1; i < (int)walk.size(); ++i) ans = min(ans, dp[0][i]);

	cout << ans;
	return 0;
}

Subtask #1
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 4 ms 980 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Incorrect 5 ms 980 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #2
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 724 KB Output is correct
4 Correct 2 ms 852 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 2 ms 980 KB Output is correct
7 Correct 2 ms 1108 KB Output is correct
8 Incorrect 4 ms 1352 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 4 ms 980 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Incorrect 5 ms 980 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 468 KB Output is correct
3 Correct 4 ms 980 KB Output is correct
4 Correct 5 ms 980 KB Output is correct
5 Correct 4 ms 980 KB Output is correct
6 Correct 4 ms 980 KB Output is correct
7 Incorrect 5 ms 980 KB Output isn't correct
8 Halted 0 ms 0 KB -