#1887
Dijkstra are nevoie de ajutorul vostru pentru a-și duce la bun sfârșit datoria. Acesta vrea să afle drumurile de lungime minimă de la casa prietenului său Vlad la celelalte case ale vecinilor. Nu are foarte mult timp la dispoziție așa ca trebuie să vă mișcați repede. Îl veți ajuta?
Problema | Dijkstra2 | Operații I/O |
![]() dijkstra2.in /dijkstra2.out
|
---|---|---|---|
Limita timp | 0.2 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #57626184 | Utilizator | |
Fișier | dijkstra2.cpp | Dimensiune | 1.12 KB |
Data încărcării | 08 Aprilie 2025, 10:57 | Scor / rezultat | Eroare de compilare |
dijkstra2.cpp:7:13: error: variable 'std::ifstream cin' has initializer but incomplete type ifstream cin("dijkstra2.in"); ^ dijkstra2.cpp:8:14: error: variable 'std::ofstream cout' has initializer but incomplete type ofstream cout("dijkstra2.out"); ^ dijkstra2.cpp:12:1: error: 'vector' does not name a type vector <PI> G[100001]; ^ dijkstra2.cpp: In function 'void dijkstra(int)': dijkstra2.cpp:16:5: error: 'priority_queue' was not declared in this scope priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:16:25: error: expected primary-expression before ',' token priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:16:27: error: 'vector' was not declared in this scope priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:16:36: error: expected primary-expression before '>' token priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:16:38: error: expected primary-expression before ',' token priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:16:52: error: expected primary-expression before '>' token priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:16:54: error: 'Q' was not declared in this scope priority_queue < PI , vector<PI> , greater<PI> > Q; ^ dijkstra2.cpp:25:20: error: 'G' was not declared in this scope for(auto& q:G[y]) ^ dijkstra2.cpp: In function 'int main()': dijkstra2.cpp:40:5: error: reference to 'cin' is ambiguous cin >> n >> m >> p; ^ dijkstra2.cpp:7:10: note: candidates are: <typeprefixerror>cin ifstream cin("dijkstra2.in"); ^ In file included from dijkstra2.cpp:1:0: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ dijkstra2.cpp:43:9: error: reference to 'cin' is ambiguous cin >> x >> y >> w; ^ dijkstra2.cpp:7:10: note: candidates are: <typeprefixerror>cin ifstream cin("dijkstra2.in"); ^ In file included from dijkstra2.cpp:1:0: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ dijkstra2.cpp:44:9: error: 'G' was not declared in this scope G[x].push_back({y , w}); ^ dijkstra2.cpp:51:25: error: reference to 'cout' is ambiguous if(D[i] == Inf) cout << "-1 "; ^ dijkstra2.cpp:8:10: note: candidates are: <typeprefixerror>cout ofstream cout("dijkstra2.out"); ^ In file included from dijkstra2.cpp:1:0: /usr/include/c++/4.8/iostream:61:18: note: std::ostream std::cout extern ostream cout; /// Linked to standard output ^ dijkstra2.cpp:52:14: error: reference to 'cout' is ambiguous else cout << D[i] << " "; ^ dijkstra2.cpp:8:10: note: candidates are: <typeprefixerror>cout ofstream cout("dijkstra2.out"); ^ In file included from dijkstra2.cpp:1:0: /usr/include/c++/4.8/iostream:61:18: note: std::ostream std::cout extern ostream cout; /// Linked to standard output ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Dijkstra2 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ă.