답안 #169100

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
169100	2019-12-18T11:53:51 Z	Akashi	Mergers (JOI19_mergers)	C++14	10 / 100	174 ms	33884 KB

mergers

#include <bits/stdc++.h>
using namespace std;

int n, k;
int h[500005], cul[500005], up[500005], root[500005], nr[500005], nr2[500005];
bool viz[500005], tip[500005];
int d[500005][21];
vector <int> v[500005];

priority_queue <pair <int, int> > L;
void predfs(int nod = 1){
    viz[nod] = 1;

    bool leaf = true;
    for(auto it : v[nod]){
        if(viz[it]) continue ;
        leaf = false;
        h[it] = h[nod] + 1;
        predfs(it);
        d[it][0] = nod;
    }

    viz[nod] = 0;
    if(leaf) L.push({h[nod], nod});
}

inline int lca(int x, int y){
    if(h[x] < h[y]) swap(x, y);

    int dif = h[x] - h[y];
    int p = 1, k = 0;
    while(dif){
        if(dif & p) x = d[x][k], dif ^= p;
        p = p << 1; ++k;
    }

    if(x == y) return x;

    for(int t = 20; t >= 0 ; --t)
        if(d[x][t] != d[y][t]) x = d[x][t], y = d[y][t];

    return d[x][0];
}

int main()
{
//    freopen("1.in", "r", stdin);
    scanf("%d%d", &n, &k);

    int x, y;
    for(int i = 1; i < n ; ++i){
        scanf("%d%d", &x, &y);
        v[x].push_back(y);
        v[y].push_back(x);
    }

    predfs();
    for(int t = 1; t <= 20 ; ++t)
        for(int i = 1; i <= n ; ++i)
            d[i][t] = d[d[i][t - 1]][t - 1];

    for(int i = 1; i <= n ; ++i){
        scanf("%d", &x);
        cul[i] = x;
        if(root[x] == 0) root[x] = i;
        else root[x] = lca(root[x], i);
    }
    for(int i = 1; i <= n ; ++i) up[i] = root[cul[i]];

    int Sol = 0, NR = 0, ad = 0;
    while(!L.empty()){
        int nod = L.top().second;
        L.pop();

        bool leaf = true;
        for(auto it : v[nod]){
            if(it == d[nod][0]) continue ;
            leaf = false;
            nr[nod] += nr[it] + nr2[it];
        }

        int TT = d[nod][0];
        tip[TT] = max(tip[nod], tip[TT]);
        if(up[nod] != nod) up[TT] = lca(up[nod], up[TT]);
        else{
            ++NR;
            if(!tip[nod]){
                tip[TT] = 1, nr[nod] = 1;
                ++ad;
            }
            else{
                if(nr[nod] > 1){
                    Sol = Sol + (nr[nod] - 1) / 2;
                    if(nr[nod] % 2 == 0) nr2[nod] = 1;
                    nr[nod] = 1;
                }

            }
        }
        if(!viz[TT] && TT != 1){
            viz[TT] = 1;
            L.push({h[TT], TT});
        }
    }

//    cerr << ad << endl;
    if(NR == 0) printf("0");
    else{
        int n1 = 0, n2 = 0;
        int cnt = 0;
        for(auto it : v[1]){
            n1 += nr[it];
            n2 += nr2[it];
            if(nr[it]) ++cnt;
        }

        if(cnt > 1) Sol = Sol + (n1 + n2) / 2 + (n1 + n2) % 2;
        else Sol = Sol + n1 / 2 + n1 % 2 + n2 / 2 + n2 % 2;

        printf("%d", Sol);
    }

    return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:75:14: warning: variable 'leaf' set but not used [-Wunused-but-set-variable]
         bool leaf = true;
              ^~~~
mergers.cpp:48:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d", &n, &k);
     ~~~~~^~~~~~~~~~~~~~~~
mergers.cpp:52:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d%d", &x, &y);
         ~~~~~^~~~~~~~~~~~~~~~
mergers.cpp:63:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &x);
         ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

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

Subtask #2
0 / 24.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	12152 KB	Output is correct
2	Correct	13 ms	12152 KB	Output is correct
3	Correct	13 ms	12152 KB	Output is correct
4	Correct	12 ms	12152 KB	Output is correct
5	Correct	13 ms	12152 KB	Output is correct
6	Correct	13 ms	12152 KB	Output is correct
7	Correct	12 ms	12152 KB	Output is correct
8	Correct	12 ms	12152 KB	Output is correct
9	Correct	12 ms	12152 KB	Output is correct
10	Correct	12 ms	12152 KB	Output is correct
11	Correct	12 ms	12152 KB	Output is correct
12	Correct	13 ms	12152 KB	Output is correct
13	Correct	12 ms	12152 KB	Output is correct
14	Correct	12 ms	12152 KB	Output is correct
15	Correct	12 ms	12152 KB	Output is correct
16	Correct	12 ms	12152 KB	Output is correct
17	Correct	12 ms	12152 KB	Output is correct
18	Correct	12 ms	12152 KB	Output is correct
19	Correct	12 ms	12152 KB	Output is correct
20	Correct	12 ms	12152 KB	Output is correct
21	Correct	12 ms	12152 KB	Output is correct
22	Correct	12 ms	12152 KB	Output is correct
23	Correct	12 ms	12152 KB	Output is correct
24	Correct	12 ms	12152 KB	Output is correct
25	Correct	12 ms	12152 KB	Output is correct
26	Correct	15 ms	12536 KB	Output is correct
27	Correct	16 ms	12664 KB	Output is correct
28	Correct	16 ms	12668 KB	Output is correct
29	Correct	15 ms	12540 KB	Output is correct
30	Correct	16 ms	12536 KB	Output is correct
31	Correct	12 ms	12152 KB	Output is correct
32	Correct	15 ms	12664 KB	Output is correct
33	Correct	12 ms	12152 KB	Output is correct
34	Correct	14 ms	12664 KB	Output is correct
35	Correct	18 ms	12536 KB	Output is correct
36	Incorrect	15 ms	12540 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

Subtask #3
0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	12152 KB	Output is correct
2	Correct	13 ms	12152 KB	Output is correct
3	Correct	13 ms	12152 KB	Output is correct
4	Correct	12 ms	12152 KB	Output is correct
5	Correct	13 ms	12152 KB	Output is correct
6	Correct	13 ms	12152 KB	Output is correct
7	Correct	12 ms	12152 KB	Output is correct
8	Correct	12 ms	12152 KB	Output is correct
9	Correct	12 ms	12152 KB	Output is correct
10	Correct	12 ms	12152 KB	Output is correct
11	Correct	12 ms	12152 KB	Output is correct
12	Correct	13 ms	12152 KB	Output is correct
13	Correct	12 ms	12152 KB	Output is correct
14	Correct	12 ms	12152 KB	Output is correct
15	Correct	12 ms	12152 KB	Output is correct
16	Correct	12 ms	12152 KB	Output is correct
17	Correct	12 ms	12152 KB	Output is correct
18	Correct	12 ms	12152 KB	Output is correct
19	Correct	12 ms	12152 KB	Output is correct
20	Correct	12 ms	12152 KB	Output is correct
21	Correct	12 ms	12152 KB	Output is correct
22	Correct	12 ms	12152 KB	Output is correct
23	Correct	12 ms	12152 KB	Output is correct
24	Correct	12 ms	12152 KB	Output is correct
25	Correct	12 ms	12152 KB	Output is correct
26	Correct	146 ms	27540 KB	Output is correct
27	Correct	160 ms	27252 KB	Output is correct
28	Correct	15 ms	12612 KB	Output is correct
29	Correct	13 ms	12152 KB	Output is correct
30	Correct	13 ms	12152 KB	Output is correct
31	Correct	169 ms	27508 KB	Output is correct
32	Correct	14 ms	12536 KB	Output is correct
33	Correct	153 ms	33884 KB	Output is correct
34	Correct	157 ms	27328 KB	Output is correct
35	Incorrect	15 ms	12536 KB	Output isn't correct
36	Halted	0 ms	0 KB	-

Subtask #4
0 / 22.0

#	결과	실행 시간	메모리	Grader output
1	Correct	122 ms	26092 KB	Output is correct
2	Correct	125 ms	26832 KB	Output is correct
3	Correct	15 ms	12536 KB	Output is correct
4	Correct	15 ms	12536 KB	Output is correct
5	Correct	12 ms	12152 KB	Output is correct
6	Correct	12 ms	12152 KB	Output is correct
7	Correct	15 ms	12664 KB	Output is correct
8	Correct	174 ms	28276 KB	Output is correct
9	Incorrect	16 ms	12536 KB	Output isn't correct
10	Halted	0 ms	0 KB	-

Subtask #5
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	12 ms	12152 KB	Output is correct
2	Correct	13 ms	12152 KB	Output is correct
3	Correct	13 ms	12152 KB	Output is correct
4	Correct	12 ms	12152 KB	Output is correct
5	Correct	13 ms	12152 KB	Output is correct
6	Correct	13 ms	12152 KB	Output is correct
7	Correct	12 ms	12152 KB	Output is correct
8	Correct	12 ms	12152 KB	Output is correct
9	Correct	12 ms	12152 KB	Output is correct
10	Correct	12 ms	12152 KB	Output is correct
11	Correct	12 ms	12152 KB	Output is correct
12	Correct	13 ms	12152 KB	Output is correct
13	Correct	12 ms	12152 KB	Output is correct
14	Correct	12 ms	12152 KB	Output is correct
15	Correct	12 ms	12152 KB	Output is correct
16	Correct	12 ms	12152 KB	Output is correct
17	Correct	12 ms	12152 KB	Output is correct
18	Correct	12 ms	12152 KB	Output is correct
19	Correct	12 ms	12152 KB	Output is correct
20	Correct	12 ms	12152 KB	Output is correct
21	Correct	12 ms	12152 KB	Output is correct
22	Correct	12 ms	12152 KB	Output is correct
23	Correct	12 ms	12152 KB	Output is correct
24	Correct	12 ms	12152 KB	Output is correct
25	Correct	12 ms	12152 KB	Output is correct
26	Correct	15 ms	12536 KB	Output is correct
27	Correct	16 ms	12664 KB	Output is correct
28	Correct	16 ms	12668 KB	Output is correct
29	Correct	15 ms	12540 KB	Output is correct
30	Correct	16 ms	12536 KB	Output is correct
31	Correct	12 ms	12152 KB	Output is correct
32	Correct	15 ms	12664 KB	Output is correct
33	Correct	12 ms	12152 KB	Output is correct
34	Correct	14 ms	12664 KB	Output is correct
35	Correct	18 ms	12536 KB	Output is correct
36	Incorrect	15 ms	12540 KB	Output isn't correct
37	Halted	0 ms	0 KB	-

답안 #169100

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 0 / 24.0

Subtask #3 0 / 14.0

Subtask #4 0 / 22.0

Subtask #5 0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
0 / 24.0

Subtask #3
0 / 14.0

Subtask #4
0 / 22.0

Subtask #5
0 / 30.0