oj.uz

답안 #521067

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521067 2022-01-31T17:05:44 Z cig32 Mergers (JOI19_mergers) C++17
70 / 100
 1170 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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23784 KB Output is correct
2 Correct 12 ms 23924 KB Output is correct
3 Correct 13 ms 23828 KB Output is correct
4 Correct 15 ms 23884 KB Output is correct
5 Correct 11 ms 23788 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 12 ms 23884 KB Output is correct
8 Correct 13 ms 23844 KB Output is correct
9 Correct 12 ms 23788 KB Output is correct
10 Correct 14 ms 23792 KB Output is correct
11 Correct 15 ms 23908 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 17 ms 23788 KB Output is correct
14 Correct 13 ms 23916 KB Output is correct
15 Correct 14 ms 23908 KB Output is correct
16 Correct 14 ms 23852 KB Output is correct
17 Correct 15 ms 23796 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 14 ms 23884 KB Output is correct
20 Correct 15 ms 23812 KB Output is correct
21 Correct 14 ms 23904 KB Output is correct
22 Correct 15 ms 23920 KB Output is correct
23 Correct 15 ms 23756 KB Output is correct
24 Correct 14 ms 23756 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23784 KB Output is correct
2 Correct 12 ms 23924 KB Output is correct
3 Correct 13 ms 23828 KB Output is correct
4 Correct 15 ms 23884 KB Output is correct
5 Correct 11 ms 23788 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 12 ms 23884 KB Output is correct
8 Correct 13 ms 23844 KB Output is correct
9 Correct 12 ms 23788 KB Output is correct
10 Correct 14 ms 23792 KB Output is correct
11 Correct 15 ms 23908 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 17 ms 23788 KB Output is correct
14 Correct 13 ms 23916 KB Output is correct
15 Correct 14 ms 23908 KB Output is correct
16 Correct 14 ms 23852 KB Output is correct
17 Correct 15 ms 23796 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 14 ms 23884 KB Output is correct
20 Correct 15 ms 23812 KB Output is correct
21 Correct 14 ms 23904 KB Output is correct
22 Correct 15 ms 23920 KB Output is correct
23 Correct 15 ms 23756 KB Output is correct
24 Correct 14 ms 23756 KB Output is correct
25 Correct 13 ms 23912 KB Output is correct
26 Correct 22 ms 25452 KB Output is correct
27 Correct 20 ms 25084 KB Output is correct
28 Correct 19 ms 25552 KB Output is correct
29 Correct 21 ms 25728 KB Output is correct
30 Correct 20 ms 25112 KB Output is correct
31 Correct 14 ms 23812 KB Output is correct
32 Correct 21 ms 25440 KB Output is correct
33 Correct 13 ms 23892 KB Output is correct
34 Correct 18 ms 25120 KB Output is correct
35 Correct 23 ms 25724 KB Output is correct
36 Correct 21 ms 25064 KB Output is correct
37 Correct 19 ms 25200 KB Output is correct
38 Correct 16 ms 23924 KB Output is correct
39 Correct 20 ms 25208 KB Output is correct
40 Correct 21 ms 25036 KB Output is correct
41 Correct 20 ms 25032 KB Output is correct
42 Correct 20 ms 25216 KB Output is correct
43 Correct 17 ms 25292 KB Output is correct
44 Correct 13 ms 23884 KB Output is correct
45 Correct 18 ms 25308 KB Output is correct
46 Correct 20 ms 25244 KB Output is correct
47 Correct 13 ms 23884 KB Output is correct
48 Correct 18 ms 25164 KB Output is correct
49 Correct 22 ms 25724 KB Output is correct
50 Correct 21 ms 25716 KB Output is correct
51 Correct 19 ms 25080 KB Output is correct
52 Correct 19 ms 25044 KB Output is correct
53 Correct 18 ms 25276 KB Output is correct
54 Correct 20 ms 25036 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23784 KB Output is correct
2 Correct 12 ms 23924 KB Output is correct
3 Correct 13 ms 23828 KB Output is correct
4 Correct 15 ms 23884 KB Output is correct
5 Correct 11 ms 23788 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 12 ms 23884 KB Output is correct
8 Correct 13 ms 23844 KB Output is correct
9 Correct 12 ms 23788 KB Output is correct
10 Correct 14 ms 23792 KB Output is correct
11 Correct 15 ms 23908 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 17 ms 23788 KB Output is correct
14 Correct 13 ms 23916 KB Output is correct
15 Correct 14 ms 23908 KB Output is correct
16 Correct 14 ms 23852 KB Output is correct
17 Correct 15 ms 23796 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 14 ms 23884 KB Output is correct
20 Correct 15 ms 23812 KB Output is correct
21 Correct 14 ms 23904 KB Output is correct
22 Correct 15 ms 23920 KB Output is correct
23 Correct 15 ms 23756 KB Output is correct
24 Correct 14 ms 23756 KB Output is correct
25 Correct 14 ms 23808 KB Output is correct
26 Correct 236 ms 70644 KB Output is correct
27 Correct 205 ms 70244 KB Output is correct
28 Correct 16 ms 25036 KB Output is correct
29 Correct 14 ms 23916 KB Output is correct
30 Correct 11 ms 23888 KB Output is correct
31 Correct 224 ms 70336 KB Output is correct
32 Correct 18 ms 25084 KB Output is correct
33 Correct 233 ms 77528 KB Output is correct
34 Correct 198 ms 70292 KB Output is correct
35 Correct 18 ms 25032 KB Output is correct
36 Correct 208 ms 70988 KB Output is correct
37 Correct 20 ms 25076 KB Output is correct
38 Correct 20 ms 25036 KB Output is correct
39 Correct 189 ms 70892 KB Output is correct
40 Correct 22 ms 25344 KB Output is correct
41 Correct 200 ms 70328 KB Output is correct
42 Correct 208 ms 72516 KB Output is correct
43 Correct 15 ms 23924 KB Output is correct
44 Correct 216 ms 77908 KB Output is correct
45 Correct 203 ms 73904 KB Output is correct
46 Correct 19 ms 25116 KB Output is correct
47 Correct 20 ms 25088 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 233 ms 71168 KB Output is correct
2 Correct 442 ms 91444 KB Output is correct
3 Correct 20 ms 25444 KB Output is correct
4 Correct 20 ms 25072 KB Output is correct
5 Correct 15 ms 23884 KB Output is correct
6 Correct 17 ms 23892 KB Output is correct
7 Correct 21 ms 25000 KB Output is correct
8 Correct 235 ms 74164 KB Output is correct
9 Correct 22 ms 25036 KB Output is correct
10 Correct 208 ms 70392 KB Output is correct
11 Correct 15 ms 23912 KB Output is correct
12 Correct 211 ms 71668 KB Output is correct
13 Correct 288 ms 75596 KB Output is correct
14 Correct 445 ms 90684 KB Output is correct
15 Correct 221 ms 70904 KB Output is correct
16 Correct 20 ms 25164 KB Output is correct
17 Correct 14 ms 23884 KB Output is correct
18 Correct 453 ms 87948 KB Output is correct
19 Correct 399 ms 95804 KB Output is correct
20 Correct 19 ms 25172 KB Output is correct
21 Correct 16 ms 23932 KB Output is correct
22 Correct 258 ms 76272 KB Output is correct
23 Correct 23 ms 25080 KB Output is correct
24 Correct 234 ms 72404 KB Output is correct
25 Correct 462 ms 93068 KB Output is correct
26 Correct 20 ms 25672 KB Output is correct
27 Correct 21 ms 25740 KB Output is correct
28 Correct 19 ms 25036 KB Output is correct
29 Correct 20 ms 25036 KB Output is correct
30 Correct 20 ms 25212 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23784 KB Output is correct
2 Correct 12 ms 23924 KB Output is correct
3 Correct 13 ms 23828 KB Output is correct
4 Correct 15 ms 23884 KB Output is correct
5 Correct 11 ms 23788 KB Output is correct
6 Correct 12 ms 23844 KB Output is correct
7 Correct 12 ms 23884 KB Output is correct
8 Correct 13 ms 23844 KB Output is correct
9 Correct 12 ms 23788 KB Output is correct
10 Correct 14 ms 23792 KB Output is correct
11 Correct 15 ms 23908 KB Output is correct
12 Correct 16 ms 23916 KB Output is correct
13 Correct 17 ms 23788 KB Output is correct
14 Correct 13 ms 23916 KB Output is correct
15 Correct 14 ms 23908 KB Output is correct
16 Correct 14 ms 23852 KB Output is correct
17 Correct 15 ms 23796 KB Output is correct
18 Correct 13 ms 23884 KB Output is correct
19 Correct 14 ms 23884 KB Output is correct
20 Correct 15 ms 23812 KB Output is correct
21 Correct 14 ms 23904 KB Output is correct
22 Correct 15 ms 23920 KB Output is correct
23 Correct 15 ms 23756 KB Output is correct
24 Correct 14 ms 23756 KB Output is correct
25 Correct 13 ms 23912 KB Output is correct
26 Correct 22 ms 25452 KB Output is correct
27 Correct 20 ms 25084 KB Output is correct
28 Correct 19 ms 25552 KB Output is correct
29 Correct 21 ms 25728 KB Output is correct
30 Correct 20 ms 25112 KB Output is correct
31 Correct 14 ms 23812 KB Output is correct
32 Correct 21 ms 25440 KB Output is correct
33 Correct 13 ms 23892 KB Output is correct
34 Correct 18 ms 25120 KB Output is correct
35 Correct 23 ms 25724 KB Output is correct
36 Correct 21 ms 25064 KB Output is correct
37 Correct 19 ms 25200 KB Output is correct
38 Correct 16 ms 23924 KB Output is correct
39 Correct 20 ms 25208 KB Output is correct
40 Correct 21 ms 25036 KB Output is correct
41 Correct 20 ms 25032 KB Output is correct
42 Correct 20 ms 25216 KB Output is correct
43 Correct 17 ms 25292 KB Output is correct
44 Correct 13 ms 23884 KB Output is correct
45 Correct 18 ms 25308 KB Output is correct
46 Correct 20 ms 25244 KB Output is correct
47 Correct 13 ms 23884 KB Output is correct
48 Correct 18 ms 25164 KB Output is correct
49 Correct 22 ms 25724 KB Output is correct
50 Correct 21 ms 25716 KB Output is correct
51 Correct 19 ms 25080 KB Output is correct
52 Correct 19 ms 25044 KB Output is correct
53 Correct 18 ms 25276 KB Output is correct
54 Correct 20 ms 25036 KB Output is correct
55 Correct 14 ms 23808 KB Output is correct
56 Correct 236 ms 70644 KB Output is correct
57 Correct 205 ms 70244 KB Output is correct
58 Correct 16 ms 25036 KB Output is correct
59 Correct 14 ms 23916 KB Output is correct
60 Correct 11 ms 23888 KB Output is correct
61 Correct 224 ms 70336 KB Output is correct
62 Correct 18 ms 25084 KB Output is correct
63 Correct 233 ms 77528 KB Output is correct
64 Correct 198 ms 70292 KB Output is correct
65 Correct 18 ms 25032 KB Output is correct
66 Correct 208 ms 70988 KB Output is correct
67 Correct 20 ms 25076 KB Output is correct
68 Correct 20 ms 25036 KB Output is correct
69 Correct 189 ms 70892 KB Output is correct
70 Correct 22 ms 25344 KB Output is correct
71 Correct 200 ms 70328 KB Output is correct
72 Correct 208 ms 72516 KB Output is correct
73 Correct 15 ms 23924 KB Output is correct
74 Correct 216 ms 77908 KB Output is correct
75 Correct 203 ms 73904 KB Output is correct
76 Correct 19 ms 25116 KB Output is correct
77 Correct 20 ms 25088 KB Output is correct
78 Correct 233 ms 71168 KB Output is correct
79 Correct 442 ms 91444 KB Output is correct
80 Correct 20 ms 25444 KB Output is correct
81 Correct 20 ms 25072 KB Output is correct
82 Correct 15 ms 23884 KB Output is correct
83 Correct 17 ms 23892 KB Output is correct
84 Correct 21 ms 25000 KB Output is correct
85 Correct 235 ms 74164 KB Output is correct
86 Correct 22 ms 25036 KB Output is correct
87 Correct 208 ms 70392 KB Output is correct
88 Correct 15 ms 23912 KB Output is correct
89 Correct 211 ms 71668 KB Output is correct
90 Correct 288 ms 75596 KB Output is correct
91 Correct 445 ms 90684 KB Output is correct
92 Correct 221 ms 70904 KB Output is correct
93 Correct 20 ms 25164 KB Output is correct
94 Correct 14 ms 23884 KB Output is correct
95 Correct 453 ms 87948 KB Output is correct
96 Correct 399 ms 95804 KB Output is correct
97 Correct 19 ms 25172 KB Output is correct
98 Correct 16 ms 23932 KB Output is correct
99 Correct 258 ms 76272 KB Output is correct
100 Correct 23 ms 25080 KB Output is correct
101 Correct 234 ms 72404 KB Output is correct
102 Correct 462 ms 93068 KB Output is correct
103 Correct 20 ms 25672 KB Output is correct
104 Correct 21 ms 25740 KB Output is correct
105 Correct 19 ms 25036 KB Output is correct
106 Correct 20 ms 25036 KB Output is correct
107 Correct 20 ms 25212 KB Output is correct
108 Runtime error 1170 ms 262148 KB Execution killed with signal 9
109 Halted 0 ms 0 KB -