oj.uz

Submission #223917

# Submission time Handle Problem Language Result Execution time Memory
223917 2020-04-16T20:46:56 Z Leonardo_Paes Museum (CEOI17_museum) C++17
100 / 100
 452 ms 169464 KB 
#include <bits/stdc++.h>

using namespace std;

#define f first
#define s second

const int maxn = 1e4+10, inf = 0x3f3f3f3f;

typedef pair<int,int> pii;

int n, k, x, siz[maxn], dp[maxn][maxn][2];

vector<pii> grafo[maxn];

inline void dfs(int u, int p = 0){
    siz[u] = 1;

    for(auto v : grafo[u]){
        if(v.f == p) continue;

        dfs(v.f, u);

        siz[u] += siz[v.f];
    }
}

inline int solve(int u, int p = 0){
    int sizes = 1, d;

    for(auto v : grafo[u]){
        if(v.f == p) continue;

        solve(v.f, u);

        sizes += siz[v.f];

        d = v.s;

        for(int i=sizes; i>=2; i--){
            for(int j=max(0, i-sizes+siz[v.f]); j<=min(i, siz[v.f]); j++){
                dp[u][i][0] = min({dp[u][i][0], dp[u][i-j][0] + dp[v.f][j][1]
                + 2*d, dp[u][i-j][1] + dp[v.f][j][0] + d});
                dp[u][i][1] = min({dp[u][i][1], dp[u][i-j][1] + dp[v.f][j][1] + 2*d});
            }
        }
    }
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

    cin >> n >> k >> x;

    for(int i=1; i<n; i++){
        int u, v, d;

        cin >> u >> v >> d;

        grafo[u].push_back({v, d});
        grafo[v].push_back({u, d});
    }

    dfs(x);

    for(int i=1; i<=n; i++){
        for(int j=2; j<=siz[i]; j++){
            dp[i][j][0] = dp[i][j][1] = inf;
        }
    }

    solve(x);

    cout << dp[x][k][0] << endl;

    return 0;
}

Compilation message

museum.cpp: In function 'int solve(int, int)':
museum.cpp:48:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

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

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 28920 KB Output is correct
2 Correct 163 ms 29172 KB Output is correct
3 Correct 368 ms 164856 KB Output is correct
4 Correct 233 ms 73080 KB Output is correct
5 Correct 184 ms 40192 KB Output is correct

Subtask #3
35.0 / 35.0

# Verdict Execution time Memory Grader output
1 Correct 164 ms 28920 KB Output is correct
2 Correct 163 ms 29172 KB Output is correct
3 Correct 368 ms 164856 KB Output is correct
4 Correct 233 ms 73080 KB Output is correct
5 Correct 184 ms 40192 KB Output is correct
6 Correct 166 ms 23424 KB Output is correct
7 Correct 292 ms 107768 KB Output is correct
8 Correct 452 ms 2688 KB Output is correct
9 Correct 357 ms 2912 KB Output is correct
10 Correct 191 ms 3888 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 640 KB Output is correct
2 Correct 5 ms 640 KB Output is correct
3 Correct 5 ms 640 KB Output is correct
4 Correct 5 ms 640 KB Output is correct
5 Correct 5 ms 640 KB Output is correct
6 Correct 164 ms 28920 KB Output is correct
7 Correct 163 ms 29172 KB Output is correct
8 Correct 368 ms 164856 KB Output is correct
9 Correct 233 ms 73080 KB Output is correct
10 Correct 184 ms 40192 KB Output is correct
11 Correct 166 ms 23424 KB Output is correct
12 Correct 292 ms 107768 KB Output is correct
13 Correct 452 ms 2688 KB Output is correct
14 Correct 357 ms 2912 KB Output is correct
15 Correct 191 ms 3888 KB Output is correct
16 Correct 168 ms 29688 KB Output is correct
17 Correct 167 ms 29432 KB Output is correct
18 Correct 246 ms 82680 KB Output is correct
19 Correct 362 ms 2804 KB Output is correct
20 Correct 162 ms 4864 KB Output is correct
21 Correct 287 ms 105720 KB Output is correct
22 Correct 169 ms 29176 KB Output is correct
23 Correct 359 ms 2816 KB Output is correct
24 Correct 164 ms 4856 KB Output is correct
25 Correct 361 ms 169464 KB Output is correct