oj.uz

Submission #676805

# Submission time Handle Problem Language Result Execution time Memory
676805 2023-01-01T08:27:06 Z PoonYaPat Beads and wires (APIO14_beads) C++14
100 / 100
 213 ms 45240 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pii;

int n;
ll dp[200001][4]; // 00 -> left mask : grow upward/downward, right mask : include free upedge or not
vector<pii> adj[200001];

void dfs(int x, int par, int w) {

    ll sum=0;
    vector<pii> best[4];

    for (auto s : adj[x]) {
        if (s.first==par) continue;
        dfs(s.first,x,s.second);

        sum+=dp[s.first][0];
        for (int i=0; i<4; ++i) best[i].push_back(pii(dp[s.first][i]-dp[s.first][0],s.first));
    }

    for (int i=0; i<4; ++i) sort(best[i].begin(),best[i].end(),greater<pii>());

    if (best[0].size()) {
        dp[x][0]=max(sum,sum+best[1][0].first+w);
        dp[x][1]=sum+w;
        dp[x][2]=max(sum+best[2][0].first,sum+best[3][0].first+w);
        dp[x][3]=sum+best[2][0].first+w;

        if (best[0].size()>=2) {
            if (best[1][0].second==best[3][0].second) dp[x][2]=max({dp[x][2],sum+best[1][1].first+best[3][0].first,sum+best[1][0].first+best[3][1].first});
            else dp[x][2]=max(dp[x][2],sum+best[1][0].first+best[3][0].first);

            if (best[1][0].second==best[3][0].second) dp[x][3]=max({dp[x][3],sum+best[1][1].first+best[3][0].first+w,sum+best[1][0].first+best[3][1].first+w});
            else dp[x][3]=max(dp[x][3],sum+best[1][0].first+best[3][0].first+w);

            dp[x][2]=max(dp[x][2],sum+best[1][0].first+best[1][1].first);
            dp[x][3]=max(dp[x][3],sum+best[1][0].first+best[1][1].first+w);
        }

    } else {
        dp[x][0]=0;
        dp[x][1]=w;
        dp[x][2]=-1e15;
        dp[x][3]=-1e15;
    }
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n;
    for (int i=0; i<n-1; ++i) {
        int a,b,w;
        cin>>a>>b>>w;
        adj[a].push_back(pii(b,w));
        adj[b].push_back(pii(a,w));
    }
    dfs(1,0,0);
    cout<<max(dp[1][1],dp[1][3]);
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 7 ms 5424 KB Output is correct
24 Correct 6 ms 5460 KB Output is correct
25 Correct 8 ms 5460 KB Output is correct
26 Correct 9 ms 5972 KB Output is correct
27 Correct 8 ms 5972 KB Output is correct
28 Correct 10 ms 7120 KB Output is correct
29 Correct 10 ms 6448 KB Output is correct
30 Correct 9 ms 6456 KB Output is correct
31 Correct 9 ms 7380 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 3 ms 4948 KB Output is correct
8 Correct 3 ms 5020 KB Output is correct
9 Correct 3 ms 4948 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 3 ms 4948 KB Output is correct
12 Correct 3 ms 4948 KB Output is correct
13 Correct 3 ms 4948 KB Output is correct
14 Correct 3 ms 4948 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 4948 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 4948 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 7 ms 5424 KB Output is correct
24 Correct 6 ms 5460 KB Output is correct
25 Correct 8 ms 5460 KB Output is correct
26 Correct 9 ms 5972 KB Output is correct
27 Correct 8 ms 5972 KB Output is correct
28 Correct 10 ms 7120 KB Output is correct
29 Correct 10 ms 6448 KB Output is correct
30 Correct 9 ms 6456 KB Output is correct
31 Correct 9 ms 7380 KB Output is correct
32 Correct 42 ms 9860 KB Output is correct
33 Correct 35 ms 9880 KB Output is correct
34 Correct 50 ms 9820 KB Output is correct
35 Correct 183 ms 25048 KB Output is correct
36 Correct 190 ms 25028 KB Output is correct
37 Correct 189 ms 25064 KB Output is correct
38 Correct 191 ms 42800 KB Output is correct
39 Correct 209 ms 37620 KB Output is correct
40 Correct 181 ms 34968 KB Output is correct
41 Correct 213 ms 45240 KB Output is correct