#4070
Se dă lista muchiilor unui graf neorientat cu n
noduri, etichetate de la 1
la n
, m
muchii și un număr k
. Din acest graf se elimină toate nodurile etichetate cu multipli ai lui k
. Să se determine câte muchii va avea subgraful obținut.
Problema | Subgraf2 | Operații I/O |
![]() |
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #58133759 | Utilizator | |
Fișier | subgraf2.cpp | Dimensiune | 8.81 KB |
Data încărcării | 15 Mai 2025, 17:46 | Scor / rezultat | 100 puncte |
subgraf2.cpp: In function 'void ListaVecini()': subgraf2.cpp:48:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idy==a[x].size()) a[x].push_back(y); ^ subgraf2.cpp:53:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idx==a[y].size()) a[y].push_back(x); ^ subgraf2.cpp:62:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j<a[i].size(); j++) ^ subgraf2.cpp: In function 'bool check_adj(std::vector<std::vector<int> >&)': subgraf2.cpp:70:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i<v.size(); i++) ^ subgraf2.cpp:74:30: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i<v.size(); i++) ^ subgraf2.cpp: In function 'void grade()': subgraf2.cpp:105:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idy==a[x].size()) a[x].push_back(y); ^ subgraf2.cpp:110:28: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (idx==a[y].size()) a[y].push_back(x); ^ subgraf2.cpp: In function 'void gradeK()': subgraf2.cpp:138:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (v[i].size()==goodk) good.push_back(i); ^ subgraf2.cpp: In function 'void GradK()': subgraf2.cpp:179:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (v[i].size()==k) good.push_back(i); ^ subgraf2.cpp: In function 'void Saturate()': subgraf2.cpp:206: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;} ^ subgraf2.cpp: In function 'void GradMax()': subgraf2.cpp:226: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 | Exemplu | |
2 | 0 secunde | OK. | 20 | 20 | ||
3 | 0 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 Subgraf2 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ă.