oj.uz

Submission #412325

# Submission time Handle Problem Language Result Execution time Memory
412325 2021-05-26T17:20:43 Z model_code Road Closures (APIO21_roads) C++17
31 / 100
 2000 ms 30036 KB 
#include "roads.h"

// O(N^2 log(N)) solution
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define all(c) ((c).begin()), ((c).end())
#define sz(x) ((int)(x).size())

const ll INF = 1LL << 50;

vector<ll> minimum_closure_costs(int n, vector<int> a, vector<int> b, vector<int> w) {
  ll W = 0;
  vector<vector<int>> adj(n);
  for (int i = 0; i + 1 < n; i++) {
    adj[a[i]].push_back(i);
    adj[b[i]].push_back(i);
    W += w[i];
  }
  vector<vector<ll>> dp(n, vector<ll>(2));
  function<void(int, int, int)> dfs = [&](int s, int p, int k) {
    vector<ll> vals;
    ll sum = 0;
    for (int ind : adj[s]) {
      int v = a[ind] ^ b[ind] ^ s;
      if (v == p) continue;
      dfs(v, s, k);
      sum += dp[v][0] + w[ind];
      vals.push_back(dp[v][1] - dp[v][0] - w[ind]);
    }
    sort(all(vals));
    dp[s][0] = dp[s][1] = INF;
    for (int i = 0; i <= min(k, sz(vals)); i++) {
      dp[s][0] = min(dp[s][0], sum);
      if (i < k) dp[s][1] = min(dp[s][1], sum);
      if (i < sz(vals)) sum += vals[i];
    }
  };
  vector<ll> answers(n, 0);
  answers[0] = W;
  for (int k = 1; k < n; k++) {
    dfs(0, 0, k);
    answers[k] += dp[0][0];
    if(answers[k] == 0) break;
  }
  return answers;
}

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 256 ms 588 KB Output is correct
3 Correct 315 ms 592 KB Output is correct
4 Correct 191 ms 600 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 3 ms 204 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 154 ms 544 KB Output is correct
9 Correct 228 ms 600 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 3 ms 320 KB Output is correct
12 Execution timed out 2044 ms 10120 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 81 ms 24960 KB Output is correct
3 Correct 101 ms 28128 KB Output is correct
4 Correct 130 ms 30036 KB Output is correct
5 Correct 110 ms 30012 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 3 ms 784 KB Output is correct
8 Correct 2 ms 716 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 53 ms 18056 KB Output is correct
13 Correct 87 ms 29928 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 79 ms 27056 KB Output is correct
16 Correct 95 ms 30016 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 2 ms 332 KB Output is correct
13 Correct 2 ms 204 KB Output is correct
14 Correct 3 ms 204 KB Output is correct
15 Correct 3 ms 204 KB Output is correct
16 Correct 1 ms 204 KB Output is correct
17 Correct 1 ms 204 KB Output is correct
18 Correct 2 ms 204 KB Output is correct
19 Correct 2 ms 204 KB Output is correct
20 Correct 3 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 1 ms 204 KB Output is correct
23 Correct 2 ms 460 KB Output is correct
24 Correct 4 ms 588 KB Output is correct
25 Correct 3 ms 460 KB Output is correct
26 Correct 9 ms 588 KB Output is correct
27 Correct 43 ms 588 KB Output is correct
28 Correct 34 ms 588 KB Output is correct
29 Correct 5 ms 460 KB Output is correct
30 Correct 9 ms 584 KB Output is correct
31 Correct 12 ms 568 KB Output is correct
32 Correct 110 ms 592 KB Output is correct
33 Correct 2 ms 716 KB Output is correct
34 Correct 3 ms 844 KB Output is correct
35 Correct 2 ms 716 KB Output is correct
36 Correct 275 ms 588 KB Output is correct
37 Correct 312 ms 588 KB Output is correct
38 Correct 193 ms 588 KB Output is correct
39 Correct 1 ms 204 KB Output is correct
40 Correct 1 ms 204 KB Output is correct
41 Correct 1 ms 204 KB Output is correct
42 Correct 1 ms 204 KB Output is correct
43 Correct 1 ms 204 KB Output is correct
44 Correct 1 ms 204 KB Output is correct
45 Correct 1 ms 204 KB Output is correct
46 Correct 1 ms 204 KB Output is correct
47 Correct 1 ms 332 KB Output is correct
48 Correct 1 ms 332 KB Output is correct
49 Correct 1 ms 332 KB Output is correct
50 Correct 2 ms 204 KB Output is correct
51 Correct 3 ms 204 KB Output is correct
52 Correct 3 ms 204 KB Output is correct
53 Correct 4 ms 460 KB Output is correct
54 Correct 4 ms 460 KB Output is correct
55 Correct 57 ms 588 KB Output is correct
56 Correct 150 ms 544 KB Output is correct
57 Correct 224 ms 596 KB Output is correct
58 Correct 1 ms 204 KB Output is correct
59 Correct 1 ms 204 KB Output is correct
60 Correct 1 ms 204 KB Output is correct
61 Correct 3 ms 320 KB Output is correct
62 Correct 3 ms 204 KB Output is correct
63 Correct 1 ms 204 KB Output is correct
64 Correct 3 ms 460 KB Output is correct
65 Correct 4 ms 460 KB Output is correct
66 Correct 9 ms 460 KB Output is correct
67 Correct 112 ms 588 KB Output is correct
68 Correct 7 ms 588 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 14108 KB Output is correct
2 Correct 449 ms 13840 KB Output is correct
3 Execution timed out 2065 ms 15044 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 384 ms 14108 KB Output is correct
2 Correct 449 ms 13840 KB Output is correct
3 Execution timed out 2065 ms 15044 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 256 ms 588 KB Output is correct
3 Correct 315 ms 592 KB Output is correct
4 Correct 191 ms 600 KB Output is correct
5 Correct 2 ms 204 KB Output is correct
6 Correct 3 ms 204 KB Output is correct
7 Correct 3 ms 204 KB Output is correct
8 Correct 154 ms 544 KB Output is correct
9 Correct 228 ms 600 KB Output is correct
10 Correct 3 ms 204 KB Output is correct
11 Correct 3 ms 320 KB Output is correct
12 Execution timed out 2044 ms 10120 KB Time limit exceeded
13 Halted 0 ms 0 KB -