제출 #1056654

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1056654		PanosPask	구슬과 끈 (APIO14_beads)	C++14	28 / 100	1053 ms	1628 KiB

beads

#include <bits/stdc++.h>
#define pb push_back
#define mp make_pair

using namespace std;

typedef pair<int, int> pi;

const int INF = 1e9;

int N;
vector<vector<pi>> adj_list;

/* dp[node][is_middle]:
 * The maximum score in the subtree of node.
 * is_middle is a boolean variable denoting if node was inserted in the middle via insert operation
 */
vector<vector<int>> dp;

void process_subtree(int node, int par)
{
    dp[node][0] = 0;
    dp[node][1] = -INF;
    
    // Maximum gain from using one of the kids as an endpoint for a red edge starting at par
    // and then inserting node and making the edges blue
    int opt_follow = -INF;

    for (auto [neigh, w] : adj_list[node]) {
        if (neigh == par) {
            continue;
        }

        process_subtree(neigh, node);

        // Gain is the maximum we can get
        int gain = max(dp[neigh][1] + w, dp[neigh][0]);

        dp[node][0] += max(dp[neigh][1] + w, dp[neigh][0]);

        opt_follow = max(opt_follow, dp[neigh][0] + w - gain);
    }

    if (opt_follow != -INF) {
        dp[node][1] = dp[node][0] + opt_follow;
    }
}

int main(void)
{
    scanf("%d", &N);

    adj_list.resize(N);
    dp.resize(N, vector<int>(2, -INF));

    for (int i = 0; i < N - 1; i++) {
        int u, v, w;
        scanf("%d %d %d", &u, &v, &w);
        u--; v--;

        adj_list[u].pb(mp(v, w));
        adj_list[v].pb(mp(u, w));
    }

    int ans = 0;
    for (int i = 0; i < N; i++) {
        process_subtree(i, i);
        ans = max(ans, dp[i][0]);
    }

    printf("%d\n", ans);

    return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

beads.cpp: In function 'void process_subtree(int, int)':
beads.cpp:29:15: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   29 |     for (auto [neigh, w] : adj_list[node]) {
      |               ^
beads.cpp: In function 'int main()':
beads.cpp:51:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   51 |     scanf("%d", &N);
      |     ~~~~~^~~~~~~~~~
beads.cpp:58:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   58 |         scanf("%d %d %d", &u, &v, &w);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~

• Subtask 1: 13 / 13
• Subtask 2: 15 / 15
• Subtask 3: 0 / 29
• Subtask 4: 0 / 43