Submission #238679

# Submission time Handle Problem Language Result Execution time Memory
238679 2020-06-12T10:37:40 Z Niya_R Birmingham (COCI20_birmingham) C++14
0 / 70
225 ms 7800 KB
#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;
}
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3072 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 2944 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3200 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3072 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3072 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3072 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 6 ms 3072 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 200 ms 7416 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 225 ms 7800 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 202 ms 7544 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 186 ms 7288 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 188 ms 7292 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 206 ms 7416 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 191 ms 7420 KB Output isn't correct
2 Halted 0 ms 0 KB -