oj.uz

Submission #338237

# Submission time Handle Problem Language Result Execution time Memory
338237 2020-12-22T19:50:12 Z kostia244 Museum (CEOI17_museum) C++17
100 / 100
 700 ms 784748 KB 
#include <bits/stdc++.h>
#define pii pair<int,int>
#define f first
#define s second
using namespace std;
 
const int mn = 1e4+1, INF=1e9;
int dp[2][mn][mn],sub[mn],k;
vector<pii> edges[mn];
//dp[0/1][i][j]
//i - parent vertice
//j - number of vertices visited
//0 -> return to i
//1 -> no return to i
 
void dfs(int c, int p)
{
    sub[c]=1;
    dp[0][c][1]=0;
    dp[1][c][1]=0;
    for (pii i : edges[c])
        if (i.f!=p)
        {
            dfs(i.f,c);
            sub[c]+=sub[i.f];
            for (int j=sub[c];j>1;--j)
                for (int K= max(sub[i.f]+j-sub[c], 1);K<=min(sub[i.f],j);++K)
                {
                    dp[0][c][j]=min(dp[0][c][j],dp[0][c][j-K]+dp[0][i.f][K]+2*i.s);
                    dp[1][c][j]=min(dp[1][c][j],min(dp[0][c][j-K]+dp[1][i.f][K]+i.s,dp[1][c][j-K]+dp[0][i.f][K]+2*i.s));
                }
        }
}
 
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n,x,a,b,c;
    cin>>n>>k>>x;
    for (int i=1;i<n;++i)
    {
        cin>>a>>b>>c;
        edges[a].push_back({b,c});
        edges[b].push_back({a,c});
    }
    for (int i=0;i<=n;++i)
        for (int j=0;j<=k;++j)
        {
            dp[0][i][j]=INF;
            dp[1][i][j]=INF;
        }
    dfs(x,0);
    cout<<dp[1][x][k];
    return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 748 KB Output is correct

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 91520 KB Output is correct
2 Correct 186 ms 91628 KB Output is correct
3 Correct 398 ms 220780 KB Output is correct
4 Correct 252 ms 131180 KB Output is correct
5 Correct 193 ms 99308 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 195 ms 91520 KB Output is correct
2 Correct 186 ms 91628 KB Output is correct
3 Correct 398 ms 220780 KB Output is correct
4 Correct 252 ms 131180 KB Output is correct
5 Correct 193 ms 99308 KB Output is correct
6 Correct 180 ms 91116 KB Output is correct
7 Correct 322 ms 166380 KB Output is correct
8 Correct 353 ms 90604 KB Output is correct
9 Correct 292 ms 90732 KB Output is correct
10 Correct 194 ms 91244 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 748 KB Output is correct
2 Correct 1 ms 748 KB Output is correct
3 Correct 1 ms 748 KB Output is correct
4 Correct 1 ms 748 KB Output is correct
5 Correct 1 ms 748 KB Output is correct
6 Correct 195 ms 91520 KB Output is correct
7 Correct 186 ms 91628 KB Output is correct
8 Correct 398 ms 220780 KB Output is correct
9 Correct 252 ms 131180 KB Output is correct
10 Correct 193 ms 99308 KB Output is correct
11 Correct 180 ms 91116 KB Output is correct
12 Correct 322 ms 166380 KB Output is correct
13 Correct 353 ms 90604 KB Output is correct
14 Correct 292 ms 90732 KB Output is correct
15 Correct 194 ms 91244 KB Output is correct
16 Correct 224 ms 162028 KB Output is correct
17 Correct 406 ms 473836 KB Output is correct
18 Correct 325 ms 199020 KB Output is correct
19 Correct 347 ms 161004 KB Output is correct
20 Correct 235 ms 161516 KB Output is correct
21 Correct 643 ms 784364 KB Output is correct
22 Correct 595 ms 784236 KB Output is correct
23 Correct 696 ms 784236 KB Output is correct
24 Correct 570 ms 784236 KB Output is correct
25 Correct 700 ms 784748 KB Output is correct