This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
void solve(){
int n, m, k;cin >> n >> m >> k;
vector<int> g[n];
while(m--){
int u, v;cin >> u >> v;u--;v--;
g[u].push_back(v);
g[v].push_back(u);
}
queue<int> q;
int d[n] = {0};
string s;cin >> s;
int x[k];for(int i = 0;i < k;i++) {
cin >> x[i];
x[i]--;
}
d[x[0]]=0;
q.push(x[0]);
while(!q.empty()){
int t = q.front();
q.pop();
for(int j : g[t]){
if(!d[j] && j != x[0]){
q.push(j);
d[j]=d[t]+1;
}
}
}
for(int i = 0;i < n;i++) cout << d[i] << '\n';
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
solve();
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |