oj.uz

Submission #255290

# Submission time Handle Problem Language Result Execution time Memory
255290 2020-07-31T17:08:59 Z rama_pang Beads and wires (APIO14_beads) C++14
28 / 100
 1000 ms 5760 KB 
#include <bits/stdc++.h>
using namespace std;

using lint = long long;
const int MAXN = 2e5 + 5;
const lint INF = 1e18;

int N;
vector<pair<int, int>> adj[MAXN];

lint dp[MAXN][2]; // dp[u][do we use parent edge?]

void Dfs(int u, int p = -1) {
  dp[u][0] = dp[u][1] = 0;
  lint mx = -INF;
  for (auto e : adj[u]) if (e.first != p) {
    int v = e.first;
    int w = e.second;
    Dfs(v, u);
    dp[u][0] += max(dp[v][0], w + dp[v][1]);
    dp[u][1] += max(dp[v][0], w + dp[v][1]);
    mx = max(mx, dp[v][0] + w - max(dp[v][0], w + dp[v][1]));
  }
  dp[u][1] += mx;
}

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);

  cin >> N;
  for (int i = 0; i + 1 < N; i++) {
    int u, v, w;
    cin >> u >> v >> w;
    u--, v--;
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
  }

  lint ans = 0;
  for (int i = 0; i < N; i++) {
    Dfs(i);
    ans = max(ans, dp[i][0]);
  }
  cout << ans << "\n";
  return 0;
}

Subtask #1
13.0 / 13.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5008 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 3 ms 4992 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 5 ms 4992 KB Output is correct
16 Correct 6 ms 4992 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 5 ms 4992 KB Output is correct
20 Correct 4 ms 5096 KB Output is correct
21 Correct 4 ms 4992 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 726 ms 5420 KB Output is correct
24 Correct 722 ms 5376 KB Output is correct
25 Correct 603 ms 5424 KB Output is correct
26 Execution timed out 1089 ms 5760 KB Time limit exceeded
27 Halted 0 ms 0 KB -

Subtask #4
0 / 43.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 5008 KB Output is correct
2 Correct 4 ms 4992 KB Output is correct
3 Correct 4 ms 4992 KB Output is correct
4 Correct 3 ms 4992 KB Output is correct
5 Correct 4 ms 4992 KB Output is correct
6 Correct 3 ms 4992 KB Output is correct
7 Correct 5 ms 4992 KB Output is correct
8 Correct 3 ms 4992 KB Output is correct
9 Correct 5 ms 4992 KB Output is correct
10 Correct 4 ms 4992 KB Output is correct
11 Correct 4 ms 4992 KB Output is correct
12 Correct 4 ms 4992 KB Output is correct
13 Correct 5 ms 4992 KB Output is correct
14 Correct 5 ms 4992 KB Output is correct
15 Correct 5 ms 4992 KB Output is correct
16 Correct 6 ms 4992 KB Output is correct
17 Correct 6 ms 4992 KB Output is correct
18 Correct 4 ms 4992 KB Output is correct
19 Correct 5 ms 4992 KB Output is correct
20 Correct 4 ms 5096 KB Output is correct
21 Correct 4 ms 4992 KB Output is correct
22 Correct 4 ms 4992 KB Output is correct
23 Correct 726 ms 5420 KB Output is correct
24 Correct 722 ms 5376 KB Output is correct
25 Correct 603 ms 5424 KB Output is correct
26 Execution timed out 1089 ms 5760 KB Time limit exceeded
27 Halted 0 ms 0 KB -