oj.uz

답안 #679668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
679668 2023-01-08T20:37:00 Z keta_tsimakuridze Mergers (JOI19_mergers) C++14
70 / 100
 193 ms 38908 KB 
#include<bits/stdc++.h>
#define f first
#define s second
#define int long long
#define pii pair<int,int>
using namespace std;
const int N = 2e5 + 5, mod = 1e9 + 7; // !
int t, p[N], P[N][20], X[N], in[N], out[N];
int ans = 0, timer = 0;
vector<int> V[N], x[N];
bool cmp(int u, int v) {
    return (in[u] < in[v]);
}
int find(int x) {
    return (p[x] == x ? x : p[x] = find(p[x]));
}

void dfs0(int u) {
    in[u] = ++timer;
    for(int i = 1; i <= 18; i++) P[u][i] = P[P[u][i - 1]][i - 1];
    for(int i = 0; i < V[u].size(); i++) {
        if(V[u][i] == P[u][0]) continue;
        P[V[u][i]][0] = u;
        dfs0(V[u][i]);
    }
    out[u] = timer;
}
bool check(int u, int v) {
    return (in[u] <= in[v] && out[v] <= out[u]);
}
int lca(int u, int v) {
    if(check(u, v)) return u;
    if(check(v, u)) return v;

    for(int i = 18; i >= 0; i--) {
        if(P[u][i] && !check(P[u][i], v)) u = P[u][i];
    }
    return P[u][0];
}
void up(int u, int v, int lca) {
    int cur = u;
    while(true) {
        cur = find(cur);
        if(cur == 1 || find(cur) == find(lca)) break;
        p[cur] = find(P[cur][0]);
        cur = p[cur];
    }
}
void dfs(int u) {

    for(int i = 0; i < V[u].size(); i++) {
        dfs(V[u][i]);
        X[u] += X[V[u][i]];
    }
    ans += ((int)V[u].size() + (u - 1 > 0) == 1);
}
main(){
    int n, m;
    cin >> n >> m;
    for(int i =1; i <= n; i++) p[i] = i;
    for(int i = 2; i <= n; i++) {
        int u, v;
        cin >> u >> v;
        V[u].push_back(v);
        V[v].push_back(u);
    }
    dfs0(1);
    for(int i = 1; i <= n; i++) {
        int a; cin >> a;
        x[a].push_back(i);
    }
    for(int i = 1; i <= m; i++) {

        sort(x[i].begin(), x[i].end(), cmp);

        for(int j = 1; j < x[i].size(); j++) {

            int u = x[i][j - 1], v = x[i][j];
            int l = lca(u, v);
            up(u, v, l);
            up(v, u, l);
        }
    }
    for(int i = 1; i <= n; i++) V[i].clear();
    for(int i = 2; i <= n; i++) if(find(i) != find(P[i][0])) V[find(P[i][0])].push_back(find(i));
    dfs(1);
    cout << (ans + 1) /2;

 }

Compilation message

mergers.cpp: In function 'void dfs0(long long int)':
mergers.cpp:21:22: 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]
   21 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
mergers.cpp: In function 'void dfs(long long int)':
mergers.cpp:51:22: 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]
   51 |     for(int i = 0; i < V[u].size(); i++) {
      |                    ~~^~~~~~~~~~~~~
mergers.cpp: At global scope:
mergers.cpp:57:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   57 | main(){
      | ^~~~
mergers.cpp: In function 'int main()':
mergers.cpp:76:26: 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]
   76 |         for(int j = 1; j < x[i].size(); j++) {
      |                        ~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9660 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9644 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct

Subtask #2
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9660 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9644 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9684 KB Output is correct
26 Correct 8 ms 10488 KB Output is correct
27 Correct 8 ms 10348 KB Output is correct
28 Correct 8 ms 10580 KB Output is correct
29 Correct 8 ms 10452 KB Output is correct
30 Correct 9 ms 10452 KB Output is correct
31 Correct 8 ms 9684 KB Output is correct
32 Correct 12 ms 10612 KB Output is correct
33 Correct 6 ms 9712 KB Output is correct
34 Correct 10 ms 10360 KB Output is correct
35 Correct 8 ms 10452 KB Output is correct
36 Correct 9 ms 10448 KB Output is correct
37 Correct 9 ms 10452 KB Output is correct
38 Correct 6 ms 9684 KB Output is correct
39 Correct 8 ms 10488 KB Output is correct
40 Correct 8 ms 10356 KB Output is correct
41 Correct 9 ms 10396 KB Output is correct
42 Correct 9 ms 10472 KB Output is correct
43 Correct 8 ms 10480 KB Output is correct
44 Correct 6 ms 9684 KB Output is correct
45 Correct 9 ms 10488 KB Output is correct
46 Correct 10 ms 10452 KB Output is correct
47 Correct 6 ms 9684 KB Output is correct
48 Correct 10 ms 10484 KB Output is correct
49 Correct 10 ms 10452 KB Output is correct
50 Correct 9 ms 10580 KB Output is correct
51 Correct 8 ms 10380 KB Output is correct
52 Correct 8 ms 10492 KB Output is correct
53 Correct 8 ms 10452 KB Output is correct
54 Correct 10 ms 10452 KB Output is correct

Subtask #3
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9660 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9644 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 5 ms 9684 KB Output is correct
26 Correct 135 ms 34096 KB Output is correct
27 Correct 176 ms 33924 KB Output is correct
28 Correct 8 ms 10452 KB Output is correct
29 Correct 5 ms 9684 KB Output is correct
30 Correct 5 ms 9684 KB Output is correct
31 Correct 151 ms 33868 KB Output is correct
32 Correct 9 ms 10360 KB Output is correct
33 Correct 182 ms 37580 KB Output is correct
34 Correct 168 ms 34028 KB Output is correct
35 Correct 9 ms 10352 KB Output is correct
36 Correct 157 ms 33772 KB Output is correct
37 Correct 9 ms 10452 KB Output is correct
38 Correct 10 ms 10480 KB Output is correct
39 Correct 145 ms 34032 KB Output is correct
40 Correct 9 ms 10544 KB Output is correct
41 Correct 149 ms 33952 KB Output is correct
42 Correct 169 ms 34776 KB Output is correct
43 Correct 6 ms 9700 KB Output is correct
44 Correct 181 ms 37792 KB Output is correct
45 Correct 193 ms 37036 KB Output is correct
46 Correct 8 ms 10484 KB Output is correct
47 Correct 8 ms 10464 KB Output is correct

Subtask #4
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 32664 KB Output is correct
2 Correct 125 ms 34752 KB Output is correct
3 Correct 9 ms 10452 KB Output is correct
4 Correct 8 ms 10452 KB Output is correct
5 Correct 7 ms 9684 KB Output is correct
6 Correct 7 ms 9700 KB Output is correct
7 Correct 8 ms 10352 KB Output is correct
8 Correct 167 ms 35920 KB Output is correct
9 Correct 9 ms 10420 KB Output is correct
10 Correct 169 ms 34808 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 160 ms 34264 KB Output is correct
13 Correct 181 ms 35648 KB Output is correct
14 Correct 149 ms 37076 KB Output is correct
15 Correct 130 ms 34056 KB Output is correct
16 Correct 8 ms 10480 KB Output is correct
17 Correct 6 ms 9812 KB Output is correct
18 Correct 144 ms 36796 KB Output is correct
19 Correct 171 ms 38860 KB Output is correct
20 Correct 8 ms 10484 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 134 ms 35468 KB Output is correct
23 Correct 11 ms 10452 KB Output is correct
24 Correct 171 ms 35124 KB Output is correct
25 Correct 168 ms 38908 KB Output is correct
26 Correct 10 ms 10452 KB Output is correct
27 Correct 9 ms 10580 KB Output is correct
28 Correct 8 ms 10468 KB Output is correct
29 Correct 8 ms 10452 KB Output is correct
30 Correct 9 ms 10480 KB Output is correct

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 5 ms 9684 KB Output is correct
4 Correct 6 ms 9684 KB Output is correct
5 Correct 5 ms 9684 KB Output is correct
6 Correct 6 ms 9684 KB Output is correct
7 Correct 5 ms 9684 KB Output is correct
8 Correct 7 ms 9684 KB Output is correct
9 Correct 5 ms 9684 KB Output is correct
10 Correct 5 ms 9684 KB Output is correct
11 Correct 5 ms 9684 KB Output is correct
12 Correct 5 ms 9684 KB Output is correct
13 Correct 5 ms 9684 KB Output is correct
14 Correct 5 ms 9660 KB Output is correct
15 Correct 7 ms 9684 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9644 KB Output is correct
18 Correct 7 ms 9684 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 5 ms 9684 KB Output is correct
21 Correct 5 ms 9684 KB Output is correct
22 Correct 5 ms 9684 KB Output is correct
23 Correct 5 ms 9684 KB Output is correct
24 Correct 5 ms 9684 KB Output is correct
25 Correct 6 ms 9684 KB Output is correct
26 Correct 8 ms 10488 KB Output is correct
27 Correct 8 ms 10348 KB Output is correct
28 Correct 8 ms 10580 KB Output is correct
29 Correct 8 ms 10452 KB Output is correct
30 Correct 9 ms 10452 KB Output is correct
31 Correct 8 ms 9684 KB Output is correct
32 Correct 12 ms 10612 KB Output is correct
33 Correct 6 ms 9712 KB Output is correct
34 Correct 10 ms 10360 KB Output is correct
35 Correct 8 ms 10452 KB Output is correct
36 Correct 9 ms 10448 KB Output is correct
37 Correct 9 ms 10452 KB Output is correct
38 Correct 6 ms 9684 KB Output is correct
39 Correct 8 ms 10488 KB Output is correct
40 Correct 8 ms 10356 KB Output is correct
41 Correct 9 ms 10396 KB Output is correct
42 Correct 9 ms 10472 KB Output is correct
43 Correct 8 ms 10480 KB Output is correct
44 Correct 6 ms 9684 KB Output is correct
45 Correct 9 ms 10488 KB Output is correct
46 Correct 10 ms 10452 KB Output is correct
47 Correct 6 ms 9684 KB Output is correct
48 Correct 10 ms 10484 KB Output is correct
49 Correct 10 ms 10452 KB Output is correct
50 Correct 9 ms 10580 KB Output is correct
51 Correct 8 ms 10380 KB Output is correct
52 Correct 8 ms 10492 KB Output is correct
53 Correct 8 ms 10452 KB Output is correct
54 Correct 10 ms 10452 KB Output is correct
55 Correct 5 ms 9684 KB Output is correct
56 Correct 135 ms 34096 KB Output is correct
57 Correct 176 ms 33924 KB Output is correct
58 Correct 8 ms 10452 KB Output is correct
59 Correct 5 ms 9684 KB Output is correct
60 Correct 5 ms 9684 KB Output is correct
61 Correct 151 ms 33868 KB Output is correct
62 Correct 9 ms 10360 KB Output is correct
63 Correct 182 ms 37580 KB Output is correct
64 Correct 168 ms 34028 KB Output is correct
65 Correct 9 ms 10352 KB Output is correct
66 Correct 157 ms 33772 KB Output is correct
67 Correct 9 ms 10452 KB Output is correct
68 Correct 10 ms 10480 KB Output is correct
69 Correct 145 ms 34032 KB Output is correct
70 Correct 9 ms 10544 KB Output is correct
71 Correct 149 ms 33952 KB Output is correct
72 Correct 169 ms 34776 KB Output is correct
73 Correct 6 ms 9700 KB Output is correct
74 Correct 181 ms 37792 KB Output is correct
75 Correct 193 ms 37036 KB Output is correct
76 Correct 8 ms 10484 KB Output is correct
77 Correct 8 ms 10464 KB Output is correct
78 Correct 128 ms 32664 KB Output is correct
79 Correct 125 ms 34752 KB Output is correct
80 Correct 9 ms 10452 KB Output is correct
81 Correct 8 ms 10452 KB Output is correct
82 Correct 7 ms 9684 KB Output is correct
83 Correct 7 ms 9700 KB Output is correct
84 Correct 8 ms 10352 KB Output is correct
85 Correct 167 ms 35920 KB Output is correct
86 Correct 9 ms 10420 KB Output is correct
87 Correct 169 ms 34808 KB Output is correct
88 Correct 5 ms 9684 KB Output is correct
89 Correct 160 ms 34264 KB Output is correct
90 Correct 181 ms 35648 KB Output is correct
91 Correct 149 ms 37076 KB Output is correct
92 Correct 130 ms 34056 KB Output is correct
93 Correct 8 ms 10480 KB Output is correct
94 Correct 6 ms 9812 KB Output is correct
95 Correct 144 ms 36796 KB Output is correct
96 Correct 171 ms 38860 KB Output is correct
97 Correct 8 ms 10484 KB Output is correct
98 Correct 6 ms 9684 KB Output is correct
99 Correct 134 ms 35468 KB Output is correct
100 Correct 11 ms 10452 KB Output is correct
101 Correct 171 ms 35124 KB Output is correct
102 Correct 168 ms 38908 KB Output is correct
103 Correct 10 ms 10452 KB Output is correct
104 Correct 9 ms 10580 KB Output is correct
105 Correct 8 ms 10468 KB Output is correct
106 Correct 8 ms 10452 KB Output is correct
107 Correct 9 ms 10480 KB Output is correct
108 Runtime error 18 ms 22580 KB Execution killed with signal 11
109 Halted 0 ms 0 KB -