제출 #491095

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
491095		two_sides	구슬과 끈 (APIO14_beads)	C++17	0 / 100	3 ms	5020 KiB

beads

#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 200005;
const ll INF = 1e18;

ll dp[N][2][2];
vector<pair<int, int>> adj[N];

void add(ll &x, ll y) {
    x = max(x + y, -INF);    
}

void dfs(int u, int p) {
    ll sum = 0;
    pair<ll, ll> best01(-INF, -INF);
    ll best10 = -INF;
    for (auto e : adj[u]) {
        int v, w; tie(v, w) = e;
        if (v == p) continue; dfs(v, u);
        add(dp[u][0][0], max(dp[v][0][0], dp[v][1][0] + w));
        add(dp[u][0][1], max({dp[v][0][0], dp[v][1][0] + w,
                        dp[v][0][1], dp[v][1][1] + w}));
        add(sum, max(dp[v][0][0], dp[v][1][0] + w));
        ll tmp = max(dp[v][0][0], dp[v][0][1])
        + w - max(dp[v][0][0], dp[v][1][0] + w);
        if (best01.first < tmp) {
            best01.second = best01.first;
            best01.first = tmp;
        } else best01.second = max(best01.second, tmp);
        best10 = max(best10, ll(w));
    }
    dp[u][1][0] = dp[u][1][1] = sum;
    add(dp[u][1][0], best10);
    add(dp[u][1][1], best01.first);
    add(sum, best01.first);
    add(sum, best01.second);
    dp[u][0][1] = max(dp[u][0][1], sum);
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int n; cin >> n;
    for (int i = 1; i < n; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        adj[u].emplace_back(v, w);
        adj[v].emplace_back(u, w);
    }
    dfs(1, 0); cout << max(dp[1][0][0], dp[1][0][1]);
}

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

beads.cpp: In function 'void dfs(int, int)':
beads.cpp:23:9: warning: this 'if' clause does not guard... [-Wmisleading-indentation]
   23 |         if (v == p) continue; dfs(v, u);
      |         ^~
beads.cpp:23:31: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the 'if'
   23 |         if (v == p) continue; dfs(v, u);
      |                               ^~~

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