oj.uz

Submission #137364

# Submission time Handle Problem Language Result Execution time Memory
137364 2019-07-27T14:10:38 Z egorlifar Beads and wires (APIO14_beads) C++17
100 / 100
 288 ms 23148 KB 
/*
ЗАПУСКАЕМ
░ГУСЯ░▄▀▀▀▄░РАБОТЯГУ░░
▄███▀░◐░░░▌░░░░░░░
░░░░▌░░░░░▐░░░░░░░
░░░░▐░░░░░▐░░░░░░░
░░░░▌░░░░░▐▄▄░░░░░
░░░░▌░░░░▄▀▒▒▀▀▀▀▄
░░░▐░░░░▐▒▒▒▒▒▒▒▒▀▀▄
░░░▐░░░░▐▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░▀▄░░░░▀▄▒▒▒▒▒▒▒▒▒▒▀▄
░░░░░░▀▄▄▄▄▄█▄▄▄▄▄▄▄▄▄▄▄▀▄
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░░░▌▌░▌▌░░░░░
░░░░░░░░░▄▄▌▌▄▌▌░░░░░
 */
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2>inline void chkmin(T1 &x, T2 y) { if (x > y) x = y; }
template<typename T1, typename T2>inline void chkmax(T1 &x, T2 y) { if (x < y) x = y; }
#define sz(c) (int)(c).size()
#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define left left224
#define right right224
#define next next224
#define rank rank224
#define prev prev224
#define y1 y1224
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define files(FILENAME) read(FILENAME), write(FILENAME)
#define pb push_back
#define mp make_pair
const string FILENAME = "input";
const int MAXN = 200228;


int n;
vector<pair<int, int> > g[MAXN];
int dp[MAXN][2];
int up[MAXN][2];


void dfs(int u, int pr = -1, int last = 0) {
    int sum = 0;
    int add = -1e9;
    for (auto h: g[u]) {
        if (h.first == pr) {
            continue;
        }
        dfs(h.first, u, h.second);
        sum += max(dp[h.first][0], dp[h.first][1]); 
        chkmax(add, dp[h.first][0] - max(dp[h.first][0], dp[h.first][1]) + h.second + last);
    }
    dp[u][0] = sum;
    dp[u][1] = sum + add;
} 


int ans = 0;


void calcdp(int u, int pr = -1, int last = 0) {
    chkmax(ans, max(up[u][0], up[u][1]) + dp[u][0]);
    int cnt = 0;
    int mx1 = -1e9, mx2 = -1e9;
    for (auto h: g[u]) {
        if (h.first == pr) {
            continue;
        }
        int add = dp[h.first][0] - max(dp[h.first][0], dp[h.first][1]) + h.second;
        cnt++;
        if (mx1 < add) {
            mx2 = mx1;
            mx1 = add;
        } else {
            chkmax(mx2, add);
        }
    }
    for (auto h: g[u]) {
        if (h.first == pr) {
            continue;
        }
        int add = dp[h.first][0] - max(dp[h.first][0], dp[h.first][1]) + h.second;
        int sum = dp[u][0] - max(dp[h.first][0], dp[h.first][1]);
        if (u) {
            up[h.first][1] = up[u][0] + last + h.second + sum;
        }
        if (cnt > 1) {
            int val = (add == mx1 ? mx2: mx1);
            chkmax(up[h.first][1], h.second + sum + val + max(up[u][0], up[u][1]));
        }
        up[h.first][0] = max(up[u][0], up[u][1]) + sum;
        calcdp(h.first, u, h.second);
    }
}
 

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
   // read(FILENAME); 
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int a, b, c;
        cin >> a >> b >> c;
        a--, b--;
        g[a].pb({b, c});
        g[b].pb({a, c});
    }
    dfs(0);
    calcdp(0);
    cout << ans << endl;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 6 ms 4988 KB Output is correct

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 6 ms 4988 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 9 ms 5368 KB Output is correct
24 Correct 9 ms 5368 KB Output is correct
25 Correct 9 ms 5368 KB Output is correct
26 Correct 12 ms 5752 KB Output is correct
27 Correct 12 ms 5752 KB Output is correct
28 Correct 11 ms 5752 KB Output is correct
29 Correct 11 ms 5752 KB Output is correct
30 Correct 11 ms 5752 KB Output is correct
31 Correct 12 ms 6012 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 5112 KB Output is correct
2 Correct 6 ms 5112 KB Output is correct
3 Correct 6 ms 4984 KB Output is correct
4 Correct 6 ms 5112 KB Output is correct
5 Correct 6 ms 5112 KB Output is correct
6 Correct 7 ms 4984 KB Output is correct
7 Correct 6 ms 5112 KB Output is correct
8 Correct 6 ms 5112 KB Output is correct
9 Correct 6 ms 4984 KB Output is correct
10 Correct 7 ms 5112 KB Output is correct
11 Correct 7 ms 4984 KB Output is correct
12 Correct 6 ms 4988 KB Output is correct
13 Correct 6 ms 4984 KB Output is correct
14 Correct 6 ms 4984 KB Output is correct
15 Correct 6 ms 4984 KB Output is correct
16 Correct 6 ms 4984 KB Output is correct
17 Correct 6 ms 5112 KB Output is correct
18 Correct 6 ms 5112 KB Output is correct
19 Correct 6 ms 5112 KB Output is correct
20 Correct 6 ms 5112 KB Output is correct
21 Correct 6 ms 5112 KB Output is correct
22 Correct 6 ms 5112 KB Output is correct
23 Correct 9 ms 5368 KB Output is correct
24 Correct 9 ms 5368 KB Output is correct
25 Correct 9 ms 5368 KB Output is correct
26 Correct 12 ms 5752 KB Output is correct
27 Correct 12 ms 5752 KB Output is correct
28 Correct 11 ms 5752 KB Output is correct
29 Correct 11 ms 5752 KB Output is correct
30 Correct 11 ms 5752 KB Output is correct
31 Correct 12 ms 6012 KB Output is correct
32 Correct 41 ms 8436 KB Output is correct
33 Correct 41 ms 8428 KB Output is correct
34 Correct 41 ms 8444 KB Output is correct
35 Correct 227 ms 19164 KB Output is correct
36 Correct 227 ms 19192 KB Output is correct
37 Correct 234 ms 19184 KB Output is correct
38 Correct 153 ms 19556 KB Output is correct
39 Correct 157 ms 19604 KB Output is correct
40 Correct 167 ms 19528 KB Output is correct
41 Correct 288 ms 23148 KB Output is correct