oj.uz

답안 #521072

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521072 2022-01-31T17:11:19 Z cig32 Mergers (JOI19_mergers) C++17
70 / 100
 610 ms 262148 KB 
#include "bits/stdc++.h"
#define int long long
using namespace std;
const int MAXN = 5e5 + 10;
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[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);
      }
    }
  }
  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:62: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]
   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: 'long long int' and 'std::vector<long long 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: 'long long int' and 'std::vector<long long 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: 'long long int' and 'std::vector<long long 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: 'long long int' and 'std::vector<long long 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

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12132 KB Output is correct
3 Correct 7 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 7 ms 12180 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 7 ms 12180 KB Output is correct
9 Correct 7 ms 12048 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 7 ms 12176 KB Output is correct
13 Correct 6 ms 12048 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 12032 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12084 KB Output is correct
20 Correct 8 ms 12048 KB Output is correct
21 Correct 6 ms 12176 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 9 ms 12184 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12132 KB Output is correct
3 Correct 7 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 7 ms 12180 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 7 ms 12180 KB Output is correct
9 Correct 7 ms 12048 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 7 ms 12176 KB Output is correct
13 Correct 6 ms 12048 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 12032 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12084 KB Output is correct
20 Correct 8 ms 12048 KB Output is correct
21 Correct 6 ms 12176 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 9 ms 12184 KB Output is correct
25 Correct 7 ms 12108 KB Output is correct
26 Correct 12 ms 14112 KB Output is correct
27 Correct 11 ms 14028 KB Output is correct
28 Correct 12 ms 14284 KB Output is correct
29 Correct 13 ms 14156 KB Output is correct
30 Correct 14 ms 13964 KB Output is correct
31 Correct 6 ms 12176 KB Output is correct
32 Correct 12 ms 14412 KB Output is correct
33 Correct 7 ms 12176 KB Output is correct
34 Correct 13 ms 13984 KB Output is correct
35 Correct 13 ms 14116 KB Output is correct
36 Correct 11 ms 14028 KB Output is correct
37 Correct 12 ms 14112 KB Output is correct
38 Correct 7 ms 12176 KB Output is correct
39 Correct 12 ms 14028 KB Output is correct
40 Correct 11 ms 14028 KB Output is correct
41 Correct 11 ms 14028 KB Output is correct
42 Correct 11 ms 14156 KB Output is correct
43 Correct 11 ms 14368 KB Output is correct
44 Correct 8 ms 12180 KB Output is correct
45 Correct 11 ms 14156 KB Output is correct
46 Correct 12 ms 14028 KB Output is correct
47 Correct 7 ms 12108 KB Output is correct
48 Correct 11 ms 14048 KB Output is correct
49 Correct 12 ms 14156 KB Output is correct
50 Correct 13 ms 14284 KB Output is correct
51 Correct 16 ms 13976 KB Output is correct
52 Correct 12 ms 14032 KB Output is correct
53 Correct 12 ms 14028 KB Output is correct
54 Correct 13 ms 14084 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12132 KB Output is correct
3 Correct 7 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 7 ms 12180 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 7 ms 12180 KB Output is correct
9 Correct 7 ms 12048 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 7 ms 12176 KB Output is correct
13 Correct 6 ms 12048 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 12032 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12084 KB Output is correct
20 Correct 8 ms 12048 KB Output is correct
21 Correct 6 ms 12176 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 9 ms 12184 KB Output is correct
25 Correct 7 ms 12108 KB Output is correct
26 Correct 206 ms 88964 KB Output is correct
27 Correct 198 ms 88740 KB Output is correct
28 Correct 13 ms 14028 KB Output is correct
29 Correct 7 ms 12108 KB Output is correct
30 Correct 8 ms 12108 KB Output is correct
31 Correct 223 ms 88860 KB Output is correct
32 Correct 10 ms 14028 KB Output is correct
33 Correct 215 ms 98284 KB Output is correct
34 Correct 216 ms 88808 KB Output is correct
35 Correct 13 ms 14028 KB Output is correct
36 Correct 204 ms 89356 KB Output is correct
37 Correct 11 ms 14016 KB Output is correct
38 Correct 12 ms 14028 KB Output is correct
39 Correct 194 ms 89340 KB Output is correct
40 Correct 13 ms 14284 KB Output is correct
41 Correct 220 ms 88712 KB Output is correct
42 Correct 212 ms 91452 KB Output is correct
43 Correct 7 ms 12108 KB Output is correct
44 Correct 209 ms 98708 KB Output is correct
45 Correct 249 ms 94620 KB Output is correct
46 Correct 12 ms 14028 KB Output is correct
47 Correct 12 ms 13980 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 88948 KB Output is correct
2 Correct 502 ms 93692 KB Output is correct
3 Correct 13 ms 14156 KB Output is correct
4 Correct 11 ms 14028 KB Output is correct
5 Correct 6 ms 12064 KB Output is correct
6 Correct 7 ms 12180 KB Output is correct
7 Correct 13 ms 14020 KB Output is correct
8 Correct 242 ms 91668 KB Output is correct
9 Correct 12 ms 14032 KB Output is correct
10 Correct 213 ms 89304 KB Output is correct
11 Correct 7 ms 12140 KB Output is correct
12 Correct 204 ms 88852 KB Output is correct
13 Correct 279 ms 91540 KB Output is correct
14 Correct 387 ms 93524 KB Output is correct
15 Correct 233 ms 89276 KB Output is correct
16 Correct 12 ms 14156 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 398 ms 93868 KB Output is correct
19 Correct 427 ms 98384 KB Output is correct
20 Correct 12 ms 14028 KB Output is correct
21 Correct 7 ms 12128 KB Output is correct
22 Correct 247 ms 92392 KB Output is correct
23 Correct 12 ms 13980 KB Output is correct
24 Correct 266 ms 89960 KB Output is correct
25 Correct 450 ms 97392 KB Output is correct
26 Correct 13 ms 14112 KB Output is correct
27 Correct 14 ms 14284 KB Output is correct
28 Correct 13 ms 13988 KB Output is correct
29 Correct 10 ms 13980 KB Output is correct
30 Correct 11 ms 14156 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 12108 KB Output is correct
2 Correct 7 ms 12132 KB Output is correct
3 Correct 7 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 7 ms 12180 KB Output is correct
7 Correct 8 ms 12108 KB Output is correct
8 Correct 7 ms 12180 KB Output is correct
9 Correct 7 ms 12048 KB Output is correct
10 Correct 6 ms 12108 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 7 ms 12176 KB Output is correct
13 Correct 6 ms 12048 KB Output is correct
14 Correct 6 ms 12108 KB Output is correct
15 Correct 6 ms 12108 KB Output is correct
16 Correct 7 ms 12108 KB Output is correct
17 Correct 7 ms 12032 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 6 ms 12084 KB Output is correct
20 Correct 8 ms 12048 KB Output is correct
21 Correct 6 ms 12176 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 9 ms 12184 KB Output is correct
25 Correct 7 ms 12108 KB Output is correct
26 Correct 12 ms 14112 KB Output is correct
27 Correct 11 ms 14028 KB Output is correct
28 Correct 12 ms 14284 KB Output is correct
29 Correct 13 ms 14156 KB Output is correct
30 Correct 14 ms 13964 KB Output is correct
31 Correct 6 ms 12176 KB Output is correct
32 Correct 12 ms 14412 KB Output is correct
33 Correct 7 ms 12176 KB Output is correct
34 Correct 13 ms 13984 KB Output is correct
35 Correct 13 ms 14116 KB Output is correct
36 Correct 11 ms 14028 KB Output is correct
37 Correct 12 ms 14112 KB Output is correct
38 Correct 7 ms 12176 KB Output is correct
39 Correct 12 ms 14028 KB Output is correct
40 Correct 11 ms 14028 KB Output is correct
41 Correct 11 ms 14028 KB Output is correct
42 Correct 11 ms 14156 KB Output is correct
43 Correct 11 ms 14368 KB Output is correct
44 Correct 8 ms 12180 KB Output is correct
45 Correct 11 ms 14156 KB Output is correct
46 Correct 12 ms 14028 KB Output is correct
47 Correct 7 ms 12108 KB Output is correct
48 Correct 11 ms 14048 KB Output is correct
49 Correct 12 ms 14156 KB Output is correct
50 Correct 13 ms 14284 KB Output is correct
51 Correct 16 ms 13976 KB Output is correct
52 Correct 12 ms 14032 KB Output is correct
53 Correct 12 ms 14028 KB Output is correct
54 Correct 13 ms 14084 KB Output is correct
55 Correct 7 ms 12108 KB Output is correct
56 Correct 206 ms 88964 KB Output is correct
57 Correct 198 ms 88740 KB Output is correct
58 Correct 13 ms 14028 KB Output is correct
59 Correct 7 ms 12108 KB Output is correct
60 Correct 8 ms 12108 KB Output is correct
61 Correct 223 ms 88860 KB Output is correct
62 Correct 10 ms 14028 KB Output is correct
63 Correct 215 ms 98284 KB Output is correct
64 Correct 216 ms 88808 KB Output is correct
65 Correct 13 ms 14028 KB Output is correct
66 Correct 204 ms 89356 KB Output is correct
67 Correct 11 ms 14016 KB Output is correct
68 Correct 12 ms 14028 KB Output is correct
69 Correct 194 ms 89340 KB Output is correct
70 Correct 13 ms 14284 KB Output is correct
71 Correct 220 ms 88712 KB Output is correct
72 Correct 212 ms 91452 KB Output is correct
73 Correct 7 ms 12108 KB Output is correct
74 Correct 209 ms 98708 KB Output is correct
75 Correct 249 ms 94620 KB Output is correct
76 Correct 12 ms 14028 KB Output is correct
77 Correct 12 ms 13980 KB Output is correct
78 Correct 200 ms 88948 KB Output is correct
79 Correct 502 ms 93692 KB Output is correct
80 Correct 13 ms 14156 KB Output is correct
81 Correct 11 ms 14028 KB Output is correct
82 Correct 6 ms 12064 KB Output is correct
83 Correct 7 ms 12180 KB Output is correct
84 Correct 13 ms 14020 KB Output is correct
85 Correct 242 ms 91668 KB Output is correct
86 Correct 12 ms 14032 KB Output is correct
87 Correct 213 ms 89304 KB Output is correct
88 Correct 7 ms 12140 KB Output is correct
89 Correct 204 ms 88852 KB Output is correct
90 Correct 279 ms 91540 KB Output is correct
91 Correct 387 ms 93524 KB Output is correct
92 Correct 233 ms 89276 KB Output is correct
93 Correct 12 ms 14156 KB Output is correct
94 Correct 7 ms 12108 KB Output is correct
95 Correct 398 ms 93868 KB Output is correct
96 Correct 427 ms 98384 KB Output is correct
97 Correct 12 ms 14028 KB Output is correct
98 Correct 7 ms 12128 KB Output is correct
99 Correct 247 ms 92392 KB Output is correct
100 Correct 12 ms 13980 KB Output is correct
101 Correct 266 ms 89960 KB Output is correct
102 Correct 450 ms 97392 KB Output is correct
103 Correct 13 ms 14112 KB Output is correct
104 Correct 14 ms 14284 KB Output is correct
105 Correct 13 ms 13988 KB Output is correct
106 Correct 10 ms 13980 KB Output is correct
107 Correct 11 ms 14156 KB Output is correct
108 Runtime error 610 ms 262148 KB Execution killed with signal 9
109 Halted 0 ms 0 KB -