oj.uz

Submission #1030731

# Submission time Handle Problem Language Result Execution time Memory
1030731 2024-07-22T09:14:09 Z NeroZein Tourism (JOI23_tourism) C++17
10 / 100
 5000 ms 326664 KB 
#include "bits/stdc++.h"
using namespace std;
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#pragma GCC target("avx2,fma")
 
#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif
 
const int B = 400;
const int LOG = 18; 
const int N = 1e5 + 5; 
 
int n, m, q;
int c[N];
int dep[N];
int idd, id[N];
vector<int> g[N];
int spa[LOG][N * 2]; 
 
void dfs(int v, int p) {
  id[v] = idd;
  spa[0][idd++] = v;
  for (int u : g[v]) {
    if (u == p) {
      continue; 
    }
    dep[u] = dep[v] + 1; 
    dfs(u, v);
    spa[0][idd++] = v; 
  }
}
 
int get(int l, int r) {
  int lg = 31 - __builtin_clz(r - l + 1);
  int u = spa[lg][l], v = spa[lg][r - (1 << lg) + 1];
  return dep[u] < dep[v] ? u : v;
}
 
int distance(int u, int v) {
  int l = id[u], r = id[v];
  if (l > r) {
    swap(l, r); 
  }
  int lca = get(l, r);
  int ret = dep[u] + dep[v] - 2 * dep[lca];
  return ret; 
}
 
int cnt[B][N];
int in_id[N * 2];
int ans[N];
int res[B];
int pre[B][N], nxt[B][N];
vector<pair<int, int>> qs[N]; 
 
void preprocess() {//B * N
  for (int ver = 0; ver * B < m; ++ver) {//M / B (B)
    for (int r = ver * B; r < m; ++r) {//M
      int v = c[r];
      cnt[ver][v]++;
      in_id[id[v]] = v; 
    }
    vector<int> ord; 
    for (int i = 0; i < idd; ++i) {//2 * N
      if (in_id[i] != 0) {
        ord.push_back(in_id[i]);
        in_id[i] = 0; 
      }
    }
    //debug(ord);
    //cerr << '\n';
    for (int i = 1; i < (int) ord.size(); ++i) {//N
      int u = ord[i - 1], v = ord[i];
      res[ver] += distance(u, v); 
      pre[ver][v] = u;
      nxt[ver][u] = v; 
    }
    nxt[ver][ord.back()] = ord[0];
    pre[ver][ord[0]] = ord.back();
    res[ver] += distance(ord[0], ord.back()); 
  }
}
 
void back(int r) {
  //debug(r);
  for (int ver = 0; ver * B <= r; ++ver) {//M / B
    int v = c[r];
    if (--cnt[ver][v] > 0) {
      continue; 
    }
    //int old = res[ver];
    int cpre = pre[ver][v];
    int cnxt = nxt[ver][v];
    if (cpre != 0) {
      res[ver] -= distance(v, cpre);
    }
    if (cnxt != 0) {
      res[ver] -= distance(v, cnxt);
    }
    if (cpre != 0 && cnxt != 0) {
      nxt[ver][cpre] = cnxt;
      pre[ver][cnxt] = cpre; 
      res[ver] += distance(cpre, cnxt); 
    }
    //debug(ver, v, cpre, cnxt, old, res[ver]);
  }
  //cerr << '\n';
}
 
int cnt2[N];
vector<int> clean;
int curpre[N], curnxt[N];
 
void check(int v) {
  if (curpre[v] == 0 && curnxt[v] == 0) {
    clean.push_back(v);
  }
}
 
void rem(int ver, int cl, int& ret) {
  int v = c[cl];
  check(v);
  if (cnt2[v] == 0) {
    cnt2[v] = cnt[ver][v];
  }
  if (curpre[v] == 0) {
    curpre[v] = pre[ver][v];
  }
  if (curnxt[v] == 0) {
    curnxt[v] = nxt[ver][v];
  }
  if (--cnt2[v] != 0) {
    return; 
  }
  int cpre = curpre[v];
  int cnxt = curnxt[v];
  if (cpre != 0) {
    ret -= distance(v, cpre);
  }
  if (cnxt != 0) {
    ret -= distance(v, cnxt);
  }
  if (cpre != 0 && cnxt != 0) {
    check(cpre);
    check(cnxt);
    curpre[cnxt] = cpre;
    curnxt[cpre] = cnxt; 
    ret += distance(cpre, cnxt); 
  }
}
 
int qry(int l) {
  int ver = l / B;
  int ret = res[ver];
  int cl = ver * B;
  assert(l - cl < B);
  while (cl < l) {
    rem(ver, cl, ret);
    cl++;
  }
  return ret; 
}
 
void cleanup() {
  for (int v : clean) {
    cnt2[v] = curpre[v] = curnxt[v] = 0; 
  }
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cin >> n >> m >> q;
  for(int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 1); 
  for (int j = 1; j < LOG; ++j) {
    for (int i = 0; i + (1 << j) <= idd; ++i) {
      int u = spa[j - 1][i], v = spa[j - 1][i + (1 << (j - 1))];
      spa[j][i] = (dep[u] < dep[v] ? u : v); 
    }
  }
  for (int i = 0; i < m; ++i) {
    cin >> c[i];
  }
  preprocess();
  for (int i = 0; i < q; ++i) {
    int l, r;
    cin >> l >> r;
    --l, --r;
    qs[r].push_back({l, i});
  }
  for (int r = m - 1; r >= 0; --r) {
    for (auto [ql, qi] : qs[r]) {
      ans[qi] = (qry(ql) + 2) / 2;
      cleanup();
    }
    back(r); 
  }
  for (int i = 0; i < q; ++i) {
    cout << ans[i] << '\n';
  }
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 5 ms 21340 KB Output is correct
5 Correct 5 ms 21300 KB Output is correct
6 Correct 5 ms 21220 KB Output is correct
7 Correct 6 ms 21352 KB Output is correct
8 Correct 4 ms 21340 KB Output is correct
9 Correct 9 ms 21340 KB Output is correct
10 Correct 9 ms 21340 KB Output is correct
11 Correct 8 ms 21336 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21084 KB Output is correct
14 Correct 3 ms 21084 KB Output is correct
15 Correct 8 ms 21340 KB Output is correct
16 Correct 9 ms 21340 KB Output is correct
17 Correct 8 ms 21340 KB Output is correct
18 Correct 9 ms 21340 KB Output is correct
19 Correct 8 ms 21340 KB Output is correct
20 Correct 8 ms 21340 KB Output is correct
21 Correct 8 ms 21340 KB Output is correct
22 Correct 9 ms 21340 KB Output is correct
23 Correct 8 ms 21428 KB Output is correct
24 Correct 9 ms 21340 KB Output is correct
25 Correct 10 ms 21340 KB Output is correct
26 Correct 9 ms 21336 KB Output is correct
27 Correct 2 ms 14940 KB Output is correct
28 Correct 2 ms 21084 KB Output is correct
29 Correct 9 ms 21360 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 5 ms 21340 KB Output is correct
5 Correct 5 ms 21300 KB Output is correct
6 Correct 5 ms 21220 KB Output is correct
7 Correct 6 ms 21352 KB Output is correct
8 Correct 4 ms 21340 KB Output is correct
9 Correct 9 ms 21340 KB Output is correct
10 Correct 9 ms 21340 KB Output is correct
11 Correct 8 ms 21336 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21084 KB Output is correct
14 Correct 3 ms 21084 KB Output is correct
15 Correct 8 ms 21340 KB Output is correct
16 Correct 9 ms 21340 KB Output is correct
17 Correct 8 ms 21340 KB Output is correct
18 Correct 9 ms 21340 KB Output is correct
19 Correct 8 ms 21340 KB Output is correct
20 Correct 8 ms 21340 KB Output is correct
21 Correct 8 ms 21340 KB Output is correct
22 Correct 9 ms 21340 KB Output is correct
23 Correct 8 ms 21428 KB Output is correct
24 Correct 9 ms 21340 KB Output is correct
25 Correct 10 ms 21340 KB Output is correct
26 Correct 9 ms 21336 KB Output is correct
27 Correct 2 ms 14940 KB Output is correct
28 Correct 2 ms 21084 KB Output is correct
29 Correct 9 ms 21360 KB Output is correct
30 Correct 286 ms 31688 KB Output is correct
31 Correct 440 ms 31680 KB Output is correct
32 Correct 625 ms 35056 KB Output is correct
33 Correct 637 ms 35528 KB Output is correct
34 Correct 634 ms 35012 KB Output is correct
35 Correct 87 ms 30156 KB Output is correct
36 Correct 92 ms 30156 KB Output is correct
37 Correct 86 ms 30156 KB Output is correct
38 Correct 644 ms 34208 KB Output is correct
39 Correct 602 ms 35052 KB Output is correct
40 Correct 573 ms 35780 KB Output is correct
41 Correct 97 ms 30156 KB Output is correct
42 Correct 89 ms 30144 KB Output is correct
43 Correct 95 ms 30160 KB Output is correct
44 Correct 668 ms 35520 KB Output is correct
45 Correct 646 ms 34748 KB Output is correct
46 Correct 594 ms 34240 KB Output is correct
47 Correct 80 ms 30044 KB Output is correct
48 Correct 88 ms 30104 KB Output is correct
49 Correct 84 ms 30160 KB Output is correct
50 Correct 631 ms 33912 KB Output is correct
51 Correct 637 ms 33984 KB Output is correct
52 Correct 619 ms 34752 KB Output is correct
53 Correct 651 ms 34756 KB Output is correct
54 Correct 665 ms 33656 KB Output is correct
55 Correct 640 ms 34108 KB Output is correct
56 Correct 6 ms 21084 KB Output is correct
57 Correct 3 ms 23388 KB Output is correct
58 Correct 428 ms 31528 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 3 ms 14940 KB Output is correct
3 Correct 5 ms 21292 KB Output is correct
4 Execution timed out 5100 ms 194428 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 919 ms 128000 KB Output is correct
3 Correct 1519 ms 196220 KB Output is correct
4 Correct 1150 ms 172112 KB Output is correct
5 Correct 841 ms 321964 KB Output is correct
6 Correct 855 ms 322156 KB Output is correct
7 Correct 868 ms 322248 KB Output is correct
8 Correct 854 ms 322544 KB Output is correct
9 Correct 849 ms 322548 KB Output is correct
10 Correct 921 ms 322752 KB Output is correct
11 Correct 1263 ms 324220 KB Output is correct
12 Correct 3253 ms 326444 KB Output is correct
13 Execution timed out 5104 ms 326664 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 16988 KB Output is correct
2 Correct 2 ms 14940 KB Output is correct
3 Correct 6 ms 21084 KB Output is correct
4 Execution timed out 5019 ms 193756 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 16988 KB Output is correct
2 Correct 2 ms 16988 KB Output is correct
3 Correct 2 ms 16988 KB Output is correct
4 Correct 5 ms 21340 KB Output is correct
5 Correct 5 ms 21300 KB Output is correct
6 Correct 5 ms 21220 KB Output is correct
7 Correct 6 ms 21352 KB Output is correct
8 Correct 4 ms 21340 KB Output is correct
9 Correct 9 ms 21340 KB Output is correct
10 Correct 9 ms 21340 KB Output is correct
11 Correct 8 ms 21336 KB Output is correct
12 Correct 4 ms 21084 KB Output is correct
13 Correct 3 ms 21084 KB Output is correct
14 Correct 3 ms 21084 KB Output is correct
15 Correct 8 ms 21340 KB Output is correct
16 Correct 9 ms 21340 KB Output is correct
17 Correct 8 ms 21340 KB Output is correct
18 Correct 9 ms 21340 KB Output is correct
19 Correct 8 ms 21340 KB Output is correct
20 Correct 8 ms 21340 KB Output is correct
21 Correct 8 ms 21340 KB Output is correct
22 Correct 9 ms 21340 KB Output is correct
23 Correct 8 ms 21428 KB Output is correct
24 Correct 9 ms 21340 KB Output is correct
25 Correct 10 ms 21340 KB Output is correct
26 Correct 9 ms 21336 KB Output is correct
27 Correct 2 ms 14940 KB Output is correct
28 Correct 2 ms 21084 KB Output is correct
29 Correct 9 ms 21360 KB Output is correct
30 Correct 286 ms 31688 KB Output is correct
31 Correct 440 ms 31680 KB Output is correct
32 Correct 625 ms 35056 KB Output is correct
33 Correct 637 ms 35528 KB Output is correct
34 Correct 634 ms 35012 KB Output is correct
35 Correct 87 ms 30156 KB Output is correct
36 Correct 92 ms 30156 KB Output is correct
37 Correct 86 ms 30156 KB Output is correct
38 Correct 644 ms 34208 KB Output is correct
39 Correct 602 ms 35052 KB Output is correct
40 Correct 573 ms 35780 KB Output is correct
41 Correct 97 ms 30156 KB Output is correct
42 Correct 89 ms 30144 KB Output is correct
43 Correct 95 ms 30160 KB Output is correct
44 Correct 668 ms 35520 KB Output is correct
45 Correct 646 ms 34748 KB Output is correct
46 Correct 594 ms 34240 KB Output is correct
47 Correct 80 ms 30044 KB Output is correct
48 Correct 88 ms 30104 KB Output is correct
49 Correct 84 ms 30160 KB Output is correct
50 Correct 631 ms 33912 KB Output is correct
51 Correct 637 ms 33984 KB Output is correct
52 Correct 619 ms 34752 KB Output is correct
53 Correct 651 ms 34756 KB Output is correct
54 Correct 665 ms 33656 KB Output is correct
55 Correct 640 ms 34108 KB Output is correct
56 Correct 6 ms 21084 KB Output is correct
57 Correct 3 ms 23388 KB Output is correct
58 Correct 428 ms 31528 KB Output is correct
59 Correct 2 ms 16988 KB Output is correct
60 Correct 3 ms 14940 KB Output is correct
61 Correct 5 ms 21292 KB Output is correct
62 Execution timed out 5100 ms 194428 KB Time limit exceeded
63 Halted 0 ms 0 KB -