oj.uz

답안 #1000991

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1000991 2024-06-18T12:21:21 Z LucaLucaM Tourism (JOI23_tourism) C++17
100 / 100
 947 ms 34720 KB 
#include <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
#include <cstring>
#include <set>
#warning That's the baby, that's not my baby

#define debug(x) #x << " = " << x << '\n'

typedef long long ll;

const int NMAX = 1e5;
const int LGMAX = 16;

int aib[NMAX + 1];
int answer[NMAX + 1];

int a[NMAX + 1];

std::vector<int> g[NMAX + 1];
std::set<std::pair<int, int>> queries[NMAX + 1];
std::vector<std::pair<int, int>> curQ[NMAX + 1];

int depth[NMAX + 1];
int tin[NMAX + 1], tout[NMAX + 1], timer;

int jump[LGMAX + 1][NMAX + 1];

int sum[NMAX + 1];
int added[NMAX + 1], added2[NMAX + 1];
int parent[NMAX + 1];

bool ancestor(int u, int v) {
  return tin[u] <= tin[v] && tout[v] <= tout[u];
}

int lca(int u, int v) {
  if (ancestor(u, v)) {
    return u;
  }
  for (int k = LGMAX; k >= 0; k--) {
    if (jump[k][u] != 0 && !ancestor(jump[k][u], v)) {
      u = jump[k][u];
    }
  }
  return jump[0][u];
}

void dfs(int u, int p = 0) {
  depth[u] = depth[p] + 1;
  tin[u] = ++timer;
  jump[0][u] = p;
  for (const auto &v : g[u]) {
    if (v != p) {
      dfs(v, u);
    }
  }
  tout[u] = timer;
}

void dfs1(int u, int p = 0) {
  parent[u] = p;
  for (const auto &v : g[u]) {
    if (v != p) {
      dfs1(v, u);
    }
  }
}

std::vector<std::pair<int, int>> updates;

void update(int pos, const int &val) {
  if (val > 0) {
    updates.push_back({pos, val});
  }
  for (; pos <= NMAX; pos += pos & -pos) {
    aib[pos] += val;
  }
}

int query(int pos) {
  int ret = 0;
  for (; pos > 0; pos -= pos & -pos) {
    ret += aib[pos];
  }
  return ret;
}

bool cmp(int x, int y) {
  return tin[x] < tin[y];
}

void divide(int l, int r) {
  if (l >= r) {
    return;
  }
  int mid = (l + r) / 2;
  for (int i = mid + 1; i <= r; i++) {
    if (queries[i].empty()) {
      continue;
    }
    if ((*queries[i].rbegin()).first < l) {
      continue;
    }
    auto it = queries[i].lower_bound({l, 0});
    while (it != queries[i].end() && it -> first <= mid) {
      curQ[i].push_back(*it);
      it++;
    }
    for (const auto &[L, index] : curQ[i]) {
      queries[i].erase({L, index});
    }
  }


  std::vector<int> vert;
  for (int i = l; i <= r; i++) {
    vert.push_back(a[i]);
  }
  std::sort(vert.begin(), vert.end());
  vert.erase(std::unique(vert.begin(), vert.end()), vert.end());
  std::sort(vert.begin(), vert.end(), cmp);
  int sz = (int) vert.size();
  for (int i = 1; i < sz; i++) {
    vert.push_back(lca(vert[i - 1], vert[i]));
  }
  std::sort(vert.begin(), vert.end());
  vert.erase(std::unique(vert.begin(), vert.end()), vert.end());
  std::sort(vert.begin(), vert.end(), cmp);
  for (int i = 1; i < (int) vert.size(); i++) {
    int w = lca(vert[i - 1], vert[i]);
    g[w].push_back(vert[i]);
    g[vert[i]].push_back(w);
  }
  for (const auto &u : vert) {
    parent[u] = 0;
  }
  dfs1(a[mid]);
  for (const auto &u : vert) {
    added[u] = added2[u] = 0;
  }
  sum[mid] = 0;
  added[a[mid]] = added2[a[mid]] = mid;

  for (int i = mid - 1; i >= l; i--) {
    int u = a[i];
    int add = 0;
    while (!added[u]) {
      added[u] = i;
      add += std::abs(depth[u] - depth[parent[u]]);
      u = parent[u];
    }
    sum[i] = sum[i + 1] + add;
  }

  for (int i = mid + 1; i <= r; i++) {
    int u = a[i];
    while (!added2[u]) {
      if (added[u] != mid) {
        update(added[u] + 1, std::abs(depth[u] - depth[parent[u]]));
      }
      added2[u] = i;
      u = parent[u];
    }
    for (const auto &[L, index] : curQ[i]) {
      answer[index] = query(L) + sum[L];
    }
    curQ[i].clear();
  }

  for (const auto &[x, y] : updates) {
    update(x, -y);
  }
  updates.clear();
  for (const auto &u : vert) {
    g[u].clear();
  }

  if (l < r) {
    divide(l, mid);
    divide(mid + 1, r);
  }
}

int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);

  int n, m, q;
  std::cin >> n >> m >> q;

  for (int i = 1; i < n; i++) {
    int u, v;
    std::cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }

  dfs(1);

  for (int k = 1; k <= LGMAX; k++) {
    for (int i = 1; i <= n; i++) {
      jump[k][i] = jump[k - 1][jump[k - 1][i]];
    }
  }

  for (int i = 1; i <= m; i++) {
    std::cin >> a[i];
  }

  for (int i = 0; i < q; i++) {
    int l, r;
    std::cin >> l >> r;
    if (l != r) {
      queries[r].insert({l, i});
    } else {
      answer[i] = 0;
    }
  }

  for (int i = 1; i <= n; i++) {
    g[i].clear();
  }

  divide(1, m);

  for (int i = 0; i < q; i++) {
    std::cout << answer[i] + 1 << '\n';
  }

  return 0;
}

Compilation message

tourism.cpp:7:2: warning: #warning That's the baby, that's not my baby [-Wcpp]
    7 | #warning That's the baby, that's not my baby
      |  ^~~~~~~

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 17040 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16984 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 4 ms 17132 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 3 ms 16988 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 3 ms 16988 KB Output is correct
25 Correct 3 ms 17052 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 2 ms 16988 KB Output is correct
28 Correct 2 ms 16980 KB Output is correct
29 Correct 4 ms 16984 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 17040 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16984 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 4 ms 17132 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 3 ms 16988 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 3 ms 16988 KB Output is correct
25 Correct 3 ms 17052 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 2 ms 16988 KB Output is correct
28 Correct 2 ms 16980 KB Output is correct
29 Correct 4 ms 16984 KB Output is correct
30 Correct 7 ms 17244 KB Output is correct
31 Correct 11 ms 17080 KB Output is correct
32 Correct 10 ms 17244 KB Output is correct
33 Correct 10 ms 17244 KB Output is correct
34 Correct 10 ms 17380 KB Output is correct
35 Correct 13 ms 17240 KB Output is correct
36 Correct 10 ms 17352 KB Output is correct
37 Correct 13 ms 17236 KB Output is correct
38 Correct 9 ms 17244 KB Output is correct
39 Correct 9 ms 17244 KB Output is correct
40 Correct 9 ms 17244 KB Output is correct
41 Correct 10 ms 17244 KB Output is correct
42 Correct 8 ms 17244 KB Output is correct
43 Correct 12 ms 17492 KB Output is correct
44 Correct 13 ms 17244 KB Output is correct
45 Correct 9 ms 17244 KB Output is correct
46 Correct 9 ms 17412 KB Output is correct
47 Correct 8 ms 17244 KB Output is correct
48 Correct 9 ms 17244 KB Output is correct
49 Correct 10 ms 17244 KB Output is correct
50 Correct 8 ms 17244 KB Output is correct
51 Correct 9 ms 17244 KB Output is correct
52 Correct 8 ms 17244 KB Output is correct
53 Correct 11 ms 17344 KB Output is correct
54 Correct 8 ms 17244 KB Output is correct
55 Correct 11 ms 17316 KB Output is correct
56 Correct 3 ms 17192 KB Output is correct
57 Correct 3 ms 16988 KB Output is correct
58 Correct 9 ms 17244 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 2 ms 16984 KB Output is correct
3 Correct 3 ms 16988 KB Output is correct
4 Correct 336 ms 28644 KB Output is correct
5 Correct 235 ms 30024 KB Output is correct
6 Correct 333 ms 31212 KB Output is correct
7 Correct 439 ms 34612 KB Output is correct
8 Correct 463 ms 34624 KB Output is correct
9 Correct 440 ms 34720 KB Output is correct
10 Correct 442 ms 34608 KB Output is correct
11 Correct 440 ms 34620 KB Output is correct
12 Correct 301 ms 34400 KB Output is correct
13 Correct 301 ms 34488 KB Output is correct
14 Correct 295 ms 34384 KB Output is correct
15 Correct 34 ms 27476 KB Output is correct
16 Correct 409 ms 29992 KB Output is correct
17 Correct 88 ms 23244 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 391 ms 21688 KB Output is correct
3 Correct 651 ms 22608 KB Output is correct
4 Correct 518 ms 22384 KB Output is correct
5 Correct 812 ms 24920 KB Output is correct
6 Correct 806 ms 24868 KB Output is correct
7 Correct 795 ms 25028 KB Output is correct
8 Correct 808 ms 25056 KB Output is correct
9 Correct 812 ms 24952 KB Output is correct
10 Correct 835 ms 24996 KB Output is correct
11 Correct 830 ms 24844 KB Output is correct
12 Correct 802 ms 25000 KB Output is correct
13 Correct 800 ms 25496 KB Output is correct
14 Correct 811 ms 26372 KB Output is correct
15 Correct 812 ms 25304 KB Output is correct
16 Correct 810 ms 25500 KB Output is correct
17 Correct 831 ms 25272 KB Output is correct
18 Correct 804 ms 25376 KB Output is correct
19 Correct 875 ms 24868 KB Output is correct
20 Correct 877 ms 24944 KB Output is correct
21 Correct 834 ms 25104 KB Output is correct
22 Correct 874 ms 25104 KB Output is correct
23 Correct 875 ms 24892 KB Output is correct
24 Correct 854 ms 25028 KB Output is correct
25 Correct 848 ms 25020 KB Output is correct
26 Correct 897 ms 25188 KB Output is correct
27 Correct 860 ms 24940 KB Output is correct
28 Correct 847 ms 24924 KB Output is correct
29 Correct 933 ms 25028 KB Output is correct
30 Correct 947 ms 25224 KB Output is correct
31 Correct 935 ms 25700 KB Output is correct
32 Correct 875 ms 26056 KB Output is correct
33 Correct 912 ms 26624 KB Output is correct
34 Correct 911 ms 25444 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 3 ms 16988 KB Output is correct
3 Correct 3 ms 17196 KB Output is correct
4 Correct 626 ms 26960 KB Output is correct
5 Correct 670 ms 26904 KB Output is correct
6 Correct 735 ms 29000 KB Output is correct
7 Correct 788 ms 30008 KB Output is correct
8 Correct 773 ms 29872 KB Output is correct
9 Correct 725 ms 30036 KB Output is correct
10 Correct 674 ms 30012 KB Output is correct
11 Correct 686 ms 30012 KB Output is correct
12 Correct 704 ms 30068 KB Output is correct
13 Correct 692 ms 30016 KB Output is correct
14 Correct 73 ms 23252 KB Output is correct

Subtask #6
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 16984 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 3 ms 17040 KB Output is correct
5 Correct 3 ms 16988 KB Output is correct
6 Correct 3 ms 16988 KB Output is correct
7 Correct 3 ms 16988 KB Output is correct
8 Correct 3 ms 16988 KB Output is correct
9 Correct 3 ms 16988 KB Output is correct
10 Correct 3 ms 16988 KB Output is correct
11 Correct 3 ms 16984 KB Output is correct
12 Correct 3 ms 16984 KB Output is correct
13 Correct 3 ms 16988 KB Output is correct
14 Correct 4 ms 17132 KB Output is correct
15 Correct 4 ms 16988 KB Output is correct
16 Correct 3 ms 16988 KB Output is correct
17 Correct 4 ms 16988 KB Output is correct
18 Correct 3 ms 16988 KB Output is correct
19 Correct 3 ms 16988 KB Output is correct
20 Correct 3 ms 16988 KB Output is correct
21 Correct 3 ms 16988 KB Output is correct
22 Correct 3 ms 16988 KB Output is correct
23 Correct 3 ms 16988 KB Output is correct
24 Correct 3 ms 16988 KB Output is correct
25 Correct 3 ms 17052 KB Output is correct
26 Correct 4 ms 16988 KB Output is correct
27 Correct 2 ms 16988 KB Output is correct
28 Correct 2 ms 16980 KB Output is correct
29 Correct 4 ms 16984 KB Output is correct
30 Correct 7 ms 17244 KB Output is correct
31 Correct 11 ms 17080 KB Output is correct
32 Correct 10 ms 17244 KB Output is correct
33 Correct 10 ms 17244 KB Output is correct
34 Correct 10 ms 17380 KB Output is correct
35 Correct 13 ms 17240 KB Output is correct
36 Correct 10 ms 17352 KB Output is correct
37 Correct 13 ms 17236 KB Output is correct
38 Correct 9 ms 17244 KB Output is correct
39 Correct 9 ms 17244 KB Output is correct
40 Correct 9 ms 17244 KB Output is correct
41 Correct 10 ms 17244 KB Output is correct
42 Correct 8 ms 17244 KB Output is correct
43 Correct 12 ms 17492 KB Output is correct
44 Correct 13 ms 17244 KB Output is correct
45 Correct 9 ms 17244 KB Output is correct
46 Correct 9 ms 17412 KB Output is correct
47 Correct 8 ms 17244 KB Output is correct
48 Correct 9 ms 17244 KB Output is correct
49 Correct 10 ms 17244 KB Output is correct
50 Correct 8 ms 17244 KB Output is correct
51 Correct 9 ms 17244 KB Output is correct
52 Correct 8 ms 17244 KB Output is correct
53 Correct 11 ms 17344 KB Output is correct
54 Correct 8 ms 17244 KB Output is correct
55 Correct 11 ms 17316 KB Output is correct
56 Correct 3 ms 17192 KB Output is correct
57 Correct 3 ms 16988 KB Output is correct
58 Correct 9 ms 17244 KB Output is correct
59 Correct 2 ms 16988 KB Output is correct
60 Correct 2 ms 16984 KB Output is correct
61 Correct 3 ms 16988 KB Output is correct
62 Correct 336 ms 28644 KB Output is correct
63 Correct 235 ms 30024 KB Output is correct
64 Correct 333 ms 31212 KB Output is correct
65 Correct 439 ms 34612 KB Output is correct
66 Correct 463 ms 34624 KB Output is correct
67 Correct 440 ms 34720 KB Output is correct
68 Correct 442 ms 34608 KB Output is correct
69 Correct 440 ms 34620 KB Output is correct
70 Correct 301 ms 34400 KB Output is correct
71 Correct 301 ms 34488 KB Output is correct
72 Correct 295 ms 34384 KB Output is correct
73 Correct 34 ms 27476 KB Output is correct
74 Correct 409 ms 29992 KB Output is correct
75 Correct 88 ms 23244 KB Output is correct
76 Correct 2 ms 16988 KB Output is correct
77 Correct 391 ms 21688 KB Output is correct
78 Correct 651 ms 22608 KB Output is correct
79 Correct 518 ms 22384 KB Output is correct
80 Correct 812 ms 24920 KB Output is correct
81 Correct 806 ms 24868 KB Output is correct
82 Correct 795 ms 25028 KB Output is correct
83 Correct 808 ms 25056 KB Output is correct
84 Correct 812 ms 24952 KB Output is correct
85 Correct 835 ms 24996 KB Output is correct
86 Correct 830 ms 24844 KB Output is correct
87 Correct 802 ms 25000 KB Output is correct
88 Correct 800 ms 25496 KB Output is correct
89 Correct 811 ms 26372 KB Output is correct
90 Correct 812 ms 25304 KB Output is correct
91 Correct 810 ms 25500 KB Output is correct
92 Correct 831 ms 25272 KB Output is correct
93 Correct 804 ms 25376 KB Output is correct
94 Correct 875 ms 24868 KB Output is correct
95 Correct 877 ms 24944 KB Output is correct
96 Correct 834 ms 25104 KB Output is correct
97 Correct 874 ms 25104 KB Output is correct
98 Correct 875 ms 24892 KB Output is correct
99 Correct 854 ms 25028 KB Output is correct
100 Correct 848 ms 25020 KB Output is correct
101 Correct 897 ms 25188 KB Output is correct
102 Correct 860 ms 24940 KB Output is correct
103 Correct 847 ms 24924 KB Output is correct
104 Correct 933 ms 25028 KB Output is correct
105 Correct 947 ms 25224 KB Output is correct
106 Correct 935 ms 25700 KB Output is correct
107 Correct 875 ms 26056 KB Output is correct
108 Correct 912 ms 26624 KB Output is correct
109 Correct 911 ms 25444 KB Output is correct
110 Correct 2 ms 16988 KB Output is correct
111 Correct 3 ms 16988 KB Output is correct
112 Correct 3 ms 17196 KB Output is correct
113 Correct 626 ms 26960 KB Output is correct
114 Correct 670 ms 26904 KB Output is correct
115 Correct 735 ms 29000 KB Output is correct
116 Correct 788 ms 30008 KB Output is correct
117 Correct 773 ms 29872 KB Output is correct
118 Correct 725 ms 30036 KB Output is correct
119 Correct 674 ms 30012 KB Output is correct
120 Correct 686 ms 30012 KB Output is correct
121 Correct 704 ms 30068 KB Output is correct
122 Correct 692 ms 30016 KB Output is correct
123 Correct 73 ms 23252 KB Output is correct
124 Correct 669 ms 29760 KB Output is correct
125 Correct 497 ms 26904 KB Output is correct
126 Correct 766 ms 30008 KB Output is correct
127 Correct 768 ms 30044 KB Output is correct
128 Correct 741 ms 30012 KB Output is correct
129 Correct 811 ms 30132 KB Output is correct
130 Correct 805 ms 30048 KB Output is correct
131 Correct 589 ms 34000 KB Output is correct
132 Correct 546 ms 34540 KB Output is correct
133 Correct 579 ms 32320 KB Output is correct
134 Correct 866 ms 30180 KB Output is correct
135 Correct 850 ms 30412 KB Output is correct
136 Correct 863 ms 30196 KB Output is correct
137 Correct 526 ms 30300 KB Output is correct
138 Correct 547 ms 30136 KB Output is correct
139 Correct 560 ms 30156 KB Output is correct
140 Correct 558 ms 30316 KB Output is correct
141 Correct 543 ms 30252 KB Output is correct
142 Correct 555 ms 30132 KB Output is correct
143 Correct 35 ms 22872 KB Output is correct
144 Correct 751 ms 25244 KB Output is correct