oj.uz

Submission #521068

# Submission time Handle Problem Language Result Execution time Memory
521068 2022-01-31T17:06:50 Z cig32 Mergers (JOI19_mergers) C++17
70 / 100
 1208 ms 262148 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 5e5 + 10;
vector<int> adj[MAXN];
vector<int> adj2[MAXN];
int s[MAXN];
int dsu[MAXN];
int set_of(int u) {
  if(dsu[u] == u) return u;
  return dsu[u] = set_of(dsu[u]);
}
void union_(int u, int v) {
  dsu[set_of(u)] = set_of(v);
}
vector<int> e;
int dep[MAXN];
int tin[MAXN], tout[MAXN];
int tim = 0;
void dfs1(int node, int prev, int cur) {
  e.push_back(node);
  dep[node] = cur;
  tin[node] = ++tim;
  for(int x: adj[node]) {
    if(x != prev) {
      dfs1(x, node, cur + 1);
      e.push_back(node);
    }
  }
  tout[node] = ++tim;
}
pair<int, int> st[20][2*MAXN];
int l[MAXN], r[MAXN];
int lca(int x, int y) {
  int m1 = min(l[x], l[y]);
  int m2 = max(r[x], r[y]);
  int k = 32 - __builtin_clz(m2 - m1 + 1) - 1;
  return min(st[k][m1], st[k][m2 - (1<<k) + 1]).second;
}
int delta[MAXN];
bool cmp(int a, int b) {
  return tin[a] < tin[b];
}
map<pair<int, int>, bool> lit;
int dfs2(int node, int prev) {
  int s = delta[node];
  for(int x: adj[node]) {
    if(x != prev) s += dfs2(x, node);
  }
  if(s == 0) lit[{node, prev}] = lit[{prev, node}] = 1;
  return s;
}
int32_t main() {
  int n,k;cin >> n >> k;
  for(int i=1;i<n;i++) {
    int a,b;cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  for(int i=1; i<=n; i++) cin >> s[i];
  for(int i=0; i<=n; i++) dsu[i] = i;
  dfs1(1, -1, 0);
  for(int i=0; i<e.size(); i++) r[e[i]] = i;
  for(int i=e.size()-1; i>=0; i--) l[e[i]] = i;
  for(int i=0; i<e.size(); i++) st[0][i] = {dep[e[i]], e[i]};
  for(int i=1; i<20; i++) {
    for(int j=0; j<e.size(); j++) {
      if(j + (1<<i) - 1 < e.size()) {
        st[i][j] = min(st[i-1][j], st[i-1][j+(1<<(i-1))]);
      }
    }
  }
  vector<int> wow[k+1];
  for(int i=1; i<=n; i++) {
    wow[s[i]].push_back(i);
  }
  for(int i=1; i<=k; i++) {
    if(wow[i].size() == 1) continue;
    sort(wow[i].begin(), wow[i].end(), cmp);
    int l = lca(wow[i][0], wow[i][1]);
    for(int j=0; j<wow[i].size(); j++) {
      l = lca(l, wow[i][j]);
      delta[wow[i][j]]++;
    }
    delta[l] -= wow[i].size();
  }
  dfs2(1, -1);
  for(int i=1; i<=n; i++) {
    for(int x: adj[i]) {
      if(!lit[{i, x}]) {
        union_(i, x);
      }
    }
  }
  map<pair<int, int>, bool> mp;
  for(int i=1; i<=n; i++) {
    for(int x: adj[i]) {
      if(set_of(i) != set_of(x) && mp[{set_of(i), set_of(x)}] == 0) {
        mp[{set_of(i), set_of(x)}] = 1;
        mp[{set_of(x), set_of(i)}] = 1;
        adj2[set_of(i)].push_back(set_of(x));
        adj2[set_of(x)].push_back(set_of(i));
      }
    }
  }
  int s = 0;
  for(int i=1; i<=n; i++) {
    s += (adj2[i].size() == 1);
  }
  cout << (s + 1) / 2 << "\n";
}

Compilation message

mergers.cpp: In function 'int32_t main()':
mergers.cpp:62:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   for(int i=0; i<e.size(); i++) r[e[i]] = i;
      |                ~^~~~~~~~~
mergers.cpp:64:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |   for(int i=0; i<e.size(); i++) st[0][i] = {dep[e[i]], e[i]};
      |                ~^~~~~~~~~
mergers.cpp:66:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |     for(int j=0; j<e.size(); j++) {
      |                  ~^~~~~~~~~
mergers.cpp:67:25: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   67 |       if(j + (1<<i) - 1 < e.size()) {
      |          ~~~~~~~~~~~~~~~^~~~~~~~~~
mergers.cpp:80:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   80 |     for(int j=0; j<wow[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23860 KB Output is correct
2 Correct 16 ms 23888 KB Output is correct
3 Correct 13 ms 23928 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23756 KB Output is correct
6 Correct 14 ms 23856 KB Output is correct
7 Correct 14 ms 23796 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 14 ms 23884 KB Output is correct
10 Correct 15 ms 23824 KB Output is correct
11 Correct 13 ms 23872 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23880 KB Output is correct
14 Correct 14 ms 23884 KB Output is correct
15 Correct 16 ms 23832 KB Output is correct
16 Correct 13 ms 23756 KB Output is correct
17 Correct 15 ms 23756 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 17 ms 23764 KB Output is correct
20 Correct 13 ms 23784 KB Output is correct
21 Correct 13 ms 23844 KB Output is correct
22 Correct 13 ms 23884 KB Output is correct
23 Correct 14 ms 23884 KB Output is correct
24 Correct 16 ms 23852 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23860 KB Output is correct
2 Correct 16 ms 23888 KB Output is correct
3 Correct 13 ms 23928 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23756 KB Output is correct
6 Correct 14 ms 23856 KB Output is correct
7 Correct 14 ms 23796 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 14 ms 23884 KB Output is correct
10 Correct 15 ms 23824 KB Output is correct
11 Correct 13 ms 23872 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23880 KB Output is correct
14 Correct 14 ms 23884 KB Output is correct
15 Correct 16 ms 23832 KB Output is correct
16 Correct 13 ms 23756 KB Output is correct
17 Correct 15 ms 23756 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 17 ms 23764 KB Output is correct
20 Correct 13 ms 23784 KB Output is correct
21 Correct 13 ms 23844 KB Output is correct
22 Correct 13 ms 23884 KB Output is correct
23 Correct 14 ms 23884 KB Output is correct
24 Correct 16 ms 23852 KB Output is correct
25 Correct 12 ms 23884 KB Output is correct
26 Correct 20 ms 25420 KB Output is correct
27 Correct 22 ms 25036 KB Output is correct
28 Correct 22 ms 25628 KB Output is correct
29 Correct 22 ms 25632 KB Output is correct
30 Correct 20 ms 25048 KB Output is correct
31 Correct 13 ms 23884 KB Output is correct
32 Correct 21 ms 25468 KB Output is correct
33 Correct 14 ms 23916 KB Output is correct
34 Correct 21 ms 25036 KB Output is correct
35 Correct 22 ms 25608 KB Output is correct
36 Correct 17 ms 25052 KB Output is correct
37 Correct 19 ms 25204 KB Output is correct
38 Correct 14 ms 23924 KB Output is correct
39 Correct 18 ms 25212 KB Output is correct
40 Correct 19 ms 25092 KB Output is correct
41 Correct 18 ms 25032 KB Output is correct
42 Correct 17 ms 25192 KB Output is correct
43 Correct 17 ms 25236 KB Output is correct
44 Correct 15 ms 23884 KB Output is correct
45 Correct 20 ms 25292 KB Output is correct
46 Correct 21 ms 25188 KB Output is correct
47 Correct 13 ms 23884 KB Output is correct
48 Correct 19 ms 25156 KB Output is correct
49 Correct 21 ms 25712 KB Output is correct
50 Correct 23 ms 25700 KB Output is correct
51 Correct 20 ms 25036 KB Output is correct
52 Correct 18 ms 25096 KB Output is correct
53 Correct 21 ms 25140 KB Output is correct
54 Correct 17 ms 25076 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23860 KB Output is correct
2 Correct 16 ms 23888 KB Output is correct
3 Correct 13 ms 23928 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23756 KB Output is correct
6 Correct 14 ms 23856 KB Output is correct
7 Correct 14 ms 23796 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 14 ms 23884 KB Output is correct
10 Correct 15 ms 23824 KB Output is correct
11 Correct 13 ms 23872 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23880 KB Output is correct
14 Correct 14 ms 23884 KB Output is correct
15 Correct 16 ms 23832 KB Output is correct
16 Correct 13 ms 23756 KB Output is correct
17 Correct 15 ms 23756 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 17 ms 23764 KB Output is correct
20 Correct 13 ms 23784 KB Output is correct
21 Correct 13 ms 23844 KB Output is correct
22 Correct 13 ms 23884 KB Output is correct
23 Correct 14 ms 23884 KB Output is correct
24 Correct 16 ms 23852 KB Output is correct
25 Correct 12 ms 23884 KB Output is correct
26 Correct 213 ms 70680 KB Output is correct
27 Correct 220 ms 70176 KB Output is correct
28 Correct 16 ms 25036 KB Output is correct
29 Correct 16 ms 23864 KB Output is correct
30 Correct 13 ms 23900 KB Output is correct
31 Correct 194 ms 70156 KB Output is correct
32 Correct 16 ms 25136 KB Output is correct
33 Correct 225 ms 77380 KB Output is correct
34 Correct 201 ms 70332 KB Output is correct
35 Correct 18 ms 25036 KB Output is correct
36 Correct 208 ms 70824 KB Output is correct
37 Correct 18 ms 25084 KB Output is correct
38 Correct 19 ms 25032 KB Output is correct
39 Correct 187 ms 71056 KB Output is correct
40 Correct 22 ms 25292 KB Output is correct
41 Correct 210 ms 70072 KB Output is correct
42 Correct 205 ms 72744 KB Output is correct
43 Correct 14 ms 23924 KB Output is correct
44 Correct 214 ms 77584 KB Output is correct
45 Correct 209 ms 74340 KB Output is correct
46 Correct 19 ms 25116 KB Output is correct
47 Correct 21 ms 25036 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 70524 KB Output is correct
2 Correct 433 ms 91424 KB Output is correct
3 Correct 20 ms 25420 KB Output is correct
4 Correct 22 ms 25020 KB Output is correct
5 Correct 15 ms 23884 KB Output is correct
6 Correct 15 ms 23888 KB Output is correct
7 Correct 19 ms 25156 KB Output is correct
8 Correct 239 ms 75384 KB Output is correct
9 Correct 21 ms 25036 KB Output is correct
10 Correct 206 ms 71632 KB Output is correct
11 Correct 16 ms 23996 KB Output is correct
12 Correct 209 ms 70332 KB Output is correct
13 Correct 287 ms 76924 KB Output is correct
14 Correct 438 ms 91896 KB Output is correct
15 Correct 223 ms 72236 KB Output is correct
16 Correct 18 ms 25292 KB Output is correct
17 Correct 14 ms 23868 KB Output is correct
18 Correct 462 ms 89284 KB Output is correct
19 Correct 417 ms 94428 KB Output is correct
20 Correct 19 ms 25192 KB Output is correct
21 Correct 15 ms 23864 KB Output is correct
22 Correct 270 ms 77756 KB Output is correct
23 Correct 23 ms 25136 KB Output is correct
24 Correct 236 ms 73740 KB Output is correct
25 Correct 464 ms 94468 KB Output is correct
26 Correct 20 ms 25676 KB Output is correct
27 Correct 22 ms 25724 KB Output is correct
28 Correct 18 ms 25084 KB Output is correct
29 Correct 19 ms 25132 KB Output is correct
30 Correct 21 ms 25252 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23860 KB Output is correct
2 Correct 16 ms 23888 KB Output is correct
3 Correct 13 ms 23928 KB Output is correct
4 Correct 12 ms 23756 KB Output is correct
5 Correct 13 ms 23756 KB Output is correct
6 Correct 14 ms 23856 KB Output is correct
7 Correct 14 ms 23796 KB Output is correct
8 Correct 13 ms 23808 KB Output is correct
9 Correct 14 ms 23884 KB Output is correct
10 Correct 15 ms 23824 KB Output is correct
11 Correct 13 ms 23872 KB Output is correct
12 Correct 13 ms 23820 KB Output is correct
13 Correct 13 ms 23880 KB Output is correct
14 Correct 14 ms 23884 KB Output is correct
15 Correct 16 ms 23832 KB Output is correct
16 Correct 13 ms 23756 KB Output is correct
17 Correct 15 ms 23756 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 17 ms 23764 KB Output is correct
20 Correct 13 ms 23784 KB Output is correct
21 Correct 13 ms 23844 KB Output is correct
22 Correct 13 ms 23884 KB Output is correct
23 Correct 14 ms 23884 KB Output is correct
24 Correct 16 ms 23852 KB Output is correct
25 Correct 12 ms 23884 KB Output is correct
26 Correct 20 ms 25420 KB Output is correct
27 Correct 22 ms 25036 KB Output is correct
28 Correct 22 ms 25628 KB Output is correct
29 Correct 22 ms 25632 KB Output is correct
30 Correct 20 ms 25048 KB Output is correct
31 Correct 13 ms 23884 KB Output is correct
32 Correct 21 ms 25468 KB Output is correct
33 Correct 14 ms 23916 KB Output is correct
34 Correct 21 ms 25036 KB Output is correct
35 Correct 22 ms 25608 KB Output is correct
36 Correct 17 ms 25052 KB Output is correct
37 Correct 19 ms 25204 KB Output is correct
38 Correct 14 ms 23924 KB Output is correct
39 Correct 18 ms 25212 KB Output is correct
40 Correct 19 ms 25092 KB Output is correct
41 Correct 18 ms 25032 KB Output is correct
42 Correct 17 ms 25192 KB Output is correct
43 Correct 17 ms 25236 KB Output is correct
44 Correct 15 ms 23884 KB Output is correct
45 Correct 20 ms 25292 KB Output is correct
46 Correct 21 ms 25188 KB Output is correct
47 Correct 13 ms 23884 KB Output is correct
48 Correct 19 ms 25156 KB Output is correct
49 Correct 21 ms 25712 KB Output is correct
50 Correct 23 ms 25700 KB Output is correct
51 Correct 20 ms 25036 KB Output is correct
52 Correct 18 ms 25096 KB Output is correct
53 Correct 21 ms 25140 KB Output is correct
54 Correct 17 ms 25076 KB Output is correct
55 Correct 12 ms 23884 KB Output is correct
56 Correct 213 ms 70680 KB Output is correct
57 Correct 220 ms 70176 KB Output is correct
58 Correct 16 ms 25036 KB Output is correct
59 Correct 16 ms 23864 KB Output is correct
60 Correct 13 ms 23900 KB Output is correct
61 Correct 194 ms 70156 KB Output is correct
62 Correct 16 ms 25136 KB Output is correct
63 Correct 225 ms 77380 KB Output is correct
64 Correct 201 ms 70332 KB Output is correct
65 Correct 18 ms 25036 KB Output is correct
66 Correct 208 ms 70824 KB Output is correct
67 Correct 18 ms 25084 KB Output is correct
68 Correct 19 ms 25032 KB Output is correct
69 Correct 187 ms 71056 KB Output is correct
70 Correct 22 ms 25292 KB Output is correct
71 Correct 210 ms 70072 KB Output is correct
72 Correct 205 ms 72744 KB Output is correct
73 Correct 14 ms 23924 KB Output is correct
74 Correct 214 ms 77584 KB Output is correct
75 Correct 209 ms 74340 KB Output is correct
76 Correct 19 ms 25116 KB Output is correct
77 Correct 21 ms 25036 KB Output is correct
78 Correct 231 ms 70524 KB Output is correct
79 Correct 433 ms 91424 KB Output is correct
80 Correct 20 ms 25420 KB Output is correct
81 Correct 22 ms 25020 KB Output is correct
82 Correct 15 ms 23884 KB Output is correct
83 Correct 15 ms 23888 KB Output is correct
84 Correct 19 ms 25156 KB Output is correct
85 Correct 239 ms 75384 KB Output is correct
86 Correct 21 ms 25036 KB Output is correct
87 Correct 206 ms 71632 KB Output is correct
88 Correct 16 ms 23996 KB Output is correct
89 Correct 209 ms 70332 KB Output is correct
90 Correct 287 ms 76924 KB Output is correct
91 Correct 438 ms 91896 KB Output is correct
92 Correct 223 ms 72236 KB Output is correct
93 Correct 18 ms 25292 KB Output is correct
94 Correct 14 ms 23868 KB Output is correct
95 Correct 462 ms 89284 KB Output is correct
96 Correct 417 ms 94428 KB Output is correct
97 Correct 19 ms 25192 KB Output is correct
98 Correct 15 ms 23864 KB Output is correct
99 Correct 270 ms 77756 KB Output is correct
100 Correct 23 ms 25136 KB Output is correct
101 Correct 236 ms 73740 KB Output is correct
102 Correct 464 ms 94468 KB Output is correct
103 Correct 20 ms 25676 KB Output is correct
104 Correct 22 ms 25724 KB Output is correct
105 Correct 18 ms 25084 KB Output is correct
106 Correct 19 ms 25132 KB Output is correct
107 Correct 21 ms 25252 KB Output is correct
108 Runtime error 1208 ms 262148 KB Execution killed with signal 9
109 Halted 0 ms 0 KB -