#1572
Dându-se un graf conex, să se determine componentele biconexe, punctele de articulaţie şi muchiile critice ale acestuia.
| Problema | ComponenteBiconexe | Operații I/O |
componentebiconexe.in/componentebiconexe.out
|
|---|---|---|---|
| Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #50466713 | Utilizator | |
| Fișier | componentebiconexe.cpp | Dimensiune | 4.27 KB |
| Data încărcării | 10 Aprilie 2024, 16:13 | Scor/rezultat | 12 puncte |
componentebiconexe.cpp: In function 'void dfs(int)': componentebiconexe.cpp:25:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < adj[nod].size(); i++) ^ componentebiconexe.cpp:37:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < adj[nod].size(); i++) ^ componentebiconexe.cpp: In function 'void adaug_la_checker(int)': componentebiconexe.cpp:47:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < adj[nod].size(); i++) ^ componentebiconexe.cpp: In function 'void creaza_componente(int, int)': componentebiconexe.cpp:61:39: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < adj[nod].size(); i++) ^ componentebiconexe.cpp:72:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < b_tree[nod].size(); i++) ^ componentebiconexe.cpp: In function 'int main()': componentebiconexe.cpp:103:43: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j < adj[nod].size(); j++) ^ componentebiconexe.cpp:148:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j < adj[i].size(); j++) ^ componentebiconexe.cpp:167:45: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j < ans[i].size(); j++) ^
| Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
|---|---|---|---|---|---|---|
| 0 | 0 secunde | Numar componente biconexe gresit! | 4 | 0 | ||
| 1 | 0.08 secunde | Numar componente biconexe gresit! | 4 | 0 | ||
| 2 | 0.044 secunde | Numar componente biconexe gresit! | 4 | 0 | ||
| 3 | 0.108 secunde | Caught fatal signal 11 | 4 | 0 | ||
| 4 | 0.008 secunde | Numar componente biconexe gresit! | 4 | 0 | ||
| 5 | 0.008 secunde | Corect! | 4 | 4 | ||
| 6 | 0.02 secunde | Corect! | 4 | 4 | ||
| 7 | 0 secunde | Numar componente biconexe gresit! | 4 | 0 | ||
| 8 | 0 secunde | Corect! | 4 | 4 | ||
| 9 | 0 secunde | Numar componente biconexe gresit! | 4 | 0 | ||
| 10 | 0 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 11 | 0.064 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 12 | 0.036 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 13 | 0.108 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 14 | 0.004 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 15 | 0.004 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 16 | 0.02 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 17 | 0 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 18 | 0 secunde | Raspuns gresit | 3 | 0 | ||
| 19 | 0 secunde | Numar noduri critice gresit! | 3 | 0 | ||
| 20 | 0 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 21 | 0.064 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 22 | 0.032 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 23 | 0.112 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 24 | 0.004 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 25 | 0.008 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 26 | 0.02 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 27 | 0 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 28 | 0 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| 29 | 0 secunde | Numar muchii critice gresit! | 3 | 0 | ||
| Punctaj total | 12 | |||||
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema ComponenteBiconexe 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ă.