oj.uz

Submission #964698

# Submission time Handle Problem Language Result Execution time Memory
964698 2024-04-17T10:58:00 Z kilkuwu Road Closures (APIO21_roads) C++17
24 / 100
 2000 ms 23008 KB 
#include "roads.h"

#include <bits/stdc++.h>

std::vector<long long> minimum_closure_costs(int N, std::vector<int> U,
                                             std::vector<int> V,
                                             std::vector<int> W) {


  std::vector<std::vector<std::pair<int, int>>> adj(N);
  long long tot = 0;
  for (int i = 0; i < N - 1; i++) { 
    int u = U[i], v = V[i], w = W[i];
    adj[u].emplace_back(v, w);
    adj[v].emplace_back(u, w);
    tot += w;
  }

  auto solve = [&](int k) -> long long {
    std::vector<std::array<long long, 2>> dp(N, {-1, -1});

    auto dfs = [&](auto self, int u, int p, int s) {
      if (dp[u][s] != -1) return dp[u][s];

      std::vector<std::pair<int, std::pair<int, int>>> options;
      for (auto [v, w] : adj[u]) {
        if (v == p) continue;
        self(self, v, u, 0);
        self(self, v, u, 1);
        options.emplace_back(dp[v][1] - (dp[v][0] + w), std::make_pair(v, w));
      } 

      // 

      std::sort(options.begin(), options.end());

      int rem = k - s; // 0 means we are disconnected, 1 tuc la minh noi thang tren 

      long long ans = 0;
      for (int i = 0; i < (int) options.size(); i++) {
        int v = options[i].second.first;
        int w = options[i].second.second;
        if (i < rem) {
          ans += std::min(dp[v][1], dp[v][0] + w);
        } else {
          ans += dp[v][0] + w;
        }
      }

      return dp[u][s] = ans;
    };

    return dfs(dfs, 0, -1, 0);
  };

  std::vector<long long> res(N);
  res[0] = tot;
  res[N - 1] = 0;
  for (int i = N - 2; i >= 1; i--) {
    res[i] = solve(i);
  }
  return res;


  
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 217 ms 664 KB Output is correct
3 Correct 245 ms 692 KB Output is correct
4 Correct 294 ms 680 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 209 ms 604 KB Output is correct
9 Correct 308 ms 680 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Execution timed out 2057 ms 8868 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Execution timed out 2089 ms 23008 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 3 ms 432 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 4 ms 344 KB Output is correct
6 Correct 3 ms 348 KB Output is correct
7 Correct 3 ms 344 KB Output is correct
8 Correct 4 ms 348 KB Output is correct
9 Correct 4 ms 348 KB Output is correct
10 Correct 2 ms 432 KB Output is correct
11 Correct 3 ms 432 KB Output is correct
12 Correct 3 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 2 ms 436 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 2 ms 348 KB Output is correct
17 Correct 4 ms 348 KB Output is correct
18 Correct 3 ms 348 KB Output is correct
19 Correct 2 ms 344 KB Output is correct
20 Correct 2 ms 348 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 1 ms 348 KB Output is correct
23 Correct 126 ms 348 KB Output is correct
24 Correct 348 ms 688 KB Output is correct
25 Correct 257 ms 600 KB Output is correct
26 Correct 352 ms 660 KB Output is correct
27 Correct 289 ms 704 KB Output is correct
28 Correct 430 ms 692 KB Output is correct
29 Correct 284 ms 600 KB Output is correct
30 Correct 253 ms 684 KB Output is correct
31 Correct 279 ms 688 KB Output is correct
32 Correct 430 ms 600 KB Output is correct
33 Correct 225 ms 856 KB Output is correct
34 Correct 300 ms 1000 KB Output is correct
35 Correct 247 ms 936 KB Output is correct
36 Correct 225 ms 696 KB Output is correct
37 Correct 245 ms 712 KB Output is correct
38 Correct 287 ms 716 KB Output is correct
39 Correct 0 ms 348 KB Output is correct
40 Correct 1 ms 348 KB Output is correct
41 Correct 2 ms 348 KB Output is correct
42 Correct 4 ms 348 KB Output is correct
43 Correct 3 ms 432 KB Output is correct
44 Correct 3 ms 456 KB Output is correct
45 Correct 4 ms 348 KB Output is correct
46 Correct 3 ms 348 KB Output is correct
47 Correct 2 ms 348 KB Output is correct
48 Correct 5 ms 488 KB Output is correct
49 Correct 3 ms 344 KB Output is correct
50 Correct 1 ms 348 KB Output is correct
51 Correct 2 ms 464 KB Output is correct
52 Correct 2 ms 348 KB Output is correct
53 Correct 217 ms 612 KB Output is correct
54 Correct 376 ms 664 KB Output is correct
55 Correct 368 ms 696 KB Output is correct
56 Correct 205 ms 664 KB Output is correct
57 Correct 319 ms 696 KB Output is correct
58 Correct 1 ms 348 KB Output is correct
59 Correct 5 ms 348 KB Output is correct
60 Correct 3 ms 432 KB Output is correct
61 Correct 2 ms 344 KB Output is correct
62 Correct 2 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 334 ms 608 KB Output is correct
65 Correct 352 ms 660 KB Output is correct
66 Correct 287 ms 700 KB Output is correct
67 Correct 471 ms 672 KB Output is correct
68 Correct 299 ms 676 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2041 ms 10972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2041 ms 10972 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 217 ms 664 KB Output is correct
3 Correct 245 ms 692 KB Output is correct
4 Correct 294 ms 680 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 2 ms 348 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 209 ms 604 KB Output is correct
9 Correct 308 ms 680 KB Output is correct
10 Correct 2 ms 348 KB Output is correct
11 Correct 3 ms 348 KB Output is correct
12 Execution timed out 2057 ms 8868 KB Time limit exceeded
13 Halted 0 ms 0 KB -