#589
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 drumurilor 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 | #64108014 | Utilizator | |
| Fișier | roy-floyd.cpp | Dimensiune | 859 B |
| Data încărcării | 17 Aprilie 2026, 11:59 | Scor/rezultat | Eroare de compilare |
roy-floyd.cpp:6:1: error: expected ‘,’ or ‘;’ before ‘ofstream’ 6 | ofstream fout("roy-floyd.out") | ^~~~~~~~ roy-floyd.cpp: In function ‘int main()’: roy-floyd.cpp:12:10: error: ‘n’ was not declared in this scope 12 | fin>>n>>m; | ^ roy-floyd.cpp:15:9: error: ‘a’ was not declared in this scope 15 | a[i][j]= INFINIT; | ^ roy-floyd.cpp:15:18: error: ‘INFINIT’ was not declared in this scope 15 | a[i][j]= INFINIT; | ^~~~~~~ roy-floyd.cpp:16:5: error: ‘a’ was not declared in this scope 16 | a[i][i]= 0; | ^ roy-floyd.cpp:22:5: error: ‘a’ was not declared in this scope 22 | a[i][j]=c; | ^ roy-floyd.cpp:28:16: error: ‘a’ was not declared in this scope 28 | if(a[i][j]>a[i][j]+a[k][j]) | ^ roy-floyd.cpp:33:24: error: ‘a’ was not declared in this scope 33 | if(a[i][j] == INFINIT) | ^ roy-floyd.cpp:33:35: error: ‘INFINIT’ was not declared in this scope 33 | if(a[i][j] == INFINIT) | ^~~~~~~ roy-floyd.cpp:34:21: error: ‘fout’ was not declared in this scope 34 | fout<< -1<< " "; | ^~~~ roy-floyd.cpp:35:17: error: ‘fout’ was not declared in this scope 35 | fout<<endl; | ^~~~
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ă.