oj.uz

답안 #103410

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
103410 2019-03-30T07:20:06 Z wxh010910 경주 (Race) (IOI11_race) C++17
100 / 100
 1965 ms 52024 KB 
#include <bits/stdc++.h>
#include "race.h"

using namespace std;

int best_path(int N, int K, int H[][2], int L[]) {
  vector<vector<pair<int, int>>> adj(N);
  for (int i = 0; i < N - 1; ++i) {
    adj[H[i][0]].emplace_back(H[i][1], L[i]);
    adj[H[i][1]].emplace_back(H[i][0], L[i]);
  }
  int ans = N;
  vector<int> pr(N), sz(N), subtree(N);
  vector<bool> visit(N);
  function<void(int, int)> centroid_decomposition = [&](int x, int s) {
    int root = -1;
    pr[x] = -1;
    function<void(int)> find_root = [&](int x) {
      subtree[x] = 0;
      sz[x] = 1;
      for (auto p : adj[x]) {
        int y = p.first;
        if (!visit[y] && y != pr[x]) {
          pr[y] = x;
          find_root(y);
          sz[x] += sz[y];
          subtree[x] = max(subtree[x], sz[y]);
        }
      }
      subtree[x] = max(subtree[x], s - sz[x]);
      if (root == -1 || subtree[x] < subtree[root]) {
        root = x;
      }
    };
    find_root(x);
    visit[x = root] = true;
    if (pr[x] != -1) {
      sz[pr[x]] = s - sz[x];
    }
    pr[x] = -1;
    unordered_map<int, int> f;
    f[0] = 0;
    function<void(int, int, int)> query = [&](int x, int d, int v) {
      if (v > K) {
        return;
      }
      if (f.count(K - v)) {
        ans = min(ans, f[K - v] + d);
      }
      for (auto p : adj[x]) {
        int y = p.first, w = p.second;
        if (!visit[y] && y != pr[x]) {
          pr[y] = x;
          query(y, d + 1, v + w);
        }
      }
    };
    function<void(int, int, int)> modify = [&](int x, int d, int v) {
      if (v > K) {
        return;
      }
      if (f.count(v)) {
        f[v] = min(f[v], d);
      } else {
        f[v] = d;
      }
      for (auto p : adj[x]) {
        int y = p.first, w = p.second;
        if (!visit[y] && y != pr[x]) {
          pr[y] = x;
          modify(y, d + 1, v + w);
        }
      }
    };
    for (auto p : adj[x]) {
      int y = p.first, w = p.second;
      if (!visit[y]) {
        pr[y] = x;
        query(y, 1, w);
        modify(y, 1, w);
      }
    }
    for (auto p : adj[x]) {
      int y = p.first;
      if (!visit[y]) {
        centroid_decomposition(y, sz[y]);
      }
    }
  };
  centroid_decomposition(0, N);
  if (ans == N) {
    ans = -1;
  }
  return ans;
}

Subtask #1
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 4 ms 512 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 6 ms 512 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 406 ms 8952 KB Output is correct
20 Correct 409 ms 8716 KB Output is correct
21 Correct 482 ms 8928 KB Output is correct
22 Correct 497 ms 8844 KB Output is correct
23 Correct 305 ms 8952 KB Output is correct
24 Correct 186 ms 8952 KB Output is correct
25 Correct 373 ms 13308 KB Output is correct
26 Correct 234 ms 18936 KB Output is correct
27 Correct 389 ms 20312 KB Output is correct
28 Correct 676 ms 37888 KB Output is correct
29 Correct 739 ms 36600 KB Output is correct
30 Correct 419 ms 20216 KB Output is correct
31 Correct 368 ms 20344 KB Output is correct
32 Correct 501 ms 20472 KB Output is correct
33 Correct 653 ms 19320 KB Output is correct
34 Correct 490 ms 20088 KB Output is correct

Subtask #4
57.0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 512 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 2 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 2 ms 356 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 3 ms 256 KB Output is correct
20 Correct 3 ms 384 KB Output is correct
21 Correct 4 ms 512 KB Output is correct
22 Correct 3 ms 384 KB Output is correct
23 Correct 4 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 4 ms 384 KB Output is correct
26 Correct 3 ms 384 KB Output is correct
27 Correct 3 ms 384 KB Output is correct
28 Correct 4 ms 512 KB Output is correct
29 Correct 4 ms 512 KB Output is correct
30 Correct 5 ms 512 KB Output is correct
31 Correct 4 ms 512 KB Output is correct
32 Correct 5 ms 512 KB Output is correct
33 Correct 5 ms 512 KB Output is correct
34 Correct 4 ms 512 KB Output is correct
35 Correct 4 ms 384 KB Output is correct
36 Correct 5 ms 384 KB Output is correct
37 Correct 4 ms 512 KB Output is correct
38 Correct 6 ms 512 KB Output is correct
39 Correct 406 ms 8952 KB Output is correct
40 Correct 409 ms 8716 KB Output is correct
41 Correct 482 ms 8928 KB Output is correct
42 Correct 497 ms 8844 KB Output is correct
43 Correct 305 ms 8952 KB Output is correct
44 Correct 186 ms 8952 KB Output is correct
45 Correct 373 ms 13308 KB Output is correct
46 Correct 234 ms 18936 KB Output is correct
47 Correct 389 ms 20312 KB Output is correct
48 Correct 676 ms 37888 KB Output is correct
49 Correct 739 ms 36600 KB Output is correct
50 Correct 419 ms 20216 KB Output is correct
51 Correct 368 ms 20344 KB Output is correct
52 Correct 501 ms 20472 KB Output is correct
53 Correct 653 ms 19320 KB Output is correct
54 Correct 490 ms 20088 KB Output is correct
55 Correct 32 ms 1636 KB Output is correct
56 Correct 28 ms 1280 KB Output is correct
57 Correct 371 ms 10360 KB Output is correct
58 Correct 101 ms 10200 KB Output is correct
59 Correct 497 ms 25396 KB Output is correct
60 Correct 1965 ms 52024 KB Output is correct
61 Correct 492 ms 20696 KB Output is correct
62 Correct 619 ms 20444 KB Output is correct
63 Correct 714 ms 20668 KB Output is correct
64 Correct 1728 ms 30472 KB Output is correct
65 Correct 576 ms 21368 KB Output is correct
66 Correct 1293 ms 35060 KB Output is correct
67 Correct 414 ms 20968 KB Output is correct
68 Correct 711 ms 27400 KB Output is correct
69 Correct 753 ms 27664 KB Output is correct
70 Correct 735 ms 26444 KB Output is correct