oj.uz

Submission #494101

# Submission time Handle Problem Language Result Execution time Memory
494101 2021-12-14T10:42:38 Z peijar Road Closures (APIO21_roads) C++17
24 / 100
 229 ms 5064 KB 
#include "roads.h"
#include <bits/stdc++.h>
using namespace std;
#define int long long

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

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

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

      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;
  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]);
  }

  int tot = accumulate(W.begin(), W.end(), 0LL);
  vector<int> ret(N);
  ret[0] = tot;
  for (int k = 1; k < N; ++k)
    ret[k] = dfs(0, 0, k).first;
  return ret;

  if (U == vector<signed>(N - 1, 0)) {
    vector<int> prefSum(N);
    sort(W.begin(), W.end());
    for (int i = 0; i < N - 1; ++i)
      prefSum[i + 1] = prefSum[i] + W[i];
    reverse(prefSum.begin(), prefSum.end());

    return prefSum;
  }
  return vector<int>(N, 0);
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 148 ms 500 KB Output is correct
3 Correct 174 ms 516 KB Output is correct
4 Correct 71 ms 516 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 66 ms 500 KB Output is correct
9 Correct 108 ms 512 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Runtime error 21 ms 3360 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -

Subtask #2
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Runtime error 27 ms 4664 KB Execution killed with signal 11
3 Halted 0 ms 0 KB -

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 3 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 2 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 2 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 1 ms 460 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 332 KB Output is correct
20 Correct 1 ms 332 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 332 KB Output is correct
23 Correct 87 ms 332 KB Output is correct
24 Correct 229 ms 544 KB Output is correct
25 Correct 173 ms 500 KB Output is correct
26 Correct 165 ms 464 KB Output is correct
27 Correct 141 ms 464 KB Output is correct
28 Correct 76 ms 464 KB Output is correct
29 Correct 192 ms 524 KB Output is correct
30 Correct 126 ms 548 KB Output is correct
31 Correct 116 ms 532 KB Output is correct
32 Correct 71 ms 540 KB Output is correct
33 Correct 124 ms 720 KB Output is correct
34 Correct 141 ms 764 KB Output is correct
35 Correct 117 ms 720 KB Output is correct
36 Correct 148 ms 548 KB Output is correct
37 Correct 175 ms 544 KB Output is correct
38 Correct 78 ms 464 KB Output is correct
39 Correct 0 ms 336 KB Output is correct
40 Correct 1 ms 336 KB Output is correct
41 Correct 1 ms 336 KB Output is correct
42 Correct 2 ms 336 KB Output is correct
43 Correct 1 ms 336 KB Output is correct
44 Correct 2 ms 336 KB Output is correct
45 Correct 3 ms 348 KB Output is correct
46 Correct 2 ms 336 KB Output is correct
47 Correct 1 ms 336 KB Output is correct
48 Correct 2 ms 336 KB Output is correct
49 Correct 2 ms 336 KB Output is correct
50 Correct 1 ms 336 KB Output is correct
51 Correct 1 ms 336 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 138 ms 464 KB Output is correct
54 Correct 229 ms 536 KB Output is correct
55 Correct 105 ms 540 KB Output is correct
56 Correct 66 ms 464 KB Output is correct
57 Correct 101 ms 464 KB Output is correct
58 Correct 1 ms 336 KB Output is correct
59 Correct 2 ms 336 KB Output is correct
60 Correct 2 ms 336 KB Output is correct
61 Correct 1 ms 336 KB Output is correct
62 Correct 2 ms 336 KB Output is correct
63 Correct 0 ms 336 KB Output is correct
64 Correct 215 ms 464 KB Output is correct
65 Correct 226 ms 528 KB Output is correct
66 Correct 89 ms 528 KB Output is correct
67 Correct 71 ms 516 KB Output is correct
68 Correct 83 ms 464 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 5064 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Runtime error 24 ms 5064 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 332 KB Output is correct
2 Correct 148 ms 500 KB Output is correct
3 Correct 174 ms 516 KB Output is correct
4 Correct 71 ms 516 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 66 ms 500 KB Output is correct
9 Correct 108 ms 512 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Runtime error 21 ms 3360 KB Execution killed with signal 11
13 Halted 0 ms 0 KB -