#592
Kruskal
Se dă un graf neorientat ponderat conex cu n
vârfuri și m
muchii – în care fiecare muchie are asociat un cost, număr natural strict pozitiv. Folosind algoritmul lui Kruskal, determinați un arbore parțial de cost minim.
Problema | Kruskal | Operații I/O |
kruskal.in /kruskal.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #5103379 | Utilizator | |
Fișier | kruskal.cpp | Dimensiune | 1.22 KB |
Data încărcării | 04 Mai 2017, 15:58 | Scor / rezultat | Eroare de compilare |
kruskal.cpp:6:1: error: expected ',' or ';' before 'int' int n, m, L[20], j, k=0,x , y, ct=0, i; ^ kruskal.cpp: In function 'void init()': kruskal.cpp:13:21: error: 'n' was not declared in this scope for (int i=1;i<=n;i++) ^ kruskal.cpp:14:5: error: 'L' was not declared in this scope L[i]=i; ^ kruskal.cpp: In function 'void citire()': kruskal.cpp:19:8: error: 'n' was not declared in this scope f>>n; ^ kruskal.cpp:27:5: error: 'm' was not declared in this scope m=i; ^ kruskal.cpp: In function 'void sortare()': kruskal.cpp:33:16: error: 'm' was not declared in this scope for (i=1;i<m;i++) ^ kruskal.cpp: In function 'int main()': kruskal.cpp:46:5: error: 'i' was not declared in this scope i=1; ^ kruskal.cpp:47:12: error: 'k' was not declared in this scope while (k<n-1) ^ kruskal.cpp:47:14: error: 'n' was not declared in this scope while (k<n-1) ^ kruskal.cpp:49:17: error: 'L' was not declared in this scope if (L[u[i].x]!=L[u[i].y]) ^ kruskal.cpp:52:17: error: 'ct' was not declared in this scope ct+=u[i].c; ^ kruskal.cpp:54:17: error: 'x' was not declared in this scope x=L[u[i].y]; ^ kruskal.cpp:55:17: error: 'y' was not declared in this scope y=L[u[i].x]; ^ kruskal.cpp:56:22: error: 'j' was not declared in this scope for (j=1;j<=n;j++) ^ kruskal.cpp:61:12: error: 'ct' was not declared in this scope g<<ct<<' '; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Kruskal 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ă.