#4780
Se dă un graf neorientat cu n
vârfuri și m
muchii. Să se afișeze în ordine lexicografică toate lanțurile hamiltoniene ale grafului dat.
Problema | Hamiltonian | Operații I/O |
![]() hamiltonian.in /hamiltonian.out
|
---|---|---|---|
Limita timp | 1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #58050437 | Utilizator | |
Fișier | hamiltonian.cpp | Dimensiune | 6.59 KB |
Data încărcării | 11 Mai 2025, 14:14 | Scor / rezultat | 100 puncte |
hamiltonian.cpp: In function 'void ListaVecini()': hamiltonian.cpp:73:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idy==a[x].size()) a[x].push_back(y); ^ hamiltonian.cpp:78:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idx==a[y].size()) a[y].push_back(x); ^ hamiltonian.cpp:87:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j<a[i].size(); j++) ^ hamiltonian.cpp: In function 'bool check_adj(std::vector<std::vector<int> >&)': hamiltonian.cpp:95:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i<v.size(); i++) ^ hamiltonian.cpp:99:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i<v.size(); i++) ^ hamiltonian.cpp: In function 'void grade()': hamiltonian.cpp:130:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idy==a[x].size()) a[x].push_back(y); ^ hamiltonian.cpp:135:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idx==a[y].size()) a[y].push_back(x); ^ hamiltonian.cpp: In function 'void gradeK()': hamiltonian.cpp:163:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (v[i].size()==goodk) good.push_back(i); ^ hamiltonian.cpp: In function 'void GradK()': hamiltonian.cpp:204:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (v[i].size()==k) good.push_back(i); ^ hamiltonian.cpp: In function 'void Saturate()': hamiltonian.cpp:231:49: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i<=n; i++) if (v[i].size()>=half) {fout<<i<<" "; check=1;} ^ hamiltonian.cpp: In function 'void GradMax()': hamiltonian.cpp:251:49: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i<=n; i++) if (v[i].size()==maxgrad) good.push_back(i); ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 20 | 20 | ||
2 | 0 secunde | OK. | 20 | 20 | ||
3 | 0.376 secunde | OK. | 20 | 20 | ||
4 | 0 secunde | OK. | 20 | 20 | ||
5 | 0 secunde | OK. | 20 | 20 | ||
Punctaj total | 100 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Hamiltonian 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ă.