oj.uz

Submission #559145

# Submission time Handle Problem Language Result Execution time Memory
559145 2022-05-09T12:41:31 Z acm Road Closures (APIO21_roads) C++14
31 / 100
 2000 ms 25732 KB 
#include <bits/stdc++.h>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define REP(i, l, r) for (int i = (l); i < (r); ++i)
#define FORD(i, r, l) for (int i = (r); i >= (l); --i)
#define REPD(i, r, l) for (int i = (r)-1; i >= (l); --i)
#define pb(x) push_back(x)
#define ll long long
#define pii pair<int, int>
using namespace std;
const int N = 1e5 + 5, Ns4 = 200005;
int n;
long long ans[N];
long long dpx[N], val[N];
int sz[Ns4];
long long dd[Ns4][2];
vector<pii> S[N];

void DFS(int u, int p, int max_sz) {
  int now_sz = min(sz[u], max_sz), w = 0;
  vector<int> Q;
  long long sum = 0, pre_sum = 0;
  for (auto [c, v] : S[u])
    if (v != p) {
      DFS(v, u, max_sz);
      long long xx = dd[v][1] + c;
      long long yy = dd[v][0];
      sum += xx;
      if (yy - xx < 0)
        Q.push_back(yy - xx);
      else
        w++;
    }
  for (int i = 0; i <= min(w, 1); i++) Q.pb(0);
  sort(Q.begin(), Q.end());
  now_sz = min(now_sz, (int)Q.size());
  pre_sum = 1e15;
  REP(i, 0, now_sz) {
    pre_sum = sum;
    sum += min(0, Q[i]);
  }
  Q.clear();
  if (now_sz < max_sz) pre_sum = sum;
  dd[u][0] = pre_sum;
  dd[u][1] = sum;
}
void calc(int i) {
  DFS(0, 0, i);
  ans[i] = dd[0][1];
}
void dnc(int l = 1, int r = n - 2, ll L = ans[n - 1], ll R = ans[0]) {
  if (l > r) return;
  if (L == R) {
    for (int i = l; i <= r; i++) ans[i] = L;
    return;
  }
  int tm = (l + r) / 2;
  calc(tm);
  dnc(l, tm - 1, ans[tm], R);
  dnc(tm + 1, r, L, ans[tm]);
}
void sub34() {
  REP(i, 0, n) {
    sz[i] = S[i].size() - 1;
    if (i == 0) ++sz[i];
  }
  calc(0);
  calc(n - 1);
  if (1 <= n - 2) dnc();
}

vector<long long> minimum_closure_costs(int N, vector<int> U, vector<int> V,
                                        vector<int> W) {
  n = N;
  REP(i, 0, n - 1) {
    S[U[i]].emplace_back(W[i], V[i]);
    S[V[i]].emplace_back(W[i], U[i]);
  }
  sub34();
  vector<long long> ret(n);
  REP(i, 0, n) ret[i] = ans[i];
  return ret;
}

Compilation message

roads.cpp: In function 'void DFS(int, int, int)':
roads.cpp:22:13: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   22 |   for (auto [c, v] : S[u])
      |             ^

Subtask #1
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 240 ms 2844 KB Output is correct
3 Correct 292 ms 2864 KB Output is correct
4 Correct 187 ms 2844 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 142 ms 2820 KB Output is correct
9 Correct 215 ms 2976 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 4 ms 2644 KB Output is correct
12 Execution timed out 2076 ms 8448 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 2644 KB Output is correct
2 Correct 183 ms 21844 KB Output is correct
3 Correct 207 ms 24172 KB Output is correct
4 Correct 216 ms 25640 KB Output is correct
5 Correct 220 ms 25712 KB Output is correct
6 Correct 4 ms 3028 KB Output is correct
7 Correct 4 ms 3028 KB Output is correct
8 Correct 5 ms 3028 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 134 ms 16436 KB Output is correct
13 Correct 213 ms 25732 KB Output is correct
14 Correct 2 ms 2644 KB Output is correct
15 Correct 206 ms 23372 KB Output is correct
16 Correct 220 ms 25732 KB Output is correct

Subtask #3
14.0 / 14.0

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

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 1 ms 2644 KB Output is correct
4 Correct 2 ms 2644 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 2 ms 2644 KB Output is correct
7 Correct 2 ms 2644 KB Output is correct
8 Correct 2 ms 2644 KB Output is correct
9 Correct 2 ms 2644 KB Output is correct
10 Correct 2 ms 2660 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 2 ms 2644 KB Output is correct
13 Correct 2 ms 2644 KB Output is correct
14 Correct 4 ms 2772 KB Output is correct
15 Correct 5 ms 2644 KB Output is correct
16 Correct 3 ms 2644 KB Output is correct
17 Correct 3 ms 2644 KB Output is correct
18 Correct 3 ms 2644 KB Output is correct
19 Correct 5 ms 2696 KB Output is correct
20 Correct 4 ms 2644 KB Output is correct
21 Correct 2 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 4 ms 2796 KB Output is correct
24 Correct 6 ms 2772 KB Output is correct
25 Correct 5 ms 2772 KB Output is correct
26 Correct 10 ms 2772 KB Output is correct
27 Correct 44 ms 2868 KB Output is correct
28 Correct 33 ms 2864 KB Output is correct
29 Correct 6 ms 2772 KB Output is correct
30 Correct 10 ms 2772 KB Output is correct
31 Correct 11 ms 2856 KB Output is correct
32 Correct 94 ms 2844 KB Output is correct
33 Correct 4 ms 3028 KB Output is correct
34 Correct 4 ms 3028 KB Output is correct
35 Correct 4 ms 3028 KB Output is correct
36 Correct 234 ms 2840 KB Output is correct
37 Correct 270 ms 2892 KB Output is correct
38 Correct 171 ms 2772 KB Output is correct
39 Correct 2 ms 2644 KB Output is correct
40 Correct 1 ms 2644 KB Output is correct
41 Correct 2 ms 2644 KB Output is correct
42 Correct 3 ms 2644 KB Output is correct
43 Correct 2 ms 2644 KB Output is correct
44 Correct 2 ms 2644 KB Output is correct
45 Correct 2 ms 2644 KB Output is correct
46 Correct 2 ms 2644 KB Output is correct
47 Correct 2 ms 2644 KB Output is correct
48 Correct 3 ms 2644 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 3 ms 2644 KB Output is correct
51 Correct 4 ms 2644 KB Output is correct
52 Correct 3 ms 2644 KB Output is correct
53 Correct 6 ms 2772 KB Output is correct
54 Correct 8 ms 2772 KB Output is correct
55 Correct 39 ms 2772 KB Output is correct
56 Correct 143 ms 2772 KB Output is correct
57 Correct 211 ms 2972 KB Output is correct
58 Correct 2 ms 2644 KB Output is correct
59 Correct 2 ms 2644 KB Output is correct
60 Correct 2 ms 2644 KB Output is correct
61 Correct 4 ms 2644 KB Output is correct
62 Correct 4 ms 2644 KB Output is correct
63 Correct 2 ms 2644 KB Output is correct
64 Correct 6 ms 2772 KB Output is correct
65 Correct 6 ms 2876 KB Output is correct
66 Correct 11 ms 2772 KB Output is correct
67 Correct 92 ms 2848 KB Output is correct
68 Correct 9 ms 2772 KB Output is correct

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 550 ms 11928 KB Output is correct
2 Correct 681 ms 11788 KB Output is correct
3 Execution timed out 2079 ms 11524 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 550 ms 11928 KB Output is correct
2 Correct 681 ms 11788 KB Output is correct
3 Execution timed out 2079 ms 11524 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 240 ms 2844 KB Output is correct
3 Correct 292 ms 2864 KB Output is correct
4 Correct 187 ms 2844 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 3 ms 2644 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 142 ms 2820 KB Output is correct
9 Correct 215 ms 2976 KB Output is correct
10 Correct 3 ms 2644 KB Output is correct
11 Correct 4 ms 2644 KB Output is correct
12 Execution timed out 2076 ms 8448 KB Time limit exceeded
13 Halted 0 ms 0 KB -