oj.uz

답안 #559179

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559179 2022-05-09T13:08:18 Z acm 도로 폐쇄 (APIO21_roads) C++14
31 / 100
 2000 ms 25856 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);
  now_sz = min(now_sz, (int)Q.size());
  pre_sum = 1e15;
  if (now_sz && Q.size() > 2000) {
    nth_element(Q.begin(), Q.begin() + now_sz - 1, Q.end());
    int alta = Q[now_sz - 1];
    int x = now_sz;
    for (auto X : Q) {
      if (X < alta) {
        x--;
        pre_sum = sum;
        sum += min(0, X);
      }
    }
    for (auto X : Q) {
      if (X == alta && x) {
        x--;
        pre_sum = sum;
        sum += min(0, X);
      }
    }
    Q.clear();
  } else {
    sort(Q.begin(), Q.end());

    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;
}
ll calc(int i) {
  DFS(0, 0, i);
  return 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];
  }
  int x = 0;
  for (int i = 6;; i++) {
    int y = min(x + (1 << i), n - 1);
    dnc(x, y, calc(y), calc(x));
    if (y == n - 1) break;
    x = y + 1;
  }
}

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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 257 ms 2840 KB Output is correct
3 Correct 298 ms 2836 KB Output is correct
4 Correct 194 ms 2852 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 4 ms 2644 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 147 ms 2824 KB Output is correct
9 Correct 212 ms 2860 KB Output is correct
10 Correct 3 ms 2696 KB Output is correct
11 Correct 4 ms 2644 KB Output is correct
12 Execution timed out 2081 ms 8352 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #2
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2644 KB Output is correct
2 Correct 260 ms 21824 KB Output is correct
3 Correct 287 ms 24220 KB Output is correct
4 Correct 312 ms 25856 KB Output is correct
5 Correct 331 ms 25804 KB Output is correct
6 Correct 6 ms 3028 KB Output is correct
7 Correct 4 ms 3028 KB Output is correct
8 Correct 4 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 170 ms 16588 KB Output is correct
13 Correct 303 ms 25728 KB Output is correct
14 Correct 1 ms 2644 KB Output is correct
15 Correct 267 ms 23456 KB Output is correct
16 Correct 302 ms 25744 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 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 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 5 ms 2644 KB Output is correct
14 Correct 6 ms 2644 KB Output is correct
15 Correct 5 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 3 ms 2644 KB Output is correct
20 Correct 4 ms 2696 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 2 ms 2644 KB Output is correct
3 Correct 2 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 2644 KB Output is correct
11 Correct 2 ms 2644 KB Output is correct
12 Correct 3 ms 2688 KB Output is correct
13 Correct 5 ms 2644 KB Output is correct
14 Correct 6 ms 2644 KB Output is correct
15 Correct 5 ms 2644 KB Output is correct
16 Correct 2 ms 2644 KB Output is correct
17 Correct 2 ms 2644 KB Output is correct
18 Correct 2 ms 2644 KB Output is correct
19 Correct 3 ms 2644 KB Output is correct
20 Correct 4 ms 2696 KB Output is correct
21 Correct 1 ms 2644 KB Output is correct
22 Correct 1 ms 2644 KB Output is correct
23 Correct 4 ms 2772 KB Output is correct
24 Correct 7 ms 2772 KB Output is correct
25 Correct 6 ms 2772 KB Output is correct
26 Correct 12 ms 2844 KB Output is correct
27 Correct 44 ms 2864 KB Output is correct
28 Correct 34 ms 2864 KB Output is correct
29 Correct 7 ms 2824 KB Output is correct
30 Correct 14 ms 2772 KB Output is correct
31 Correct 12 ms 2772 KB Output is correct
32 Correct 96 ms 2848 KB Output is correct
33 Correct 5 ms 3052 KB Output is correct
34 Correct 7 ms 3028 KB Output is correct
35 Correct 5 ms 3028 KB Output is correct
36 Correct 256 ms 2840 KB Output is correct
37 Correct 280 ms 2844 KB Output is correct
38 Correct 175 ms 2852 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 2 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 2 ms 2644 KB Output is correct
49 Correct 2 ms 2644 KB Output is correct
50 Correct 2 ms 2644 KB Output is correct
51 Correct 4 ms 2644 KB Output is correct
52 Correct 5 ms 2592 KB Output is correct
53 Correct 6 ms 2772 KB Output is correct
54 Correct 7 ms 2772 KB Output is correct
55 Correct 38 ms 2864 KB Output is correct
56 Correct 141 ms 2812 KB Output is correct
57 Correct 209 ms 2852 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 3 ms 2696 KB Output is correct
62 Correct 3 ms 2644 KB Output is correct
63 Correct 2 ms 2644 KB Output is correct
64 Correct 8 ms 2876 KB Output is correct
65 Correct 6 ms 2772 KB Output is correct
66 Correct 10 ms 2772 KB Output is correct
67 Correct 98 ms 2852 KB Output is correct
68 Correct 9 ms 2772 KB Output is correct

Subtask #5
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 684 ms 11952 KB Output is correct
2 Correct 723 ms 11748 KB Output is correct
3 Execution timed out 2077 ms 11332 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 684 ms 11952 KB Output is correct
2 Correct 723 ms 11748 KB Output is correct
3 Execution timed out 2077 ms 11332 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 2644 KB Output is correct
2 Correct 257 ms 2840 KB Output is correct
3 Correct 298 ms 2836 KB Output is correct
4 Correct 194 ms 2852 KB Output is correct
5 Correct 2 ms 2644 KB Output is correct
6 Correct 4 ms 2644 KB Output is correct
7 Correct 4 ms 2644 KB Output is correct
8 Correct 147 ms 2824 KB Output is correct
9 Correct 212 ms 2860 KB Output is correct
10 Correct 3 ms 2696 KB Output is correct
11 Correct 4 ms 2644 KB Output is correct
12 Execution timed out 2081 ms 8352 KB Time limit exceeded
13 Halted 0 ms 0 KB -