Pagini recente » Borderou de evaluare (job #1253521) | Borderou de evaluare (job #1346552) | Borderou de evaluare (job #2055492) | Borderou de evaluare (job #288799) | Borderou de evaluare (job #2807514)
Borderou de evaluare (job #2807514)
Raport evaluator
Compilare:
main.cpp: In member function 'bool graf::Havel_Hakimi(std::vector<int>, int)':
main.cpp:280:21: warning: comparison of integer expressions of different signedness: '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'} and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
280 | if(grade[0] > grade.size() - 1) // daca gradul este mai mare decat nr de noduri curente - 1 => NU se poate forma
main.cpp: In member function 'void graf::Bellman_Ford(int)':
main.cpp:521:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int>, std::allocator<std::pair<int, int> > >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
521 | for(int i = 0; i < muchii[nod_curent].size(); ++i) // parcurgem nodurile adiacente cu nodul curent
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In member function 'bool graf::Havel_Hakimi(std::vector<int>, int)':
main.cpp:293:1: warning: control reaches end of non-void function [-Wreturn-type]
293 | }
| ^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 13ms | 12304kb | Memory limit exceeded | 0 |
2 | 15ms | 12304kb | Memory limit exceeded | 0 |
3 | 14ms | 12304kb | Memory limit exceeded | 0 |
4 | 15ms | 12304kb | Memory limit exceeded | 0 |
5 | 14ms | 12304kb | Memory limit exceeded | 0 |
6 | 15ms | 12304kb | Memory limit exceeded | 0 |
7 | 15ms | 12304kb | Memory limit exceeded | 0 |
8 | 15ms | 12304kb | Memory limit exceeded | 0 |
9 | 15ms | 12304kb | Memory limit exceeded | 0 |
10 | 15ms | 12304kb | Memory limit exceeded | 0 |
Punctaj total | 0 |