Borderou de evaluare (job #1182010)

Utilizator lvamanuLoredana Vamanu lvamanu Data 4 mai 2014 14:46:52
Problema Algoritmul Bellman-Ford Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 35

Raport evaluator

Compilare: user.cpp: In function ‘void computeSSSD(int*, int, std::map<int, std::vector<Neighbor> >&)’: user.cpp:27:44: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j < neigh.size(); j++) { ^ user.cpp: In function ‘bool containsCycle(int*, int, std::map<int, std::vector<Neighbor> >&)’: user.cpp:42:40: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int j = 0; j < neigh.size(); j++) { ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
10ms388kbOK55
20ms388kbOK55
30ms392kbOK55
40ms400kbOK55
532ms428kbOK55
64ms396kbOK510
78ms404kbOK5
8Depăşit1352kbTime limit exceeded.00
9Depăşit1464kbTime limit exceeded.0
1012ms408kbOK5
11Depăşit2124kbTime limit exceeded.00
12Depăşit2680kbTime limit exceeded.0
13Depăşit2220kbTime limit exceeded.0
14Depăşit3408kbTime limit exceeded.0
15Depăşit3832kbTime limit exceeded.00
16Depăşit3368kbTime limit exceeded.0
1736ms420kbOK5
18Depăşit4180kbTime limit exceeded.00
19Depăşit4260kbTime limit exceeded.0
2056ms436kbOK5
Punctaj total35

Ceva nu functioneaza?