oj.uz

Submission #716962

# Submission time Handle Problem Language Result Execution time Memory
716962 2023-03-31T13:58:51 Z Dan4Life Museum (CEOI17_museum) C++17
45 / 100
 1002 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mxN=(int)1e4+2;
const int LINF = (int)1e9;
int n, k, s, sub[mxN];
vector<pair<int,int>> adj[mxN];
int dp[mxN][mxN][2], dp2[mxN][mxN][2];
 
int findSize(int s, int p){
	sub[s]=1;
	for(auto [u,w] : adj[s])
		if(u!=p) sub[s]+=findSize(u,s);
	return sub[s];
}
 
void dfs(int s, int p){
	vector<pair<int,int>> v; v.clear();
	for(auto [u,w] : adj[s])
		if(u!=p) dfs(u,s), v.pb({u,w});
	dp[s][1][0]=dp[s][1][1]=0;
	if(!sz(v)) return;
	for(int i = 0; i <= sz(v); i++)
		for(int j = 0; j <= k; j++)
			dp2[i][j][0]=dp2[i][j][1]=LINF;
	dp2[0][0][0] = dp2[0][0][1] = 0; int tot = 1;
	for(int i = 1; i <= sz(v); i++){
		auto u = v[i-1].fi; tot+=sub[u];
		for(int j = tot; j >= 0; j--){
			for(int x = 0; x < 2; x++){
				dp2[i][j][x] = min(dp2[i][j][x],dp2[i-1][j][x]);
				for(int l = max(1,j-tot+sub[u]); l <= min(j,sub[u]); l++){
					dp2[i][j][x] = min(dp2[i][j][x], dp2[i-1][j-l][x]+dp[u][l][1]+2*v[i-1].se);
					if(!x)dp2[i][j][x] = min(dp2[i][j][x], dp2[i-1][j-l][1]+dp[u][l][0]+v[i-1].se);
				}
			}
		}
	}
	for(int i = 2; i <= k; i++)
		for(int j = 0; j < 2; j++)
			dp[s][i][j] = min(dp[s][i][j],dp2[sz(v)][i-1][j]);
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n >> k >> s;
	memset(dp,63,sizeof(dp));
	for(int i = 1; i < n; i++){
		int a, b, c; cin >> a >> b >> c;
		adj[a].pb({b,c}), adj[b].pb({a,c});
	}
	findSize(s,-1); dfs(s,-1); cout << dp[s][k][0];
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 783556 KB Output is correct
2 Correct 284 ms 783648 KB Output is correct
3 Correct 297 ms 783572 KB Output is correct
4 Correct 283 ms 783672 KB Output is correct
5 Correct 281 ms 783680 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1002 ms 784276 KB Output is correct
2 Correct 748 ms 784172 KB Output is correct
3 Correct 725 ms 784988 KB Output is correct
4 Correct 750 ms 784524 KB Output is correct
5 Correct 766 ms 784276 KB Output is correct

Subtask #3
0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 1002 ms 784276 KB Output is correct
2 Correct 748 ms 784172 KB Output is correct
3 Correct 725 ms 784988 KB Output is correct
4 Correct 750 ms 784524 KB Output is correct
5 Correct 766 ms 784276 KB Output is correct
6 Correct 763 ms 784880 KB Output is correct
7 Correct 767 ms 784948 KB Output is correct
8 Runtime error 690 ms 1048576 KB Execution killed with signal 9
9 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 281 ms 783556 KB Output is correct
2 Correct 284 ms 783648 KB Output is correct
3 Correct 297 ms 783572 KB Output is correct
4 Correct 283 ms 783672 KB Output is correct
5 Correct 281 ms 783680 KB Output is correct
6 Correct 1002 ms 784276 KB Output is correct
7 Correct 748 ms 784172 KB Output is correct
8 Correct 725 ms 784988 KB Output is correct
9 Correct 750 ms 784524 KB Output is correct
10 Correct 766 ms 784276 KB Output is correct
11 Correct 763 ms 784880 KB Output is correct
12 Correct 767 ms 784948 KB Output is correct
13 Runtime error 690 ms 1048576 KB Execution killed with signal 9
14 Halted 0 ms 0 KB -