oj.uz

Submission #1030532

# Submission time Handle Problem Language Result Execution time Memory
1030532 2024-07-22T06:31:58 Z NeroZein Tourism (JOI23_tourism) C++17
10 / 100
 5000 ms 398220 KB 
#include "bits/stdc++.h"
using namespace std;

#ifdef Nero
#include "Deb.h"
#else
#define debug(...)
#endif

const int B = 320;
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];
long long ans[N];
long long res[B];
int pre[B][N], nxt[B][N];
vector<pair<int, int>> qs[N]; 

void preprocess() {
  for (int ver = 0; ver * B < m; ++ver) {
    for (int r = ver * B; r < m; ++r) {
      int v = c[r];
      cnt[ver][v]++;
      in_id[id[v]] = v; 
    }
    vector<int> ord; 
    for (int i = 0; i < idd; ++i) {
      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) {
      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) {
    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, long long& 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); 
  }
}

long long qry(int l) {
  int ver = l / B;
  long long ret = res[ver];
  int cl = ver * 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 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5208 KB Output is correct
4 Correct 5 ms 5436 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 7 ms 5468 KB Output is correct
8 Correct 4 ms 5432 KB Output is correct
9 Correct 9 ms 5592 KB Output is correct
10 Correct 9 ms 5452 KB Output is correct
11 Correct 9 ms 5464 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 12 ms 5468 KB Output is correct
16 Correct 9 ms 5468 KB Output is correct
17 Correct 10 ms 5468 KB Output is correct
18 Correct 9 ms 5468 KB Output is correct
19 Correct 8 ms 5440 KB Output is correct
20 Correct 8 ms 5468 KB Output is correct
21 Correct 8 ms 5468 KB Output is correct
22 Correct 9 ms 5468 KB Output is correct
23 Correct 9 ms 5492 KB Output is correct
24 Correct 9 ms 5468 KB Output is correct
25 Correct 9 ms 5468 KB Output is correct
26 Correct 8 ms 5468 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 2 ms 5212 KB Output is correct
29 Correct 10 ms 5468 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5208 KB Output is correct
4 Correct 5 ms 5436 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 7 ms 5468 KB Output is correct
8 Correct 4 ms 5432 KB Output is correct
9 Correct 9 ms 5592 KB Output is correct
10 Correct 9 ms 5452 KB Output is correct
11 Correct 9 ms 5464 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 12 ms 5468 KB Output is correct
16 Correct 9 ms 5468 KB Output is correct
17 Correct 10 ms 5468 KB Output is correct
18 Correct 9 ms 5468 KB Output is correct
19 Correct 8 ms 5440 KB Output is correct
20 Correct 8 ms 5468 KB Output is correct
21 Correct 8 ms 5468 KB Output is correct
22 Correct 9 ms 5468 KB Output is correct
23 Correct 9 ms 5492 KB Output is correct
24 Correct 9 ms 5468 KB Output is correct
25 Correct 9 ms 5468 KB Output is correct
26 Correct 8 ms 5468 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 2 ms 5212 KB Output is correct
29 Correct 10 ms 5468 KB Output is correct
30 Correct 236 ms 7812 KB Output is correct
31 Correct 379 ms 7880 KB Output is correct
32 Correct 564 ms 8136 KB Output is correct
33 Correct 545 ms 7932 KB Output is correct
34 Correct 531 ms 7924 KB Output is correct
35 Correct 85 ms 6356 KB Output is correct
36 Correct 95 ms 6352 KB Output is correct
37 Correct 85 ms 6348 KB Output is correct
38 Correct 563 ms 8132 KB Output is correct
39 Correct 560 ms 8184 KB Output is correct
40 Correct 579 ms 8136 KB Output is correct
41 Correct 85 ms 6604 KB Output is correct
42 Correct 89 ms 6604 KB Output is correct
43 Correct 102 ms 6524 KB Output is correct
44 Correct 548 ms 8136 KB Output is correct
45 Correct 575 ms 9996 KB Output is correct
46 Correct 504 ms 8100 KB Output is correct
47 Correct 73 ms 6236 KB Output is correct
48 Correct 84 ms 6348 KB Output is correct
49 Correct 85 ms 6508 KB Output is correct
50 Correct 577 ms 7872 KB Output is correct
51 Correct 542 ms 7964 KB Output is correct
52 Correct 504 ms 7884 KB Output is correct
53 Correct 558 ms 7876 KB Output is correct
54 Correct 553 ms 8432 KB Output is correct
55 Correct 571 ms 8104 KB Output is correct
56 Correct 9 ms 5368 KB Output is correct
57 Correct 3 ms 5468 KB Output is correct
58 Correct 321 ms 7924 KB Output is correct

Subtask #3
0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 3 ms 5212 KB Output is correct
3 Correct 6 ms 5200 KB Output is correct
4 Execution timed out 5070 ms 215708 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 5212 KB Output is correct
2 Correct 897 ms 130624 KB Output is correct
3 Correct 1484 ms 218368 KB Output is correct
4 Correct 1217 ms 190368 KB Output is correct
5 Correct 1286 ms 392820 KB Output is correct
6 Correct 1158 ms 393900 KB Output is correct
7 Correct 1188 ms 393808 KB Output is correct
8 Correct 1182 ms 393864 KB Output is correct
9 Correct 1240 ms 394060 KB Output is correct
10 Correct 1302 ms 394264 KB Output is correct
11 Correct 1633 ms 394804 KB Output is correct
12 Correct 3121 ms 397828 KB Output is correct
13 Execution timed out 5073 ms 398220 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 9 ms 5416 KB Output is correct
4 Execution timed out 5052 ms 216868 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 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5208 KB Output is correct
4 Correct 5 ms 5436 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 4 ms 5212 KB Output is correct
7 Correct 7 ms 5468 KB Output is correct
8 Correct 4 ms 5432 KB Output is correct
9 Correct 9 ms 5592 KB Output is correct
10 Correct 9 ms 5452 KB Output is correct
11 Correct 9 ms 5464 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 3 ms 5212 KB Output is correct
14 Correct 3 ms 5212 KB Output is correct
15 Correct 12 ms 5468 KB Output is correct
16 Correct 9 ms 5468 KB Output is correct
17 Correct 10 ms 5468 KB Output is correct
18 Correct 9 ms 5468 KB Output is correct
19 Correct 8 ms 5440 KB Output is correct
20 Correct 8 ms 5468 KB Output is correct
21 Correct 8 ms 5468 KB Output is correct
22 Correct 9 ms 5468 KB Output is correct
23 Correct 9 ms 5492 KB Output is correct
24 Correct 9 ms 5468 KB Output is correct
25 Correct 9 ms 5468 KB Output is correct
26 Correct 8 ms 5468 KB Output is correct
27 Correct 2 ms 5212 KB Output is correct
28 Correct 2 ms 5212 KB Output is correct
29 Correct 10 ms 5468 KB Output is correct
30 Correct 236 ms 7812 KB Output is correct
31 Correct 379 ms 7880 KB Output is correct
32 Correct 564 ms 8136 KB Output is correct
33 Correct 545 ms 7932 KB Output is correct
34 Correct 531 ms 7924 KB Output is correct
35 Correct 85 ms 6356 KB Output is correct
36 Correct 95 ms 6352 KB Output is correct
37 Correct 85 ms 6348 KB Output is correct
38 Correct 563 ms 8132 KB Output is correct
39 Correct 560 ms 8184 KB Output is correct
40 Correct 579 ms 8136 KB Output is correct
41 Correct 85 ms 6604 KB Output is correct
42 Correct 89 ms 6604 KB Output is correct
43 Correct 102 ms 6524 KB Output is correct
44 Correct 548 ms 8136 KB Output is correct
45 Correct 575 ms 9996 KB Output is correct
46 Correct 504 ms 8100 KB Output is correct
47 Correct 73 ms 6236 KB Output is correct
48 Correct 84 ms 6348 KB Output is correct
49 Correct 85 ms 6508 KB Output is correct
50 Correct 577 ms 7872 KB Output is correct
51 Correct 542 ms 7964 KB Output is correct
52 Correct 504 ms 7884 KB Output is correct
53 Correct 558 ms 7876 KB Output is correct
54 Correct 553 ms 8432 KB Output is correct
55 Correct 571 ms 8104 KB Output is correct
56 Correct 9 ms 5368 KB Output is correct
57 Correct 3 ms 5468 KB Output is correct
58 Correct 321 ms 7924 KB Output is correct
59 Correct 2 ms 5212 KB Output is correct
60 Correct 3 ms 5212 KB Output is correct
61 Correct 6 ms 5200 KB Output is correct
62 Execution timed out 5070 ms 215708 KB Time limit exceeded
63 Halted 0 ms 0 KB -