oj.uz

Submission #494103

# Submission time Handle Problem Language Result Execution time Memory
494103 2021-12-14T10:55:01 Z peijar Road Closures (APIO21_roads) C++17
31 / 100
 2000 ms 22856 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int INF = 1e18;
const int MAXN = 1e5;

vector<pair<int, int>> adj[MAXN];
bool seen[MAXN];

// [withPar, withoutPar]
pair<int, int> dfs(int u, int p, int maxDeg) {
  assert(!seen[u]);
  seen[u] = true;
  int coutInit = 0;
  vector<int> swaps;
  for (auto [v, w] : adj[u])
    if (v != p) {

      if ((int)adj[v].size() <= maxDeg) {
        swaps.push_back(w);
        continue;
      }

      auto [withPar, withoutPar] = dfs(v, u, maxDeg);

      coutInit += withPar;
      assert(coutInit < INF);
      swaps.push_back(withoutPar + w - withPar);
    }

  sort(swaps.begin(), swaps.end());

  // withPar :
  int toRem = adj[u].size() - maxDeg;
  int withPar = INF;
  if (toRem <= 0)
    withPar = coutInit;
  int accu = coutInit;

  for (int i = 0; i < (int)swaps.size(); ++i) {
    accu += swaps[i];
    if (i + 1 >= toRem)
      withPar = min(withPar, accu);
  }

  // withoutPar
  toRem = adj[u].size() - maxDeg - (u != p);
  int withoutPar = INF;
  if (toRem <= 0)
    withoutPar = coutInit;
  accu = coutInit;
  for (int i = 0; i < (int)swaps.size(); ++i) {
    accu += swaps[i];
    if (i + 1 >= toRem)
      withoutPar = min(withoutPar, accu);
  }
  return pair(withPar, withoutPar);
}

vector<int> minimum_closure_costs(signed N, vector<signed> U, vector<signed> V,
                                  vector<signed> W) {

  for (int i = 0; i < N - 1; ++i) {
    adj[U[i]].emplace_back(V[i], W[i]);
    adj[V[i]].emplace_back(U[i], W[i]);
  }

  vector<int> order(N);
  iota(order.begin(), order.end(), 0LL);
  sort(order.begin(), order.end(),
       [&](int i, int j) { return adj[i].size() > adj[j].size(); });

  vector<int> ret(N);
  ret[0] = accumulate(W.begin(), W.end(), 0LL);

  for (int k = 1; k < N; ++k) {
    for (int i : order) {
      if ((int)adj[i].size() <= k)
        break;
      if (!seen[i])
        ret[k] += dfs(i, i, k).first;
    }
    for (int i : order) {
      if ((int)adj[i].size() <= k)
        break;
      seen[i] = false;
    }
  }

  return ret;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 133 ms 2824 KB Output is correct
3 Correct 156 ms 2832 KB Output is correct
4 Correct 55 ms 2832 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 52 ms 2812 KB Output is correct
9 Correct 94 ms 2828 KB Output is correct
10 Correct 3 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Execution timed out 2078 ms 8964 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 78 ms 17572 KB Output is correct
3 Correct 66 ms 21568 KB Output is correct
4 Correct 63 ms 22856 KB Output is correct
5 Correct 65 ms 22856 KB Output is correct
6 Correct 2 ms 2896 KB Output is correct
7 Correct 3 ms 3024 KB Output is correct
8 Correct 3 ms 2896 KB Output is correct
9 Correct 2 ms 2640 KB Output is correct
10 Correct 3 ms 2640 KB Output is correct
11 Correct 2 ms 2656 KB Output is correct
12 Correct 37 ms 14280 KB Output is correct
13 Correct 57 ms 22124 KB Output is correct
14 Correct 2 ms 2640 KB Output is correct
15 Correct 60 ms 20240 KB Output is correct
16 Correct 58 ms 22088 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2636 KB Output is correct
2 Correct 2 ms 2636 KB Output is correct
3 Correct 2 ms 2636 KB Output is correct
4 Correct 2 ms 2636 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 2 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 2 ms 2636 KB Output is correct
9 Correct 2 ms 2636 KB Output is correct
10 Correct 2 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Correct 2 ms 2636 KB Output is correct
13 Correct 2 ms 2636 KB Output is correct
14 Correct 2 ms 2636 KB Output is correct
15 Correct 2 ms 2636 KB Output is correct
16 Correct 2 ms 2636 KB Output is correct
17 Correct 2 ms 2724 KB Output is correct
18 Correct 2 ms 2636 KB Output is correct
19 Correct 2 ms 2636 KB Output is correct
20 Correct 2 ms 2636 KB Output is correct
21 Correct 2 ms 2636 KB Output is correct
22 Correct 1 ms 2636 KB Output is correct
23 Correct 2 ms 2764 KB Output is correct
24 Correct 3 ms 2764 KB Output is correct
25 Correct 3 ms 2764 KB Output is correct
26 Correct 4 ms 2796 KB Output is correct
27 Correct 21 ms 2860 KB Output is correct
28 Correct 10 ms 2764 KB Output is correct
29 Correct 3 ms 2764 KB Output is correct
30 Correct 6 ms 2764 KB Output is correct
31 Correct 5 ms 2764 KB Output is correct
32 Correct 19 ms 2844 KB Output is correct
33 Correct 3 ms 2892 KB Output is correct
34 Correct 2 ms 2892 KB Output is correct
35 Correct 3 ms 2892 KB Output is correct
36 Correct 136 ms 2820 KB Output is correct
37 Correct 158 ms 2832 KB Output is correct
38 Correct 59 ms 2840 KB Output is correct
39 Correct 2 ms 2636 KB Output is correct
40 Correct 2 ms 2636 KB Output is correct
41 Correct 2 ms 2636 KB Output is correct
42 Correct 2 ms 2636 KB Output is correct
43 Correct 2 ms 2636 KB Output is correct
44 Correct 3 ms 2636 KB Output is correct
45 Correct 2 ms 2636 KB Output is correct
46 Correct 2 ms 2636 KB Output is correct
47 Correct 2 ms 2636 KB Output is correct
48 Correct 1 ms 2636 KB Output is correct
49 Correct 1 ms 2636 KB Output is correct
50 Correct 2 ms 2636 KB Output is correct
51 Correct 2 ms 2636 KB Output is correct
52 Correct 2 ms 2636 KB Output is correct
53 Correct 3 ms 2764 KB Output is correct
54 Correct 3 ms 2764 KB Output is correct
55 Correct 16 ms 2868 KB Output is correct
56 Correct 53 ms 2764 KB Output is correct
57 Correct 88 ms 2836 KB Output is correct
58 Correct 2 ms 2636 KB Output is correct
59 Correct 2 ms 2636 KB Output is correct
60 Correct 2 ms 2636 KB Output is correct
61 Correct 3 ms 2636 KB Output is correct
62 Correct 2 ms 2636 KB Output is correct
63 Correct 2 ms 2636 KB Output is correct
64 Correct 3 ms 2764 KB Output is correct
65 Correct 3 ms 2764 KB Output is correct
66 Correct 4 ms 2764 KB Output is correct
67 Correct 18 ms 2836 KB Output is correct
68 Correct 4 ms 2764 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 11712 KB Output is correct
2 Correct 90 ms 12872 KB Output is correct
3 Correct 524 ms 13752 KB Output is correct
4 Correct 82 ms 13512 KB Output is correct
5 Correct 508 ms 13736 KB Output is correct
6 Execution timed out 2080 ms 12744 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 78 ms 11712 KB Output is correct
2 Correct 90 ms 12872 KB Output is correct
3 Correct 524 ms 13752 KB Output is correct
4 Correct 82 ms 13512 KB Output is correct
5 Correct 508 ms 13736 KB Output is correct
6 Execution timed out 2080 ms 12744 KB Time limit exceeded
7 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2636 KB Output is correct
2 Correct 133 ms 2824 KB Output is correct
3 Correct 156 ms 2832 KB Output is correct
4 Correct 55 ms 2832 KB Output is correct
5 Correct 2 ms 2636 KB Output is correct
6 Correct 3 ms 2636 KB Output is correct
7 Correct 2 ms 2636 KB Output is correct
8 Correct 52 ms 2812 KB Output is correct
9 Correct 94 ms 2828 KB Output is correct
10 Correct 3 ms 2636 KB Output is correct
11 Correct 2 ms 2636 KB Output is correct
12 Execution timed out 2078 ms 8964 KB Time limit exceeded
13 Halted 0 ms 0 KB -