oj.uz

Submission #832177

# Submission time Handle Problem Language Result Execution time Memory
832177 2023-08-21T05:44:54 Z arush_agu Mergers (JOI19_mergers) C++17
70 / 100
 445 ms 145512 KB 
#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;

const int MAXN = 5e5 + 1;
const int MAXLG = 22;

ll state[MAXN], first_occ[MAXN], cnt[MAXN];
ii st[MAXLG][MAXN];
vi adj[MAXN], by_state[MAXN];
ll b[MAXN], sub_sz[MAXN];

int log2_floor(unsigned long long i) {
  return i ? __builtin_clzll(1) - __builtin_clzll(i) : -1;
}

struct ST {
  int n;

  ST(int n) : n(n) {
    for (int j = 1; j < MAXLG; j++)
      for (int i = 0; i + (1 << j) <= n; i++)
        st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
  }

  int query(int l, int r) {
    if (l > r)
      swap(l, r);
    int k = log2_floor(r - l + 1);
    return min(st[k][l], st[k][r - (1 << k) + 1]).second;
  }
};

void solve() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 0; i < n; i++)
    cin >> state[i], state[i]--;

  int timer = 0;
  function<void(int, int, int)> f = [&](int u, int p, int d) {
    first_occ[u] = timer;
    st[0][timer++] = {d, u};
    for (int &v : adj[u])
      if (v != p) {
        f(v, u, d + 1);
        st[0][timer++] = {d, u};
      }
  };
  f(0, -1, 0);

  ST lc(timer);

  for (int i = 0; i < n; i++)
    by_state[state[i]].push_back(i);

  for (int i = 0; i < k; i++) {
    int lca = by_state[i][0];
    for (int &u : by_state[i])
      lca = lc.query(first_occ[lca], first_occ[u]);
    b[lca] += by_state[i].size();
  }

  int cc = 0;
  function<void(int, int)> g = [&](int u, int p) {
    sub_sz[u] = 1;
    for (int &v : adj[u])
      if (v != p) {
        g(v, u);
        sub_sz[u] += sub_sz[v];
      }
    sub_sz[u] -= b[u];
    if (!sub_sz[u])
      cc++;
  };
  g(0, -1);

  if (cc == 1) {
    cout << "0\n";
    return;
  }

  int no_leaves = 0;
  function<void(int, int, int)> h = [&](int u, int p, int curr) {
    if (sub_sz[u] == 0 && curr != u)
      cnt[u]++, cnt[curr]++, curr = u;
    for (int &v : adj[u])
      if (v != p)
        h(v, u, curr);
    if (cnt[u] == 1)
      no_leaves++;
  };

  h(0, -1, 0);
  cout << (no_leaves + 1) / 2 << '\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

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 14 ms 23880 KB Output is correct
3 Correct 11 ms 23892 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 10 ms 23852 KB Output is correct
6 Correct 11 ms 24000 KB Output is correct
7 Correct 11 ms 23792 KB Output is correct
8 Correct 12 ms 23916 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23784 KB Output is correct
11 Correct 10 ms 23892 KB Output is correct
12 Correct 10 ms 23896 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 10 ms 23844 KB Output is correct
15 Correct 11 ms 23928 KB Output is correct
16 Correct 11 ms 23764 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 11 ms 23892 KB Output is correct
19 Correct 11 ms 23756 KB Output is correct
20 Correct 11 ms 23780 KB Output is correct
21 Correct 11 ms 23892 KB Output is correct
22 Correct 11 ms 23892 KB Output is correct
23 Correct 11 ms 23772 KB Output is correct
24 Correct 11 ms 23828 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 14 ms 23880 KB Output is correct
3 Correct 11 ms 23892 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 10 ms 23852 KB Output is correct
6 Correct 11 ms 24000 KB Output is correct
7 Correct 11 ms 23792 KB Output is correct
8 Correct 12 ms 23916 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23784 KB Output is correct
11 Correct 10 ms 23892 KB Output is correct
12 Correct 10 ms 23896 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 10 ms 23844 KB Output is correct
15 Correct 11 ms 23928 KB Output is correct
16 Correct 11 ms 23764 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 11 ms 23892 KB Output is correct
19 Correct 11 ms 23756 KB Output is correct
20 Correct 11 ms 23780 KB Output is correct
21 Correct 11 ms 23892 KB Output is correct
22 Correct 11 ms 23892 KB Output is correct
23 Correct 11 ms 23772 KB Output is correct
24 Correct 11 ms 23828 KB Output is correct
25 Correct 11 ms 23816 KB Output is correct
26 Correct 13 ms 24740 KB Output is correct
27 Correct 12 ms 24692 KB Output is correct
28 Correct 12 ms 24916 KB Output is correct
29 Correct 13 ms 24788 KB Output is correct
30 Correct 13 ms 24660 KB Output is correct
31 Correct 13 ms 23860 KB Output is correct
32 Correct 13 ms 24920 KB Output is correct
33 Correct 13 ms 23892 KB Output is correct
34 Correct 12 ms 24620 KB Output is correct
35 Correct 13 ms 24724 KB Output is correct
36 Correct 12 ms 24736 KB Output is correct
37 Correct 14 ms 24672 KB Output is correct
38 Correct 13 ms 23916 KB Output is correct
39 Correct 14 ms 24736 KB Output is correct
40 Correct 11 ms 24572 KB Output is correct
41 Correct 13 ms 24660 KB Output is correct
42 Correct 13 ms 24660 KB Output is correct
43 Correct 13 ms 25008 KB Output is correct
44 Correct 10 ms 23892 KB Output is correct
45 Correct 11 ms 24788 KB Output is correct
46 Correct 11 ms 24660 KB Output is correct
47 Correct 10 ms 23800 KB Output is correct
48 Correct 13 ms 24740 KB Output is correct
49 Correct 14 ms 24788 KB Output is correct
50 Correct 11 ms 24872 KB Output is correct
51 Correct 12 ms 24660 KB Output is correct
52 Correct 11 ms 24584 KB Output is correct
53 Correct 14 ms 24764 KB Output is correct
54 Correct 11 ms 24668 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 14 ms 23880 KB Output is correct
3 Correct 11 ms 23892 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 10 ms 23852 KB Output is correct
6 Correct 11 ms 24000 KB Output is correct
7 Correct 11 ms 23792 KB Output is correct
8 Correct 12 ms 23916 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23784 KB Output is correct
11 Correct 10 ms 23892 KB Output is correct
12 Correct 10 ms 23896 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 10 ms 23844 KB Output is correct
15 Correct 11 ms 23928 KB Output is correct
16 Correct 11 ms 23764 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 11 ms 23892 KB Output is correct
19 Correct 11 ms 23756 KB Output is correct
20 Correct 11 ms 23780 KB Output is correct
21 Correct 11 ms 23892 KB Output is correct
22 Correct 11 ms 23892 KB Output is correct
23 Correct 11 ms 23772 KB Output is correct
24 Correct 11 ms 23828 KB Output is correct
25 Correct 9 ms 23892 KB Output is correct
26 Correct 66 ms 56456 KB Output is correct
27 Correct 91 ms 56124 KB Output is correct
28 Correct 14 ms 24660 KB Output is correct
29 Correct 11 ms 23872 KB Output is correct
30 Correct 10 ms 23832 KB Output is correct
31 Correct 70 ms 56484 KB Output is correct
32 Correct 11 ms 24664 KB Output is correct
33 Correct 72 ms 66292 KB Output is correct
34 Correct 74 ms 56316 KB Output is correct
35 Correct 13 ms 24660 KB Output is correct
36 Correct 83 ms 57616 KB Output is correct
37 Correct 12 ms 24660 KB Output is correct
38 Correct 12 ms 24732 KB Output is correct
39 Correct 55 ms 56528 KB Output is correct
40 Correct 13 ms 24916 KB Output is correct
41 Correct 70 ms 56120 KB Output is correct
42 Correct 107 ms 59584 KB Output is correct
43 Correct 12 ms 23896 KB Output is correct
44 Correct 80 ms 66616 KB Output is correct
45 Correct 79 ms 61464 KB Output is correct
46 Correct 13 ms 24704 KB Output is correct
47 Correct 12 ms 24660 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 56464 KB Output is correct
2 Correct 70 ms 60664 KB Output is correct
3 Correct 12 ms 24652 KB Output is correct
4 Correct 12 ms 24720 KB Output is correct
5 Correct 11 ms 23816 KB Output is correct
6 Correct 11 ms 23892 KB Output is correct
7 Correct 12 ms 24704 KB Output is correct
8 Correct 101 ms 58856 KB Output is correct
9 Correct 15 ms 24660 KB Output is correct
10 Correct 100 ms 57820 KB Output is correct
11 Correct 13 ms 23892 KB Output is correct
12 Correct 81 ms 57788 KB Output is correct
13 Correct 104 ms 58744 KB Output is correct
14 Correct 85 ms 60372 KB Output is correct
15 Correct 84 ms 56424 KB Output is correct
16 Correct 15 ms 24712 KB Output is correct
17 Correct 11 ms 23892 KB Output is correct
18 Correct 67 ms 60332 KB Output is correct
19 Correct 92 ms 65924 KB Output is correct
20 Correct 12 ms 24748 KB Output is correct
21 Correct 11 ms 23920 KB Output is correct
22 Correct 75 ms 59200 KB Output is correct
23 Correct 13 ms 24712 KB Output is correct
24 Correct 103 ms 58064 KB Output is correct
25 Correct 86 ms 64036 KB Output is correct
26 Correct 14 ms 24788 KB Output is correct
27 Correct 12 ms 24892 KB Output is correct
28 Correct 13 ms 24704 KB Output is correct
29 Correct 12 ms 24660 KB Output is correct
30 Correct 13 ms 24776 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 23764 KB Output is correct
2 Correct 14 ms 23880 KB Output is correct
3 Correct 11 ms 23892 KB Output is correct
4 Correct 13 ms 23764 KB Output is correct
5 Correct 10 ms 23852 KB Output is correct
6 Correct 11 ms 24000 KB Output is correct
7 Correct 11 ms 23792 KB Output is correct
8 Correct 12 ms 23916 KB Output is correct
9 Correct 10 ms 23764 KB Output is correct
10 Correct 10 ms 23784 KB Output is correct
11 Correct 10 ms 23892 KB Output is correct
12 Correct 10 ms 23896 KB Output is correct
13 Correct 13 ms 23764 KB Output is correct
14 Correct 10 ms 23844 KB Output is correct
15 Correct 11 ms 23928 KB Output is correct
16 Correct 11 ms 23764 KB Output is correct
17 Correct 12 ms 23744 KB Output is correct
18 Correct 11 ms 23892 KB Output is correct
19 Correct 11 ms 23756 KB Output is correct
20 Correct 11 ms 23780 KB Output is correct
21 Correct 11 ms 23892 KB Output is correct
22 Correct 11 ms 23892 KB Output is correct
23 Correct 11 ms 23772 KB Output is correct
24 Correct 11 ms 23828 KB Output is correct
25 Correct 11 ms 23816 KB Output is correct
26 Correct 13 ms 24740 KB Output is correct
27 Correct 12 ms 24692 KB Output is correct
28 Correct 12 ms 24916 KB Output is correct
29 Correct 13 ms 24788 KB Output is correct
30 Correct 13 ms 24660 KB Output is correct
31 Correct 13 ms 23860 KB Output is correct
32 Correct 13 ms 24920 KB Output is correct
33 Correct 13 ms 23892 KB Output is correct
34 Correct 12 ms 24620 KB Output is correct
35 Correct 13 ms 24724 KB Output is correct
36 Correct 12 ms 24736 KB Output is correct
37 Correct 14 ms 24672 KB Output is correct
38 Correct 13 ms 23916 KB Output is correct
39 Correct 14 ms 24736 KB Output is correct
40 Correct 11 ms 24572 KB Output is correct
41 Correct 13 ms 24660 KB Output is correct
42 Correct 13 ms 24660 KB Output is correct
43 Correct 13 ms 25008 KB Output is correct
44 Correct 10 ms 23892 KB Output is correct
45 Correct 11 ms 24788 KB Output is correct
46 Correct 11 ms 24660 KB Output is correct
47 Correct 10 ms 23800 KB Output is correct
48 Correct 13 ms 24740 KB Output is correct
49 Correct 14 ms 24788 KB Output is correct
50 Correct 11 ms 24872 KB Output is correct
51 Correct 12 ms 24660 KB Output is correct
52 Correct 11 ms 24584 KB Output is correct
53 Correct 14 ms 24764 KB Output is correct
54 Correct 11 ms 24668 KB Output is correct
55 Correct 9 ms 23892 KB Output is correct
56 Correct 66 ms 56456 KB Output is correct
57 Correct 91 ms 56124 KB Output is correct
58 Correct 14 ms 24660 KB Output is correct
59 Correct 11 ms 23872 KB Output is correct
60 Correct 10 ms 23832 KB Output is correct
61 Correct 70 ms 56484 KB Output is correct
62 Correct 11 ms 24664 KB Output is correct
63 Correct 72 ms 66292 KB Output is correct
64 Correct 74 ms 56316 KB Output is correct
65 Correct 13 ms 24660 KB Output is correct
66 Correct 83 ms 57616 KB Output is correct
67 Correct 12 ms 24660 KB Output is correct
68 Correct 12 ms 24732 KB Output is correct
69 Correct 55 ms 56528 KB Output is correct
70 Correct 13 ms 24916 KB Output is correct
71 Correct 70 ms 56120 KB Output is correct
72 Correct 107 ms 59584 KB Output is correct
73 Correct 12 ms 23896 KB Output is correct
74 Correct 80 ms 66616 KB Output is correct
75 Correct 79 ms 61464 KB Output is correct
76 Correct 13 ms 24704 KB Output is correct
77 Correct 12 ms 24660 KB Output is correct
78 Correct 55 ms 56464 KB Output is correct
79 Correct 70 ms 60664 KB Output is correct
80 Correct 12 ms 24652 KB Output is correct
81 Correct 12 ms 24720 KB Output is correct
82 Correct 11 ms 23816 KB Output is correct
83 Correct 11 ms 23892 KB Output is correct
84 Correct 12 ms 24704 KB Output is correct
85 Correct 101 ms 58856 KB Output is correct
86 Correct 15 ms 24660 KB Output is correct
87 Correct 100 ms 57820 KB Output is correct
88 Correct 13 ms 23892 KB Output is correct
89 Correct 81 ms 57788 KB Output is correct
90 Correct 104 ms 58744 KB Output is correct
91 Correct 85 ms 60372 KB Output is correct
92 Correct 84 ms 56424 KB Output is correct
93 Correct 15 ms 24712 KB Output is correct
94 Correct 11 ms 23892 KB Output is correct
95 Correct 67 ms 60332 KB Output is correct
96 Correct 92 ms 65924 KB Output is correct
97 Correct 12 ms 24748 KB Output is correct
98 Correct 11 ms 23920 KB Output is correct
99 Correct 75 ms 59200 KB Output is correct
100 Correct 13 ms 24712 KB Output is correct
101 Correct 103 ms 58064 KB Output is correct
102 Correct 86 ms 64036 KB Output is correct
103 Correct 14 ms 24788 KB Output is correct
104 Correct 12 ms 24892 KB Output is correct
105 Correct 13 ms 24704 KB Output is correct
106 Correct 12 ms 24660 KB Output is correct
107 Correct 13 ms 24776 KB Output is correct
108 Incorrect 445 ms 145512 KB Output isn't correct
109 Halted 0 ms 0 KB -