# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
856461 | ttamx | Museum (CEOI17_museum) | C++14 | 417 ms | 784976 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
const int N=10005;
const int inf=1e9;
int n,k,x;
vector<pair<int,int>> adj[N];
int dp[2][N][N];
int sz[N];
void dfs(int u,int p=-1){
sz[u]=1;
for(auto [v,w]:adj[u])if(v!=p){
dfs(v,u);
for(int i=sz[u];i>=0;i--){
for(int j=sz[v];j>=0;j--){
dp[0][u][i+j]=min(dp[0][u][i+j],dp[0][u][i]+dp[0][v][j]+w*2);
dp[1][u][i+j]=min(dp[1][u][i+j],dp[1][u][i]+dp[0][v][j]+w*2);
dp[1][u][i+j]=min(dp[1][u][i+j],dp[0][u][i]+dp[1][v][j]+w);
}
}
sz[u]+=sz[v];
}
}
int main(){
cin.tie(nullptr)->sync_with_stdio(false);
cin >> n >> k >> x;
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |