6371 | 2023. 11. 26 09:39:34 | horvathabel | Adószedő | cpp17 | Elfogadva 30/30 | 474ms | 26904 KiB |
#include <bits/stdc++.h>
using namespace std;
vector<int> tav;
vector<int> g[60001];
vector<pair<int,int>> good;
void bfs(int s){
queue<int> q;
q.push(s);
while (!q.empty()){
int v=q.front();
q.pop();
for (int edge:g[v]){
if (tav[edge]==1e9){
tav[edge]=tav[v]+1;
q.push(edge);
good.push_back({v,edge});
}
else{
if (tav[edge]==tav[v]+1) good.push_back({v,edge});
}
}
}
cout<<good.size()<<endl;
for (auto x:good) cout<<x.first<<" "<<x.second<<endl;
}
int main()
{
vector<pair<int,int>> good;
int n,m,k;
cin>>n>>m>>k;
tav.resize(n+1,1e9);
tav[k]=0;
for (int i=0; i<m;i++){
int a,b;
cin>>a>>b;
g[a].push_back(b);
g[b].push_back(a);
}
bfs(k);
}
Részfeladat | Összpont | Teszt | Verdikt | Idő | Memória | ||
---|---|---|---|---|---|---|---|
base | 30/30 | ||||||
1 | Elfogadva | 0/0 | 4ms | 4628 KiB | |||
2 | Elfogadva | 0/0 | 379ms | 14028 KiB | |||
3 | Elfogadva | 1/1 | 4ms | 6840 KiB | |||
4 | Elfogadva | 1/1 | 4ms | 7072 KiB | |||
5 | Elfogadva | 1/1 | 4ms | 7280 KiB | |||
6 | Elfogadva | 1/1 | 4ms | 7132 KiB | |||
7 | Elfogadva | 1/1 | 4ms | 7356 KiB | |||
8 | Elfogadva | 1/1 | 4ms | 7620 KiB | |||
9 | Elfogadva | 2/2 | 4ms | 7860 KiB | |||
10 | Elfogadva | 2/2 | 6ms | 7832 KiB | |||
11 | Elfogadva | 2/2 | 6ms | 8096 KiB | |||
12 | Elfogadva | 2/2 | 26ms | 8980 KiB | |||
13 | Elfogadva | 2/2 | 59ms | 10364 KiB | |||
14 | Elfogadva | 2/2 | 312ms | 16576 KiB | |||
15 | Elfogadva | 1/1 | 449ms | 22828 KiB | |||
16 | Elfogadva | 1/1 | 365ms | 21376 KiB | |||
17 | Elfogadva | 2/2 | 368ms | 26508 KiB | |||
18 | Elfogadva | 2/2 | 395ms | 26060 KiB | |||
19 | Elfogadva | 2/2 | 474ms | 26424 KiB | |||
20 | Elfogadva | 2/2 | 363ms | 26824 KiB | |||
21 | Elfogadva | 2/2 | 354ms | 26904 KiB |