oj.uz

답안 #1030530

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1030530 2024-07-22T06:30:11 Z NeroZein Tourism (JOI23_tourism) C++17
10 / 100
 5000 ms 216908 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 in_id[N];
int cnt[B][N];
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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5212 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 5 ms 5212 KB Output is correct
7 Correct 6 ms 5468 KB Output is correct
8 Correct 5 ms 5212 KB Output is correct
9 Correct 9 ms 5584 KB Output is correct
10 Correct 9 ms 5440 KB Output is correct
11 Correct 8 ms 5468 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 4 ms 5176 KB Output is correct
14 Correct 3 ms 5208 KB Output is correct
15 Correct 9 ms 5468 KB Output is correct
16 Correct 11 ms 5576 KB Output is correct
17 Correct 9 ms 5464 KB Output is correct
18 Correct 9 ms 5432 KB Output is correct
19 Correct 9 ms 5464 KB Output is correct
20 Correct 11 ms 5464 KB Output is correct
21 Correct 8 ms 5468 KB Output is correct
22 Correct 8 ms 5592 KB Output is correct
23 Correct 9 ms 5572 KB Output is correct
24 Correct 9 ms 5468 KB Output is correct
25 Correct 8 ms 5468 KB Output is correct
26 Correct 8 ms 5468 KB Output is correct
27 Correct 4 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

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5212 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 5 ms 5212 KB Output is correct
7 Correct 6 ms 5468 KB Output is correct
8 Correct 5 ms 5212 KB Output is correct
9 Correct 9 ms 5584 KB Output is correct
10 Correct 9 ms 5440 KB Output is correct
11 Correct 8 ms 5468 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 4 ms 5176 KB Output is correct
14 Correct 3 ms 5208 KB Output is correct
15 Correct 9 ms 5468 KB Output is correct
16 Correct 11 ms 5576 KB Output is correct
17 Correct 9 ms 5464 KB Output is correct
18 Correct 9 ms 5432 KB Output is correct
19 Correct 9 ms 5464 KB Output is correct
20 Correct 11 ms 5464 KB Output is correct
21 Correct 8 ms 5468 KB Output is correct
22 Correct 8 ms 5592 KB Output is correct
23 Correct 9 ms 5572 KB Output is correct
24 Correct 9 ms 5468 KB Output is correct
25 Correct 8 ms 5468 KB Output is correct
26 Correct 8 ms 5468 KB Output is correct
27 Correct 4 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 239 ms 7880 KB Output is correct
31 Correct 401 ms 7856 KB Output is correct
32 Correct 524 ms 8052 KB Output is correct
33 Correct 559 ms 7884 KB Output is correct
34 Correct 521 ms 7880 KB Output is correct
35 Correct 86 ms 6352 KB Output is correct
36 Correct 95 ms 6488 KB Output is correct
37 Correct 88 ms 6348 KB Output is correct
38 Correct 539 ms 8192 KB Output is correct
39 Correct 548 ms 8136 KB Output is correct
40 Correct 511 ms 8136 KB Output is correct
41 Correct 81 ms 6604 KB Output is correct
42 Correct 76 ms 6648 KB Output is correct
43 Correct 82 ms 6604 KB Output is correct
44 Correct 497 ms 8048 KB Output is correct
45 Correct 489 ms 10176 KB Output is correct
46 Correct 552 ms 8092 KB Output is correct
47 Correct 79 ms 6232 KB Output is correct
48 Correct 93 ms 6348 KB Output is correct
49 Correct 116 ms 6608 KB Output is correct
50 Correct 552 ms 7884 KB Output is correct
51 Correct 473 ms 8084 KB Output is correct
52 Correct 571 ms 7888 KB Output is correct
53 Correct 484 ms 7888 KB Output is correct
54 Correct 520 ms 8028 KB Output is correct
55 Correct 593 ms 8068 KB Output is correct
56 Correct 7 ms 5212 KB Output is correct
57 Correct 3 ms 5468 KB Output is correct
58 Correct 326 ms 7972 KB Output is correct

Subtask #3
0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5212 KB Output is correct
2 Correct 3 ms 5208 KB Output is correct
3 Correct 10 ms 5404 KB Output is correct
4 Execution timed out 5067 ms 215888 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 5212 KB Output is correct
2 Incorrect 894 ms 130764 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 5180 KB Output is correct
3 Correct 8 ms 5212 KB Output is correct
4 Execution timed out 5053 ms 216908 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #6
0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 5212 KB Output is correct
2 Correct 2 ms 5212 KB Output is correct
3 Correct 2 ms 5212 KB Output is correct
4 Correct 5 ms 5212 KB Output is correct
5 Correct 4 ms 5212 KB Output is correct
6 Correct 5 ms 5212 KB Output is correct
7 Correct 6 ms 5468 KB Output is correct
8 Correct 5 ms 5212 KB Output is correct
9 Correct 9 ms 5584 KB Output is correct
10 Correct 9 ms 5440 KB Output is correct
11 Correct 8 ms 5468 KB Output is correct
12 Correct 3 ms 5208 KB Output is correct
13 Correct 4 ms 5176 KB Output is correct
14 Correct 3 ms 5208 KB Output is correct
15 Correct 9 ms 5468 KB Output is correct
16 Correct 11 ms 5576 KB Output is correct
17 Correct 9 ms 5464 KB Output is correct
18 Correct 9 ms 5432 KB Output is correct
19 Correct 9 ms 5464 KB Output is correct
20 Correct 11 ms 5464 KB Output is correct
21 Correct 8 ms 5468 KB Output is correct
22 Correct 8 ms 5592 KB Output is correct
23 Correct 9 ms 5572 KB Output is correct
24 Correct 9 ms 5468 KB Output is correct
25 Correct 8 ms 5468 KB Output is correct
26 Correct 8 ms 5468 KB Output is correct
27 Correct 4 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 239 ms 7880 KB Output is correct
31 Correct 401 ms 7856 KB Output is correct
32 Correct 524 ms 8052 KB Output is correct
33 Correct 559 ms 7884 KB Output is correct
34 Correct 521 ms 7880 KB Output is correct
35 Correct 86 ms 6352 KB Output is correct
36 Correct 95 ms 6488 KB Output is correct
37 Correct 88 ms 6348 KB Output is correct
38 Correct 539 ms 8192 KB Output is correct
39 Correct 548 ms 8136 KB Output is correct
40 Correct 511 ms 8136 KB Output is correct
41 Correct 81 ms 6604 KB Output is correct
42 Correct 76 ms 6648 KB Output is correct
43 Correct 82 ms 6604 KB Output is correct
44 Correct 497 ms 8048 KB Output is correct
45 Correct 489 ms 10176 KB Output is correct
46 Correct 552 ms 8092 KB Output is correct
47 Correct 79 ms 6232 KB Output is correct
48 Correct 93 ms 6348 KB Output is correct
49 Correct 116 ms 6608 KB Output is correct
50 Correct 552 ms 7884 KB Output is correct
51 Correct 473 ms 8084 KB Output is correct
52 Correct 571 ms 7888 KB Output is correct
53 Correct 484 ms 7888 KB Output is correct
54 Correct 520 ms 8028 KB Output is correct
55 Correct 593 ms 8068 KB Output is correct
56 Correct 7 ms 5212 KB Output is correct
57 Correct 3 ms 5468 KB Output is correct
58 Correct 326 ms 7972 KB Output is correct
59 Correct 3 ms 5212 KB Output is correct
60 Correct 3 ms 5208 KB Output is correct
61 Correct 10 ms 5404 KB Output is correct
62 Execution timed out 5067 ms 215888 KB Time limit exceeded
63 Halted 0 ms 0 KB -