oj.uz

Submission #261381

# Submission time Handle Problem Language Result Execution time Memory
261381 2020-08-11T16:54:19 Z Mercenary Beads and wires (APIO14_beads) C++14
100 / 100
 371 ms 30724 KB 
#include<bits/stdc++.h>
#define taskname "A"
#define pb push_back
#define mp make_pair
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

typedef pair<int,int> ii;
const int maxn = 2e5 + 5;
int n;
ll dp[maxn][2][2];

vector<ii> adj[maxn];

void dfs(int u , int par , int parcost){
    ll sum = 0;
    for(auto & c : adj[u]){
        if(c.first == par)continue;
        dfs(c.first , u , c.second);
        sum += dp[c.first][0][0];
    }
    dp[u][0][0] = dp[u][0][1] = dp[u][1][0] = dp[u][1][1] = sum;
    {
        vector<ll> val;
        ll tmp1 = 0;
        for(auto & c : adj[u]){
            if(c.first == par)continue;
            tmp1 = max(tmp1 , dp[c.first][0][1] - dp[c.first][0][0]);
            val.pb(dp[c.first][1][0] + c.second - dp[c.first][0][0]);
        }
        if(val.size() >= 2){
            sort(val.begin(),val.end(),greater<ll>());
            for(auto & c : adj[u]){
                if(c.first == par)continue;
                if(val[0] == dp[c.first][1][0] + c.second - dp[c.first][0][0]){
                    dp[u][1][1] = max(dp[u][1][1] , sum + val[1] + max(dp[c.first][1][0],dp[c.first][1][1]) + c.second - dp[c.first][0][0]);
                }else{
                    dp[u][1][1] = max(dp[u][1][1] , sum + val[0] + max(dp[c.first][1][0],dp[c.first][1][1]) + c.second - dp[c.first][0][0]);
                }
            }
        }
        dp[u][1][1] = max(dp[u][1][1] , sum + tmp1);
    }
    {
        vector<ll> val;
        for(auto & c : adj[u]){
            if(c.first == par)continue;
            val.pb(dp[c.first][1][0] + c.second - dp[c.first][0][0]);
        }
        sort(val.begin(),val.end(),greater<ll>());
        if(val.size() >= 1)dp[u][0][0] = max(dp[u][0][0] , dp[u][0][0] + parcost + val[0]);
        else dp[u][0][0] = -1e9;
        dp[u][0][0] = max(dp[u][0][0] , dp[u][1][0]);
    }
    {
        vector<ll> val;
        for(auto & c : adj[u]){
            if(c.first == par)continue;
            val.pb(max(dp[c.first][1][1],dp[c.first][1][0]) + c.second - dp[c.first][0][0]);
        }
        sort(val.begin(),val.end(),greater<ll>());
        if(val.size() >= 1)dp[u][0][1] = max(dp[u][0][1] , dp[u][0][1] + parcost + val[0]);
        else dp[u][0][1] = -1e9;
        dp[u][0][1] = max(dp[u][0][1] , dp[u][1][1]);
        dp[u][0][1] = max(dp[u][0][1] , dp[u][0][0]);
    }
//    cout << u << " " << dp[u][0][0] << " " << dp[u][0][1] << " " << dp[u][1][0] << " " << dp[u][1][1] << endl;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    if(fopen(taskname".inp", "r")) {
        freopen(taskname".inp", "r", stdin);
        freopen(taskname".out", "w", stdout);
    }
    cin >> n;
    for(int i = 1 ; i < n ; ++i){
        int u , v , c;cin >> u >> v >> c;
        adj[u].pb(mp(v,c));adj[v].pb(mp(u , c));
    }
    dfs(1 , 0 , 0);
    cout << max(dp[1][1][0] , dp[1][1][1]);
}

Compilation message

beads.cpp: In function 'int main()':
beads.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(taskname".inp", "r", stdin);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
beads.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)', declared with attribute warn_unused_result [-Wunused-result]
         freopen(taskname".out", "w", stdout);
         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 5 ms 4992 KB Output is correct
12 Correct 5 ms 5096 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 5 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 4 ms 4992 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 5 ms 4992 KB Output is correct
12 Correct 5 ms 5096 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 5 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 4 ms 4992 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct
23 Correct 10 ms 5504 KB Output is correct
24 Correct 9 ms 5504 KB Output is correct
25 Correct 11 ms 5504 KB Output is correct
26 Correct 13 ms 5888 KB Output is correct
27 Correct 11 ms 5888 KB Output is correct
28 Correct 12 ms 6160 KB Output is correct
29 Correct 10 ms 5888 KB Output is correct
30 Correct 11 ms 6016 KB Output is correct
31 Correct 11 ms 6528 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4992 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 4 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 4 ms 4992 KB Output is correct
7 Correct 4 ms 4992 KB Output is correct
8 Correct 4 ms 4992 KB Output is correct
9 Correct 4 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 5 ms 4992 KB Output is correct
12 Correct 5 ms 5096 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 4 ms 4992 KB Output is correct
15 Correct 4 ms 4992 KB Output is correct
16 Correct 5 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 4 ms 4992 KB Output is correct
20 Correct 5 ms 5120 KB Output is correct
21 Correct 5 ms 4992 KB Output is correct
22 Correct 6 ms 5120 KB Output is correct
23 Correct 10 ms 5504 KB Output is correct
24 Correct 9 ms 5504 KB Output is correct
25 Correct 11 ms 5504 KB Output is correct
26 Correct 13 ms 5888 KB Output is correct
27 Correct 11 ms 5888 KB Output is correct
28 Correct 12 ms 6160 KB Output is correct
29 Correct 10 ms 5888 KB Output is correct
30 Correct 11 ms 6016 KB Output is correct
31 Correct 11 ms 6528 KB Output is correct
32 Correct 57 ms 9284 KB Output is correct
33 Correct 70 ms 9208 KB Output is correct
34 Correct 53 ms 9208 KB Output is correct
35 Correct 331 ms 22264 KB Output is correct
36 Correct 371 ms 22264 KB Output is correct
37 Correct 314 ms 22392 KB Output is correct
38 Correct 339 ms 26208 KB Output is correct
39 Correct 269 ms 24412 KB Output is correct
40 Correct 250 ms 23604 KB Output is correct
41 Correct 309 ms 30724 KB Output is correct