Submission #238679

#	Time	Username	Problem	Language	Result	Execution time	Memory
238679		Niya_R	Birmingham (COCI20_birmingham)	C++14	0 / 70	225 ms	7800 KiB

birmingham

#include <iostream>
#include<bits/stdc++.h>
using namespace std;
vector<int>v[100004];
queue<int>q1;
int used[100004];
void bfs()
{
    while(!q1.empty())
    {
        int x=q1.front();
        q1.pop();
        int sz=v[x].size();
        for(int i=0;i<sz;i++)
        {
            int nb=v[x][i];
            if(used[nb]==-1)
            {
                used[nb]=used[x]+1;
                q1.push(nb);
            }
        }
    }
}
int main()
{
    int n, m, q, k;
    cin>>n>>m>>q>>k;
    memset(used,-1,sizeof(used));
    for(int i=1; i<=q; i++)
    {
        int x;
        cin>>x;
        used[x]=0;
        q1.push(x);
    }
    for(int i=1; i<=m; i++)
    {
        int x,y;
        cin>>x>>y;
        v[x].push_back(y);
        v[y].push_back(x);
    }
    bfs();
    for(int i=1;i<=n;i++)
    {
        cout<<used[i]<<" ";
    }
    cout<<endl;
    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