oj.uz

Submission #670251

# Submission time Handle Problem Language Result Execution time Memory
670251 2022-12-08T13:13:34 Z fatemetmhr Beads and wires (APIO14_beads) C++17
28 / 100
 1000 ms 1108 KB 
// hmmm... na dige chizi baraye goftan namoonde


#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

#define all(x) x.begin(), x.end()
#define pb     push_back
#define fi     first
#define se     second

const int maxn5 = 1e4 + 10;
const int lg    = 20;
const ll  inf   = 1e18;

int dp[2][maxn5];
vector <pair<int, int>> adj[maxn5];

void dfs(int v, int par){
    for(auto [u, w] : adj[v]) if(u != par){
        dp[1][u] = w;
        dfs(u, v);
        dp[0][v] = max(dp[0][v] + dp[0][u], dp[1][v] + dp[1][u]);
        dp[1][v] += dp[0][u];
    }
}


int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);

    int n; cin >> n;
    for(int i = 0; i < n - 1; i ++){
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        adj[a].pb({b, c});
        adj[b].pb({a, c});
    }

    int ans = 0;
    for(int i = 0; i < n; i++){ // YOU HAVE CHANGED THIS
        memset(dp, 0, sizeof dp);
        dfs(i, -1);
        ans = max(ans, dp[1][i]);
    }

    cout << ans << endl;

}

/*
10
4 10 2
1 2 21
1 3 13
6 7 1
7 9 5
2 4 3
2 5 8
1 6 55
6 8 34
*/

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 564 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 556 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 560 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 560 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 560 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 512 ms 876 KB Output is correct
24 Correct 514 ms 872 KB Output is correct
25 Correct 515 ms 872 KB Output is correct
26 Execution timed out 1075 ms 1108 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 596 KB Output is correct
2 Correct 1 ms 596 KB Output is correct
3 Correct 1 ms 564 KB Output is correct
4 Correct 1 ms 596 KB Output is correct
5 Correct 1 ms 596 KB Output is correct
6 Correct 1 ms 596 KB Output is correct
7 Correct 1 ms 556 KB Output is correct
8 Correct 1 ms 596 KB Output is correct
9 Correct 1 ms 596 KB Output is correct
10 Correct 1 ms 596 KB Output is correct
11 Correct 1 ms 596 KB Output is correct
12 Correct 1 ms 596 KB Output is correct
13 Correct 1 ms 596 KB Output is correct
14 Correct 1 ms 596 KB Output is correct
15 Correct 1 ms 596 KB Output is correct
16 Correct 1 ms 560 KB Output is correct
17 Correct 2 ms 596 KB Output is correct
18 Correct 1 ms 560 KB Output is correct
19 Correct 1 ms 596 KB Output is correct
20 Correct 1 ms 560 KB Output is correct
21 Correct 1 ms 596 KB Output is correct
22 Correct 2 ms 596 KB Output is correct
23 Correct 512 ms 876 KB Output is correct
24 Correct 514 ms 872 KB Output is correct
25 Correct 515 ms 872 KB Output is correct
26 Execution timed out 1075 ms 1108 KB Time limit exceeded
27 Halted 0 ms 0 KB -