#588
Dijkstra
Se dă un graf orientat ponderat – în care fiecare arc are asociat un cost, număr natural strict pozitiv, și un nod p
. Să se determine, folosind algoritmul lui Dijkstra, costul minim al drumului de la p
la fiecare nod al grafului.
Problema | Dijkstra | Operații I/O |
dijkstra.in /dijkstra.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #2060004 | Utilizator | |
Fișier | dijkstra.cpp | Dimensiune | 2.85 KB |
Data încărcării | 11 Martie 2016, 17:27 | Scor / rezultat | Eroare de compilare |
dijkstra.cpp: In function 'void citire()': dijkstra.cpp:14:15: warning: unused variable 'm' [-Wunused-variable] int x,y,c,m; ^ dijkstra.cpp: In function 'void dijkstra(int)': dijkstra.cpp:24:11: warning: unused variable 'j' [-Wunused-variable] int i,j,mi,k,ok; ^ dijkstra.cpp:25:27: warning: variable 'tata' set but not used [-Wunused-but-set-variable] int viz[NMax],d[NMax],tata[NMax]; ^ dijkstra.cpp: At global scope: dijkstra.cpp:84:13: error: redefinition of 'std::ifstream fin' ifstream fin("graf.in"); ^ dijkstra.cpp:8:10: error: 'std::ifstream fin' previously declared here ifstream fin("graf.in"); ^ dijkstra.cpp:85:14: error: redefinition of 'std::ofstream fout' ofstream fout("graf.out"); ^ dijkstra.cpp:9:10: error: 'std::ofstream fout' previously declared here ofstream fout("graf.out"); ^ dijkstra.cpp:86:5: error: redefinition of 'int N' int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:10:5: error: 'int N' previously declared here int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:86:7: error: redefinition of 'int M' int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:10:7: error: 'int M' previously declared here int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:86:9: error: redefinition of 'int S' int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:10:9: error: 'int S' previously declared here int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:86:11: error: redefinition of 'int i' int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:10:11: error: 'int i' previously declared here int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:86:25: error: redefinition of 'int C [3001][3001]' int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:10:13: error: 'int C [3001][3001]' previously declared here int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:86:27: error: redefinition of 'int p' int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:10:27: error: 'int p' previously declared here int N,M,S,i,C[NMax][NMax],p; ^ dijkstra.cpp:87:12: error: redefinition of 'char U [3001]' char U[NMax]; ^ dijkstra.cpp:11:6: error: 'char U [3001]' previously declared here char U[NMax]; ^ dijkstra.cpp: In function 'void citire()': dijkstra.cpp:88:6: error: redefinition of 'void citire()' void citire() ^ dijkstra.cpp:12:6: error: 'void citire()' previously defined here void citire() ^ dijkstra.cpp:90:15: warning: unused variable 'm' [-Wunused-variable] int x,y,c,m; ^ dijkstra.cpp: In function 'void dijkstra(int)': dijkstra.cpp:98:6: error: redefinition of 'void dijkstra(int)' void dijkstra(int sursa) ^ dijkstra.cpp:22:6: error: 'void dijkstra(int)' previously defined here void dijkstra(int sursa) ^ dijkstra.cpp:100:11: warning: unused variable 'j' [-Wunused-variable] int i,j,mi,k,ok; ^ dijkstra.cpp: In function 'void afis()': dijkstra.cpp:137:6: error: redefinition of 'void afis()' void afis() ^ dijkstra.cpp:61:6: error: 'void afis()' previously defined here void afis() ^ dijkstra.cpp: In function 'int main()': dijkstra.cpp:146:5: error: redefinition of 'int main()' int main() ^ dijkstra.cpp:70:5: error: 'int main()' previously defined here int main() ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Dijkstra 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ă.