Pagini recente » Borderou de evaluare (job #3039981) | Borderou de evaluare (job #2160524) | Borderou de evaluare (job #2730781) | Borderou de evaluare (job #2145318) | Borderou de evaluare (job #2124088)
Borderou de evaluare (job #2124088)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:18:16: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(!f[x][y]){
^
user.cpp:18:19: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(!f[x][y]){
^
user.cpp:19:18: warning: array subscript has type ‘char’ [-Wchar-subscripts]
++c[x];
^
user.cpp:20:27: warning: array subscript has type ‘char’ [-Wchar-subscripts]
if(x!=y) ++c[y];
^
user.cpp:21:16: warning: array subscript has type ‘char’ [-Wchar-subscripts]
f[x][y]=f[y][x]=1;
^
user.cpp:21:19: warning: array subscript has type ‘char’ [-Wchar-subscripts]
f[x][y]=f[y][x]=1;
^
user.cpp:21:24: warning: array subscript has type ‘char’ [-Wchar-subscripts]
f[x][y]=f[y][x]=1;
^
user.cpp:21:27: warning: array subscript has type ‘char’ [-Wchar-subscripts]
f[x][y]=f[y][x]=1;
^
user.cpp:34:22: warning: iteration 25u invokes undefined behavior [-Waggressive-loop-optimizations]
s+=(dp[i][n-1]);
^
user.cpp:33:15: note: containing loop
for(i=1; i<=26; ++i)
^
user.cpp:30:24: warning: iteration 25u invokes undefined behavior [-Waggressive-loop-optimizations]
dp[j][i]%=M;
^
user.cpp:27:19: note: containing loop
for(j=1; j<=26; ++j){
^
user.cpp:29:36: warning: iteration 25u invokes undefined behavior [-Waggressive-loop-optimizations]
dp[j][i]+=dp[k][i-1]*(1-f[j][k]);
^
user.cpp:28:23: note: containing loop
for(k=1; k<=26; ++k)
^
user.cpp:25:25: warning: iteration 25u invokes undefined behavior [-Waggressive-loop-optimizations]
dp[i][1]=26-c[i];
^
user.cpp:24:15: note: containing loop
for(i=1; i<=26; ++i)
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 1356kb | Incorect | 0 |
| 2 | 0ms | 1356kb | OK | 5 |
| 3 | 0ms | 1356kb | OK | 5 |
| 4 | 0ms | 1352kb | Killed by signal 11(SIGSEGV). | 0 |
| 5 | 0ms | 1356kb | Killed by signal 11(SIGSEGV). | 0 |
| 6 | 0ms | 1352kb | Killed by signal 11(SIGSEGV). | 0 |
| 7 | 0ms | 1352kb | Killed by signal 11(SIGSEGV). | 0 |
| 8 | 0ms | 1360kb | Killed by signal 11(SIGSEGV). | 0 |
| 9 | 0ms | 1360kb | Killed by signal 11(SIGSEGV). | 0 |
| 10 | 0ms | 1360kb | Killed by signal 11(SIGSEGV). | 0 |
| 11 | 0ms | 1356kb | Killed by signal 11(SIGSEGV). | 0 |
| 12 | 0ms | 1368kb | Killed by signal 11(SIGSEGV). | 0 |
| 13 | 0ms | 1396kb | Killed by signal 11(SIGSEGV). | 0 |
| 14 | 4ms | 1420kb | Killed by signal 11(SIGSEGV). | 0 |
| 15 | 4ms | 1432kb | Killed by signal 11(SIGSEGV). | 0 |
| 16 | 4ms | 1456kb | Killed by signal 11(SIGSEGV). | 0 |
| 17 | 4ms | 1452kb | Killed by signal 11(SIGSEGV). | 0 |
| 18 | 8ms | 1448kb | Killed by signal 11(SIGSEGV). | 0 |
| 19 | 8ms | 1452kb | Killed by signal 11(SIGSEGV). | 0 |
| 20 | 8ms | 1448kb | Killed by signal 11(SIGSEGV). | 0 |
| Punctaj total | 10 |