oj.uz

Submission #553562

# Submission time Handle Problem Language Result Execution time Memory
553562 2022-04-26T09:06:31 Z kwongweng Beads and wires (APIO14_beads) C++17
100 / 100
 269 ms 31224 KB 
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")

#include <bits/stdc++.h>
#define ll int
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 2e5 + 9;
const ll inf = 1e9 + 7;
vector<LL> g[N];
ll n,x,y,w,dp[N][2][2],ans,val1[N],val2[N];

void DFS(ll u,ll p){
    ll child = 0; multiset<ll> s;
    for (auto i : g[u]) if (i.fs != p) DFS(i.fs,u),child++;
    dp[u][0][0] = dp[u][0][1] = 0;
    if (!child) dp[u][1][0] = dp[u][1][1] = -inf;
    for (auto i : g[u]){
        ll v = i.fs,cost = i.sc;
        if (v == p) continue;
        dp[u][0][0] += max(dp[v][1][0] + cost,dp[v][0][0]);
        val1[v] = dp[v][0][1] + cost - max(dp[v][1][0] + cost,dp[v][0][0]);
        val2[v] = dp[v][0][0] + cost - max(dp[v][1][0] + cost,dp[v][0][0]); s.insert(val2[v]);
    }
    for (auto i : g[u]){
        ll v = i.fs,cost = i.sc;
        if (v == p) continue;
        ll now = dp[u][0][0] - max(dp[v][1][0] + cost,dp[v][0][0]) + dp[v][0][0] + cost;
        dp[u][1][0] = max(dp[u][1][0],now);
        dp[u][1][1] = max(dp[u][1][1],now - dp[v][0][0] + dp[v][0][1]);
    }
    for (auto i : g[u]){
        ll v = i.fs,cost = i.sc;
        if (v == p) continue;
        ll now = dp[u][0][0] - max(dp[v][1][0] + cost,dp[v][0][0]) + max(dp[v][1][1] + cost,dp[v][0][1]);
        dp[u][0][1] = max(dp[u][0][1],now);
    }


    if (child < 2) return;
    for (auto i : g[u]){
        ll v = i.fs,cost = i.sc;
        if (v == p) continue;
        s.erase(s.find(val2[v]));
        dp[u][0][1] = max(dp[u][0][1],dp[u][0][0] + val1[v] + *s.rbegin());
        s.insert(val2[v]);
    }
}
int main(){
    ios_base::sync_with_stdio(NULL);
    cin>>n;
    for (ll i = 1;i < n;i++){
        cin>>x>>y>>w;
        g[x].push_back({y,w}); g[y].push_back({x,w});
    }
    DFS(1,0);
    cout<<max(dp[1][0][0],dp[1][0][1]);
}

Compilation message

beads.cpp:1: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    1 | #pragma GCC optimization O2
      | 
beads.cpp:2: warning: ignoring '#pragma GCC optimization' [-Wunknown-pragmas]
    2 | #pragma GCC optimization "unroll-loop"
      | 
beads.cpp:3: warning: ignoring '#pragma target ' [-Wunknown-pragmas]
    3 | #pragma target ("avx2")
      | 
beads.cpp: In function 'void DFS(int, int)':
beads.cpp:46:21: warning: unused variable 'cost' [-Wunused-variable]
   46 |         ll v = i.fs,cost = i.sc;
      |                     ^~~~

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 5024 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 4 ms 5032 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 2 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 5024 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 4 ms 5032 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 2 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5024 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 5024 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 4 ms 5032 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 2 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5024 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 6 ms 5332 KB Output is correct
24 Correct 6 ms 5288 KB Output is correct
25 Correct 5 ms 5288 KB Output is correct
26 Correct 8 ms 5668 KB Output is correct
27 Correct 8 ms 5716 KB Output is correct
28 Correct 11 ms 6220 KB Output is correct
29 Correct 9 ms 5972 KB Output is correct
30 Correct 10 ms 5928 KB Output is correct
31 Correct 9 ms 6544 KB Output is correct

Subtask #4
43.0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 2 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 5024 KB Output is correct
8 Correct 3 ms 5024 KB Output is correct
9 Correct 4 ms 5032 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 2 ms 4948 KB Output is correct
14 Correct 3 ms 5020 KB Output is correct
15 Correct 3 ms 5028 KB Output is correct
16 Correct 3 ms 5028 KB Output is correct
17 Correct 3 ms 4948 KB Output is correct
18 Correct 3 ms 5028 KB Output is correct
19 Correct 3 ms 4948 KB Output is correct
20 Correct 3 ms 5024 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 4948 KB Output is correct
23 Correct 6 ms 5332 KB Output is correct
24 Correct 6 ms 5288 KB Output is correct
25 Correct 5 ms 5288 KB Output is correct
26 Correct 8 ms 5668 KB Output is correct
27 Correct 8 ms 5716 KB Output is correct
28 Correct 11 ms 6220 KB Output is correct
29 Correct 9 ms 5972 KB Output is correct
30 Correct 10 ms 5928 KB Output is correct
31 Correct 9 ms 6544 KB Output is correct
32 Correct 32 ms 8748 KB Output is correct
33 Correct 31 ms 8828 KB Output is correct
34 Correct 33 ms 8804 KB Output is correct
35 Correct 167 ms 20644 KB Output is correct
36 Correct 187 ms 20684 KB Output is correct
37 Correct 168 ms 20700 KB Output is correct
38 Correct 259 ms 29452 KB Output is correct
39 Correct 269 ms 24812 KB Output is correct
40 Correct 244 ms 23788 KB Output is correct
41 Correct 225 ms 31224 KB Output is correct