oj.uz

Submission #986807

# Submission time Handle Problem Language Result Execution time Memory
986807 2024-05-21T09:04:35 Z arush_agu Cat Exercise (JOI23_ho_t4) C++17
100 / 100
 331 ms 217488 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

template<typename T>
struct ST {
  const ll MAXLG = 22;

  ll n;
  vector<vector<T>> st;
  vl lg2;

  ST(ll n, vector<T>& a) : n(n) {
    st = vector<vector<T>>(MAXLG, vector<T>(n));
    for (ll i=0; i<n; i++) st[0][i] = a[i];

    for (ll j=1; j<MAXLG; j++) for (ll i=0; i + (1 << j) <= n; i++) 
      st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);

    lg2 = vl(n + 10);
    for (ll i=2; i<n + 10; i++) lg2[i] = lg2[i / 2] + 1;
  }

  T query(ll l, ll r) {
    if (l > r) swap(l, r);
    ll k = lg2[r - l + 1];
    return min(st[k][l], st[k][r - (1 << k) + 1]);
  }
};

struct DSU {
  ll n;
  vl par, sz, mx;

  DSU(ll n) : n(n), par(vl(n, -1)), sz(vl(n, 1)) {
    mx = vl(n);
    for (ll i=0; i<n; i++) mx[i] = i;
  }

  ll find(ll x) {
    if (par[x] == -1) return x;
    return par[x] = find(par[x]);
  }

  void merge(ll u, ll v) {
    u = find(u), v = find(v);
    if (u == v) return;

    if (sz[v] > sz[u]) swap(u, v);
    par[v] = u;
    sz[u] += sz[v];
    mx[u] = max(mx[u], mx[v]);
  }
};

void solve() {
  ll n; cin >> n;
  vl p(n); for (ll &x : p) cin >> x, x--;
  vvl adj(n);
  vll ed(n - 1);
  for (ll i=0; i<n - 1; i++) {
    cin >> ed[i].first >> ed[i].second;
    ed[i].first--, ed[i].second--;
    adj[ed[i].first].push_back(ed[i].second);
    adj[ed[i].second].push_back(ed[i].first);
  }

  vl inv_p(n);
  for (ll i=0; i<n; i++) inv_p[p[i]] = i;

  sort(all(ed), [&](ii a, ii b) {
    return max(p[a.first], p[a.second]) < max(p[b.first], p[b.second]);
  });

  ll idx_n = find(all(p), n - 1) - p.begin();

  vl depth(n), idx(n);
  vll euler;
  function<void(ll, ll)> f = [&](ll u, ll p) {
    idx[u] = euler.size();
    euler.push_back({depth[u], u});
    for (ll &v : adj[u]) if (v != p) {
      depth[v] = depth[u] + 1;
      f(v, u);
      euler.push_back({depth[u], u});
    }
  }; f(idx_n, -1);

  ST st(euler.size(), euler);
  DSU dsu(n);

  auto dist = [&](ll u, ll v) {
    ll lca = st.query(idx[u], idx[v]).second;
    return depth[u] + depth[v] - 2 * depth[lca];
  };

  vvl nadj(n);
  for (auto &[ui, vl] : ed) {
    ll u = p[ui], v = p[vl];
    ll u_max = dsu.mx[dsu.find(u)], v_max = dsu.mx[dsu.find(v)];

    nadj[u_max].push_back(v_max);
    nadj[v_max].push_back(u_max);
    dsu.merge(u, v);
  }

  ll ans = 0;
  function<void(ll, ll, ll)> g = [&](ll u, ll p, ll tot) {
    if (p != -1)
      tot += dist(inv_p[u], inv_p[p]);
    ans = max(ans, tot);
    for (ll &v : nadj[u]) if (v != p)
      g(v, u, tot);
  }; g(n - 1, -1, 0);

  cout << ans << "\n";
}

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

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:213:11: warning: unused variable 'start' [-Wunused-variable]
  213 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct

Subtask #2
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 5688 KB Output is correct
19 Correct 5 ms 5688 KB Output is correct
20 Correct 5 ms 5684 KB Output is correct
21 Correct 5 ms 5688 KB Output is correct
22 Correct 5 ms 5432 KB Output is correct
23 Correct 5 ms 5428 KB Output is correct
24 Correct 6 ms 5684 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 5688 KB Output is correct
19 Correct 5 ms 5688 KB Output is correct
20 Correct 5 ms 5684 KB Output is correct
21 Correct 5 ms 5688 KB Output is correct
22 Correct 5 ms 5432 KB Output is correct
23 Correct 5 ms 5428 KB Output is correct
24 Correct 6 ms 5684 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 5432 KB Output is correct
27 Correct 6 ms 5432 KB Output is correct
28 Correct 6 ms 5684 KB Output is correct
29 Correct 5 ms 5684 KB Output is correct
30 Correct 5 ms 5176 KB Output is correct
31 Correct 5 ms 5176 KB Output is correct
32 Correct 6 ms 5076 KB Output is correct
33 Correct 5 ms 5176 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 5688 KB Output is correct
19 Correct 5 ms 5688 KB Output is correct
20 Correct 5 ms 5684 KB Output is correct
21 Correct 5 ms 5688 KB Output is correct
22 Correct 5 ms 5432 KB Output is correct
23 Correct 5 ms 5428 KB Output is correct
24 Correct 6 ms 5684 KB Output is correct
25 Correct 206 ms 212140 KB Output is correct
26 Correct 203 ms 217488 KB Output is correct
27 Correct 196 ms 216592 KB Output is correct
28 Correct 277 ms 211176 KB Output is correct
29 Correct 241 ms 215624 KB Output is correct
30 Correct 269 ms 212772 KB Output is correct
31 Correct 265 ms 215284 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 247 ms 188232 KB Output is correct
4 Correct 229 ms 189248 KB Output is correct
5 Correct 248 ms 189292 KB Output is correct

Subtask #7
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 604 KB Output is correct
12 Correct 1 ms 604 KB Output is correct
13 Correct 1 ms 604 KB Output is correct
14 Correct 1 ms 604 KB Output is correct
15 Correct 1 ms 604 KB Output is correct
16 Correct 1 ms 604 KB Output is correct
17 Correct 1 ms 604 KB Output is correct
18 Correct 5 ms 5688 KB Output is correct
19 Correct 5 ms 5688 KB Output is correct
20 Correct 5 ms 5684 KB Output is correct
21 Correct 5 ms 5688 KB Output is correct
22 Correct 5 ms 5432 KB Output is correct
23 Correct 5 ms 5428 KB Output is correct
24 Correct 6 ms 5684 KB Output is correct
25 Correct 1 ms 348 KB Output is correct
26 Correct 5 ms 5432 KB Output is correct
27 Correct 6 ms 5432 KB Output is correct
28 Correct 6 ms 5684 KB Output is correct
29 Correct 5 ms 5684 KB Output is correct
30 Correct 5 ms 5176 KB Output is correct
31 Correct 5 ms 5176 KB Output is correct
32 Correct 6 ms 5076 KB Output is correct
33 Correct 5 ms 5176 KB Output is correct
34 Correct 206 ms 212140 KB Output is correct
35 Correct 203 ms 217488 KB Output is correct
36 Correct 196 ms 216592 KB Output is correct
37 Correct 277 ms 211176 KB Output is correct
38 Correct 241 ms 215624 KB Output is correct
39 Correct 269 ms 212772 KB Output is correct
40 Correct 265 ms 215284 KB Output is correct
41 Correct 0 ms 348 KB Output is correct
42 Correct 1 ms 604 KB Output is correct
43 Correct 247 ms 188232 KB Output is correct
44 Correct 229 ms 189248 KB Output is correct
45 Correct 248 ms 189292 KB Output is correct
46 Correct 248 ms 208460 KB Output is correct
47 Correct 263 ms 207944 KB Output is correct
48 Correct 245 ms 212520 KB Output is correct
49 Correct 259 ms 208836 KB Output is correct
50 Correct 282 ms 190028 KB Output is correct
51 Correct 284 ms 189628 KB Output is correct
52 Correct 331 ms 191308 KB Output is correct
53 Correct 279 ms 191572 KB Output is correct