#1861
Se dă un graf orientat aciclic cu N noduri numerotate de la 1 la N. Să se realizeze o sortare topologică a nodurilor.
| Problema | TopSort | Operații I/O |
topsort.in/topsort.out
|
|---|---|---|---|
| Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64493045 | Utilizator | |
| Fișier | topsort.cpp | Dimensiune | 563 B |
| Data încărcării | 11 Mai 2026, 09:28 | Scor/rezultat | Eroare de compilare |
topsort.cpp:5:13: error: variable ‘std::ifstream cin’ has initializer but incomplete type 5 | ifstream cin("topsort.in"); | ^ topsort.cpp:6:14: error: variable ‘std::ofstream cout’ has initializer but incomplete type 6 | ofstream cout("topsort.out"); | ^ topsort.cpp:8:1: error: ‘vector’ does not name a type 8 | vector <int> G[100001]; | ^~~~~~ topsort.cpp:9:1: error: ‘vector’ does not name a type 9 | vector <int> L; | ^~~~~~ topsort.cpp: In function ‘void dfs(int)’: topsort.cpp:15:18: error: ‘G’ was not declared in this scope 15 | for(auto i : G[nod]) | ^ topsort.cpp:17:5: error: ‘L’ was not declared in this scope 17 | L.push_back(nod); | ^ topsort.cpp: In function ‘int main()’: topsort.cpp:22:5: error: reference to ‘cin’ is ambiguous 22 | cin>>n>>m; | ^~~ In file included from topsort.cpp:1: /usr/include/c++/13/iostream:62:18: note: candidates are: ‘std::istream std::cin’ 62 | extern istream cin; ///< Linked to standard input | ^~~ topsort.cpp:5:10: note: ‘<typeprefixerror>cin’ 5 | ifstream cin("topsort.in"); | ^~~ topsort.cpp:25:9: error: reference to ‘cin’ is ambiguous 25 | cin >> x >> y; | ^~~ /usr/include/c++/13/iostream:62:18: note: candidates are: ‘std::istream std::cin’ 62 | extern istream cin; ///< Linked to standard input | ^~~ topsort.cpp:5:10: note: ‘<typeprefixerror>cin’ 5 | ifstream cin("topsort.in"); | ^~~ topsort.cpp:26:9: error: ‘G’ was not declared in this scope 26 | G[x].push_back(y); | ^ topsort.cpp:32:15: error: ‘L’ was not declared in this scope 32 | for(int i=L.size()-1;i>=0;i--) | ^ topsort.cpp:33:9: error: reference to ‘cout’ is ambiguous 33 | cout << L[i] << " "; | ^~~~ /usr/include/c++/13/iostream:63:18: note: candidates are: ‘std::ostream std::cout’ 63 | extern ostream cout; ///< Linked to standard output | ^~~~ topsort.cpp:6:10: note: ‘<typeprefixerror>cout’ 6 | ofstream cout("topsort.out"); | ^~~~
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema TopSort 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ă.