Educational Codeforces Round 65 (Rated for Div. 2) (C. News Distribution)

Bismillahir Rahmanir Rahim

///Author: Tanvir Ahmmad

///CSE,Islamic University,Bangladesh

#include<iostream>

#include<cstdio>

#include<algorithm>

#include<string>

#include<cstring>

#include<sstream>

#include<cmath>

#include<cstring>

#include<vector>

#include<queue>

#include<map>

#include<set>

#include<stack>

#include<vector>

#include<iterator>

#include <functional> ///sort(arr,arr+n,greater<int>()) for decrement of array

/*every external angle sum=360 degree

  angle find using polygon hand(n) ((n-2)*180)/n*/

///Floor[Log(b)  N] + 1 = the number of digits when any number is represented in base b

using namespace std;

typedef long long ll;

int fx[]= {1,-1,0,0};

int fy[]= {0,0,-1,1};

const ll N=1e6+9;

vector<ll> graph[N];

bool vis[N];

stack<ll>stk;

void dfs(ll node)

{

    vis[node]=true;

    for(ll i=0; i<graph[node].size(); i++)

        if(vis[graph[node][i]]==false)

            dfs(graph[node][i]);

    stk.push(node);

}

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    ll node,op,p,ans[N];

    cin>>node>>op;

    for(ll i=1; i<=node; i++)

        ans[i]=1;

    for(ll i=1; i<=op; i++)

    {

        cin>>p;

        ll arr[p+9];

        for(ll j=0; j<p; j++)

            cin>>arr[j];

        for(ll j=1; j<p; j++)

            graph[arr[j]].push_back(arr[j-1]),graph[arr[j-1]].push_back(arr[j]);

    }

    for(ll i=1; i<=node; i++)

        if(vis[i]==false)

        {

            dfs(i);

            ll sz=stk.size();

            while(!stk.empty())

            {

                ll num=stk.top();

                ans[num]=sz;

                stk.pop();

            }

        }

    for(ll i=1; i<=node; i++)

        cout<<ans[i]<<" ";

    cout<<endl;

    return 0;

}

///Alhamdulillah

Problem Link:https://codeforces.com/problemset/problem/1167/C