oj.uz

답안 #1094998

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1094998 2024-10-01T07:00:11 Z blackslex Museum (CEOI17_museum) C++17
20 / 100
 405 ms 1048576 KB 
#include<bits/stdc++.h>

using namespace std;
using ll = long long;
using pii = pair<ll, ll>;

int n, k, c, x, y, z;

int main() {
    scanf("%d %d %d", &n, &k, &c);
    vector<int> sz(n + 5, 1);
    vector<vector<pii>> v(n + 5, vector<pii>());
    vector<vector<vector<ll>>> dp(n + 5, vector<vector<ll>>(2, vector<ll>(n + 5, 1e18)));
    for (int i = 1; i < n; i++) {
        scanf("%d %d %d", &x, &y, &z);
        v[x].emplace_back(y, z); v[y].emplace_back(x, z);
    }
    function<void(int, int)> dfs = [&] (int cur, int par) {
        for (auto i: {0, 1}) {
            for (auto j: {0, 1}) dp[cur][i][j] = 0;
        }
        for (auto &[x, y]: v[cur]) {
            if (par == x) continue;
            dfs(x, cur);
            for (int i = sz[cur]; ~i; i--) {
                for (int j = sz[x]; ~j; j--) {
                    dp[cur][0][i + j] = min(dp[cur][0][i + j], dp[cur][1][i] + dp[x][0][j] + y);
                    dp[cur][0][i + j] = min(dp[cur][0][i + j], dp[cur][0][i] + dp[x][1][j] + y * 2);
                    dp[cur][1][i + j] = min(dp[cur][1][i + j], dp[cur][1][i] + dp[x][1][j] + y * 2);
                }
            }
            sz[cur] += sz[x];
        }
    };
    dfs(c, 0);
    printf("%lld", min(dp[c][0][k], dp[c][1][k]));
}

Compilation message

museum.cpp: In function 'int main()':
museum.cpp:10:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   10 |     scanf("%d %d %d", &n, &k, &c);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
museum.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d %d %d", &x, &y, &z);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 405 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 405 ms 1048576 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Runtime error 405 ms 1048576 KB Execution killed with signal 9
7 Halted 0 ms 0 KB -