oj.uz

Submission #249113

# Submission time Handle Problem Language Result Execution time Memory
249113 2020-07-14T10:51:07 Z receed Beads and wires (APIO14_beads) C++14
28 / 100
 1000 ms 5760 KB 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <string>
#include <set>
#include <map>
#include <random>
#include <bitset>
#include <string>
#include <unordered_set>
#include <unordered_map>
#include <deque>
#include <queue>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
 
using namespace std;
using ll = long long;
using ul = unsigned long long;
using ld = long double;
 
const int N = 200001;
vector<pair<int, int>> g[N];
ll d0[N], d1[N], inf = 1e11;
 
void dfs(int v, int p) {
    d0[v] = 0;
    ll m1 = -inf, m2 = -inf, cm;
    for (auto &e : g[v]) {
        if (e.first == p)
            continue;
        dfs(e.first, v);
        ll cx = max(d0[e.first], d1[e.first] + e.second);
        d0[v] += cx;
        cm = d0[e.first] - cx + e.second;
        if (cm > m1) {
            m2 = m1;
            m1 = cm;
        }
        else if (cm > m2)
            m2 = cm;
    }
    d1[v] = d0[v] + m1;
}
 
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, u, v, w;
    cin >> n;
    rep(i, n - 1) {
        cin >> u >> v >> w;
        u--; v--;
        g[u].push_back({v, w});
        g[v].push_back({u, w});
    }
    ll ans = 0;
    rep(i, n) {
        dfs(i, -1);
        ans = max(ans, d0[i]);
    }
    cout << ans;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 3 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 4 ms 5096 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4992 KB Output is correct
12 Correct 3 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 3 ms 4992 KB Output is correct
20 Correct 3 ms 4992 KB Output is correct
21 Correct 4 ms 4992 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 528 ms 5428 KB Output is correct
24 Correct 496 ms 5376 KB Output is correct
25 Correct 507 ms 5428 KB Output is correct
26 Execution timed out 1091 ms 5760 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4992 KB Output is correct
2 Correct 3 ms 4992 KB Output is correct
3 Correct 3 ms 4992 KB Output is correct
4 Correct 5 ms 4992 KB Output is correct
5 Correct 3 ms 4992 KB Output is correct
6 Correct 5 ms 4992 KB Output is correct
7 Correct 3 ms 4992 KB Output is correct
8 Correct 4 ms 5096 KB Output is correct
9 Correct 3 ms 4992 KB Output is correct
10 Correct 3 ms 4992 KB Output is correct
11 Correct 3 ms 4992 KB Output is correct
12 Correct 3 ms 4992 KB Output is correct
13 Correct 4 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 3 ms 4992 KB Output is correct
16 Correct 4 ms 4992 KB Output is correct
17 Correct 4 ms 4992 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 3 ms 4992 KB Output is correct
20 Correct 3 ms 4992 KB Output is correct
21 Correct 4 ms 4992 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 528 ms 5428 KB Output is correct
24 Correct 496 ms 5376 KB Output is correct
25 Correct 507 ms 5428 KB Output is correct
26 Execution timed out 1091 ms 5760 KB Time limit exceeded
27 Halted 0 ms 0 KB -