제출 #31600

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

beads

#include <bits/stdc++.h>
using namespace std;

typedef pair<int, int> ii;

const int N = 1e4 + 5;

int n, dp[N][2], ans;
vector<ii> a[N], b[N];
vector<int> l[N], r[N];

void dfs(int u, int p) {
    b[u].clear();
    b[u].push_back(ii(0, 0));
    for(int i = 0; i < a[u].size(); ++i) {
        int v = a[u][i].first;
        if(v == p) continue;
        dfs(v, u);
        b[u].push_back(a[u][i]);
    }
    l[u].assign(b[u].size() + 1, 0); r[u].assign(b[u].size() + 1, 0);
    for(int i = 1; i < b[u].size(); ++i) {
        int v = b[u][i].first, w = b[u][i].second;
        l[u][i] = l[u][i - 1] + max(dp[v][1] + w, dp[v][0]);
    }
    for(int i = b[u].size() - 1; i >= 1; --i) {
        int v = b[u][i].first, w = b[u][i].second;
        r[u][i] = r[u][i + 1] + max(dp[v][1] + w, dp[v][0]);
    }
    dp[u][0] = l[u][b[u].size() - 1];
    for(int i = 1; i < b[u].size(); ++i) {
        int v = b[u][i].first, w = b[u][i].second;
        dp[u][1] = max(dp[u][1], l[u][i - 1] + r[u][i + 1] + dp[v][0] + w);
    }
    if(b[u].size() == 1) dp[u][1] = -1e9;
}

int main() {
    cin >> n;
    for(int i = 1; i < n; ++i) {
        int u, v, w;
        cin >> u >> v >> w;
        a[u].push_back(ii(v, w));
        a[v].push_back(ii(u, w));
    }
    for(int i = 1; i <= n; ++i) {
        memset(dp, 0, sizeof dp);
        dfs(i, i);
        ans = max(ans, dp[i][0]);
        ans = max(ans, dp[i][1]);
    }
    cout << ans;
}

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

beads.cpp: In function 'void dfs(int, int)':
beads.cpp:15:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 0; i < a[u].size(); ++i) {
                    ~~^~~~~~~~~~~~~
beads.cpp:22:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i < b[u].size(); ++i) {
                    ~~^~~~~~~~~~~~~
beads.cpp:31:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
     for(int i = 1; i < b[u].size(); ++i) {
                    ~~^~~~~~~~~~~~~

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