News Distribution （并查集）

                                                    C. News Distribution

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

In some social network, there are nn users communicating with each other in mm groups of friends. Let's analyze the process of distributing some news between users.

Initially, some user xx receives the news from some source. Then he or she sends the news to his or her friends (two users are friends if there is at least one group such that both of them belong to this group). Friends continue sending the news to their friends, and so on. The process ends when there is no pair of friends such that one of them knows the news, and another one doesn't know.

For each user xx you have to determine what is the number of users that will know the news if initially only user xx starts distributing it.

Input

The first line contains two integers nn and mm (1≤n,m≤5⋅1051≤n,m≤5⋅105) — the number of users and the number of groups of friends, respectively.

Then mm lines follow, each describing a group of friends. The ii-th line begins with integer kiki (0≤ki≤n0≤ki≤n) — the number of users in the ii-th group. Then kiki distinct integers follow, denoting the users belonging to the ii-th group.

It is guaranteed that ∑i=1mki≤5⋅105∑i=1mki≤5⋅105.

Output

Print nn integers. The ii-th integer should be equal to the number of users that will know the news if user ii starts distributing it.

Example

input

Copy

7 5
3 2 5 4
0
2 1 2
1 1
2 6 7

output

Copy

4 4 1 4 4 2 2 

题意：两个人在一个组内就是朋友，朋友之间可以接收消息，问第 I 个人发送消息 有多少人可以接收到消息。。。

思路：就是问第 I 个人有多少个朋友。。。 并查集并起来就好

代码如下：

#include<bits/stdc++.h>
using namespace std;
const int maxn =5e5+5;
vector<int>vec[maxn];
int f[maxn],t[maxn];
void init(int n)
{
    for(int i=1; i<=n; i++)f[i]=i,t[i]=1;
}
int getf(int x)
{
    if(f[x]!=x)
    {
        f[x]=getf(f[x]);
    }
    return f[x];
}
void unin(int x,int y)
{
    int fx=getf(x);
    int fy=getf(y);
    if(fx<fy)
    {
        f[fy]=fx;
        t[fx]+=t[fy];
    }
    else if(fx>fy)
    {
        f[fx]=fy;
        t[fy]+=t[fx];
    }
}
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    init(n);
    for(int i=1; i<=m; i++)
    {
        int k,a;
        vec[i].clear();
        scanf("%d",&k);
        int mi=1e9;
        for(int j=0; j<k; j++)
        {
            scanf("%d",&a);
            vec[i].push_back(a);
            mi=min(mi,a);
        }
        vec[i].push_back(mi);
    }
    for(int i=1; i<=m; i++)
    {
        int len=vec[i].size();
        if(len==2||len==0)continue;
        int mi=vec[i][len-1];

        for(int j=0; j<len-1; j++)
        {
            if(vec[i][j]==mi)continue;
            unin(mi,vec[i][j]);
        }
    }
    printf("%d",t[getf(1)]);
    for(int i=2; i<=n; i++)
    {
        printf(" %d",t[getf(i)]);
    }
    printf("\n");
    return 0;
}