oj.uz

답안 #521084

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
521084 2022-01-31T17:25:15 Z cig32 Mergers (JOI19_mergers) C++17
100 / 100
 2924 ms 218816 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() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  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: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++) r[e[i]] = i + 1;
      |                ~^~~~~~~~~
mergers.cpp:93: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]
   93 |   for(int i=0; i<e.size(); i++) update(i + 1, dep[e[i]], e[i]);
      |                ~^~~~~~~~~
mergers.cpp:102: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]
  102 |     for(int j=0; j<wow[i].size(); j++) {
      |                  ~^~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 7 ms 12200 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 12188 KB Output is correct
6 Correct 6 ms 12212 KB Output is correct
7 Correct 6 ms 12112 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 5 ms 12108 KB Output is correct
11 Correct 6 ms 12100 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 12216 KB Output is correct
15 Correct 6 ms 12220 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12188 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12188 KB Output is correct
20 Correct 5 ms 12108 KB Output is correct
21 Correct 6 ms 12200 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 7 ms 12200 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 12188 KB Output is correct
6 Correct 6 ms 12212 KB Output is correct
7 Correct 6 ms 12112 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 5 ms 12108 KB Output is correct
11 Correct 6 ms 12100 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 12216 KB Output is correct
15 Correct 6 ms 12220 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12188 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12188 KB Output is correct
20 Correct 5 ms 12108 KB Output is correct
21 Correct 6 ms 12200 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 6 ms 12108 KB Output is correct
26 Correct 11 ms 13200 KB Output is correct
27 Correct 9 ms 13132 KB Output is correct
28 Correct 11 ms 13388 KB Output is correct
29 Correct 11 ms 13260 KB Output is correct
30 Correct 9 ms 13060 KB Output is correct
31 Correct 7 ms 12200 KB Output is correct
32 Correct 10 ms 13388 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 9 ms 13024 KB Output is correct
35 Correct 11 ms 13132 KB Output is correct
36 Correct 10 ms 13132 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 13184 KB Output is correct
40 Correct 10 ms 13092 KB Output is correct
41 Correct 10 ms 13132 KB Output is correct
42 Correct 10 ms 13132 KB Output is correct
43 Correct 10 ms 13372 KB Output is correct
44 Correct 6 ms 12108 KB Output is correct
45 Correct 10 ms 13260 KB Output is correct
46 Correct 10 ms 13132 KB Output is correct
47 Correct 6 ms 12108 KB Output is correct
48 Correct 11 ms 13132 KB Output is correct
49 Correct 12 ms 13132 KB Output is correct
50 Correct 13 ms 13340 KB Output is correct
51 Correct 10 ms 13132 KB Output is correct
52 Correct 10 ms 13132 KB Output is correct
53 Correct 10 ms 13132 KB Output is correct
54 Correct 10 ms 13004 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 7 ms 12200 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 12188 KB Output is correct
6 Correct 6 ms 12212 KB Output is correct
7 Correct 6 ms 12112 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 5 ms 12108 KB Output is correct
11 Correct 6 ms 12100 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 12216 KB Output is correct
15 Correct 6 ms 12220 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12188 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12188 KB Output is correct
20 Correct 5 ms 12108 KB Output is correct
21 Correct 6 ms 12200 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 6 ms 12108 KB Output is correct
26 Correct 170 ms 43180 KB Output is correct
27 Correct 156 ms 42896 KB Output is correct
28 Correct 10 ms 13004 KB Output is correct
29 Correct 6 ms 12108 KB Output is correct
30 Correct 6 ms 12108 KB Output is correct
31 Correct 168 ms 42892 KB Output is correct
32 Correct 9 ms 13132 KB Output is correct
33 Correct 171 ms 52724 KB Output is correct
34 Correct 151 ms 42872 KB Output is correct
35 Correct 10 ms 13004 KB Output is correct
36 Correct 154 ms 43672 KB Output is correct
37 Correct 10 ms 13008 KB Output is correct
38 Correct 10 ms 13132 KB Output is correct
39 Correct 160 ms 43388 KB Output is correct
40 Correct 9 ms 13336 KB Output is correct
41 Correct 153 ms 42824 KB Output is correct
42 Correct 163 ms 45616 KB Output is correct
43 Correct 6 ms 12108 KB Output is correct
44 Correct 171 ms 52732 KB Output is correct
45 Correct 160 ms 48776 KB Output is correct
46 Correct 10 ms 13132 KB Output is correct
47 Correct 10 ms 13004 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 170 ms 43088 KB Output is correct
2 Correct 357 ms 47748 KB Output is correct
3 Correct 12 ms 13132 KB Output is correct
4 Correct 10 ms 13132 KB Output is correct
5 Correct 6 ms 12108 KB Output is correct
6 Correct 6 ms 12108 KB Output is correct
7 Correct 9 ms 13020 KB Output is correct
8 Correct 189 ms 45788 KB Output is correct
9 Correct 10 ms 13132 KB Output is correct
10 Correct 156 ms 43372 KB Output is correct
11 Correct 6 ms 12108 KB Output is correct
12 Correct 170 ms 42940 KB Output is correct
13 Correct 207 ms 45744 KB Output is correct
14 Correct 336 ms 47700 KB Output is correct
15 Correct 163 ms 43468 KB Output is correct
16 Correct 10 ms 13132 KB Output is correct
17 Correct 7 ms 12108 KB Output is correct
18 Correct 349 ms 47900 KB Output is correct
19 Correct 366 ms 52700 KB Output is correct
20 Correct 11 ms 13096 KB Output is correct
21 Correct 7 ms 12108 KB Output is correct
22 Correct 190 ms 46500 KB Output is correct
23 Correct 11 ms 13132 KB Output is correct
24 Correct 187 ms 44156 KB Output is correct
25 Correct 343 ms 51492 KB Output is correct
26 Correct 11 ms 13132 KB Output is correct
27 Correct 13 ms 13240 KB Output is correct
28 Correct 11 ms 13132 KB Output is correct
29 Correct 10 ms 13132 KB Output is correct
30 Correct 12 ms 13132 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 12108 KB Output is correct
2 Correct 7 ms 12200 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 12188 KB Output is correct
6 Correct 6 ms 12212 KB Output is correct
7 Correct 6 ms 12112 KB Output is correct
8 Correct 6 ms 12108 KB Output is correct
9 Correct 6 ms 12108 KB Output is correct
10 Correct 5 ms 12108 KB Output is correct
11 Correct 6 ms 12100 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 12216 KB Output is correct
15 Correct 6 ms 12220 KB Output is correct
16 Correct 6 ms 12108 KB Output is correct
17 Correct 6 ms 12188 KB Output is correct
18 Correct 7 ms 12108 KB Output is correct
19 Correct 7 ms 12188 KB Output is correct
20 Correct 5 ms 12108 KB Output is correct
21 Correct 6 ms 12200 KB Output is correct
22 Correct 6 ms 12108 KB Output is correct
23 Correct 6 ms 12108 KB Output is correct
24 Correct 6 ms 12108 KB Output is correct
25 Correct 6 ms 12108 KB Output is correct
26 Correct 11 ms 13200 KB Output is correct
27 Correct 9 ms 13132 KB Output is correct
28 Correct 11 ms 13388 KB Output is correct
29 Correct 11 ms 13260 KB Output is correct
30 Correct 9 ms 13060 KB Output is correct
31 Correct 7 ms 12200 KB Output is correct
32 Correct 10 ms 13388 KB Output is correct
33 Correct 6 ms 12108 KB Output is correct
34 Correct 9 ms 13024 KB Output is correct
35 Correct 11 ms 13132 KB Output is correct
36 Correct 10 ms 13132 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 13184 KB Output is correct
40 Correct 10 ms 13092 KB Output is correct
41 Correct 10 ms 13132 KB Output is correct
42 Correct 10 ms 13132 KB Output is correct
43 Correct 10 ms 13372 KB Output is correct
44 Correct 6 ms 12108 KB Output is correct
45 Correct 10 ms 13260 KB Output is correct
46 Correct 10 ms 13132 KB Output is correct
47 Correct 6 ms 12108 KB Output is correct
48 Correct 11 ms 13132 KB Output is correct
49 Correct 12 ms 13132 KB Output is correct
50 Correct 13 ms 13340 KB Output is correct
51 Correct 10 ms 13132 KB Output is correct
52 Correct 10 ms 13132 KB Output is correct
53 Correct 10 ms 13132 KB Output is correct
54 Correct 10 ms 13004 KB Output is correct
55 Correct 6 ms 12108 KB Output is correct
56 Correct 170 ms 43180 KB Output is correct
57 Correct 156 ms 42896 KB Output is correct
58 Correct 10 ms 13004 KB Output is correct
59 Correct 6 ms 12108 KB Output is correct
60 Correct 6 ms 12108 KB Output is correct
61 Correct 168 ms 42892 KB Output is correct
62 Correct 9 ms 13132 KB Output is correct
63 Correct 171 ms 52724 KB Output is correct
64 Correct 151 ms 42872 KB Output is correct
65 Correct 10 ms 13004 KB Output is correct
66 Correct 154 ms 43672 KB Output is correct
67 Correct 10 ms 13008 KB Output is correct
68 Correct 10 ms 13132 KB Output is correct
69 Correct 160 ms 43388 KB Output is correct
70 Correct 9 ms 13336 KB Output is correct
71 Correct 153 ms 42824 KB Output is correct
72 Correct 163 ms 45616 KB Output is correct
73 Correct 6 ms 12108 KB Output is correct
74 Correct 171 ms 52732 KB Output is correct
75 Correct 160 ms 48776 KB Output is correct
76 Correct 10 ms 13132 KB Output is correct
77 Correct 10 ms 13004 KB Output is correct
78 Correct 170 ms 43088 KB Output is correct
79 Correct 357 ms 47748 KB Output is correct
80 Correct 12 ms 13132 KB Output is correct
81 Correct 10 ms 13132 KB Output is correct
82 Correct 6 ms 12108 KB Output is correct
83 Correct 6 ms 12108 KB Output is correct
84 Correct 9 ms 13020 KB Output is correct
85 Correct 189 ms 45788 KB Output is correct
86 Correct 10 ms 13132 KB Output is correct
87 Correct 156 ms 43372 KB Output is correct
88 Correct 6 ms 12108 KB Output is correct
89 Correct 170 ms 42940 KB Output is correct
90 Correct 207 ms 45744 KB Output is correct
91 Correct 336 ms 47700 KB Output is correct
92 Correct 163 ms 43468 KB Output is correct
93 Correct 10 ms 13132 KB Output is correct
94 Correct 7 ms 12108 KB Output is correct
95 Correct 349 ms 47900 KB Output is correct
96 Correct 366 ms 52700 KB Output is correct
97 Correct 11 ms 13096 KB Output is correct
98 Correct 7 ms 12108 KB Output is correct
99 Correct 190 ms 46500 KB Output is correct
100 Correct 11 ms 13132 KB Output is correct
101 Correct 187 ms 44156 KB Output is correct
102 Correct 343 ms 51492 KB Output is correct
103 Correct 11 ms 13132 KB Output is correct
104 Correct 13 ms 13240 KB Output is correct
105 Correct 11 ms 13132 KB Output is correct
106 Correct 10 ms 13132 KB Output is correct
107 Correct 12 ms 13132 KB Output is correct
108 Correct 1392 ms 181072 KB Output is correct
109 Correct 1192 ms 188292 KB Output is correct
110 Correct 1243 ms 204196 KB Output is correct
111 Correct 2334 ms 218816 KB Output is correct
112 Correct 1951 ms 209556 KB Output is correct
113 Correct 2576 ms 191360 KB Output is correct
114 Correct 1066 ms 165536 KB Output is correct
115 Correct 1074 ms 165644 KB Output is correct
116 Correct 1144 ms 173812 KB Output is correct
117 Correct 2535 ms 188960 KB Output is correct
118 Correct 1014 ms 164932 KB Output is correct
119 Correct 2585 ms 188924 KB Output is correct
120 Correct 2503 ms 210340 KB Output is correct
121 Correct 2409 ms 189716 KB Output is correct
122 Correct 1446 ms 182704 KB Output is correct
123 Correct 2924 ms 189768 KB Output is correct
124 Correct 1957 ms 195844 KB Output is correct