oj.uz

Submission #832168

# Submission time Handle Problem Language Result Execution time Memory
832168 2023-08-21T05:32:07 Z arush_agu Mergers (JOI19_mergers) C++17
70 / 100
 329 ms 262144 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 + 10;
const int MAXLG = 22;

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

struct ST {
  int n;

  ST(vii &a) : n(a.size()) {
    for (int i = 0; i < n; i++)
      st[0][i] = a[i];
    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))]);

    lg2[1] = 0;
    for (int i = 2; i <= n; i++)
      lg2[i] = lg2[i / 2] + 1;
  }

  int query(int l, int r) {
    if (l > r)
      swap(l, r);
    int k = lg2[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;
  memset(par, -1, sizeof(par));
  vii euler;
  function<void(int, int)> f = [&](int u, int p) {
    first_occ[u] = euler.size();
    euler.push_back({depth[u], u});
    for (int &v : adj[u])
      if (v != p) {
        par[v] = u;
        depth[v] = depth[u] + 1;
        f(v, u);
        euler.push_back({depth[u], u});
      }
  };
  f(0, -1);

  ST lc(euler);

  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 'void solve()':
mergers.cpp:136:7: warning: unused variable 'timer' [-Wunused-variable]
  136 |   int timer = 0;
      |       ^~~~~
mergers.cpp: In function 'int main()':
mergers.cpp:202:11: warning: unused variable 'start' [-Wunused-variable]
  202 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25812 KB Output is correct
2 Correct 12 ms 25812 KB Output is correct
3 Correct 11 ms 25864 KB Output is correct
4 Correct 12 ms 25760 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25868 KB Output is correct
7 Correct 13 ms 25812 KB Output is correct
8 Correct 12 ms 25888 KB Output is correct
9 Correct 12 ms 25812 KB Output is correct
10 Correct 12 ms 25812 KB Output is correct
11 Correct 12 ms 25812 KB Output is correct
12 Correct 12 ms 25868 KB Output is correct
13 Correct 12 ms 25812 KB Output is correct
14 Correct 12 ms 25868 KB Output is correct
15 Correct 12 ms 25888 KB Output is correct
16 Correct 11 ms 25744 KB Output is correct
17 Correct 12 ms 25812 KB Output is correct
18 Correct 12 ms 25844 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 11 ms 25748 KB Output is correct
21 Correct 11 ms 25836 KB Output is correct
22 Correct 11 ms 25784 KB Output is correct
23 Correct 11 ms 25812 KB Output is correct
24 Correct 11 ms 25848 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25812 KB Output is correct
2 Correct 12 ms 25812 KB Output is correct
3 Correct 11 ms 25864 KB Output is correct
4 Correct 12 ms 25760 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25868 KB Output is correct
7 Correct 13 ms 25812 KB Output is correct
8 Correct 12 ms 25888 KB Output is correct
9 Correct 12 ms 25812 KB Output is correct
10 Correct 12 ms 25812 KB Output is correct
11 Correct 12 ms 25812 KB Output is correct
12 Correct 12 ms 25868 KB Output is correct
13 Correct 12 ms 25812 KB Output is correct
14 Correct 12 ms 25868 KB Output is correct
15 Correct 12 ms 25888 KB Output is correct
16 Correct 11 ms 25744 KB Output is correct
17 Correct 12 ms 25812 KB Output is correct
18 Correct 12 ms 25844 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 11 ms 25748 KB Output is correct
21 Correct 11 ms 25836 KB Output is correct
22 Correct 11 ms 25784 KB Output is correct
23 Correct 11 ms 25812 KB Output is correct
24 Correct 11 ms 25848 KB Output is correct
25 Correct 13 ms 25768 KB Output is correct
26 Correct 13 ms 26816 KB Output is correct
27 Correct 12 ms 26732 KB Output is correct
28 Correct 13 ms 26892 KB Output is correct
29 Correct 13 ms 26836 KB Output is correct
30 Correct 13 ms 26676 KB Output is correct
31 Correct 11 ms 25848 KB Output is correct
32 Correct 13 ms 26964 KB Output is correct
33 Correct 11 ms 25812 KB Output is correct
34 Correct 12 ms 26708 KB Output is correct
35 Correct 13 ms 26800 KB Output is correct
36 Correct 15 ms 26708 KB Output is correct
37 Correct 14 ms 26808 KB Output is correct
38 Correct 12 ms 25812 KB Output is correct
39 Correct 14 ms 26708 KB Output is correct
40 Correct 13 ms 26668 KB Output is correct
41 Correct 13 ms 26732 KB Output is correct
42 Correct 12 ms 26740 KB Output is correct
43 Correct 13 ms 27052 KB Output is correct
44 Correct 11 ms 25880 KB Output is correct
45 Correct 14 ms 26836 KB Output is correct
46 Correct 14 ms 26796 KB Output is correct
47 Correct 12 ms 25880 KB Output is correct
48 Correct 14 ms 26812 KB Output is correct
49 Correct 13 ms 26756 KB Output is correct
50 Correct 13 ms 26920 KB Output is correct
51 Correct 13 ms 26740 KB Output is correct
52 Correct 12 ms 26692 KB Output is correct
53 Correct 12 ms 26712 KB Output is correct
54 Correct 13 ms 26708 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25812 KB Output is correct
2 Correct 12 ms 25812 KB Output is correct
3 Correct 11 ms 25864 KB Output is correct
4 Correct 12 ms 25760 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25868 KB Output is correct
7 Correct 13 ms 25812 KB Output is correct
8 Correct 12 ms 25888 KB Output is correct
9 Correct 12 ms 25812 KB Output is correct
10 Correct 12 ms 25812 KB Output is correct
11 Correct 12 ms 25812 KB Output is correct
12 Correct 12 ms 25868 KB Output is correct
13 Correct 12 ms 25812 KB Output is correct
14 Correct 12 ms 25868 KB Output is correct
15 Correct 12 ms 25888 KB Output is correct
16 Correct 11 ms 25744 KB Output is correct
17 Correct 12 ms 25812 KB Output is correct
18 Correct 12 ms 25844 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 11 ms 25748 KB Output is correct
21 Correct 11 ms 25836 KB Output is correct
22 Correct 11 ms 25784 KB Output is correct
23 Correct 11 ms 25812 KB Output is correct
24 Correct 11 ms 25848 KB Output is correct
25 Correct 11 ms 25812 KB Output is correct
26 Correct 57 ms 60388 KB Output is correct
27 Correct 70 ms 60080 KB Output is correct
28 Correct 15 ms 26944 KB Output is correct
29 Correct 12 ms 25820 KB Output is correct
30 Correct 12 ms 25812 KB Output is correct
31 Correct 74 ms 60432 KB Output is correct
32 Correct 13 ms 26760 KB Output is correct
33 Correct 76 ms 70184 KB Output is correct
34 Correct 72 ms 60172 KB Output is correct
35 Correct 14 ms 26716 KB Output is correct
36 Correct 74 ms 61472 KB Output is correct
37 Correct 14 ms 26708 KB Output is correct
38 Correct 13 ms 26708 KB Output is correct
39 Correct 58 ms 60472 KB Output is correct
40 Correct 14 ms 27092 KB Output is correct
41 Correct 70 ms 60464 KB Output is correct
42 Correct 76 ms 63472 KB Output is correct
43 Correct 12 ms 25820 KB Output is correct
44 Correct 74 ms 70960 KB Output is correct
45 Correct 70 ms 65340 KB Output is correct
46 Correct 13 ms 26708 KB Output is correct
47 Correct 14 ms 26764 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 57 ms 60492 KB Output is correct
2 Correct 71 ms 64504 KB Output is correct
3 Correct 14 ms 26708 KB Output is correct
4 Correct 14 ms 26808 KB Output is correct
5 Correct 12 ms 25880 KB Output is correct
6 Correct 12 ms 25812 KB Output is correct
7 Correct 13 ms 26708 KB Output is correct
8 Correct 83 ms 62784 KB Output is correct
9 Correct 14 ms 26692 KB Output is correct
10 Correct 74 ms 61756 KB Output is correct
11 Correct 12 ms 25812 KB Output is correct
12 Correct 74 ms 61744 KB Output is correct
13 Correct 85 ms 62692 KB Output is correct
14 Correct 85 ms 64292 KB Output is correct
15 Correct 57 ms 60368 KB Output is correct
16 Correct 13 ms 26836 KB Output is correct
17 Correct 12 ms 25816 KB Output is correct
18 Correct 69 ms 64240 KB Output is correct
19 Correct 100 ms 69756 KB Output is correct
20 Correct 15 ms 26740 KB Output is correct
21 Correct 13 ms 25784 KB Output is correct
22 Correct 67 ms 63016 KB Output is correct
23 Correct 14 ms 26816 KB Output is correct
24 Correct 83 ms 61992 KB Output is correct
25 Correct 82 ms 67952 KB Output is correct
26 Correct 13 ms 26836 KB Output is correct
27 Correct 13 ms 26868 KB Output is correct
28 Correct 14 ms 26812 KB Output is correct
29 Correct 15 ms 26708 KB Output is correct
30 Correct 15 ms 26824 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 25812 KB Output is correct
2 Correct 12 ms 25812 KB Output is correct
3 Correct 11 ms 25864 KB Output is correct
4 Correct 12 ms 25760 KB Output is correct
5 Correct 11 ms 25812 KB Output is correct
6 Correct 11 ms 25868 KB Output is correct
7 Correct 13 ms 25812 KB Output is correct
8 Correct 12 ms 25888 KB Output is correct
9 Correct 12 ms 25812 KB Output is correct
10 Correct 12 ms 25812 KB Output is correct
11 Correct 12 ms 25812 KB Output is correct
12 Correct 12 ms 25868 KB Output is correct
13 Correct 12 ms 25812 KB Output is correct
14 Correct 12 ms 25868 KB Output is correct
15 Correct 12 ms 25888 KB Output is correct
16 Correct 11 ms 25744 KB Output is correct
17 Correct 12 ms 25812 KB Output is correct
18 Correct 12 ms 25844 KB Output is correct
19 Correct 12 ms 25812 KB Output is correct
20 Correct 11 ms 25748 KB Output is correct
21 Correct 11 ms 25836 KB Output is correct
22 Correct 11 ms 25784 KB Output is correct
23 Correct 11 ms 25812 KB Output is correct
24 Correct 11 ms 25848 KB Output is correct
25 Correct 13 ms 25768 KB Output is correct
26 Correct 13 ms 26816 KB Output is correct
27 Correct 12 ms 26732 KB Output is correct
28 Correct 13 ms 26892 KB Output is correct
29 Correct 13 ms 26836 KB Output is correct
30 Correct 13 ms 26676 KB Output is correct
31 Correct 11 ms 25848 KB Output is correct
32 Correct 13 ms 26964 KB Output is correct
33 Correct 11 ms 25812 KB Output is correct
34 Correct 12 ms 26708 KB Output is correct
35 Correct 13 ms 26800 KB Output is correct
36 Correct 15 ms 26708 KB Output is correct
37 Correct 14 ms 26808 KB Output is correct
38 Correct 12 ms 25812 KB Output is correct
39 Correct 14 ms 26708 KB Output is correct
40 Correct 13 ms 26668 KB Output is correct
41 Correct 13 ms 26732 KB Output is correct
42 Correct 12 ms 26740 KB Output is correct
43 Correct 13 ms 27052 KB Output is correct
44 Correct 11 ms 25880 KB Output is correct
45 Correct 14 ms 26836 KB Output is correct
46 Correct 14 ms 26796 KB Output is correct
47 Correct 12 ms 25880 KB Output is correct
48 Correct 14 ms 26812 KB Output is correct
49 Correct 13 ms 26756 KB Output is correct
50 Correct 13 ms 26920 KB Output is correct
51 Correct 13 ms 26740 KB Output is correct
52 Correct 12 ms 26692 KB Output is correct
53 Correct 12 ms 26712 KB Output is correct
54 Correct 13 ms 26708 KB Output is correct
55 Correct 11 ms 25812 KB Output is correct
56 Correct 57 ms 60388 KB Output is correct
57 Correct 70 ms 60080 KB Output is correct
58 Correct 15 ms 26944 KB Output is correct
59 Correct 12 ms 25820 KB Output is correct
60 Correct 12 ms 25812 KB Output is correct
61 Correct 74 ms 60432 KB Output is correct
62 Correct 13 ms 26760 KB Output is correct
63 Correct 76 ms 70184 KB Output is correct
64 Correct 72 ms 60172 KB Output is correct
65 Correct 14 ms 26716 KB Output is correct
66 Correct 74 ms 61472 KB Output is correct
67 Correct 14 ms 26708 KB Output is correct
68 Correct 13 ms 26708 KB Output is correct
69 Correct 58 ms 60472 KB Output is correct
70 Correct 14 ms 27092 KB Output is correct
71 Correct 70 ms 60464 KB Output is correct
72 Correct 76 ms 63472 KB Output is correct
73 Correct 12 ms 25820 KB Output is correct
74 Correct 74 ms 70960 KB Output is correct
75 Correct 70 ms 65340 KB Output is correct
76 Correct 13 ms 26708 KB Output is correct
77 Correct 14 ms 26764 KB Output is correct
78 Correct 57 ms 60492 KB Output is correct
79 Correct 71 ms 64504 KB Output is correct
80 Correct 14 ms 26708 KB Output is correct
81 Correct 14 ms 26808 KB Output is correct
82 Correct 12 ms 25880 KB Output is correct
83 Correct 12 ms 25812 KB Output is correct
84 Correct 13 ms 26708 KB Output is correct
85 Correct 83 ms 62784 KB Output is correct
86 Correct 14 ms 26692 KB Output is correct
87 Correct 74 ms 61756 KB Output is correct
88 Correct 12 ms 25812 KB Output is correct
89 Correct 74 ms 61744 KB Output is correct
90 Correct 85 ms 62692 KB Output is correct
91 Correct 85 ms 64292 KB Output is correct
92 Correct 57 ms 60368 KB Output is correct
93 Correct 13 ms 26836 KB Output is correct
94 Correct 12 ms 25816 KB Output is correct
95 Correct 69 ms 64240 KB Output is correct
96 Correct 100 ms 69756 KB Output is correct
97 Correct 15 ms 26740 KB Output is correct
98 Correct 13 ms 25784 KB Output is correct
99 Correct 67 ms 63016 KB Output is correct
100 Correct 14 ms 26816 KB Output is correct
101 Correct 83 ms 61992 KB Output is correct
102 Correct 82 ms 67952 KB Output is correct
103 Correct 13 ms 26836 KB Output is correct
104 Correct 13 ms 26868 KB Output is correct
105 Correct 14 ms 26812 KB Output is correct
106 Correct 15 ms 26708 KB Output is correct
107 Correct 15 ms 26824 KB Output is correct
108 Runtime error 329 ms 262144 KB Execution killed with signal 11
109 Halted 0 ms 0 KB -