oj.uz

Submission #832182

# Submission time Handle Problem Language Result Execution time Memory
832182 2023-08-21T05:48:26 Z arush_agu Mergers (JOI19_mergers) C++17
100 / 100
 949 ms 141380 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;

int in[MAXN], out[MAXN];
int timer = 0;
int p[MAXN][MAXLG];
vvi g(MAXN);
void dfs(int v, int e) {
  in[v] = timer++;
  p[v][0] = e;
  for (int j = 1; j <= 20; j++)
    p[v][j] = p[p[v][j - 1]][j - 1];
  for (int to : g[v]) {
    if (to == e)
      continue;
    dfs(to, v);
  }
  out[v] = timer++;
}

bool isancestor(int u, int v) { return in[u] <= in[v] && out[u] >= out[v]; }

int lca(int u, int v) {
  if (isancestor(u, v))
    return u;
  if (isancestor(v, u))
    return v;
  for (int j = 20; j >= 0; j--) {
    if (!isancestor(p[u][j], v))
      u = p[u][j];
  }
  return p[u][0];
}

vi sz(MAXN), a(MAXN);
int c = 0;
void dfs2(int v, int e) {
  sz[v] = 1;
  for (int to : g[v]) {
    if (to == e)
      continue;
    dfs2(to, v);
    sz[v] += sz[to];
  }
  sz[v] -= a[v];
  if (sz[v] == 0)
    c++;
}

int cnt[MAXN];
int leaf = 0;
void ansdfs(int v, int cur, int e) {
  if (sz[v] == 0 && cur != v)
    cnt[v]++, cnt[cur]++;
  if (sz[v] == 0)
    cur = v;
  for (int to : g[v]) {
    if (to != e)
      ansdfs(to, cur, v);
  }
  if (cnt[v] == 1)
    leaf++;
}

void solve() {
  int n;
  cin >> n;
  int k;
  cin >> k;
  vector<vector<int>> vec(k + 1);
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 1);
  for (int i = 1; i <= n; ++i) {
    int x;
    cin >> x;
    vec[x].push_back(i);
  }

  for (int i = 1; i <= k; i++) {
    if (vec[i].empty())
      continue;
    int lc = vec[i][0];
    for (int to : vec[i])
      lc = lca(lc, to);
    a[lc] += vec[i].size();
  }
  dfs2(1, 1);
  if (c == 1)
    cout << 0 << "\n";
  else {
    ansdfs(1, 1, 1);
    cout << (leaf + 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 7 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 16012 KB Output is correct
4 Correct 7 ms 15976 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 16016 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 7 ms 16008 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 7 ms 15956 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15992 KB Output is correct
14 Correct 6 ms 15912 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15908 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 16012 KB Output is correct
4 Correct 7 ms 15976 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 16016 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 7 ms 16008 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 7 ms 15956 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15992 KB Output is correct
14 Correct 6 ms 15912 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15908 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 8 ms 16468 KB Output is correct
27 Correct 8 ms 16340 KB Output is correct
28 Correct 9 ms 16652 KB Output is correct
29 Correct 9 ms 16468 KB Output is correct
30 Correct 8 ms 16412 KB Output is correct
31 Correct 7 ms 15956 KB Output is correct
32 Correct 9 ms 16724 KB Output is correct
33 Correct 7 ms 15956 KB Output is correct
34 Correct 8 ms 16340 KB Output is correct
35 Correct 9 ms 16468 KB Output is correct
36 Correct 8 ms 16340 KB Output is correct
37 Correct 8 ms 16456 KB Output is correct
38 Correct 7 ms 15956 KB Output is correct
39 Correct 9 ms 16468 KB Output is correct
40 Correct 8 ms 16340 KB Output is correct
41 Correct 8 ms 16404 KB Output is correct
42 Correct 8 ms 16468 KB Output is correct
43 Correct 8 ms 16596 KB Output is correct
44 Correct 7 ms 15956 KB Output is correct
45 Correct 9 ms 16596 KB Output is correct
46 Correct 8 ms 16468 KB Output is correct
47 Correct 7 ms 15980 KB Output is correct
48 Correct 8 ms 16432 KB Output is correct
49 Correct 8 ms 16468 KB Output is correct
50 Correct 8 ms 16596 KB Output is correct
51 Correct 8 ms 16340 KB Output is correct
52 Correct 8 ms 16340 KB Output is correct
53 Correct 9 ms 16460 KB Output is correct
54 Correct 8 ms 16368 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 16012 KB Output is correct
4 Correct 7 ms 15976 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 16016 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 7 ms 16008 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 7 ms 15956 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15992 KB Output is correct
14 Correct 6 ms 15912 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15908 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 46 ms 29440 KB Output is correct
27 Correct 73 ms 29156 KB Output is correct
28 Correct 9 ms 16340 KB Output is correct
29 Correct 8 ms 15988 KB Output is correct
30 Correct 8 ms 15956 KB Output is correct
31 Correct 72 ms 29292 KB Output is correct
32 Correct 8 ms 16340 KB Output is correct
33 Correct 83 ms 36332 KB Output is correct
34 Correct 60 ms 29132 KB Output is correct
35 Correct 8 ms 16340 KB Output is correct
36 Correct 75 ms 30028 KB Output is correct
37 Correct 8 ms 16340 KB Output is correct
38 Correct 9 ms 16340 KB Output is correct
39 Correct 56 ms 29448 KB Output is correct
40 Correct 9 ms 16596 KB Output is correct
41 Correct 57 ms 29192 KB Output is correct
42 Correct 77 ms 31488 KB Output is correct
43 Correct 6 ms 16004 KB Output is correct
44 Correct 82 ms 36560 KB Output is correct
45 Correct 72 ms 32812 KB Output is correct
46 Correct 9 ms 16428 KB Output is correct
47 Correct 9 ms 16340 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 52 ms 29400 KB Output is correct
2 Correct 58 ms 34768 KB Output is correct
3 Correct 8 ms 16456 KB Output is correct
4 Correct 8 ms 16340 KB Output is correct
5 Correct 6 ms 15956 KB Output is correct
6 Correct 7 ms 15992 KB Output is correct
7 Correct 8 ms 16444 KB Output is correct
8 Correct 80 ms 31736 KB Output is correct
9 Correct 8 ms 16340 KB Output is correct
10 Correct 64 ms 29556 KB Output is correct
11 Correct 7 ms 15956 KB Output is correct
12 Correct 68 ms 29480 KB Output is correct
13 Correct 105 ms 31764 KB Output is correct
14 Correct 84 ms 34424 KB Output is correct
15 Correct 46 ms 29376 KB Output is correct
16 Correct 8 ms 16468 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 62 ms 34172 KB Output is correct
19 Correct 93 ms 38372 KB Output is correct
20 Correct 10 ms 16468 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 61 ms 32032 KB Output is correct
23 Correct 9 ms 16340 KB Output is correct
24 Correct 73 ms 30056 KB Output is correct
25 Correct 85 ms 37016 KB Output is correct
26 Correct 8 ms 16596 KB Output is correct
27 Correct 8 ms 16596 KB Output is correct
28 Correct 8 ms 16428 KB Output is correct
29 Correct 8 ms 16336 KB Output is correct
30 Correct 7 ms 16468 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 15956 KB Output is correct
2 Correct 7 ms 15956 KB Output is correct
3 Correct 7 ms 16012 KB Output is correct
4 Correct 7 ms 15976 KB Output is correct
5 Correct 8 ms 15956 KB Output is correct
6 Correct 8 ms 16016 KB Output is correct
7 Correct 7 ms 15948 KB Output is correct
8 Correct 7 ms 15956 KB Output is correct
9 Correct 7 ms 16008 KB Output is correct
10 Correct 7 ms 15956 KB Output is correct
11 Correct 7 ms 15956 KB Output is correct
12 Correct 6 ms 15956 KB Output is correct
13 Correct 6 ms 15992 KB Output is correct
14 Correct 6 ms 15912 KB Output is correct
15 Correct 7 ms 15956 KB Output is correct
16 Correct 7 ms 15956 KB Output is correct
17 Correct 6 ms 15956 KB Output is correct
18 Correct 7 ms 15956 KB Output is correct
19 Correct 7 ms 15956 KB Output is correct
20 Correct 7 ms 15956 KB Output is correct
21 Correct 7 ms 15956 KB Output is correct
22 Correct 7 ms 15956 KB Output is correct
23 Correct 7 ms 15956 KB Output is correct
24 Correct 7 ms 15908 KB Output is correct
25 Correct 7 ms 15956 KB Output is correct
26 Correct 8 ms 16468 KB Output is correct
27 Correct 8 ms 16340 KB Output is correct
28 Correct 9 ms 16652 KB Output is correct
29 Correct 9 ms 16468 KB Output is correct
30 Correct 8 ms 16412 KB Output is correct
31 Correct 7 ms 15956 KB Output is correct
32 Correct 9 ms 16724 KB Output is correct
33 Correct 7 ms 15956 KB Output is correct
34 Correct 8 ms 16340 KB Output is correct
35 Correct 9 ms 16468 KB Output is correct
36 Correct 8 ms 16340 KB Output is correct
37 Correct 8 ms 16456 KB Output is correct
38 Correct 7 ms 15956 KB Output is correct
39 Correct 9 ms 16468 KB Output is correct
40 Correct 8 ms 16340 KB Output is correct
41 Correct 8 ms 16404 KB Output is correct
42 Correct 8 ms 16468 KB Output is correct
43 Correct 8 ms 16596 KB Output is correct
44 Correct 7 ms 15956 KB Output is correct
45 Correct 9 ms 16596 KB Output is correct
46 Correct 8 ms 16468 KB Output is correct
47 Correct 7 ms 15980 KB Output is correct
48 Correct 8 ms 16432 KB Output is correct
49 Correct 8 ms 16468 KB Output is correct
50 Correct 8 ms 16596 KB Output is correct
51 Correct 8 ms 16340 KB Output is correct
52 Correct 8 ms 16340 KB Output is correct
53 Correct 9 ms 16460 KB Output is correct
54 Correct 8 ms 16368 KB Output is correct
55 Correct 7 ms 15956 KB Output is correct
56 Correct 46 ms 29440 KB Output is correct
57 Correct 73 ms 29156 KB Output is correct
58 Correct 9 ms 16340 KB Output is correct
59 Correct 8 ms 15988 KB Output is correct
60 Correct 8 ms 15956 KB Output is correct
61 Correct 72 ms 29292 KB Output is correct
62 Correct 8 ms 16340 KB Output is correct
63 Correct 83 ms 36332 KB Output is correct
64 Correct 60 ms 29132 KB Output is correct
65 Correct 8 ms 16340 KB Output is correct
66 Correct 75 ms 30028 KB Output is correct
67 Correct 8 ms 16340 KB Output is correct
68 Correct 9 ms 16340 KB Output is correct
69 Correct 56 ms 29448 KB Output is correct
70 Correct 9 ms 16596 KB Output is correct
71 Correct 57 ms 29192 KB Output is correct
72 Correct 77 ms 31488 KB Output is correct
73 Correct 6 ms 16004 KB Output is correct
74 Correct 82 ms 36560 KB Output is correct
75 Correct 72 ms 32812 KB Output is correct
76 Correct 9 ms 16428 KB Output is correct
77 Correct 9 ms 16340 KB Output is correct
78 Correct 52 ms 29400 KB Output is correct
79 Correct 58 ms 34768 KB Output is correct
80 Correct 8 ms 16456 KB Output is correct
81 Correct 8 ms 16340 KB Output is correct
82 Correct 6 ms 15956 KB Output is correct
83 Correct 7 ms 15992 KB Output is correct
84 Correct 8 ms 16444 KB Output is correct
85 Correct 80 ms 31736 KB Output is correct
86 Correct 8 ms 16340 KB Output is correct
87 Correct 64 ms 29556 KB Output is correct
88 Correct 7 ms 15956 KB Output is correct
89 Correct 68 ms 29480 KB Output is correct
90 Correct 105 ms 31764 KB Output is correct
91 Correct 84 ms 34424 KB Output is correct
92 Correct 46 ms 29376 KB Output is correct
93 Correct 8 ms 16468 KB Output is correct
94 Correct 6 ms 15956 KB Output is correct
95 Correct 62 ms 34172 KB Output is correct
96 Correct 93 ms 38372 KB Output is correct
97 Correct 10 ms 16468 KB Output is correct
98 Correct 7 ms 15956 KB Output is correct
99 Correct 61 ms 32032 KB Output is correct
100 Correct 9 ms 16340 KB Output is correct
101 Correct 73 ms 30056 KB Output is correct
102 Correct 85 ms 37016 KB Output is correct
103 Correct 8 ms 16596 KB Output is correct
104 Correct 8 ms 16596 KB Output is correct
105 Correct 8 ms 16428 KB Output is correct
106 Correct 8 ms 16336 KB Output is correct
107 Correct 7 ms 16468 KB Output is correct
108 Correct 447 ms 93656 KB Output is correct
109 Correct 850 ms 106756 KB Output is correct
110 Correct 704 ms 117948 KB Output is correct
111 Correct 949 ms 141380 KB Output is correct
112 Correct 807 ms 131640 KB Output is correct
113 Correct 460 ms 117140 KB Output is correct
114 Correct 553 ms 88960 KB Output is correct
115 Correct 521 ms 88784 KB Output is correct
116 Correct 620 ms 97504 KB Output is correct
117 Correct 682 ms 118348 KB Output is correct
118 Correct 598 ms 90852 KB Output is correct
119 Correct 723 ms 118416 KB Output is correct
120 Correct 822 ms 132428 KB Output is correct
121 Correct 687 ms 118404 KB Output is correct
122 Correct 693 ms 107444 KB Output is correct
123 Correct 472 ms 119868 KB Output is correct
124 Correct 851 ms 116500 KB Output is correct