oj.uz

답안 #793349

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
793349 2023-07-25T18:11:56 Z ToniB Fireworks (APIO16_fireworks) C++17
26 / 100
 36 ms 3916 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf = 1e15;
const int MAXN = 5005;

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

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

void dfs(int node){
	if(node >= n){
		for(int i = 0; i < n + m; ++i){
			if(walk[perm[i]] == walk[node]) 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 (n + m);

		for(int i = 0; i < n + m; ++i){
			lo.insert(dp[x.first][i] - walk[perm[i]]);
			uk[i] = walk[perm[i]] + *lo.begin();
			if(i != n + m - 1) assert(walk[perm[i]] <= walk[perm[i + 1]]);
		}

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

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

		for(int i = 0; i < n + m; ++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);
	vector<pair<ll, int> > walks;
	for(int i = 0; i < n + m; ++i) walks.push_back({walk[i], i});
	sort(walks.begin(), walks.end());
	for(int i = 0; i < n + m; ++i) perm[i] = walks[i].second;

	dfs(0);

	ll ans = dp[0][0];
	for(int i = 1; i < n + m; ++i) ans = min(ans, dp[0][i]);

	cout << ans;
	return 0;
}

Subtask #1
7.0 / 7.0

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

Subtask #2
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 468 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 596 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 2 ms 980 KB Output is correct
6 Correct 4 ms 1108 KB Output is correct
7 Correct 5 ms 1176 KB Output is correct
8 Correct 7 ms 1364 KB Output is correct
9 Correct 8 ms 1492 KB Output is correct
10 Correct 10 ms 1584 KB Output is correct
11 Correct 11 ms 1748 KB Output is correct
12 Correct 13 ms 2008 KB Output is correct
13 Correct 15 ms 2144 KB Output is correct
14 Correct 11 ms 2388 KB Output is correct
15 Correct 20 ms 2360 KB Output is correct
16 Correct 19 ms 2372 KB Output is correct
17 Correct 19 ms 2388 KB Output is correct
18 Correct 19 ms 2364 KB Output is correct
19 Correct 20 ms 2380 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 5 ms 1176 KB Output is correct
18 Correct 7 ms 1364 KB Output is correct
19 Correct 8 ms 1492 KB Output is correct
20 Correct 10 ms 1584 KB Output is correct
21 Correct 11 ms 1748 KB Output is correct
22 Correct 13 ms 2008 KB Output is correct
23 Correct 15 ms 2144 KB Output is correct
24 Correct 11 ms 2388 KB Output is correct
25 Correct 20 ms 2360 KB Output is correct
26 Correct 19 ms 2372 KB Output is correct
27 Correct 19 ms 2388 KB Output is correct
28 Correct 19 ms 2364 KB Output is correct
29 Correct 20 ms 2380 KB Output is correct
30 Incorrect 36 ms 3916 KB Output isn't correct
31 Halted 0 ms 0 KB -

Subtask #4
0 / 45.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 468 KB Output is correct
3 Correct 1 ms 852 KB Output is correct
4 Correct 1 ms 852 KB Output is correct
5 Correct 1 ms 852 KB Output is correct
6 Correct 1 ms 852 KB Output is correct
7 Correct 2 ms 852 KB Output is correct
8 Correct 1 ms 852 KB Output is correct
9 Correct 1 ms 852 KB Output is correct
10 Correct 1 ms 852 KB Output is correct
11 Correct 1 ms 468 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 852 KB Output is correct
15 Correct 2 ms 980 KB Output is correct
16 Correct 4 ms 1108 KB Output is correct
17 Correct 5 ms 1176 KB Output is correct
18 Correct 7 ms 1364 KB Output is correct
19 Correct 8 ms 1492 KB Output is correct
20 Correct 10 ms 1584 KB Output is correct
21 Correct 11 ms 1748 KB Output is correct
22 Correct 13 ms 2008 KB Output is correct
23 Correct 15 ms 2144 KB Output is correct
24 Correct 11 ms 2388 KB Output is correct
25 Correct 20 ms 2360 KB Output is correct
26 Correct 19 ms 2372 KB Output is correct
27 Correct 19 ms 2388 KB Output is correct
28 Correct 19 ms 2364 KB Output is correct
29 Correct 20 ms 2380 KB Output is correct
30 Incorrect 36 ms 3916 KB Output isn't correct
31 Halted 0 ms 0 KB -