oj.uz

Submission #521083

# Submission time Handle Problem Language Result Execution time Memory
521083 2022-01-31T17:23:44 Z cig32 Mergers (JOI19_mergers) C++17
70 / 100
 3000 ms 228764 KB 
#include "bits/stdc++.h"
using namespace std;
const int MAXN = 5e5 + 10;
#define int long long
vector<int> adj[MAXN];
int fin[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];
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);
    }
  }
}
pair<int, int> st[8*MAXN];

void u(int l, int r, int tar, int idx, int val, int o) {
  if(l == r) {
    st[idx] = {val, o};
    return;
  }
  int mid = (l+r) >> 1;
  if(tar <= mid) u(l, mid, tar, 2*idx+1, val, o);
  else u(mid+1, r, tar, 2*idx+2, val, o);
  st[idx] = min(st[2*idx+1], st[2*idx+2]);
}
pair<int, int> qu(int l, int r, int constl, int constr, int idx) {
  if(l<=constl && constr<=r) return st[idx];
  int mid = (constl + constr) >> 1;
  if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
  if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
  return min(
    qu(l, r, constl, mid, 2*idx+1),
    qu(l, r, mid+1, constr, 2*idx+2)
  );
}

void update(int i, int v, int key) {
  u(0, 2*MAXN-1, i, 0, v, key);
}

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]);
  return qu(m1, m2, 0, 2*MAXN-1, 0).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 + 1;
  for(int i=e.size()-1; i>=0; i--) l[e[i]] = i + 1;
  for(int i=0; i<e.size(); i++) update(i + 1, dep[e[i]], e[i]);
  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][wow[i].size() - 1]);
    for(int j=0; j<wow[i].size(); 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);
      }
    }
  }
  lit.clear();
  for(int i=1; i<=n; i++) {
    for(int x: adj[i]) {
      if(set_of(i) != set_of(x) && lit[{set_of(i), set_of(x)}] == 0) {
        lit[{set_of(i), set_of(x)}] = 1;
        lit[{set_of(x), set_of(i)}] = 1;
        fin[set_of(i)]++;
        fin[set_of(x)]++;
      }
    }
  }
  int s = 0;
  for(int i=1; i<=n; i++) {
    s += (fin[i] == 1);
  }
  cout << (s + 1) / 2 << "\n";
}

Compilation message

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

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 7 ms 12184 KB Output is correct
9 Correct 7 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12180 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12120 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 6 ms 12108 KB Output is correct
22 Correct 8 ms 12196 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 7 ms 12108 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 7 ms 12184 KB Output is correct
9 Correct 7 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12180 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12120 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 6 ms 12108 KB Output is correct
22 Correct 8 ms 12196 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 7 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 14 ms 13148 KB Output is correct
27 Correct 11 ms 12992 KB Output is correct
28 Correct 12 ms 13352 KB Output is correct
29 Correct 13 ms 13132 KB Output is correct
30 Correct 11 ms 13048 KB Output is correct
31 Correct 7 ms 12096 KB Output is correct
32 Correct 12 ms 13432 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 11 ms 13004 KB Output is correct
35 Correct 14 ms 13116 KB Output is correct
36 Correct 11 ms 12992 KB Output is correct
37 Correct 12 ms 13132 KB Output is correct
38 Correct 7 ms 12108 KB Output is correct
39 Correct 11 ms 13132 KB Output is correct
40 Correct 11 ms 13016 KB Output is correct
41 Correct 11 ms 13004 KB Output is correct
42 Correct 12 ms 13192 KB Output is correct
43 Correct 12 ms 13388 KB Output is correct
44 Correct 7 ms 12108 KB Output is correct
45 Correct 13 ms 13284 KB Output is correct
46 Correct 12 ms 13132 KB Output is correct
47 Correct 7 ms 12108 KB Output is correct
48 Correct 12 ms 13132 KB Output is correct
49 Correct 12 ms 13132 KB Output is correct
50 Correct 14 ms 13320 KB Output is correct
51 Correct 11 ms 13004 KB Output is correct
52 Correct 11 ms 13084 KB Output is correct
53 Correct 12 ms 13132 KB Output is correct
54 Correct 12 ms 13016 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 7 ms 12184 KB Output is correct
9 Correct 7 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12180 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12120 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 6 ms 12108 KB Output is correct
22 Correct 8 ms 12196 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 7 ms 12108 KB Output is correct
25 Correct 7 ms 12136 KB Output is correct
26 Correct 211 ms 43144 KB Output is correct
27 Correct 206 ms 42796 KB Output is correct
28 Correct 11 ms 13004 KB Output is correct
29 Correct 7 ms 12108 KB Output is correct
30 Correct 7 ms 12164 KB Output is correct
31 Correct 206 ms 42872 KB Output is correct
32 Correct 11 ms 13068 KB Output is correct
33 Correct 217 ms 52344 KB Output is correct
34 Correct 195 ms 42924 KB Output is correct
35 Correct 11 ms 13004 KB Output is correct
36 Correct 229 ms 43520 KB Output is correct
37 Correct 11 ms 13040 KB Output is correct
38 Correct 11 ms 13032 KB Output is correct
39 Correct 204 ms 43692 KB Output is correct
40 Correct 11 ms 13388 KB Output is correct
41 Correct 197 ms 42800 KB Output is correct
42 Correct 218 ms 45568 KB Output is correct
43 Correct 7 ms 12236 KB Output is correct
44 Correct 237 ms 52884 KB Output is correct
45 Correct 200 ms 48756 KB Output is correct
46 Correct 12 ms 13068 KB Output is correct
47 Correct 11 ms 13004 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 205 ms 43116 KB Output is correct
2 Correct 386 ms 47656 KB Output is correct
3 Correct 13 ms 13136 KB Output is correct
4 Correct 12 ms 13004 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 8 ms 12076 KB Output is correct
7 Correct 11 ms 13128 KB Output is correct
8 Correct 269 ms 45768 KB Output is correct
9 Correct 11 ms 13044 KB Output is correct
10 Correct 207 ms 43404 KB Output is correct
11 Correct 7 ms 12164 KB Output is correct
12 Correct 204 ms 43032 KB Output is correct
13 Correct 265 ms 45744 KB Output is correct
14 Correct 376 ms 47600 KB Output is correct
15 Correct 195 ms 43436 KB Output is correct
16 Correct 12 ms 13176 KB Output is correct
17 Correct 6 ms 12108 KB Output is correct
18 Correct 368 ms 47908 KB Output is correct
19 Correct 390 ms 52536 KB Output is correct
20 Correct 14 ms 13136 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 270 ms 46524 KB Output is correct
23 Correct 11 ms 13132 KB Output is correct
24 Correct 251 ms 44280 KB Output is correct
25 Correct 411 ms 51492 KB Output is correct
26 Correct 12 ms 13132 KB Output is correct
27 Correct 14 ms 13316 KB Output is correct
28 Correct 11 ms 13132 KB Output is correct
29 Correct 12 ms 13004 KB Output is correct
30 Correct 12 ms 13132 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 6 ms 12108 KB Output is correct
3 Correct 6 ms 12108 KB Output is correct
4 Correct 6 ms 12108 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 6 ms 12108 KB Output is correct
8 Correct 7 ms 12184 KB Output is correct
9 Correct 7 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 7 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12180 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 7 ms 12120 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12108 KB Output is correct
20 Correct 6 ms 12108 KB Output is correct
21 Correct 6 ms 12108 KB Output is correct
22 Correct 8 ms 12196 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 7 ms 12108 KB Output is correct
25 Correct 8 ms 12108 KB Output is correct
26 Correct 14 ms 13148 KB Output is correct
27 Correct 11 ms 12992 KB Output is correct
28 Correct 12 ms 13352 KB Output is correct
29 Correct 13 ms 13132 KB Output is correct
30 Correct 11 ms 13048 KB Output is correct
31 Correct 7 ms 12096 KB Output is correct
32 Correct 12 ms 13432 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 11 ms 13004 KB Output is correct
35 Correct 14 ms 13116 KB Output is correct
36 Correct 11 ms 12992 KB Output is correct
37 Correct 12 ms 13132 KB Output is correct
38 Correct 7 ms 12108 KB Output is correct
39 Correct 11 ms 13132 KB Output is correct
40 Correct 11 ms 13016 KB Output is correct
41 Correct 11 ms 13004 KB Output is correct
42 Correct 12 ms 13192 KB Output is correct
43 Correct 12 ms 13388 KB Output is correct
44 Correct 7 ms 12108 KB Output is correct
45 Correct 13 ms 13284 KB Output is correct
46 Correct 12 ms 13132 KB Output is correct
47 Correct 7 ms 12108 KB Output is correct
48 Correct 12 ms 13132 KB Output is correct
49 Correct 12 ms 13132 KB Output is correct
50 Correct 14 ms 13320 KB Output is correct
51 Correct 11 ms 13004 KB Output is correct
52 Correct 11 ms 13084 KB Output is correct
53 Correct 12 ms 13132 KB Output is correct
54 Correct 12 ms 13016 KB Output is correct
55 Correct 7 ms 12136 KB Output is correct
56 Correct 211 ms 43144 KB Output is correct
57 Correct 206 ms 42796 KB Output is correct
58 Correct 11 ms 13004 KB Output is correct
59 Correct 7 ms 12108 KB Output is correct
60 Correct 7 ms 12164 KB Output is correct
61 Correct 206 ms 42872 KB Output is correct
62 Correct 11 ms 13068 KB Output is correct
63 Correct 217 ms 52344 KB Output is correct
64 Correct 195 ms 42924 KB Output is correct
65 Correct 11 ms 13004 KB Output is correct
66 Correct 229 ms 43520 KB Output is correct
67 Correct 11 ms 13040 KB Output is correct
68 Correct 11 ms 13032 KB Output is correct
69 Correct 204 ms 43692 KB Output is correct
70 Correct 11 ms 13388 KB Output is correct
71 Correct 197 ms 42800 KB Output is correct
72 Correct 218 ms 45568 KB Output is correct
73 Correct 7 ms 12236 KB Output is correct
74 Correct 237 ms 52884 KB Output is correct
75 Correct 200 ms 48756 KB Output is correct
76 Correct 12 ms 13068 KB Output is correct
77 Correct 11 ms 13004 KB Output is correct
78 Correct 205 ms 43116 KB Output is correct
79 Correct 386 ms 47656 KB Output is correct
80 Correct 13 ms 13136 KB Output is correct
81 Correct 12 ms 13004 KB Output is correct
82 Correct 6 ms 12108 KB Output is correct
83 Correct 8 ms 12076 KB Output is correct
84 Correct 11 ms 13128 KB Output is correct
85 Correct 269 ms 45768 KB Output is correct
86 Correct 11 ms 13044 KB Output is correct
87 Correct 207 ms 43404 KB Output is correct
88 Correct 7 ms 12164 KB Output is correct
89 Correct 204 ms 43032 KB Output is correct
90 Correct 265 ms 45744 KB Output is correct
91 Correct 376 ms 47600 KB Output is correct
92 Correct 195 ms 43436 KB Output is correct
93 Correct 12 ms 13176 KB Output is correct
94 Correct 6 ms 12108 KB Output is correct
95 Correct 368 ms 47908 KB Output is correct
96 Correct 390 ms 52536 KB Output is correct
97 Correct 14 ms 13136 KB Output is correct
98 Correct 7 ms 12108 KB Output is correct
99 Correct 270 ms 46524 KB Output is correct
100 Correct 11 ms 13132 KB Output is correct
101 Correct 251 ms 44280 KB Output is correct
102 Correct 411 ms 51492 KB Output is correct
103 Correct 12 ms 13132 KB Output is correct
104 Correct 14 ms 13316 KB Output is correct
105 Correct 11 ms 13132 KB Output is correct
106 Correct 12 ms 13004 KB Output is correct
107 Correct 12 ms 13132 KB Output is correct
108 Correct 1679 ms 180988 KB Output is correct
109 Correct 1469 ms 195932 KB Output is correct
110 Correct 1479 ms 211712 KB Output is correct
111 Correct 2800 ms 228764 KB Output is correct
112 Correct 2372 ms 219432 KB Output is correct
113 Correct 2624 ms 201252 KB Output is correct
114 Correct 1267 ms 173204 KB Output is correct
115 Correct 1249 ms 173080 KB Output is correct
116 Correct 1451 ms 183128 KB Output is correct
117 Correct 2716 ms 198924 KB Output is correct
118 Correct 1278 ms 173056 KB Output is correct
119 Correct 2787 ms 198800 KB Output is correct
120 Correct 2957 ms 220124 KB Output is correct
121 Correct 2821 ms 199572 KB Output is correct
122 Correct 1785 ms 192464 KB Output is correct
123 Execution timed out 3017 ms 200004 KB Time limit exceeded
124 Halted 0 ms 0 KB -