oj.uz

답안 #716931

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
716931 2023-03-31T12:16:14 Z Dan4Life Museum (CEOI17_museum) C++17
0 / 100
 476 ms 18368 KB 
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define int long long
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
const int mxN=(int)1e4+10;
const int mxK=(int)1e2+10;
const int LINF = (int)1e16;
int n, k, s;
vector<pair<int,int>> adj[mxN];
int dp[mxN][mxK][2],dp2[mxN][mxK][2];

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;
	for(int i = 1; i <= sz(v); i++){
		for(int j = 0; j <= k; j++){
			for(int x = 0; x < 2; x++){
				dp2[i][j][x] = dp2[i-1][j][x];
				for(int l = 1; l <= j; l++){
					dp2[i][j][x] = min(dp2[i][j][x], dp2[i-1][j-l][x]+
					dp[v[i-1].fi][l][x]+2*v[i-1].se);
					if(x) continue;
					dp2[i][j][x] = min(dp2[i][j][x], dp2[i-1][j-l][1-x]+
					dp[v[i-1].fi][l][x]+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;
	for(int i = 0; i < mxN; i++)
		for(int j = 0; j < mxK; j++)
			dp[i][j][0]=dp[i][j][1]=LINF;
	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});
	}
	dfs(s,-1); cout << dp[s][k][0];
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17748 KB Output is correct
2 Correct 9 ms 17748 KB Output is correct
3 Correct 8 ms 17748 KB Output is correct
4 Incorrect 9 ms 17708 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 476 ms 18368 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 476 ms 18368 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 17748 KB Output is correct
2 Correct 9 ms 17748 KB Output is correct
3 Correct 8 ms 17748 KB Output is correct
4 Incorrect 9 ms 17708 KB Output isn't correct
5 Halted 0 ms 0 KB -