Submission #238686

#TimeUsernameProblemLanguageResultExecution timeMemory
238686TrayanaGBirmingham (COCI20_birmingham)C++14
0 / 70
220 ms10360 KiB
#include<iostream> #include<bits/stdc++.h> using namespace std; int n,m,q,k; int a[200020]; int used[200020]; vector <int> v[200020]; int br = 0; void read() { cin>>n>>m>>q>>k; for(int i=1; i<=q; i++) { cin>>a[i]; used[a[i]] = 0; } int x,y; for(int i=1; i<=m; i++) { cin>>x>>y; v[x].push_back(y); v[y].push_back(x); } } int main() { memset(used, -1, sizeof(used)); read(); br = n-q; int den = 1; while(br!=0) { for(int i=1; i<=n; i++) { if(used[i]!=-1) { int sz = v[i].size(); for(int j=0; j<sz; j++) { int nb = v[i][j]; if(used[nb]==-1) { used[nb] = den; br--; } } } } den++; } for(int i=1;i<=n;i++) { cout<<used[i]<<" "; } cout<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...