Borderou de evaluare (job #1864968)

Utilizator Stefanescu_MihaiStefanescu Mihai-Nicolae Stefanescu_Mihai Data 1 februarie 2017 10:09:20
Problema Algoritmul lui Dijkstra Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 100

Raport evaluator

Compilare: user.cpp: In function ‘int main()’: user.cpp:343:7: warning: suggest explicit braces to avoid ambiguous ‘else’ [-Wparentheses] if (!visited[target[currNode][i]]) ^ user.cpp: In member function ‘bool Heap<type>::push(const type&, int) [with type = int]’: user.cpp:100:3: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow] if (n < numElem) ^ user.cpp: In function ‘int main()’: user.cpp:100:3: warning: assuming signed overflow does not occur when assuming that (X + c) < X is always false [-Wstrict-overflow] if (n < numElem) ^ user.cpp:345:47: warning: ‘currNode’ may be used uninitialized in this function [-Wmaybe-uninitialized] heap.push(currCost + costEdge[currNode][i], target[currNode][i]); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
10ms1964kbOK10
20ms1972kbOK10
34ms2004kbOK10
44ms2028kbOK10
528ms2400kbOK10
656ms2760kbOK10
776ms3052kbOK10
8164ms4312kbOK10
9116ms4220kbOK10
10360ms6068kbOK10
Punctaj total100

Ceva nu functioneaza?