oj.uz

답안 #832160

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
832160 2023-08-21T05:17:08 Z arush_agu Mergers (JOI19_mergers) C++17
70 / 100
 637 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;

struct ST {
  const int MAXLG = 22;
  int n;
  vi lg2;
  vvii st;

  ST(vii &a) : n(a.size()) {
    st = vvii(MAXLG, vii(n));
    st[0] = a;
    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 = vi(n + 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;
  vvi adj(n);
  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);
  }
  vi st(n);
  for (int &x : st)
    cin >> x, x--;

  int timer = 0;
  vi par(n, -1), depth(n), first_occ(n, -1), tin(n), tout(n);
  vii euler;
  function<void(int, int)> f = [&](int u, int p) {
    tin[u] = timer++;
    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});
      }
    tout[u] = timer++;
  };
  f(0, -1);
  ST lc(euler);

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

  vl b(n);
  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;
  vl sub_sz(n);
  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;
  }

  vl cnt(n);
  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:205:11: warning: unused variable 'start' [-Wunused-variable]
  205 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 252 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 252 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 2 ms 1876 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 3 ms 2004 KB Output is correct
29 Correct 2 ms 1948 KB Output is correct
30 Correct 2 ms 1740 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 2 ms 2132 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 2 ms 1868 KB Output is correct
36 Correct 2 ms 1748 KB Output is correct
37 Correct 2 ms 1748 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 2 ms 1748 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 2 ms 1876 KB Output is correct
43 Correct 2 ms 2004 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 2 ms 1876 KB Output is correct
46 Correct 3 ms 1820 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 2 ms 1760 KB Output is correct
49 Correct 2 ms 1876 KB Output is correct
50 Correct 2 ms 2004 KB Output is correct
51 Correct 2 ms 1748 KB Output is correct
52 Correct 2 ms 1748 KB Output is correct
53 Correct 2 ms 1876 KB Output is correct
54 Correct 3 ms 1748 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 252 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 65 ms 48828 KB Output is correct
27 Correct 66 ms 48576 KB Output is correct
28 Correct 2 ms 1748 KB Output is correct
29 Correct 0 ms 316 KB Output is correct
30 Correct 0 ms 316 KB Output is correct
31 Correct 84 ms 49280 KB Output is correct
32 Correct 2 ms 1748 KB Output is correct
33 Correct 74 ms 58688 KB Output is correct
34 Correct 72 ms 49428 KB Output is correct
35 Correct 2 ms 1748 KB Output is correct
36 Correct 79 ms 50328 KB Output is correct
37 Correct 2 ms 1740 KB Output is correct
38 Correct 2 ms 1748 KB Output is correct
39 Correct 54 ms 48820 KB Output is correct
40 Correct 3 ms 2004 KB Output is correct
41 Correct 74 ms 48972 KB Output is correct
42 Correct 108 ms 52680 KB Output is correct
43 Correct 1 ms 340 KB Output is correct
44 Correct 84 ms 59364 KB Output is correct
45 Correct 70 ms 53884 KB Output is correct
46 Correct 2 ms 1748 KB Output is correct
47 Correct 2 ms 1736 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 54 ms 48948 KB Output is correct
2 Correct 69 ms 54928 KB Output is correct
3 Correct 2 ms 1876 KB Output is correct
4 Correct 2 ms 1748 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 0 ms 324 KB Output is correct
7 Correct 2 ms 1736 KB Output is correct
8 Correct 87 ms 51892 KB Output is correct
9 Correct 3 ms 1748 KB Output is correct
10 Correct 71 ms 49556 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 77 ms 49524 KB Output is correct
13 Correct 86 ms 51732 KB Output is correct
14 Correct 121 ms 54704 KB Output is correct
15 Correct 57 ms 48784 KB Output is correct
16 Correct 2 ms 1872 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 68 ms 54376 KB Output is correct
19 Correct 98 ms 60184 KB Output is correct
20 Correct 2 ms 1756 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 90 ms 52132 KB Output is correct
23 Correct 2 ms 1748 KB Output is correct
24 Correct 80 ms 50076 KB Output is correct
25 Correct 88 ms 58280 KB Output is correct
26 Correct 2 ms 1876 KB Output is correct
27 Correct 2 ms 2004 KB Output is correct
28 Correct 2 ms 1748 KB Output is correct
29 Correct 2 ms 1748 KB Output is correct
30 Correct 3 ms 1876 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 252 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 324 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 316 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 0 ms 212 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 2 ms 1876 KB Output is correct
27 Correct 2 ms 1748 KB Output is correct
28 Correct 3 ms 2004 KB Output is correct
29 Correct 2 ms 1948 KB Output is correct
30 Correct 2 ms 1740 KB Output is correct
31 Correct 0 ms 340 KB Output is correct
32 Correct 2 ms 2132 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 2 ms 1748 KB Output is correct
35 Correct 2 ms 1868 KB Output is correct
36 Correct 2 ms 1748 KB Output is correct
37 Correct 2 ms 1748 KB Output is correct
38 Correct 0 ms 340 KB Output is correct
39 Correct 2 ms 1748 KB Output is correct
40 Correct 2 ms 1748 KB Output is correct
41 Correct 2 ms 1748 KB Output is correct
42 Correct 2 ms 1876 KB Output is correct
43 Correct 2 ms 2004 KB Output is correct
44 Correct 0 ms 340 KB Output is correct
45 Correct 2 ms 1876 KB Output is correct
46 Correct 3 ms 1820 KB Output is correct
47 Correct 1 ms 340 KB Output is correct
48 Correct 2 ms 1760 KB Output is correct
49 Correct 2 ms 1876 KB Output is correct
50 Correct 2 ms 2004 KB Output is correct
51 Correct 2 ms 1748 KB Output is correct
52 Correct 2 ms 1748 KB Output is correct
53 Correct 2 ms 1876 KB Output is correct
54 Correct 3 ms 1748 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 65 ms 48828 KB Output is correct
57 Correct 66 ms 48576 KB Output is correct
58 Correct 2 ms 1748 KB Output is correct
59 Correct 0 ms 316 KB Output is correct
60 Correct 0 ms 316 KB Output is correct
61 Correct 84 ms 49280 KB Output is correct
62 Correct 2 ms 1748 KB Output is correct
63 Correct 74 ms 58688 KB Output is correct
64 Correct 72 ms 49428 KB Output is correct
65 Correct 2 ms 1748 KB Output is correct
66 Correct 79 ms 50328 KB Output is correct
67 Correct 2 ms 1740 KB Output is correct
68 Correct 2 ms 1748 KB Output is correct
69 Correct 54 ms 48820 KB Output is correct
70 Correct 3 ms 2004 KB Output is correct
71 Correct 74 ms 48972 KB Output is correct
72 Correct 108 ms 52680 KB Output is correct
73 Correct 1 ms 340 KB Output is correct
74 Correct 84 ms 59364 KB Output is correct
75 Correct 70 ms 53884 KB Output is correct
76 Correct 2 ms 1748 KB Output is correct
77 Correct 2 ms 1736 KB Output is correct
78 Correct 54 ms 48948 KB Output is correct
79 Correct 69 ms 54928 KB Output is correct
80 Correct 2 ms 1876 KB Output is correct
81 Correct 2 ms 1748 KB Output is correct
82 Correct 1 ms 340 KB Output is correct
83 Correct 0 ms 324 KB Output is correct
84 Correct 2 ms 1736 KB Output is correct
85 Correct 87 ms 51892 KB Output is correct
86 Correct 3 ms 1748 KB Output is correct
87 Correct 71 ms 49556 KB Output is correct
88 Correct 0 ms 340 KB Output is correct
89 Correct 77 ms 49524 KB Output is correct
90 Correct 86 ms 51732 KB Output is correct
91 Correct 121 ms 54704 KB Output is correct
92 Correct 57 ms 48784 KB Output is correct
93 Correct 2 ms 1872 KB Output is correct
94 Correct 0 ms 340 KB Output is correct
95 Correct 68 ms 54376 KB Output is correct
96 Correct 98 ms 60184 KB Output is correct
97 Correct 2 ms 1756 KB Output is correct
98 Correct 1 ms 340 KB Output is correct
99 Correct 90 ms 52132 KB Output is correct
100 Correct 2 ms 1748 KB Output is correct
101 Correct 80 ms 50076 KB Output is correct
102 Correct 88 ms 58280 KB Output is correct
103 Correct 2 ms 1876 KB Output is correct
104 Correct 2 ms 2004 KB Output is correct
105 Correct 2 ms 1748 KB Output is correct
106 Correct 2 ms 1748 KB Output is correct
107 Correct 3 ms 1876 KB Output is correct
108 Correct 569 ms 258280 KB Output is correct
109 Runtime error 637 ms 262144 KB Execution killed with signal 9
110 Halted 0 ms 0 KB -