#4162
Se consideră un graf orientat cu n vârfuri, numerotate de la 1 la n, şi m muchii. Definim distanţa minimă dintre două noduri x şi y ca fiind numărul minim de arce al unui drum elementar care uneşte x cu y.
Se dau k perechi de vârfuri x y. Determinați pentru fiecare pereche distanța minimă dintre x și y.
| Problema | DrumuriMinime | Operații I/O |
dmin2.in/dmin2.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #63448750 | Utilizator | |
| Fișier | drumuriminime.cpp | Dimensiune | 1.71 KB |
| Data încărcării | 04 Martie 2026, 08:00 | Scor/rezultat | Eroare de compilare |
drumuriminime.cpp:58:13: error: redefinition of 'std::ifstream fin' ifstream fin("dmin2.in"); ^ drumuriminime.cpp:3:10: error: 'std::ifstream fin' previously declared here ifstream fin("dmin2.in"); ^ drumuriminime.cpp:59:14: error: redefinition of 'std::ofstream fout' ofstream fout("dmin2.out"); ^ drumuriminime.cpp:4:10: error: 'std::ofstream fout' previously declared here ofstream fout("dmin2.out"); ^ drumuriminime.cpp:60:5: error: redefinition of 'int n' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:5: error: 'int n' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:7: error: redefinition of 'int m' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:7: error: 'int m' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:9: error: redefinition of 'int k' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:9: error: 'int k' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:21: error: redefinition of 'int a [101][101]' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:11: error: 'int a [101][101]' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:28: error: redefinition of 'int c [101]' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:23: error: 'int c [101]' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:35: error: redefinition of 'int v [101]' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:30: error: 'int v [101]' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:47: error: redefinition of 'int d [101][101]' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:37: error: 'int d [101][101]' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:60:49: error: redefinition of 'int u' int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp:5:49: error: 'int u' previously declared here int n,m,k,a[101][101],c[101],v[101],d[101][101],u; ^ drumuriminime.cpp: In function 'void bfs()': drumuriminime.cpp:61:6: error: redefinition of 'void bfs()' void bfs() ^ drumuriminime.cpp:6:6: error: 'void bfs()' previously defined here void bfs() ^ drumuriminime.cpp: In function 'void citire()': drumuriminime.cpp:87:6: error: redefinition of 'void citire()' void citire() ^ drumuriminime.cpp:32:6: error: 'void citire()' previously defined here void citire() ^ drumuriminime.cpp: In function 'int main()': drumuriminime.cpp:106:5: error: redefinition of 'int main()' int main() ^ drumuriminime.cpp:51:5: error: 'int main()' previously defined here int main() ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema DrumuriMinime 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ă.