Pagini recente » Borderou de evaluare (job #1692357) | Borderou de evaluare (job #701511) | Borderou de evaluare (job #433935) | Borderou de evaluare (job #2811274) | Borderou de evaluare (job #2959448)
Borderou de evaluare (job #2959448)
Raport evaluator
Compilare:
main.cpp: In function 'bool FindUnsaturatedPath(int, int, int, std::vector<int>*, std::vector<int>*, long int**, long int**, int*, int*)':
main.cpp:28:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
28 | for(int i = 0; i < AdList[Node].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~
main.cpp:46:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
46 | for(int i = 0; i < AdInList[Node].size(); i++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~
main.cpp: In function 'int main()':
main.cpp:171:26: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
171 | for(int j = 0; j < AdjacencyList[i].size(); j++){
| ~~^~~~~~~~~~~~~~~~~~~~~~~~~
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 184kb | Nod inexistent in graf | 4 |
| 2 | 0ms | 184kb | OK | 10 |
| 3 | 0ms | 188kb | Raspuns gresit | 0 |
| 4 | 3ms | 4902kb | Raspuns gresit | 0 |
| 5 | 18ms | 12173kb | Raspuns gresit | 0 |
| 6 | 15ms | 20496kb | Memory limit exceeded | 0 |
| 7 | 16ms | 20496kb | Memory limit exceeded | 0 |
| 8 | 19ms | 20496kb | Memory limit exceeded | 0 |
| 9 | 20ms | 20496kb | Memory limit exceeded | 0 |
| 10 | 20ms | 20496kb | Memory limit exceeded | 0 |
| Punctaj total | 14 |
Olaeriu Vlad Mihai VladWero08