Borderou de evaluare (job #3188633)

Utilizator willOcanaru Mihai will Data 3 ianuarie 2024 16:32:31
Problema Ghizi Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'bool explorePaths()': main.cpp:23:25: warning: iteration 110 invokes undefined behavior [-Waggressive-loop-optimizations] 23 | visitedNodes[i] = 0; | ~~~~~~~~~~~~~~~~^~~ main.cpp:22:22: note: within this loop 22 | for(int i = 0; i <= MAX_NODES; i++) | ^ main.cpp:25:24: warning: iteration 110 invokes undefined behavior [-Waggressive-loop-optimizations] 25 | parentNodes[i] = -1; | ~~~~~~~~~~~~~~~^~~~ main.cpp:24:22: note: within this loop 24 | for(int i = 0; i <= MAX_NODES; i++) | ^ main.cpp:23:25: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [440, 443] is out of the bounds [0, 440] of object 'visitedNodes' with type 'int [110]' [-Warray-bounds] 23 | visitedNodes[i] = 0; | ~~~~~~~~~~~~~~~~^~~ main.cpp:14:56: note: 'visitedNodes' declared here 14 | int traversalQueue[MAX_NODES], parentNodes[MAX_NODES], visitedNodes[MAX_NODES], solutionEdges[MAX_EDGES]; | ^~~~~~~~~~~~ main.cpp:25:24: warning: 'void* __builtin_memset(void*, int, long unsigned int)' forming offset [440, 443] is out of the bounds [0, 440] of object 'parentNodes' with type 'int [110]' [-Warray-bounds] 25 | parentNodes[i] = -1; | ~~~~~~~~~~~~~~~^~~~ main.cpp:14:32: note: 'parentNodes' declared here 14 | int traversalQueue[MAX_NODES], parentNodes[MAX_NODES], visitedNodes[MAX_NODES], solutionEdges[MAX_EDGES]; | ^~~~~~~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test
11ms819kbOK10
20ms557kbOK10
31ms819kbOK10
41ms557kbOK10
51ms819kbOK10
61ms557kbOK10
71ms557kbOK10
81ms819kbOK10
90ms303kbOK10
100ms303kbOK10
Punctaj total100

Ceva nu functioneaza?