Kauliuko kelionė
Taškai: 0
Compile: OK
kauliukas.cpp: In function ‘int main()’: kauliukas.cpp:240:72: warning: iteration 3u invokes undefined behavior [-Waggressive-loop-optimizations] if(k[m[c][d]][f] == k[m[c][d+1]][pb] && p[c][d+1][pb] > p[c][d][f] + 1) ^ kauliukas.cpp:238:52: note: containing loop for(int pb = 1; pb <= 4; pb++) ^ kauliukas.cpp:212:72: warning: iteration 3u invokes undefined behavior [-Waggressive-loop-optimizations] if(k[m[c][d]][f] == k[m[c][d-1]][pb] && p[c][d-1][pb] > p[c][d][f] + 1) ^ kauliukas.cpp:210:52: note: containing loop for(int pb = 1; pb <= 4; pb++) ^ kauliukas.cpp:183:55: warning: iteration 3u invokes undefined behavior [-Waggressive-loop-optimizations] if(k[m[c+1][d]][pb] == m[c][d]) ^ kauliukas.cpp:181:52: note: containing loop for(int pb = 1; pb <= 4; pb++) ^ kauliukas.cpp:39:31: warning: iteration 99u invokes undefined behavior [-Waggressive-loop-optimizations] p[a][b][f] = 9; ^ kauliukas.cpp:35:26: note: containing loop for(int b = 1; b <= 100; b++) ^
| nr. | result | time | message |
|---|---|---|---|
| 1 | False | 0.004 s | Neteisinga eilutė |
| 2 | False | 0.0 s | Neteisinga eilutė |
| 3 | False | 0.0 s | Neteisinga eilutė |
| 4 | False | 0.004 s | Neteisinga eilutė |
| 5 | False | 0.008 s | Neteisinga eilutė |
| 6 | False | 0.04 s | Neteisinga eilutė |
| 7 | False | 0.004 s | Neteisinga eilutė |
| 8 | False | 0.672 s | Neteisinga eilutė |
| 9 | False | 1.08 s | Time limit exceeded (wall clock) |
| 10 | False | 0.004 s | Neteisinga eilutė |
| 11 | False | 0.0 s | Neteisinga eilutė |