Borderou de evaluare (job #2802840)

Utilizator PopescuMihneaPopescu Mihnea-Valentin PopescuMihnea Data 18 noiembrie 2021 21:26:34
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 35

Raport evaluator

Compilare: main.cpp: In member function 'void graf::havelhakimi()': main.cpp:383:33: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 383 | for (unsigned int i=0; i<=vmax; ++i) | ~^~~~~~ main.cpp:384:37: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 384 | for (unsigned int j=0; j<ap[i]; ++j) | ~^~~~~~ main.cpp: In member function 'void graf::disjoint()': main.cpp:575:29: warning: comparison of integer expressions of different signedness: 'unsigned int' and 'int' [-Wsign-compare] 575 | for (unsigned int i=0; i<=n; ++i) | ~^~~ main.cpp: In member function 'void graf::dijkstra()': main.cpp:654:24: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare] 654 | for (int i=0; i<lista_vecini[nod].size(); ++i) | ~^~~~~~~~~~~~~~~~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbOK55
21ms184kbOK55
31ms184kbOK55
41ms184kbOK55
5421ms184kbOK55
61ms184kbOK510
798ms245kbOK5
8500ms1245kbTime limit exceeded00
9502ms1241kbTime limit exceeded0
10248ms290kbOK5
11500ms1994kbTime limit exceeded00
12502ms2416kbTime limit exceeded0
13505ms2068kbTime limit exceeded0
14503ms3190kbTime limit exceeded0
15505ms3727kbTime limit exceeded00
16503ms3096kbTime limit exceeded0
17502ms184kbTime limit exceeded0
18502ms4616kbTime limit exceeded00
19503ms5251kbTime limit exceeded0
20500ms307kbTime limit exceeded0
Punctaj total35

Ceva nu functioneaza?