#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 | #61787436 | Utilizator | |
| Fișier | bfs.cpp | Dimensiune | 837 B |
| Data încărcării | 10 Decembrie 2025, 09:48 | Scor/rezultat | Eroare de compilare |
bfs.cpp:7:13: error: variable 'std::ifstream cin' has initializer but incomplete type ifstream cin("BFS.in"); ^ bfs.cpp:8:14: error: variable 'std::ofstream cout' has initializer but incomplete type ofstream cout("BFS.out"); ^ bfs.cpp: In function 'void BFS(int)': bfs.cpp:14:5: error: reference to 'cout' is ambiguous cout<<x<<" "; ^ bfs.cpp:8:10: note: candidates are: <typeprefixerror>cout ofstream cout("BFS.out"); ^ In file included from bfs.cpp:1:0: /usr/include/c++/4.8/iostream:61:18: note: std::ostream std::cout extern ostream cout; /// Linked to standard output ^ bfs.cpp:25:17: error: reference to 'cout' is ambiguous cout<<t<<" "; ^ bfs.cpp:8:10: note: candidates are: <typeprefixerror>cout ofstream cout("BFS.out"); ^ In file included from bfs.cpp:1:0: /usr/include/c++/4.8/iostream:61:18: note: std::ostream std::cout extern ostream cout; /// Linked to standard output ^ bfs.cpp: In function 'int main()': bfs.cpp:35:5: error: reference to 'cin' is ambiguous cin>>n>>m>>X; ^ bfs.cpp:7:10: note: candidates are: <typeprefixerror>cin ifstream cin("BFS.in"); ^ In file included from bfs.cpp:1:0: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ bfs.cpp:39:9: error: reference to 'cin' is ambiguous cin>>x>>y; ^ bfs.cpp:7:10: note: candidates are: <typeprefixerror>cin ifstream cin("BFS.in"); ^ In file included from bfs.cpp:1:0: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ bfs.cpp:40:42: error: no matching function for call to 'find(std::vector<int>::iterator, std::vector<int>::iterator, int&)' if(find(G[x].begin(),G[x].end(),y)==G[x].end()) ^ bfs.cpp:40:42: note: candidate is: In file included from /usr/include/c++/4.8/bits/locale_facets.h:48:0, from /usr/include/c++/4.8/bits/basic_ios.h:37, from /usr/include/c++/4.8/ios:44, from /usr/include/c++/4.8/ostream:38, from /usr/include/c++/4.8/iostream:39, from bfs.cpp:1: /usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template<class _CharT2> typename __gnu_cxx::__enable_if<std::__is_char<_CharT2>::__value, std::istreambuf_iterator<_CharT> >::__type std::find(std::istreambuf_iterator<_CharT>, std::istreambuf_iterator<_CharT>, const _CharT2&) find(istreambuf_iterator<_CharT> __first, ^ /usr/include/c++/4.8/bits/streambuf_iterator.h:369:5: note: template argument deduction/substitution failed: bfs.cpp:40:42: note: '__gnu_cxx::__normal_iterator<int*, std::vector<int> >' is not derived from 'std::istreambuf_iterator<_CharT>' if(find(G[x].begin(),G[x].end(),y)==G[x].end()) ^
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ă.