#19
Se consideră un graf neorientat cu n vârfuri și m muchii și un vârf cunoscut X. Să se afişeze vârfurile vizitate în urma parcurgerii în lățime a grafului pornind din vârful X.
| Problema | BFS | Operații I/O |
BFS.in/BFS.out
|
|---|---|---|---|
| Limita timp | 1 secunde | Limita memorie |
Total: 128 MB
/
Stivă 8 MB
|
| Id soluție | #64381088 | Utilizator | |
| Fișier | bfs.cpp | Dimensiune | 578 B |
| Data încărcării | 04 Mai 2026, 13:53 | Scor/rezultat | Eroare de compilare |
bfs.cpp:4:1: error: expected ‘,’ or ‘;’ before ‘ofstream’ 4 | ofstream cout("BFS.out") | ^~~~~~~~ bfs.cpp: In function ‘int main()’: bfs.cpp:7:10: error: ‘n’ was not declared in this scope 7 | cin>>n>>m>>X; | ^ bfs.cpp:7:13: error: ‘m’ was not declared in this scope; did you mean ‘tm’? 7 | cin>>n>>m>>X; | ^ | tm bfs.cpp:7:16: error: ‘X’ was not declared in this scope 7 | cin>>n>>m>>X; | ^ bfs.cpp:8:9: error: ‘i’ was not declared in this scope 8 | for(i=1;i<=m;i++) { | ^ bfs.cpp:9:14: error: ‘v1’ was not declared in this scope 9 | cin>>v1>>v2; | ^~ bfs.cpp:9:18: error: ‘v2’ was not declared in this scope 9 | cin>>v1>>v2; | ^~ bfs.cpp:10:9: error: ‘a’ was not declared in this scope 10 | a[v1][v2]=a[v2][v1]=1; } | ^ bfs.cpp:11:5: error: ‘p’ was not declared in this scope 11 | p=1; | ^ bfs.cpp:12:5: error: ‘u’ was not declared in this scope 12 | u=1; | ^ bfs.cpp:13:5: error: ‘c’ was not declared in this scope 13 | c[p]=x; | ^ bfs.cpp:13:10: error: ‘x’ was not declared in this scope 13 | c[p]=x; | ^ bfs.cpp:14:5: error: ‘v’ was not declared in this scope 14 | v[x]=1; | ^ bfs.cpp:16:13: error: ‘i’ was not declared in this scope 16 | for(i=1;i<=n;i++) | ^ bfs.cpp:17:16: error: ‘a’ was not declared in this scope 17 | if(a[c[p]][i]==1 && v[i]==0) { | ^ bfs.cpp:23:9: error: ‘i’ was not declared in this scope 23 | for(i=1;i<=u;i++) | ^ bfs.cpp:24:9: error: ‘cout’ was not declared in this scope 24 | cout<<c[i]<<" "; | ^~~~ bfs.cpp:2:1: note: ‘std::cout’ is defined in header ‘<iostream>’; did you forget to ‘#include <iostream>’? 1 | #include<fstream> +++ |+#include <iostream> 2 | using namespace std;
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema BFS face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.