oj.uz

Submission #404142

# Submission time Handle Problem Language Result Execution time Memory
404142 2021-05-13T21:56:19 Z opukittpceno_hhr Beads and wires (APIO14_beads) C++17
100 / 100
 439 ms 46556 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 rP[N];
int to[N];
int dp[N][2];
int udp[N][2];

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

void dfs(int cur, int p) {
    rP[cur] = p;
    int S = 0;
    int mx = -INF;
    for (auto [t, w] : g[cur]) {
        if (t != p) {
            to[t] = w;
            dfs(t, cur);
            S += max(dp[t][0], dp[t][1]);
            mx = max(mx, dp[t][0] + to[t] - max(dp[t][0], dp[t][1]));
        }
    }
    dp[cur][1] = S + mx + to[cur];
    dp[cur][0] = S;
}

void dfs2(int cur, int p) {
    int S = 0;
    multiset<int> smx = {-INF};
    if (p != -1) {
        S += max(udp[cur][0], udp[cur][1]);
        smx.insert(udp[cur][0] + to[cur] - max(udp[cur][0], udp[cur][1]));
    }
    for (auto [t, w] : g[cur]) {
        if (t != p) {
            S += max(dp[t][0], dp[t][1]);
            smx.insert(dp[t][0] + to[t] - max(dp[t][0], dp[t][1]));
        }
    }
    for (auto [t, w] : g[cur]) {
        if (t != p) {
            S -= max(dp[t][0], dp[t][1]);
            smx.erase(smx.find(dp[t][0] + to[t] - max(dp[t][0], dp[t][1])));
            udp[t][0] = S;
            udp[t][1] = S + *smx.rbegin() + to[t];
            S += max(dp[t][0], dp[t][1]);
            smx.insert(dp[t][0] + to[t] - max(dp[t][0], dp[t][1]));
        }
    }
    for (auto [t, w] : g[cur]) {
        if (t != p) {
            dfs2(t, cur);
        }
    }
}

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});
    }
    dfs(0, -1);
    dfs2(0, -1);
    int ans = 0;
    for (int i = 0; i < n; i++) {
        int c = 0;
        for (auto [j, w] : g[i]) {
            if (j == rP[i]) {
                c += max(udp[i][0], udp[i][1]);
            } else {
                c += max(dp[j][0], dp[j][1]);
            }
        }
        ans = max(ans, c);
    }
    cout << ans << '\n';
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 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 4 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 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 4 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 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 4 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 7 ms 5544 KB Output is correct
24 Correct 8 ms 5580 KB Output is correct
25 Correct 9 ms 5536 KB Output is correct
26 Correct 14 ms 6056 KB Output is correct
27 Correct 11 ms 6072 KB Output is correct
28 Correct 14 ms 6564 KB Output is correct
29 Correct 13 ms 6476 KB Output is correct
30 Correct 13 ms 6352 KB Output is correct
31 Correct 14 ms 7628 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4940 KB Output is correct
2 Correct 3 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 4 ms 4940 KB Output is correct
6 Correct 4 ms 4940 KB Output is correct
7 Correct 3 ms 4940 KB Output is correct
8 Correct 3 ms 4940 KB Output is correct
9 Correct 3 ms 4940 KB Output is correct
10 Correct 3 ms 4940 KB Output is correct
11 Correct 3 ms 4940 KB Output is correct
12 Correct 3 ms 4940 KB Output is correct
13 Correct 3 ms 4940 KB Output is correct
14 Correct 3 ms 4940 KB Output is correct
15 Correct 4 ms 4940 KB Output is correct
16 Correct 3 ms 4940 KB Output is correct
17 Correct 3 ms 4940 KB Output is correct
18 Correct 4 ms 4940 KB Output is correct
19 Correct 4 ms 4940 KB Output is correct
20 Correct 3 ms 5068 KB Output is correct
21 Correct 3 ms 4940 KB Output is correct
22 Correct 3 ms 5068 KB Output is correct
23 Correct 7 ms 5544 KB Output is correct
24 Correct 8 ms 5580 KB Output is correct
25 Correct 9 ms 5536 KB Output is correct
26 Correct 14 ms 6056 KB Output is correct
27 Correct 11 ms 6072 KB Output is correct
28 Correct 14 ms 6564 KB Output is correct
29 Correct 13 ms 6476 KB Output is correct
30 Correct 13 ms 6352 KB Output is correct
31 Correct 14 ms 7628 KB Output is correct
32 Correct 60 ms 10612 KB Output is correct
33 Correct 54 ms 10668 KB Output is correct
34 Correct 54 ms 10720 KB Output is correct
35 Correct 326 ms 28240 KB Output is correct
36 Correct 319 ms 28100 KB Output is correct
37 Correct 301 ms 28196 KB Output is correct
38 Correct 409 ms 35968 KB Output is correct
39 Correct 370 ms 36652 KB Output is correct
40 Correct 439 ms 35892 KB Output is correct
41 Correct 355 ms 46556 KB Output is correct