oj.uz

Submission #543347

# Submission time Handle Problem Language Result Execution time Memory
543347 2022-03-30T11:03:24 Z inventiontime Beads and wires (APIO14_beads) C++17
28 / 100
 1000 ms 5844 KB 
// [node][0] is current node is *ordinary*
// [node][1] is current node is *connector* 
// connector: node between two blue wires
// condition for connector: 
    // atleast one node below ordinary

#include <bits/stdc++.h>
using namespace std;

#define int ll
//#define endl '\n'

#define fast_io ios::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define pb push_back
#define re resize
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define loop(i, n) for(int i = 0; i < n; i++)
#define loop1(i, n) for(int i = 1; i <= n; i++)
#define print(x) cout << #x << ": " << x << endl

typedef long long ll;
typedef vector<int> vi;
typedef array<int, 2> ii;
typedef array<int, 3> ti;
typedef vector<ii> vii;
typedef vector<ti> vti;
typedef priority_queue<int> pq;

template<class T> bool ckmin(T&a, T b) { bool B = a > b; a = min(a, b); return B; }
template<class T> bool ckmax(T&a, T b) { bool B = a < b; a = max(a, b); return B; }

const int inf = 1e17;
const int maxn = 2e5 + 5;

int n;
vii adj[maxn];
int sub[maxn][2];
int par[maxn][2];

void dfs(int u, int p) {

    sub[u][0] = 0;
    sub[u][1] = 0;
    bool ord = false;
    int mindiff = inf;
    for(auto [v, w] : adj[u]) if(v != p) {
        dfs(v, u);
        sub[u][0] += max(sub[v][0], sub[v][1] + w);
        sub[u][1] += max(sub[v][0], sub[v][1] + w);
        ckmin(mindiff, max(sub[v][0], sub[v][1] + w) - (sub[v][0] + w));
    }
    sub[u][1] -= mindiff;

}

void solve() {
    
    cin >> n;
    loop(i, n-1) {
        int u, v, w; cin >> u >> v >> w;
        adj[u].pb({v, w});
        adj[v].pb({u, w});
    }

    int res = 0;
    loop1(i, n) {
        dfs(i, i);
        ckmax(res, sub[i][0]);
    }

    cout << res << endl;

}

signed main() {

    fast_io;

    int t = 1; //cin >> t;
    while(t--)
        solve();

    //cout << flush;

    return 0;

}

Compilation message

beads.cpp: In function 'void dfs(ll, ll)':
beads.cpp:46:10: warning: unused variable 'ord' [-Wunused-variable]
   46 |     bool ord = false;
      |          ^~~

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 5032 KB Output is correct
4 Correct 3 ms 5028 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5036 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 5032 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 5032 KB Output is correct
4 Correct 3 ms 5028 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5036 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 5032 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 5032 KB Output is correct
16 Correct 4 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 5032 KB Output is correct

Subtask #3
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 5032 KB Output is correct
4 Correct 3 ms 5028 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5036 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 5032 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 5032 KB Output is correct
16 Correct 4 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 5032 KB Output is correct
23 Correct 526 ms 5428 KB Output is correct
24 Correct 520 ms 5436 KB Output is correct
25 Correct 541 ms 5452 KB Output is correct
26 Execution timed out 1092 ms 5844 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
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 5032 KB Output is correct
4 Correct 3 ms 5028 KB Output is correct
5 Correct 3 ms 4948 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4948 KB Output is correct
9 Correct 3 ms 5036 KB Output is correct
10 Correct 3 ms 4948 KB Output is correct
11 Correct 2 ms 5032 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 5032 KB Output is correct
16 Correct 4 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 5032 KB Output is correct
23 Correct 526 ms 5428 KB Output is correct
24 Correct 520 ms 5436 KB Output is correct
25 Correct 541 ms 5452 KB Output is correct
26 Execution timed out 1092 ms 5844 KB Time limit exceeded
27 Halted 0 ms 0 KB -