Pagini recente » Borderou de evaluare (job #2692288) | Borderou de evaluare (job #730256) | Borderou de evaluare (job #2481212) | Borderou de evaluare (job #2652745) | Borderou de evaluare (job #3188633)
Borderou de evaluare (job #3188633)
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 |
1 | 1ms | 819kb | OK | 10 |
2 | 0ms | 557kb | OK | 10 |
3 | 1ms | 819kb | OK | 10 |
4 | 1ms | 557kb | OK | 10 |
5 | 1ms | 819kb | OK | 10 |
6 | 1ms | 557kb | OK | 10 |
7 | 1ms | 557kb | OK | 10 |
8 | 1ms | 819kb | OK | 10 |
9 | 0ms | 303kb | OK | 10 |
10 | 0ms | 303kb | OK | 10 |
Punctaj total | 100 |