oj.uz

Submission #915311

# Submission time Handle Problem Language Result Execution time Memory
915311 2024-01-23T16:27:13 Z GrindMachine Beads and wires (APIO14_beads) C++17
28 / 100
 1000 ms 10116 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 2e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

vector<pll> adj[N];
vector<ll> dp[N];

void dfs(ll u, ll p){
    for(auto [v,w] : adj[u]){
        if(v == p) conts;
        dfs(v,u);
    }

    dp[u] = vector<ll>(sz(adj[u])+1);
    ll sum = 0;

    rep(i,sz(adj[u])){
        auto [v,w] = adj[u][i];
        if(v == p) conts;

        ll curr_val = -inf2;

        rep(j,sz(adj[v])){
            auto [v2,w2] = adj[v][j];
            if(v2 == u) conts;

            ll val = w+w2+dp[v2][0]+dp[v][j+1];
            amax(curr_val,val);            
        }

        amax(curr_val,dp[v][0]);
        dp[u][i+1] = -curr_val;
        sum += curr_val;
    }

    rep(i,sz(adj[u])+1){
        dp[u][i] += sum;
    }
}

void solve(int test_case)
{
    ll n; cin >> n;
    rep1(i,n-1){
        ll u,v,c; cin >> u >> v >> c;
        adj[u].pb({v,c}), adj[v].pb({u,c});
    }

    ll ans = -inf2;

    rep1(i,n){
        dfs(i,-1);
        amax(ans,dp[i][0]);
    }

    cout << ans << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9816 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9816 KB Output is correct
4 Correct 3 ms 9816 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9816 KB Output is correct
10 Correct 3 ms 10072 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 3 ms 9644 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9868 KB Output is correct
18 Correct 6 ms 9864 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 4 ms 9820 KB Output is correct
22 Correct 4 ms 9820 KB Output is correct
23 Execution timed out 1042 ms 10116 KB Time limit exceeded
24 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 9816 KB Output is correct
2 Correct 3 ms 9820 KB Output is correct
3 Correct 3 ms 9816 KB Output is correct
4 Correct 3 ms 9816 KB Output is correct
5 Correct 3 ms 9820 KB Output is correct
6 Correct 4 ms 9820 KB Output is correct
7 Correct 3 ms 9820 KB Output is correct
8 Correct 3 ms 9820 KB Output is correct
9 Correct 3 ms 9816 KB Output is correct
10 Correct 3 ms 10072 KB Output is correct
11 Correct 3 ms 9820 KB Output is correct
12 Correct 3 ms 9644 KB Output is correct
13 Correct 3 ms 9820 KB Output is correct
14 Correct 3 ms 9820 KB Output is correct
15 Correct 5 ms 9820 KB Output is correct
16 Correct 4 ms 9820 KB Output is correct
17 Correct 5 ms 9868 KB Output is correct
18 Correct 6 ms 9864 KB Output is correct
19 Correct 5 ms 9820 KB Output is correct
20 Correct 4 ms 9820 KB Output is correct
21 Correct 4 ms 9820 KB Output is correct
22 Correct 4 ms 9820 KB Output is correct
23 Execution timed out 1042 ms 10116 KB Time limit exceeded
24 Halted 0 ms 0 KB -