#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 | #49931391 | Utilizator | |
Fișier | roy-floyd.cpp | Dimensiune | 3.37 KB |
Data încărcării | 20 Martie 2024, 12:07 | Scor / rezultat | Eroare de compilare |
roy-floyd.cpp:95:2: error: stray '#' in program }#include <queue> ^ roy-floyd.cpp:95:3: error: 'include' does not name a type }#include <queue> ^ roy-floyd.cpp:103:12: error: redefinition of 'std::ifstream in' ifstream in("roy-floyd.in"); ^ roy-floyd.cpp:9:10: error: 'std::ifstream in' previously declared here ifstream in("roy-floyd.in"); ^ roy-floyd.cpp:104:13: error: redefinition of 'std::ofstream out' ofstream out("roy-floyd.out"); ^ roy-floyd.cpp:10:10: error: 'std::ofstream out' previously declared here ofstream out("roy-floyd.out"); ^ roy-floyd.cpp:106:8: error: redefinition of 'struct mare' struct mare ^ roy-floyd.cpp:12:8: error: previous definition of 'struct mare' struct mare ^ roy-floyd.cpp:111:5: error: redefinition of 'int n' int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:17:5: error: 'int n' previously declared here int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:111:8: error: redefinition of 'int m' int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:17:8: error: 'int m' previously declared here int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:111:20: error: redefinition of 'int dist [105]' int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:17:11: error: 'int dist [105]' previously declared here int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:111:37: error: redefinition of 'int rez [105][105]' int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:17:23: error: 'int rez [105][105]' previously declared here int n, m, dist[maxn], rez[maxn][maxn]; ^ roy-floyd.cpp:112:14: error: redefinition of 'bool viz [105]' bool viz[maxn]; ^ roy-floyd.cpp:18:6: error: 'bool viz [105]' previously declared here bool viz[maxn]; ^ roy-floyd.cpp:113:56: error: redefinition of 'std::priority_queue<std::vector<int>, std::vector<std::vector<int> >, mare> q' priority_queue<vector<int>, vector<vector<int>>, mare> q; ^ roy-floyd.cpp:19:56: error: 'std::priority_queue<std::vector<int>, std::vector<std::vector<int> >, mare> q' previously declared here priority_queue<vector<int>, vector<vector<int>>, mare> q; ^ roy-floyd.cpp:114:35: error: redefinition of 'std::vector<std::pair<int, int> > drumuri [105]' vector<pair<int,int>> drumuri[maxn]; ^ roy-floyd.cpp:20:23: error: 'std::vector<std::pair<int, int> > drumuri [105]' previously declared here vector<pair<int,int>> drumuri[maxn]; ^ roy-floyd.cpp: In function 'void citire()': roy-floyd.cpp:116:6: error: redefinition of 'void citire()' void citire() ^ roy-floyd.cpp:22:6: error: 'void citire()' previously defined here void citire() ^ roy-floyd.cpp: In function 'void init(int)': roy-floyd.cpp:128:6: error: redefinition of 'void init(int)' void init(int start) ^ roy-floyd.cpp:34:6: error: 'void init(int)' previously defined here void init(int start) ^ roy-floyd.cpp: In function 'void solve(int)': roy-floyd.cpp:140:6: error: redefinition of 'void solve(int)' void solve(int start) ^ roy-floyd.cpp:46:6: error: 'void solve(int)' previously defined here void solve(int start) ^ roy-floyd.cpp: In function 'void afisare()': roy-floyd.cpp:167:6: error: redefinition of 'void afisare()' void afisare() ^ roy-floyd.cpp:73:6: error: 'void afisare()' previously defined here void afisare() ^ roy-floyd.cpp: In function 'int main()': roy-floyd.cpp:177:5: error: redefinition of 'int main()' int main() ^ roy-floyd.cpp:83:5: error: 'int main()' previously defined here int main() ^
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ă.