Mai intai trebuie sa te autentifici.
Borderou de evaluare (job #2795529)
| Utilizator | Data | 6 noiembrie 2021 15:42:47 | |
|---|---|---|---|
| Problema | Componente biconexe | Status | done |
| Runda | Arhiva educationala | Compilator | cpp-64 | Vezi sursa |
| Scor | 90 | ||
Raport evaluator
Compilare:
main.cpp:16:31: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
16 | Graf(char* fisierIntrare={"bfs.in"});///constructor pentru problema bfs
| ^~~~~~~~
main.cpp:20:34: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
20 | void BFS(char* fisierIesire={"bfs.out"});///primul exercitiu(afiseaza intr-un fisier lungimea drumurilor de la un nod la restul)
| ^~~~~~~~~
main.cpp:21:33: warning: ISO C++ forbids converting a string constant to 'char*' [-Wwrite-strings]
21 | void DFS(char* fisierIesire="dfs.out");
| ^~~~~~~~~
main.cpp: In member function 'void Graf::BFS(char*)':
main.cpp:123:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
123 | for (int i = 0; i < lsAd[nodCrt].size(); i++)///trec prin toate nodurile adiacente
| ~~^~~~~~~~~~~~~~~~~~~~~
| Test | Timp executie | Memorie folosita | Mesaj | Punctaj/test |
|---|---|---|---|---|
| 1 | 1ms | 184kb | Corect | 10 |
| 2 | 1ms | 184kb | Corect | 10 |
| 3 | 1ms | 184kb | Corect | 10 |
| 4 | 1ms | 184kb | Corect | 10 |
| 5 | 1ms | 184kb | Corect | 10 |
| 6 | 19ms | 1355kb | Corect | 10 |
| 7 | 20ms | 2314kb | Corect | 10 |
| 8 | 405ms | 32444kb | Time limit exceeded | 0 |
| 9 | 193ms | 17965kb | Corect | 10 |
| 10 | 260ms | 25096kb | Corect | 10 |
| Punctaj total | 90 | |||
Ceva nu functioneaza?
- Citeste despre borderoul de evaluare.
- Daca tot nu e bine, contacteaza-ne pe forum !
