# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238424 | 2020-06-11T07:53:49 Z | stev2005 | Birmingham (COCI20_birmingham) | C++17 | 122 ms | 8400 KB |
#include<bits/stdc++.h> using namespace std; const int MAXN=(1<<17); int n,m,q1,k; int q_el[MAXN],used[MAXN]; vector<int>v[MAXN]; void read() { scanf("%d%d%d%d",&n,&m,&q1,&k); for(int i=0;i<q1;i++) scanf("%d",&q_el[i]); int x,y; for(int i=0;i<m;i++) { scanf("%d%d",&x,&y); v[x].push_back(y); v[y].push_back(x); } } void BFS() { queue<int>q; int w,nb,i,sz; for(int i=0;i<q1;i++) { q.push(q_el[i]); used[q_el[i]]=1; } while(!q.empty()) { w=q.front(); q.pop(); sz=v[w].size(); for(i=0;i<sz;i++) { nb=v[w][i]; if(!used[nb]) { used[nb]=used[w]+1; q.push(nb); } } } } void ans() { int rez; for(int i=1;i<=n;i++) { rez=used[i]-1; rez=(rez%k)?rez/k+1:rez/k; printf("%d ",rez); } } int main() { read(); BFS(); ans(); return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 7 ms | 3456 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3456 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3348 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 6 ms | 3456 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 3456 KB | Output is correct |
2 | Correct | 6 ms | 3456 KB | Output is correct |
3 | Correct | 6 ms | 3456 KB | Output is correct |
4 | Correct | 6 ms | 3456 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 3456 KB | Output is correct |
2 | Correct | 6 ms | 3456 KB | Output is correct |
3 | Correct | 6 ms | 3456 KB | Output is correct |
4 | Correct | 6 ms | 3456 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 6 ms | 3456 KB | Output is correct |
2 | Correct | 6 ms | 3456 KB | Output is correct |
3 | Correct | 7 ms | 3456 KB | Output is correct |
4 | Correct | 7 ms | 3456 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 122 ms | 8140 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 110 ms | 8400 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 109 ms | 8280 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 102 ms | 8040 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 102 ms | 8040 KB | Output is correct |
2 | Incorrect | 114 ms | 8220 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 110 ms | 8024 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 109 ms | 8044 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |