oj.uz

Submission #363125

# Submission time Handle Problem Language Result Execution time Memory
363125 2021-02-05T05:37:49 Z ijxjdjd Beads and wires (APIO14_beads) C++14
57 / 100
 393 ms 47456 KB 
#include <bits/stdc++.h>
#define FR(i, N) for (int i = 0; i < int(N); i++)
#define all(x) begin(x), end(x)

#define f first
#define s second
using namespace std;

using ll = long long;

const int MAXN = (int)(3e5) + 5;
vector<pair<int, int>> adj[MAXN];
int dp[MAXN][2];
multiset<int> trans[MAXN];
int sm[MAXN];
void dfs(int n, int p, int w) {
    int allSum = 0;
    for (auto& e : adj[n]) {
        if (e.f != p) {
            dfs(e.f, n, e.s);
            trans[n].insert(e.s + dp[e.f][0] - dp[e.f][1]);
            allSum += dp[e.f][1];
        }
    }
    sm[n] = allSum;
    dp[n][0] = allSum;
    dp[n][1] = allSum + (trans[n].size() > 0 ? max(0, *trans[n].rbegin() + w): 0);
}

int ans = 0;
void sol(int n, int p) {
    ans = max(dp[n][0], ans);
    if (trans[n].size() >= 2) {
        ans = max(ans, dp[n][0] + *trans[n].rbegin() + *next(trans[n].rbegin()));
    }
    ans = max(ans, dp[n][0]);
    for (auto e : adj[n]) {
        if (e.f != p) {
            int orin0 = dp[n][0];
            int orin1 = dp[n][1];
            int orinsm = sm[n];
            trans[n].erase(e.s + dp[e.f][0] - dp[e.f][1]);
            sm[n] -= dp[e.f][1];
            dp[n][0] = sm[n];
            dp[n][1] = sm[n] + (trans[n].size() > 0 ? max(0, *trans[n].rbegin() + e.s): 0);
            int orie0 = dp[e.f][0];
            int orie1 = dp[e.f][1];
            int oriesm = sm[e.f];
            sm[e.f] += dp[n][1];
            dp[e.f][0] = sm[e.f];
            dp[e.f][1] = sm[e.f] + (trans[e.f].size() > 0 ? max(0, *trans[e.f].rbegin() + e.s): 0);
            trans[e.f].insert(e.s + dp[n][0] - dp[n][1]);
            sol(e.f, n);
            trans[e.f].erase(e.s + dp[n][0] - dp[n][1]);
            sm[n] = orinsm;
            dp[n][0] = orin0;
            dp[n][1] = orin1;
            dp[e.f][0] = orie0;
            dp[e.f][1] = orie1;
            sm[e.f] = oriesm;
            trans[n].insert(e.s + dp[e.f][0] - dp[e.f][1]);
        }
    }
}
int main() {
//    freopen("input.in", "r", stdin);
	cin.tie(0);
	cin.sync_with_stdio(0);
	int N;
	cin >> N;
	FR(i, N-1) {
        int u, v, w;
        cin >> u >> v >> w;
        u--, v--;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
	}
	dfs(0, 0, 0);
	sol(0, 0);
	cout << ans << '\n';
	return 0;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21484 KB Output is correct
2 Correct 15 ms 21484 KB Output is correct
3 Correct 16 ms 21484 KB Output is correct
4 Correct 14 ms 21484 KB Output is correct
5 Correct 15 ms 21484 KB Output is correct
6 Correct 15 ms 21484 KB Output is correct
7 Correct 15 ms 21484 KB Output is correct
8 Correct 15 ms 21484 KB Output is correct
9 Correct 15 ms 21484 KB Output is correct
10 Correct 15 ms 21484 KB Output is correct
11 Correct 15 ms 21484 KB Output is correct
12 Correct 15 ms 21484 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21484 KB Output is correct
2 Correct 15 ms 21484 KB Output is correct
3 Correct 16 ms 21484 KB Output is correct
4 Correct 14 ms 21484 KB Output is correct
5 Correct 15 ms 21484 KB Output is correct
6 Correct 15 ms 21484 KB Output is correct
7 Correct 15 ms 21484 KB Output is correct
8 Correct 15 ms 21484 KB Output is correct
9 Correct 15 ms 21484 KB Output is correct
10 Correct 15 ms 21484 KB Output is correct
11 Correct 15 ms 21484 KB Output is correct
12 Correct 15 ms 21484 KB Output is correct
13 Correct 14 ms 21484 KB Output is correct
14 Correct 15 ms 21484 KB Output is correct
15 Correct 14 ms 21484 KB Output is correct
16 Correct 15 ms 21484 KB Output is correct
17 Correct 15 ms 21484 KB Output is correct
18 Correct 15 ms 21484 KB Output is correct
19 Correct 15 ms 21484 KB Output is correct
20 Correct 15 ms 21484 KB Output is correct
21 Correct 16 ms 21484 KB Output is correct
22 Correct 16 ms 21484 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21484 KB Output is correct
2 Correct 15 ms 21484 KB Output is correct
3 Correct 16 ms 21484 KB Output is correct
4 Correct 14 ms 21484 KB Output is correct
5 Correct 15 ms 21484 KB Output is correct
6 Correct 15 ms 21484 KB Output is correct
7 Correct 15 ms 21484 KB Output is correct
8 Correct 15 ms 21484 KB Output is correct
9 Correct 15 ms 21484 KB Output is correct
10 Correct 15 ms 21484 KB Output is correct
11 Correct 15 ms 21484 KB Output is correct
12 Correct 15 ms 21484 KB Output is correct
13 Correct 14 ms 21484 KB Output is correct
14 Correct 15 ms 21484 KB Output is correct
15 Correct 14 ms 21484 KB Output is correct
16 Correct 15 ms 21484 KB Output is correct
17 Correct 15 ms 21484 KB Output is correct
18 Correct 15 ms 21484 KB Output is correct
19 Correct 15 ms 21484 KB Output is correct
20 Correct 15 ms 21484 KB Output is correct
21 Correct 16 ms 21484 KB Output is correct
22 Correct 16 ms 21484 KB Output is correct
23 Correct 18 ms 21996 KB Output is correct
24 Correct 18 ms 21996 KB Output is correct
25 Correct 19 ms 22016 KB Output is correct
26 Correct 24 ms 22380 KB Output is correct
27 Correct 23 ms 22508 KB Output is correct
28 Correct 24 ms 22508 KB Output is correct
29 Correct 24 ms 22508 KB Output is correct
30 Correct 25 ms 22528 KB Output is correct
31 Correct 24 ms 23020 KB Output is correct

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 21484 KB Output is correct
2 Correct 15 ms 21484 KB Output is correct
3 Correct 16 ms 21484 KB Output is correct
4 Correct 14 ms 21484 KB Output is correct
5 Correct 15 ms 21484 KB Output is correct
6 Correct 15 ms 21484 KB Output is correct
7 Correct 15 ms 21484 KB Output is correct
8 Correct 15 ms 21484 KB Output is correct
9 Correct 15 ms 21484 KB Output is correct
10 Correct 15 ms 21484 KB Output is correct
11 Correct 15 ms 21484 KB Output is correct
12 Correct 15 ms 21484 KB Output is correct
13 Correct 14 ms 21484 KB Output is correct
14 Correct 15 ms 21484 KB Output is correct
15 Correct 14 ms 21484 KB Output is correct
16 Correct 15 ms 21484 KB Output is correct
17 Correct 15 ms 21484 KB Output is correct
18 Correct 15 ms 21484 KB Output is correct
19 Correct 15 ms 21484 KB Output is correct
20 Correct 15 ms 21484 KB Output is correct
21 Correct 16 ms 21484 KB Output is correct
22 Correct 16 ms 21484 KB Output is correct
23 Correct 18 ms 21996 KB Output is correct
24 Correct 18 ms 21996 KB Output is correct
25 Correct 19 ms 22016 KB Output is correct
26 Correct 24 ms 22380 KB Output is correct
27 Correct 23 ms 22508 KB Output is correct
28 Correct 24 ms 22508 KB Output is correct
29 Correct 24 ms 22508 KB Output is correct
30 Correct 25 ms 22528 KB Output is correct
31 Correct 24 ms 23020 KB Output is correct
32 Correct 72 ms 26348 KB Output is correct
33 Correct 72 ms 26348 KB Output is correct
34 Correct 78 ms 26336 KB Output is correct
35 Correct 371 ms 40704 KB Output is correct
36 Correct 361 ms 40684 KB Output is correct
37 Correct 381 ms 40812 KB Output is correct
38 Correct 331 ms 41052 KB Output is correct
39 Correct 340 ms 41040 KB Output is correct
40 Correct 343 ms 40916 KB Output is correct
41 Incorrect 393 ms 47456 KB Output isn't correct