oj.uz

Submission #521081

# Submission time Handle Problem Language Result Execution time Memory
521081 2022-01-31T17:21:37 Z cig32 Mergers (JOI19_mergers) C++17
70 / 100
 3000 ms 102428 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, 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, 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][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);
      }
    }
  }
  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 7 ms 12108 KB Output is correct
2 Correct 7 ms 12140 KB Output is correct
3 Correct 7 ms 12108 KB Output is correct
4 Correct 6 ms 12152 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 8 ms 12088 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12100 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12108 KB Output is correct
18 Correct 7 ms 12144 KB Output is correct
19 Correct 6 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 12152 KB Output is correct
23 Correct 6 ms 12148 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 7 ms 12108 KB Output is correct
2 Correct 7 ms 12140 KB Output is correct
3 Correct 7 ms 12108 KB Output is correct
4 Correct 6 ms 12152 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 8 ms 12088 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12100 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12108 KB Output is correct
18 Correct 7 ms 12144 KB Output is correct
19 Correct 6 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 12152 KB Output is correct
23 Correct 6 ms 12148 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 13164 KB Output is correct
27 Correct 11 ms 13056 KB Output is correct
28 Correct 12 ms 13260 KB Output is correct
29 Correct 16 ms 13132 KB Output is correct
30 Correct 12 ms 13004 KB Output is correct
31 Correct 6 ms 12108 KB Output is correct
32 Correct 12 ms 13388 KB Output is correct
33 Correct 7 ms 12108 KB Output is correct
34 Correct 11 ms 13048 KB Output is correct
35 Correct 13 ms 13132 KB Output is correct
36 Correct 12 ms 13008 KB Output is correct
37 Correct 14 ms 13132 KB Output is correct
38 Correct 6 ms 12108 KB Output is correct
39 Correct 15 ms 13132 KB Output is correct
40 Correct 12 ms 12960 KB Output is correct
41 Correct 11 ms 13004 KB Output is correct
42 Correct 15 ms 13132 KB Output is correct
43 Correct 12 ms 13320 KB Output is correct
44 Correct 6 ms 12084 KB Output is correct
45 Correct 12 ms 13172 KB Output is correct
46 Correct 12 ms 13132 KB Output is correct
47 Correct 7 ms 12188 KB Output is correct
48 Correct 12 ms 13004 KB Output is correct
49 Correct 14 ms 13216 KB Output is correct
50 Correct 13 ms 13260 KB Output is correct
51 Correct 13 ms 13004 KB Output is correct
52 Correct 11 ms 13004 KB Output is correct
53 Correct 14 ms 13148 KB Output is correct
54 Correct 12 ms 13060 KB Output is correct

Subtask #3
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12140 KB Output is correct
3 Correct 7 ms 12108 KB Output is correct
4 Correct 6 ms 12152 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 8 ms 12088 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12100 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12108 KB Output is correct
18 Correct 7 ms 12144 KB Output is correct
19 Correct 6 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 12152 KB Output is correct
23 Correct 6 ms 12148 KB Output is correct
24 Correct 7 ms 12108 KB Output is correct
25 Correct 6 ms 12108 KB Output is correct
26 Correct 252 ms 43056 KB Output is correct
27 Correct 303 ms 42844 KB Output is correct
28 Correct 15 ms 13004 KB Output is correct
29 Correct 7 ms 12108 KB Output is correct
30 Correct 6 ms 12108 KB Output is correct
31 Correct 214 ms 42888 KB Output is correct
32 Correct 12 ms 13124 KB Output is correct
33 Correct 240 ms 52424 KB Output is correct
34 Correct 225 ms 42908 KB Output is correct
35 Correct 12 ms 13004 KB Output is correct
36 Correct 221 ms 43456 KB Output is correct
37 Correct 12 ms 13004 KB Output is correct
38 Correct 15 ms 13036 KB Output is correct
39 Correct 246 ms 43516 KB Output is correct
40 Correct 12 ms 13388 KB Output is correct
41 Correct 251 ms 42792 KB Output is correct
42 Correct 230 ms 45624 KB Output is correct
43 Correct 7 ms 12108 KB Output is correct
44 Correct 253 ms 52700 KB Output is correct
45 Correct 231 ms 48688 KB Output is correct
46 Correct 12 ms 13004 KB Output is correct
47 Correct 12 ms 12976 KB Output is correct

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 263 ms 43140 KB Output is correct
2 Correct 440 ms 47564 KB Output is correct
3 Correct 14 ms 13132 KB Output is correct
4 Correct 12 ms 13048 KB Output is correct
5 Correct 7 ms 12064 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 11 ms 13004 KB Output is correct
8 Correct 280 ms 45740 KB Output is correct
9 Correct 12 ms 13004 KB Output is correct
10 Correct 232 ms 43396 KB Output is correct
11 Correct 7 ms 12160 KB Output is correct
12 Correct 230 ms 43024 KB Output is correct
13 Correct 284 ms 45620 KB Output is correct
14 Correct 404 ms 47504 KB Output is correct
15 Correct 223 ms 43348 KB Output is correct
16 Correct 12 ms 13080 KB Output is correct
17 Correct 6 ms 12088 KB Output is correct
18 Correct 392 ms 47968 KB Output is correct
19 Correct 398 ms 52504 KB Output is correct
20 Correct 12 ms 13120 KB Output is correct
21 Correct 6 ms 12108 KB Output is correct
22 Correct 295 ms 46556 KB Output is correct
23 Correct 13 ms 13004 KB Output is correct
24 Correct 282 ms 44084 KB Output is correct
25 Correct 410 ms 51380 KB Output is correct
26 Correct 13 ms 13152 KB Output is correct
27 Correct 18 ms 13356 KB Output is correct
28 Correct 15 ms 13060 KB Output is correct
29 Correct 11 ms 13004 KB Output is correct
30 Correct 14 ms 13084 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12140 KB Output is correct
3 Correct 7 ms 12108 KB Output is correct
4 Correct 6 ms 12152 KB Output is correct
5 Correct 7 ms 12040 KB Output is correct
6 Correct 7 ms 12108 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 8 ms 12088 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 6 ms 12108 KB Output is correct
13 Correct 6 ms 12108 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12100 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12108 KB Output is correct
18 Correct 7 ms 12144 KB Output is correct
19 Correct 6 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 12152 KB Output is correct
23 Correct 6 ms 12148 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 13164 KB Output is correct
27 Correct 11 ms 13056 KB Output is correct
28 Correct 12 ms 13260 KB Output is correct
29 Correct 16 ms 13132 KB Output is correct
30 Correct 12 ms 13004 KB Output is correct
31 Correct 6 ms 12108 KB Output is correct
32 Correct 12 ms 13388 KB Output is correct
33 Correct 7 ms 12108 KB Output is correct
34 Correct 11 ms 13048 KB Output is correct
35 Correct 13 ms 13132 KB Output is correct
36 Correct 12 ms 13008 KB Output is correct
37 Correct 14 ms 13132 KB Output is correct
38 Correct 6 ms 12108 KB Output is correct
39 Correct 15 ms 13132 KB Output is correct
40 Correct 12 ms 12960 KB Output is correct
41 Correct 11 ms 13004 KB Output is correct
42 Correct 15 ms 13132 KB Output is correct
43 Correct 12 ms 13320 KB Output is correct
44 Correct 6 ms 12084 KB Output is correct
45 Correct 12 ms 13172 KB Output is correct
46 Correct 12 ms 13132 KB Output is correct
47 Correct 7 ms 12188 KB Output is correct
48 Correct 12 ms 13004 KB Output is correct
49 Correct 14 ms 13216 KB Output is correct
50 Correct 13 ms 13260 KB Output is correct
51 Correct 13 ms 13004 KB Output is correct
52 Correct 11 ms 13004 KB Output is correct
53 Correct 14 ms 13148 KB Output is correct
54 Correct 12 ms 13060 KB Output is correct
55 Correct 6 ms 12108 KB Output is correct
56 Correct 252 ms 43056 KB Output is correct
57 Correct 303 ms 42844 KB Output is correct
58 Correct 15 ms 13004 KB Output is correct
59 Correct 7 ms 12108 KB Output is correct
60 Correct 6 ms 12108 KB Output is correct
61 Correct 214 ms 42888 KB Output is correct
62 Correct 12 ms 13124 KB Output is correct
63 Correct 240 ms 52424 KB Output is correct
64 Correct 225 ms 42908 KB Output is correct
65 Correct 12 ms 13004 KB Output is correct
66 Correct 221 ms 43456 KB Output is correct
67 Correct 12 ms 13004 KB Output is correct
68 Correct 15 ms 13036 KB Output is correct
69 Correct 246 ms 43516 KB Output is correct
70 Correct 12 ms 13388 KB Output is correct
71 Correct 251 ms 42792 KB Output is correct
72 Correct 230 ms 45624 KB Output is correct
73 Correct 7 ms 12108 KB Output is correct
74 Correct 253 ms 52700 KB Output is correct
75 Correct 231 ms 48688 KB Output is correct
76 Correct 12 ms 13004 KB Output is correct
77 Correct 12 ms 12976 KB Output is correct
78 Correct 263 ms 43140 KB Output is correct
79 Correct 440 ms 47564 KB Output is correct
80 Correct 14 ms 13132 KB Output is correct
81 Correct 12 ms 13048 KB Output is correct
82 Correct 7 ms 12064 KB Output is correct
83 Correct 6 ms 12108 KB Output is correct
84 Correct 11 ms 13004 KB Output is correct
85 Correct 280 ms 45740 KB Output is correct
86 Correct 12 ms 13004 KB Output is correct
87 Correct 232 ms 43396 KB Output is correct
88 Correct 7 ms 12160 KB Output is correct
89 Correct 230 ms 43024 KB Output is correct
90 Correct 284 ms 45620 KB Output is correct
91 Correct 404 ms 47504 KB Output is correct
92 Correct 223 ms 43348 KB Output is correct
93 Correct 12 ms 13080 KB Output is correct
94 Correct 6 ms 12088 KB Output is correct
95 Correct 392 ms 47968 KB Output is correct
96 Correct 398 ms 52504 KB Output is correct
97 Correct 12 ms 13120 KB Output is correct
98 Correct 6 ms 12108 KB Output is correct
99 Correct 295 ms 46556 KB Output is correct
100 Correct 13 ms 13004 KB Output is correct
101 Correct 282 ms 44084 KB Output is correct
102 Correct 410 ms 51380 KB Output is correct
103 Correct 13 ms 13152 KB Output is correct
104 Correct 18 ms 13356 KB Output is correct
105 Correct 15 ms 13060 KB Output is correct
106 Correct 11 ms 13004 KB Output is correct
107 Correct 14 ms 13084 KB Output is correct
108 Execution timed out 3091 ms 102428 KB Time limit exceeded
109 Halted 0 ms 0 KB -