oj.uz

Submission #672774

# Submission time Handle Problem Language Result Execution time Memory
672774 2022-12-18T04:43:05 Z Hanksburger Beads and wires (APIO14_beads) C++17
100 / 100
 304 ms 79100 KB 
#include <bits/stdc++.h>
#define ll long long
using namespace std;
vector<pair<ll, ll> > adj[200005], child[200005];
ll f[200005][2], mx[200005], mx2[200005], ans;
vector<ll> g[200005][2], h[200005][2];
pair<ll, ll> par[200005];
void dfs0(ll u)
{
    for (ll i=0; i<adj[u].size(); i++)
    {
        int v=adj[u][i].first, w=adj[u][i].second;
        if (v==par[u].first)
            continue;
        par[v]={u, child[u].size()};
        child[u].push_back({v, w});
        dfs0(v);
    }
}
void dfs1(ll u)
{
//    cout << "dfs " << u << '\n';
    mx[u]=mx2[u]=-1e18;
    for (ll i=0; i<child[u].size(); i++)
    {
        ll v=child[u][i].first, w=child[u][i].second;
        dfs1(v);
        f[u][0]+=max(f[v][0], f[v][1]+w);
        ll z=f[v][0]+w-max(f[v][0], f[v][1]+w);
        if (mx[u]<=z)
        {
            mx2[u]=mx[u];
            mx[u]=z;
        }
        else if (mx2[u]<z)
            mx2[u]=z;
    }
    f[u][1]=f[u][0]+mx[u];
//    cout << "f[" << u << "][0] " << f[u][0] << '\n';
//    cout << "f[" << u << "][1] " << f[u][1] << '\n';
    for (ll i=0; i<child[u].size(); i++)
    {
        ll v=child[u][i].first, w=child[u][i].second;
        g[u][0].push_back(f[u][0]-max(f[v][0], f[v][1]+w));
        if (mx[u]==f[v][0]+w-max(f[v][0], f[v][1]+w))
            g[u][1].push_back(g[u][0][i]+mx2[u]);
        else
            g[u][1].push_back(g[u][0][i]+mx[u]);
    }
}
void dfs2(ll u)
{
//    cout << "dfs2 " << u << '\n';
    ll p=par[u].first, j=par[u].second;
    ll x=(u==1?0:child[p][j].second);
    for (ll i=0; i<child[u].size(); i++)
    {
        ll v=child[u][i].first, w=child[u][i].second;
        if (u==1)
        {
            h[u][0].push_back(g[u][0][i]);
            h[u][1].push_back(g[u][1][i]);
        }
        else
        {
            h[u][0].push_back(g[u][0][i]+max(h[p][0][j], h[p][1][j]+x));
            h[u][1].push_back(max(g[u][0][i]+h[p][0][j]+x, g[u][1][i]+max(h[p][0][j], h[p][1][j]+x)));
        }
        ans=max(ans, f[v][0]+max(h[u][0][i], h[u][1][i]+w));
        dfs2(v);
    }
}
int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    ll n;
    cin >> n;
    for (ll i=1; i<n; i++)
    {
        ll u, v, w;
        cin >> u >> v >> w;
        adj[u].push_back({v, w});
        adj[v].push_back({u, w});
    }
    dfs0(1);
    dfs1(1);
    dfs2(1);
    cout << max(ans, f[1][0]);
}

Compilation message

beads.cpp: In function 'void dfs0(long long int)':
beads.cpp:10:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   10 |     for (ll i=0; i<adj[u].size(); i++)
      |                  ~^~~~~~~~~~~~~~
beads.cpp: In function 'void dfs1(long long int)':
beads.cpp:24:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   24 |     for (ll i=0; i<child[u].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~
beads.cpp:41:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   41 |     for (ll i=0; i<child[u].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~
beads.cpp: In function 'void dfs2(long long int)':
beads.cpp:56:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<std::pair<long long int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   56 |     for (ll i=0; i<child[u].size(); i++)
      |                  ~^~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28428 KB Output is correct
2 Correct 14 ms 28408 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 15 ms 28460 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 17 ms 28500 KB Output is correct
7 Correct 15 ms 28476 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 15 ms 28528 KB Output is correct
10 Correct 15 ms 28520 KB Output is correct
11 Correct 16 ms 28520 KB Output is correct
12 Correct 14 ms 28540 KB Output is correct

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28428 KB Output is correct
2 Correct 14 ms 28408 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 15 ms 28460 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 17 ms 28500 KB Output is correct
7 Correct 15 ms 28476 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 15 ms 28528 KB Output is correct
10 Correct 15 ms 28520 KB Output is correct
11 Correct 16 ms 28520 KB Output is correct
12 Correct 14 ms 28540 KB Output is correct
13 Correct 15 ms 28500 KB Output is correct
14 Correct 15 ms 28516 KB Output is correct
15 Correct 14 ms 28520 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 14 ms 28504 KB Output is correct
18 Correct 14 ms 28516 KB Output is correct
19 Correct 14 ms 28500 KB Output is correct
20 Correct 16 ms 28500 KB Output is correct
21 Correct 17 ms 28520 KB Output is correct
22 Correct 15 ms 28500 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28428 KB Output is correct
2 Correct 14 ms 28408 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 15 ms 28460 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 17 ms 28500 KB Output is correct
7 Correct 15 ms 28476 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 15 ms 28528 KB Output is correct
10 Correct 15 ms 28520 KB Output is correct
11 Correct 16 ms 28520 KB Output is correct
12 Correct 14 ms 28540 KB Output is correct
13 Correct 15 ms 28500 KB Output is correct
14 Correct 15 ms 28516 KB Output is correct
15 Correct 14 ms 28520 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 14 ms 28504 KB Output is correct
18 Correct 14 ms 28516 KB Output is correct
19 Correct 14 ms 28500 KB Output is correct
20 Correct 16 ms 28500 KB Output is correct
21 Correct 17 ms 28520 KB Output is correct
22 Correct 15 ms 28500 KB Output is correct
23 Correct 21 ms 29524 KB Output is correct
24 Correct 18 ms 29476 KB Output is correct
25 Correct 17 ms 29552 KB Output is correct
26 Correct 22 ms 30608 KB Output is correct
27 Correct 26 ms 30656 KB Output is correct
28 Correct 19 ms 30416 KB Output is correct
29 Correct 19 ms 30164 KB Output is correct
30 Correct 19 ms 30360 KB Output is correct
31 Correct 23 ms 31188 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 28428 KB Output is correct
2 Correct 14 ms 28408 KB Output is correct
3 Correct 14 ms 28500 KB Output is correct
4 Correct 15 ms 28460 KB Output is correct
5 Correct 14 ms 28516 KB Output is correct
6 Correct 17 ms 28500 KB Output is correct
7 Correct 15 ms 28476 KB Output is correct
8 Correct 14 ms 28500 KB Output is correct
9 Correct 15 ms 28528 KB Output is correct
10 Correct 15 ms 28520 KB Output is correct
11 Correct 16 ms 28520 KB Output is correct
12 Correct 14 ms 28540 KB Output is correct
13 Correct 15 ms 28500 KB Output is correct
14 Correct 15 ms 28516 KB Output is correct
15 Correct 14 ms 28520 KB Output is correct
16 Correct 15 ms 28500 KB Output is correct
17 Correct 14 ms 28504 KB Output is correct
18 Correct 14 ms 28516 KB Output is correct
19 Correct 14 ms 28500 KB Output is correct
20 Correct 16 ms 28500 KB Output is correct
21 Correct 17 ms 28520 KB Output is correct
22 Correct 15 ms 28500 KB Output is correct
23 Correct 21 ms 29524 KB Output is correct
24 Correct 18 ms 29476 KB Output is correct
25 Correct 17 ms 29552 KB Output is correct
26 Correct 22 ms 30608 KB Output is correct
27 Correct 26 ms 30656 KB Output is correct
28 Correct 19 ms 30416 KB Output is correct
29 Correct 19 ms 30164 KB Output is correct
30 Correct 19 ms 30360 KB Output is correct
31 Correct 23 ms 31188 KB Output is correct
32 Correct 73 ms 39140 KB Output is correct
33 Correct 61 ms 39148 KB Output is correct
34 Correct 61 ms 39120 KB Output is correct
35 Correct 304 ms 71628 KB Output is correct
36 Correct 294 ms 71884 KB Output is correct
37 Correct 293 ms 71628 KB Output is correct
38 Correct 170 ms 64400 KB Output is correct
39 Correct 155 ms 63524 KB Output is correct
40 Correct 160 ms 62520 KB Output is correct
41 Correct 300 ms 79100 KB Output is correct