oj.uz

Submission #376847

# Submission time Handle Problem Language Result Execution time Memory
376847 2021-03-12T05:24:55 Z daniel920712 Mergers (JOI19_mergers) C++14
56 / 100
 3000 ms 54924 KB 
#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <set>
#include <vector>

using namespace std;
set < int > a,b;
set < pair < int , int > > road;
int now=0;
vector < int > Next[500005];
int color[500005];
int deg[500005]={0};
int tt[500005]={0};
int Father[500005]={0};
vector < int > con[500005];
vector < int > use[500005];
int sum[500005]={0};
int M;
void F(int here,int fa,int x)
{
    int i,j;
    con[here][color[here]]++;
    sum[color[here]]++;
    for(auto i:Next[here])
    {
        if(i==fa) continue;
        F(i,here,x);
        for(j=1;j<=M;j++) con[here][j]+=con[i][j];
    }
}
void F3(int here,int fa,int x)
{
    int ok=1,i,j;
    for(auto i:Next[here])
    {
        ok=1;
        if(i==fa) continue;
        F3(i,here,x);
        for(j=1;j<=M;j++)
        {
            if(con[i][j]>0&&con[i][j]<sum[j])
            {
                //printf("%d %d %d %d %d\n",here,i,j,con[i][j],sum[j]);
                ok=0;
            }
        }
        if(ok)
        {
            //printf("%d %d\n",here,i);
            road.insert(make_pair(here,i));
            road.insert(make_pair(i,here));
        }
    }
}
void F2(int here,int fa,int xx)
{
    for(auto i:Next[here])
    {
        if(i==fa) continue;
        if(road.find(make_pair(here,i))!=road.end())
        {

            now++;
            deg[xx]++;
            deg[now]++;
            //printf("%d %d %d %d\n",here,i,deg[xx],deg[now]);
            F2(i,here,now);
        }
        else F2(i,here,xx);
    }
}
void F4(int here,int fa,int deg)
{
    tt[here]=deg;
    Father[here]=fa;
    for(auto i:Next[here])
    {
        if(i!=fa)
        {
            road.insert(make_pair(here,i));
            F4(i,here,deg+1);
        }
    }
}
int LCA(int a,int b)
{
    if(a==b) return a;
    int x,y;
    if(tt[a]==tt[b])
    {
        x=Father[a];
        y=Father[b];
        //printf("aa %d %d\n",x,a);
        //printf("bb %d %d\n",y,b);
        if(road.find(make_pair(x,a))!=road.end()) road.erase(make_pair(x,a));
        if(road.find(make_pair(y,b))!=road.end()) road.erase(make_pair(y,b));
        return LCA(x,y);
    }
    else
    {

        if(tt[a]<tt[b]) swap(a,b);
        x=Father[a];
        //printf("cc %d %d\n",x,a);
        if(road.find(make_pair(x,a))!=road.end()) road.erase(make_pair(x,a));
        return LCA(x,b);
    }
}
int main()
{
    int N,K,i,j,x,y,xx=0,ok=1;
    scanf("%d %d",&N,&M);
    for(i=1;i<N;i++)
    {
        scanf("%d %d",&x,&y);
        Next[x].push_back(y);
        Next[y].push_back(x);

    }
    for(i=1;i<=N;i++)
    {
        scanf("%d",&color[i]);
        use[color[i]].push_back(i);
    }
    F4(1,-1,0);
    for(i=1;i<=M;i++)
    {
        K=use[i].size();
        if(K>=2)
        {
            x=use[i][0];
            for(j=1;j<K;j++) x=LCA(x,use[i][j]);
        }
    }
    /*if(N<=3000||M<=50)
    {
        for(i=1;i<=N;i++)
        {
            //scanf("%d",&color[i]);
            for(j=0;j<=M;j++) con[i].push_back(0);
        }
        F(1,-1,0);
        F3(1,-1,0);

    }
    else*/


    now=0;
    F2(1,-1,0);
    for(i=0;i<=now;i++) if(deg[i]==1) xx++;

    if(xx==1) printf("0\n");
    else printf("%d\n",(xx+1)/2);
    return 0;
}

Compilation message

mergers.cpp: In function 'void F(int, int, int)':
mergers.cpp:22:9: warning: unused variable 'i' [-Wunused-variable]
   22 |     int i,j;
      |         ^
mergers.cpp: In function 'void F3(int, int, int)':
mergers.cpp:34:14: warning: unused variable 'i' [-Wunused-variable]
   34 |     int ok=1,i,j;
      |              ^
mergers.cpp: In function 'int main()':
mergers.cpp:112:26: warning: unused variable 'ok' [-Wunused-variable]
  112 |     int N,K,i,j,x,y,xx=0,ok=1;
      |                          ^~
mergers.cpp:113:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  113 |     scanf("%d %d",&N,&M);
      |     ~~~~~^~~~~~~~~~~~~~~
mergers.cpp:116:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  116 |         scanf("%d %d",&x,&y);
      |         ~~~~~^~~~~~~~~~~~~~~
mergers.cpp:123:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  123 |         scanf("%d",&color[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35564 KB Output is correct
2 Correct 27 ms 35564 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35564 KB Output is correct
5 Correct 25 ms 35564 KB Output is correct
6 Correct 24 ms 35564 KB Output is correct
7 Correct 25 ms 35564 KB Output is correct
8 Correct 25 ms 35564 KB Output is correct
9 Correct 28 ms 35700 KB Output is correct
10 Correct 25 ms 35564 KB Output is correct
11 Correct 28 ms 35564 KB Output is correct
12 Correct 25 ms 35564 KB Output is correct
13 Correct 24 ms 35564 KB Output is correct
14 Correct 24 ms 35564 KB Output is correct
15 Correct 28 ms 35552 KB Output is correct
16 Correct 25 ms 35564 KB Output is correct
17 Correct 25 ms 35564 KB Output is correct
18 Correct 25 ms 35564 KB Output is correct
19 Correct 25 ms 35564 KB Output is correct
20 Correct 26 ms 35564 KB Output is correct
21 Correct 26 ms 35564 KB Output is correct
22 Correct 25 ms 35564 KB Output is correct
23 Correct 25 ms 35584 KB Output is correct
24 Correct 25 ms 35692 KB Output is correct

Subtask #2
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35564 KB Output is correct
2 Correct 27 ms 35564 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35564 KB Output is correct
5 Correct 25 ms 35564 KB Output is correct
6 Correct 24 ms 35564 KB Output is correct
7 Correct 25 ms 35564 KB Output is correct
8 Correct 25 ms 35564 KB Output is correct
9 Correct 28 ms 35700 KB Output is correct
10 Correct 25 ms 35564 KB Output is correct
11 Correct 28 ms 35564 KB Output is correct
12 Correct 25 ms 35564 KB Output is correct
13 Correct 24 ms 35564 KB Output is correct
14 Correct 24 ms 35564 KB Output is correct
15 Correct 28 ms 35552 KB Output is correct
16 Correct 25 ms 35564 KB Output is correct
17 Correct 25 ms 35564 KB Output is correct
18 Correct 25 ms 35564 KB Output is correct
19 Correct 25 ms 35564 KB Output is correct
20 Correct 26 ms 35564 KB Output is correct
21 Correct 26 ms 35564 KB Output is correct
22 Correct 25 ms 35564 KB Output is correct
23 Correct 25 ms 35584 KB Output is correct
24 Correct 25 ms 35692 KB Output is correct
25 Correct 25 ms 35564 KB Output is correct
26 Correct 28 ms 36016 KB Output is correct
27 Correct 31 ms 36076 KB Output is correct
28 Correct 32 ms 36076 KB Output is correct
29 Correct 27 ms 35948 KB Output is correct
30 Correct 33 ms 35948 KB Output is correct
31 Correct 25 ms 35564 KB Output is correct
32 Correct 28 ms 36204 KB Output is correct
33 Correct 25 ms 35584 KB Output is correct
34 Correct 32 ms 35948 KB Output is correct
35 Correct 33 ms 36096 KB Output is correct
36 Correct 28 ms 35948 KB Output is correct
37 Correct 29 ms 35948 KB Output is correct
38 Correct 25 ms 35564 KB Output is correct
39 Correct 29 ms 35948 KB Output is correct
40 Correct 29 ms 35948 KB Output is correct
41 Correct 29 ms 35948 KB Output is correct
42 Correct 28 ms 35948 KB Output is correct
43 Correct 115 ms 36204 KB Output is correct
44 Correct 25 ms 35564 KB Output is correct
45 Correct 29 ms 36076 KB Output is correct
46 Correct 30 ms 35948 KB Output is correct
47 Correct 25 ms 35564 KB Output is correct
48 Correct 28 ms 35948 KB Output is correct
49 Correct 28 ms 36076 KB Output is correct
50 Correct 28 ms 36076 KB Output is correct
51 Correct 29 ms 35948 KB Output is correct
52 Correct 27 ms 35948 KB Output is correct
53 Correct 32 ms 35948 KB Output is correct
54 Correct 31 ms 35948 KB Output is correct

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35564 KB Output is correct
2 Correct 27 ms 35564 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35564 KB Output is correct
5 Correct 25 ms 35564 KB Output is correct
6 Correct 24 ms 35564 KB Output is correct
7 Correct 25 ms 35564 KB Output is correct
8 Correct 25 ms 35564 KB Output is correct
9 Correct 28 ms 35700 KB Output is correct
10 Correct 25 ms 35564 KB Output is correct
11 Correct 28 ms 35564 KB Output is correct
12 Correct 25 ms 35564 KB Output is correct
13 Correct 24 ms 35564 KB Output is correct
14 Correct 24 ms 35564 KB Output is correct
15 Correct 28 ms 35552 KB Output is correct
16 Correct 25 ms 35564 KB Output is correct
17 Correct 25 ms 35564 KB Output is correct
18 Correct 25 ms 35564 KB Output is correct
19 Correct 25 ms 35564 KB Output is correct
20 Correct 26 ms 35564 KB Output is correct
21 Correct 26 ms 35564 KB Output is correct
22 Correct 25 ms 35564 KB Output is correct
23 Correct 25 ms 35584 KB Output is correct
24 Correct 25 ms 35692 KB Output is correct
25 Correct 25 ms 35564 KB Output is correct
26 Correct 187 ms 46564 KB Output is correct
27 Correct 459 ms 46444 KB Output is correct
28 Correct 32 ms 35948 KB Output is correct
29 Correct 25 ms 35564 KB Output is correct
30 Correct 25 ms 35564 KB Output is correct
31 Correct 317 ms 46316 KB Output is correct
32 Correct 27 ms 35948 KB Output is correct
33 Execution timed out 3106 ms 54924 KB Time limit exceeded
34 Halted 0 ms 0 KB -

Subtask #4
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 176 ms 46308 KB Output is correct
2 Correct 186 ms 49380 KB Output is correct
3 Correct 28 ms 35948 KB Output is correct
4 Correct 30 ms 35948 KB Output is correct
5 Correct 25 ms 35564 KB Output is correct
6 Correct 25 ms 35712 KB Output is correct
7 Correct 31 ms 35948 KB Output is correct
8 Correct 357 ms 47468 KB Output is correct
9 Correct 28 ms 35948 KB Output is correct
10 Correct 295 ms 46924 KB Output is correct
11 Correct 24 ms 35564 KB Output is correct
12 Correct 605 ms 46828 KB Output is correct
13 Correct 280 ms 47980 KB Output is correct
14 Correct 203 ms 50028 KB Output is correct
15 Correct 182 ms 46820 KB Output is correct
16 Correct 28 ms 35948 KB Output is correct
17 Correct 25 ms 35564 KB Output is correct
18 Correct 196 ms 49864 KB Output is correct
19 Correct 230 ms 54636 KB Output is correct
20 Correct 28 ms 35948 KB Output is correct
21 Correct 25 ms 35564 KB Output is correct
22 Correct 242 ms 48356 KB Output is correct
23 Correct 29 ms 35948 KB Output is correct
24 Correct 322 ms 47212 KB Output is correct
25 Correct 234 ms 53228 KB Output is correct
26 Correct 27 ms 36076 KB Output is correct
27 Correct 27 ms 36076 KB Output is correct
28 Correct 29 ms 35948 KB Output is correct
29 Correct 27 ms 35948 KB Output is correct
30 Correct 28 ms 35948 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 35564 KB Output is correct
2 Correct 27 ms 35564 KB Output is correct
3 Correct 25 ms 35584 KB Output is correct
4 Correct 25 ms 35564 KB Output is correct
5 Correct 25 ms 35564 KB Output is correct
6 Correct 24 ms 35564 KB Output is correct
7 Correct 25 ms 35564 KB Output is correct
8 Correct 25 ms 35564 KB Output is correct
9 Correct 28 ms 35700 KB Output is correct
10 Correct 25 ms 35564 KB Output is correct
11 Correct 28 ms 35564 KB Output is correct
12 Correct 25 ms 35564 KB Output is correct
13 Correct 24 ms 35564 KB Output is correct
14 Correct 24 ms 35564 KB Output is correct
15 Correct 28 ms 35552 KB Output is correct
16 Correct 25 ms 35564 KB Output is correct
17 Correct 25 ms 35564 KB Output is correct
18 Correct 25 ms 35564 KB Output is correct
19 Correct 25 ms 35564 KB Output is correct
20 Correct 26 ms 35564 KB Output is correct
21 Correct 26 ms 35564 KB Output is correct
22 Correct 25 ms 35564 KB Output is correct
23 Correct 25 ms 35584 KB Output is correct
24 Correct 25 ms 35692 KB Output is correct
25 Correct 25 ms 35564 KB Output is correct
26 Correct 28 ms 36016 KB Output is correct
27 Correct 31 ms 36076 KB Output is correct
28 Correct 32 ms 36076 KB Output is correct
29 Correct 27 ms 35948 KB Output is correct
30 Correct 33 ms 35948 KB Output is correct
31 Correct 25 ms 35564 KB Output is correct
32 Correct 28 ms 36204 KB Output is correct
33 Correct 25 ms 35584 KB Output is correct
34 Correct 32 ms 35948 KB Output is correct
35 Correct 33 ms 36096 KB Output is correct
36 Correct 28 ms 35948 KB Output is correct
37 Correct 29 ms 35948 KB Output is correct
38 Correct 25 ms 35564 KB Output is correct
39 Correct 29 ms 35948 KB Output is correct
40 Correct 29 ms 35948 KB Output is correct
41 Correct 29 ms 35948 KB Output is correct
42 Correct 28 ms 35948 KB Output is correct
43 Correct 115 ms 36204 KB Output is correct
44 Correct 25 ms 35564 KB Output is correct
45 Correct 29 ms 36076 KB Output is correct
46 Correct 30 ms 35948 KB Output is correct
47 Correct 25 ms 35564 KB Output is correct
48 Correct 28 ms 35948 KB Output is correct
49 Correct 28 ms 36076 KB Output is correct
50 Correct 28 ms 36076 KB Output is correct
51 Correct 29 ms 35948 KB Output is correct
52 Correct 27 ms 35948 KB Output is correct
53 Correct 32 ms 35948 KB Output is correct
54 Correct 31 ms 35948 KB Output is correct
55 Correct 25 ms 35564 KB Output is correct
56 Correct 187 ms 46564 KB Output is correct
57 Correct 459 ms 46444 KB Output is correct
58 Correct 32 ms 35948 KB Output is correct
59 Correct 25 ms 35564 KB Output is correct
60 Correct 25 ms 35564 KB Output is correct
61 Correct 317 ms 46316 KB Output is correct
62 Correct 27 ms 35948 KB Output is correct
63 Execution timed out 3106 ms 54924 KB Time limit exceeded
64 Halted 0 ms 0 KB -