#589
Roy-Floyd
Se dă un graf orientat ponderat cu n
noduri și m
arce – în care fiecare arc are asociat un cost, număr natural strict pozitiv. Folosind algoritmul Roy-Floyd, construiți matricea costurilor minime.
Problema | Roy-Floyd | Operații I/O |
roy-floyd.in /roy-floyd.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #49345026 | Utilizator | |
Fișier | roy-floyd.cpp | Dimensiune | 710 B |
Data încărcării | 27 Februarie 2024, 09:04 | Scor / rezultat | Eroare de compilare |
roy-floyd.cpp:6:1: error: expected ',' or ';' before 'int' int n,m,a[101][101],x,y,z; ^ roy-floyd.cpp: In function 'int main()': roy-floyd.cpp:9:10: error: 'n' was not declared in this scope fin>>n>>m; ^ roy-floyd.cpp:9:13: error: 'm' was not declared in this scope fin>>n>>m; ^ roy-floyd.cpp:12:14: error: 'x' was not declared in this scope fin>>x>>y; ^ roy-floyd.cpp:12:17: error: 'y' was not declared in this scope fin>>x>>y; ^ roy-floyd.cpp:13:9: error: 'a' was not declared in this scope a[x][y]=z; ^ roy-floyd.cpp:13:17: error: 'z' was not declared in this scope a[x][y]=z; ^ roy-floyd.cpp:18:5: error: 'a' was not declared in this scope if(a[i][j]==0) ^ roy-floyd.cpp:21:2: error: 'a' was not declared in this scope a[i][j]=0; ^ roy-floyd.cpp:21:7: error: 'j' was not declared in this scope a[i][j]=0; ^ roy-floyd.cpp:25:5: error: 'a' was not declared in this scope if(a[i][j]>a[i][k]+a[k][j]) ^ roy-floyd.cpp:29:5: error: 'a' was not declared in this scope if(a[i][j]==100000) ^ roy-floyd.cpp:34:12: error: 'a' was not declared in this scope fout<<a[i][j]<<" "; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Roy-Floyd 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ă.