Submission #1162523

#TimeUsernameProblemLanguageResultExecution timeMemory
1162523NewtonabcBirmingham (COCI20_birmingham)C++20
15 / 70
84 ms7752 KiB
#include<bits/stdc++.h> using namespace std; const int N=1e5+10; int d[N]; bool vs[N]; vector<int> adj[N]; queue<int> q; int main(){ int n,m,qq,k; cin>>n >>m >>qq >>k; for(int i=0;i<qq;i++){ int inp; cin>>inp; vs[inp]=true; q.push(inp); } for(int i=0;i<m;i++){ int u,v; cin>>u >>v; adj[u].push_back(v); adj[v].push_back(u); } while(!q.empty()){ int u=q.front(); q.pop(); for(auto v:adj[u]){ if(vs[v]) continue; vs[v]=true; q.push(v); d[v]=d[u]+1; } } for(int i=1;i<=n;i++){ cout<<(d[i]+k-1)/k <<" "; } }
#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...