Submission #238683

#	Time	Username	Problem	Language	Result	Execution time	Memory
238683		Niya_R	Birmingham (COCI20_birmingham)	C++14	0 / 70	234 ms	7936 KiB

birmingham

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
int n,m,q,k;
vector<int> a[100004];
int used[100004];
int br;
int day=1;
void read()
{
    memset(used,-1,sizeof(used));
    cin>>n>>m>>q>>k;
    br=n-q;
    for(int i=1;i<=q;i++)
    {
        int x;
        cin>>x;
        used[x]=0;
    }
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        a[x].push_back(y);
        a[y].push_back(x);
    }
}
void dfs(int x, int p)
{
    if(p==0) return;
    else
    {
        p-=1;
        int sz=a[x].size();
        for(int i=0;i<sz;i++)
        {
            int nb=a[x][i];
            if(used[nb]==-1)
            {
                
                br--;
                used[nb]=day;
                dfs(nb,p);
            }
        }
    }
}
void solve()
{
    
    queue<int>q1;
    while(br>0)
    {
        for(int i=1;i<=n;i++)
        {
            if(used[i]>-1)
            {
                q1.push(i);
            }
        }
        while(!q1.empty())
        {
            int x=q1.front();
            q1.pop();
            dfs(x,day*k);
        }
        day++;
    }
    for(int i=1;i<=n;i++)
    {
        cout<<used[i]<<" ";
    }
    cout<<endl;
}
int main()
{
    read();
    solve();
 return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 5
• Subtask 11: 0 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5