#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 | #50563822 | Utilizator | |
Fișier | roy-floyd.cpp | Dimensiune | 976 B |
Data încărcării | 15 Aprilie 2024, 13:31 | Scor / rezultat | Eroare de compilare |
roy-floyd.cpp:6:1: error: expected ',' or ';' before 'int' int a[101][101],n,m; ^ roy-floyd.cpp: In function 'void init()': roy-floyd.cpp:13:8: error: 'n' was not declared in this scope f>>n; ^ roy-floyd.cpp:14:8: error: 'm' was not declared in this scope f>>m; ^ roy-floyd.cpp:18:9: error: 'a' was not declared in this scope a[i][j]=0; ^ roy-floyd.cpp:20:9: error: 'a' was not declared in this scope a[i][j]=MAX; ^ roy-floyd.cpp:12:9: warning: unused variable 'i' [-Wunused-variable] int i,j; ^ roy-floyd.cpp:12:11: warning: unused variable 'j' [-Wunused-variable] int i,j; ^ roy-floyd.cpp: In function 'void citire()': roy-floyd.cpp:27:20: error: 'm' was not declared in this scope for(int r=1;r<=m;r++){ ^ roy-floyd.cpp:29:9: error: 'a' was not declared in this scope a[i][j]=c;} ^ roy-floyd.cpp: In function 'void transformare()': roy-floyd.cpp:36:20: error: 'n' was not declared in this scope for(int k=1;k<=n;k++) ^ roy-floyd.cpp:39:12: error: 'a' was not declared in this scope if(a[i][k]+a[k][j]<a[i][j]) ^ roy-floyd.cpp: In function 'void afisare()': roy-floyd.cpp:50:20: error: 'n' was not declared in this scope for(int i=1;i<=n;i++){ ^ roy-floyd.cpp:52:12: error: 'a' was not declared in this scope if(a[i][j]==MAX) g<<"-1"<< " "; ^
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ă.