oj.uz

답안 #404089

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
404089 2021-05-13T18:32:19 Z opukittpceno_hhr 구슬과 끈 (APIO14_beads) C++17
28 / 100
 1000 ms 5420 KB 
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <algorithm>
#include <string>
#include <cmath>
#include <cstdio>
#include <iomanip>
#include <fstream>
#include <cassert>
#include <cstring>
#include <unordered_set>
#include <unordered_map>
#include <numeric>
#include <ctime>
#include <bitset>
#include <complex>
#include <chrono>
#include <random>
#include <functional>

using namespace std;

#define int long long

const int INF = 1e18 + 239;
const int N = 2e5 + 7;

int to[N];
int dp[N][2];

vector<pair<int, int>> g[N];

void dfs(int cur, int p) {
    vector<int> sons;
    for (auto [t, w] : g[cur]) {
        if (t != p) {
            to[t] = w;
            sons.push_back(t);
            dfs(t, cur);
        }
    }
    if (sons.empty()) {
        dp[cur][0] = 0;
        dp[cur][1] = -INF;
        return;
    }
    dp[cur][0] = -INF;
    dp[cur][1] = -INF;
    sort(sons.begin(), sons.end(), [&](int f, int s) {
        return (dp[f][0] + to[f]) - max(dp[f][0], dp[f][1]) > (dp[s][0] + to[s]) - max(dp[s][0], dp[s][1]);
    });
    //
    {
        int c = dp[sons[0]][0] + to[sons[0]] + to[cur];
        for (int i = 1; i < (int)sons.size(); i++) {
            c += max(dp[sons[i]][0], dp[sons[i]][1]);
        }
        dp[cur][1] = max(dp[cur][1], c);
    }
    //
    {
        int c = 0;
        for (auto u : sons) {
            c += max(dp[u][0], dp[u][1]);
        }
        dp[cur][0] = max(dp[cur][0], c);
    }
    //
    // if (sons.size() > 1) {
    //     int c = dp[sons[0]][0] + dp[sons[1]][0] + to[sons[0]] + to[sons[1]];
    //     for (int i = 2; i < (int)sons.size(); i++) {
    //         c += max(dp[sons[i]][0], dp[sons[i]][1]);
    //     }
    //     dp[cur][0] = max(dp[cur][0], c);
    // }
}

signed main() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    for (int i = 0; i + 1 < n; i++) {
        int u, v, w;
        cin >> u >> v >> w;
        u--;
        v--;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    int ans = 0;
    for (int i = 0; i < n; i++) {
        dfs(i, -1);
        ans = max(ans, dp[i][0]);
    }
    cout << ans << '\n';
    // int root = 0;
    // dfs(root, -1);
    // cout << dp[root][0] << '\n';
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 4 ms 5048 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct

Subtask #2
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 4 ms 5048 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 5020 KB Output is correct
15 Correct 5 ms 4940 KB Output is correct
16 Correct 7 ms 5048 KB Output is correct
17 Correct 6 ms 4940 KB Output is correct
18 Correct 6 ms 4940 KB Output is correct
19 Correct 6 ms 5136 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 5 ms 4940 KB Output is correct
22 Correct 6 ms 4940 KB Output is correct

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 4 ms 5048 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 5020 KB Output is correct
15 Correct 5 ms 4940 KB Output is correct
16 Correct 7 ms 5048 KB Output is correct
17 Correct 6 ms 4940 KB Output is correct
18 Correct 6 ms 4940 KB Output is correct
19 Correct 6 ms 5136 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 5 ms 4940 KB Output is correct
22 Correct 6 ms 4940 KB Output is correct
23 Execution timed out 1066 ms 5420 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 4 ms 4940 KB Output is correct
3 Correct 3 ms 4940 KB Output is correct
4 Correct 3 ms 4940 KB Output is correct
5 Correct 3 ms 4940 KB Output is correct
6 Correct 4 ms 5020 KB Output is correct
7 Correct 4 ms 5048 KB Output is correct
8 Correct 4 ms 4940 KB Output is correct
9 Correct 4 ms 4940 KB Output is correct
10 Correct 4 ms 4940 KB Output is correct
11 Correct 4 ms 4940 KB Output is correct
12 Correct 3 ms 5024 KB Output is correct
13 Correct 4 ms 4940 KB Output is correct
14 Correct 4 ms 5020 KB Output is correct
15 Correct 5 ms 4940 KB Output is correct
16 Correct 7 ms 5048 KB Output is correct
17 Correct 6 ms 4940 KB Output is correct
18 Correct 6 ms 4940 KB Output is correct
19 Correct 6 ms 5136 KB Output is correct
20 Correct 5 ms 4940 KB Output is correct
21 Correct 5 ms 4940 KB Output is correct
22 Correct 6 ms 4940 KB Output is correct
23 Execution timed out 1066 ms 5420 KB Time limit exceeded
24 Halted 0 ms 0 KB -