oj.uz

Submission #786826

# Submission time Handle Problem Language Result Execution time Memory
786826 2023-07-18T13:16:35 Z tch1cherin Cat Exercise (JOI23_ho_t4) C++17
51 / 100
 2000 ms 461672 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
#include <bits/stdc++.h>
using namespace std;

const int MAX_N = 2e5 + 5;
const int MAX_L = __lg(MAX_N) + 1;
bitset<MAX_N> used_c, used_s;
unordered_map<int, int> pos[MAX_N];
set<pair<int, int>> values[MAX_N];
vector<int> graph[MAX_N], parent[MAX_N], dist[MAX_N];
vector<char> deleted[MAX_N]; 
int ancestors[MAX_N][MAX_L], num[MAX_N] = {}, value[MAX_N], sz[MAX_N];

void find_sizes(int u, int p) {
  sz[u] = 1;
  for (int v : graph[u]) {
    if (v != p && !used_c[v]) {
      find_sizes(v, u);
      sz[u] += sz[v];
    }
  }
}

int find_centroid(int u, int p, int n) {
  for (int v : graph[u]) {
    if (v != p && !used_c[v] && sz[v] > n / 2) {
      return find_centroid(v, u, n);
    }
  }
  return u;
}

void DFS(int u, int c, int p, int d) {
  pos[c][u] = (int)dist[c].size();
  dist[c].push_back(d);
  parent[c].push_back(p);
  deleted[c].push_back(false);
  values[c].insert({value[u], u});
  ancestors[u][num[u]++] = c;
  for (int v : graph[u]) {
    if (v != p && !used_c[v]) {
      DFS(v, c, u, d + 1);
    } 
  }
}

void centroid(int u) {
  find_sizes(u, -1);
  DFS(u, u, -1, 0);
  used_c[u] = true;
  for (int v : graph[u]) {
    if (!used_c[v]) {
      centroid(find_centroid(v, u, sz[v]));
    }
  }
}

void delete_subtree(int u, int p, int c) {
  values[c].erase({value[u], u});
  deleted[c][pos[c][u]] = true;
  for (int v : graph[u]) {
    if (v != p && pos[c].count(v) && !deleted[c][pos[c][v]]) {
      delete_subtree(v, u, c);
    }
  }
}

int64_t solve(int u) {
  used_s[u] = true;
  int64_t ans = 0;
  for (int i = 0; i < num[u]; i++) {
    int A = ancestors[u][i];
    if (!deleted[A][pos[A][u]]) {
      delete_subtree(u, parent[A][pos[A][u]], A); 
    }
  }
  for (int v : graph[u]) {
    if (!used_s[v]) {
      tuple<int, int, int> val = {-1, -1, -1};
      for (int i = 0; i < num[v]; i++) {
        int A = ancestors[v][i];
        if (!deleted[A][pos[A][v]] && !values[A].empty()) {
          auto [valx, x] = *values[A].rbegin();
          val = max(val, {valx, -(dist[A][pos[A][x]] + dist[A][pos[A][v]]), x});
        }
      }
      ans = max(ans, solve(get<2>(val)) - get<1>(val) + 1);
    }
  }
  return ans;
}

int main() {
  cin.tie(nullptr)->sync_with_stdio(false);
  int N;
  cin >> N;
  for (int i = 0; i < N; i++) {
    cin >> value[i];
  }
  for (int i = 0; i < N - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    graph[u].push_back(v);
    graph[v].push_back(u);
  }
  find_sizes(0, -1);
  centroid(find_centroid(0, -1, N));
  for (int i = 0; i < N; i++) {
    if (value[i] == N) {
      cout << solve(i) << "\n";
    }
  }
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39464 KB Output is correct
2 Correct 19 ms 39444 KB Output is correct
3 Correct 24 ms 39496 KB Output is correct
4 Correct 19 ms 39464 KB Output is correct
5 Correct 25 ms 39460 KB Output is correct
6 Correct 21 ms 39484 KB Output is correct
7 Correct 19 ms 39384 KB Output is correct
8 Correct 22 ms 39380 KB Output is correct
9 Correct 24 ms 39472 KB Output is correct
10 Correct 20 ms 39380 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39464 KB Output is correct
2 Correct 19 ms 39444 KB Output is correct
3 Correct 24 ms 39496 KB Output is correct
4 Correct 19 ms 39464 KB Output is correct
5 Correct 25 ms 39460 KB Output is correct
6 Correct 21 ms 39484 KB Output is correct
7 Correct 19 ms 39384 KB Output is correct
8 Correct 22 ms 39380 KB Output is correct
9 Correct 24 ms 39472 KB Output is correct
10 Correct 20 ms 39380 KB Output is correct
11 Correct 20 ms 39764 KB Output is correct
12 Correct 20 ms 39812 KB Output is correct
13 Correct 20 ms 39764 KB Output is correct
14 Correct 22 ms 39764 KB Output is correct
15 Correct 24 ms 39780 KB Output is correct
16 Correct 24 ms 39764 KB Output is correct
17 Correct 20 ms 39676 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39464 KB Output is correct
2 Correct 19 ms 39444 KB Output is correct
3 Correct 24 ms 39496 KB Output is correct
4 Correct 19 ms 39464 KB Output is correct
5 Correct 25 ms 39460 KB Output is correct
6 Correct 21 ms 39484 KB Output is correct
7 Correct 19 ms 39384 KB Output is correct
8 Correct 22 ms 39380 KB Output is correct
9 Correct 24 ms 39472 KB Output is correct
10 Correct 20 ms 39380 KB Output is correct
11 Correct 20 ms 39764 KB Output is correct
12 Correct 20 ms 39812 KB Output is correct
13 Correct 20 ms 39764 KB Output is correct
14 Correct 22 ms 39764 KB Output is correct
15 Correct 24 ms 39780 KB Output is correct
16 Correct 24 ms 39764 KB Output is correct
17 Correct 20 ms 39676 KB Output is correct
18 Correct 40 ms 47468 KB Output is correct
19 Correct 41 ms 47424 KB Output is correct
20 Correct 50 ms 47372 KB Output is correct
21 Correct 52 ms 46776 KB Output is correct
22 Correct 48 ms 46920 KB Output is correct
23 Correct 59 ms 46956 KB Output is correct
24 Correct 45 ms 46924 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39464 KB Output is correct
2 Correct 19 ms 39444 KB Output is correct
3 Correct 24 ms 39496 KB Output is correct
4 Correct 19 ms 39464 KB Output is correct
5 Correct 25 ms 39460 KB Output is correct
6 Correct 21 ms 39484 KB Output is correct
7 Correct 19 ms 39384 KB Output is correct
8 Correct 22 ms 39380 KB Output is correct
9 Correct 24 ms 39472 KB Output is correct
10 Correct 20 ms 39380 KB Output is correct
11 Correct 20 ms 39764 KB Output is correct
12 Correct 20 ms 39812 KB Output is correct
13 Correct 20 ms 39764 KB Output is correct
14 Correct 22 ms 39764 KB Output is correct
15 Correct 24 ms 39780 KB Output is correct
16 Correct 24 ms 39764 KB Output is correct
17 Correct 20 ms 39676 KB Output is correct
18 Correct 40 ms 47468 KB Output is correct
19 Correct 41 ms 47424 KB Output is correct
20 Correct 50 ms 47372 KB Output is correct
21 Correct 52 ms 46776 KB Output is correct
22 Correct 48 ms 46920 KB Output is correct
23 Correct 59 ms 46956 KB Output is correct
24 Correct 45 ms 46924 KB Output is correct
25 Correct 24 ms 39480 KB Output is correct
26 Correct 56 ms 47148 KB Output is correct
27 Correct 52 ms 47144 KB Output is correct
28 Correct 48 ms 47016 KB Output is correct
29 Correct 61 ms 47044 KB Output is correct
30 Correct 47 ms 45204 KB Output is correct
31 Correct 47 ms 44976 KB Output is correct
32 Correct 57 ms 45464 KB Output is correct
33 Correct 45 ms 45028 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39464 KB Output is correct
2 Correct 19 ms 39444 KB Output is correct
3 Correct 24 ms 39496 KB Output is correct
4 Correct 19 ms 39464 KB Output is correct
5 Correct 25 ms 39460 KB Output is correct
6 Correct 21 ms 39484 KB Output is correct
7 Correct 19 ms 39384 KB Output is correct
8 Correct 22 ms 39380 KB Output is correct
9 Correct 24 ms 39472 KB Output is correct
10 Correct 20 ms 39380 KB Output is correct
11 Correct 20 ms 39764 KB Output is correct
12 Correct 20 ms 39812 KB Output is correct
13 Correct 20 ms 39764 KB Output is correct
14 Correct 22 ms 39764 KB Output is correct
15 Correct 24 ms 39780 KB Output is correct
16 Correct 24 ms 39764 KB Output is correct
17 Correct 20 ms 39676 KB Output is correct
18 Correct 40 ms 47468 KB Output is correct
19 Correct 41 ms 47424 KB Output is correct
20 Correct 50 ms 47372 KB Output is correct
21 Correct 52 ms 46776 KB Output is correct
22 Correct 48 ms 46920 KB Output is correct
23 Correct 59 ms 46956 KB Output is correct
24 Correct 45 ms 46924 KB Output is correct
25 Correct 1419 ms 461672 KB Output is correct
26 Correct 1511 ms 458484 KB Output is correct
27 Correct 1546 ms 458476 KB Output is correct
28 Correct 1848 ms 435064 KB Output is correct
29 Correct 1901 ms 437376 KB Output is correct
30 Correct 1850 ms 435020 KB Output is correct
31 Correct 1835 ms 436564 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 39380 KB Output is correct
2 Correct 22 ms 39616 KB Output is correct
3 Execution timed out 2071 ms 402868 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #7
0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 39464 KB Output is correct
2 Correct 19 ms 39444 KB Output is correct
3 Correct 24 ms 39496 KB Output is correct
4 Correct 19 ms 39464 KB Output is correct
5 Correct 25 ms 39460 KB Output is correct
6 Correct 21 ms 39484 KB Output is correct
7 Correct 19 ms 39384 KB Output is correct
8 Correct 22 ms 39380 KB Output is correct
9 Correct 24 ms 39472 KB Output is correct
10 Correct 20 ms 39380 KB Output is correct
11 Correct 20 ms 39764 KB Output is correct
12 Correct 20 ms 39812 KB Output is correct
13 Correct 20 ms 39764 KB Output is correct
14 Correct 22 ms 39764 KB Output is correct
15 Correct 24 ms 39780 KB Output is correct
16 Correct 24 ms 39764 KB Output is correct
17 Correct 20 ms 39676 KB Output is correct
18 Correct 40 ms 47468 KB Output is correct
19 Correct 41 ms 47424 KB Output is correct
20 Correct 50 ms 47372 KB Output is correct
21 Correct 52 ms 46776 KB Output is correct
22 Correct 48 ms 46920 KB Output is correct
23 Correct 59 ms 46956 KB Output is correct
24 Correct 45 ms 46924 KB Output is correct
25 Correct 24 ms 39480 KB Output is correct
26 Correct 56 ms 47148 KB Output is correct
27 Correct 52 ms 47144 KB Output is correct
28 Correct 48 ms 47016 KB Output is correct
29 Correct 61 ms 47044 KB Output is correct
30 Correct 47 ms 45204 KB Output is correct
31 Correct 47 ms 44976 KB Output is correct
32 Correct 57 ms 45464 KB Output is correct
33 Correct 45 ms 45028 KB Output is correct
34 Correct 1419 ms 461672 KB Output is correct
35 Correct 1511 ms 458484 KB Output is correct
36 Correct 1546 ms 458476 KB Output is correct
37 Correct 1848 ms 435064 KB Output is correct
38 Correct 1901 ms 437376 KB Output is correct
39 Correct 1850 ms 435020 KB Output is correct
40 Correct 1835 ms 436564 KB Output is correct
41 Correct 26 ms 39380 KB Output is correct
42 Correct 22 ms 39616 KB Output is correct
43 Execution timed out 2071 ms 402868 KB Time limit exceeded
44 Halted 0 ms 0 KB -