Pagini recente » Borderou de evaluare (job #228046) | Borderou de evaluare (job #986772) | Borderou de evaluare (job #419281) | Borderou de evaluare (job #1290913) | Borderou de evaluare (job #1472771)
Borderou de evaluare (job #1472771)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:79:54: warning: array subscript has type ‘char’ [-Wchar-subscripts]
for (int i = 1;i <= mx;++i) r[i] = an[mult[r[i-1]][base]];
^
user.cpp:79:60: warning: array subscript has type ‘char’ [-Wchar-subscripts]
for (int i = 1;i <= mx;++i) r[i] = an[mult[r[i-1]][base]];
^
user.cpp:79:61: warning: array subscript has type ‘char’ [-Wchar-subscripts]
for (int i = 1;i <= mx;++i) r[i] = an[mult[r[i-1]][base]];
^
user.cpp:84:48: warning: array subscript has type ‘char’ [-Wchar-subscripts]
lin[i][j] = an[mult[lin[i][j-1]][base] + x];
^
user.cpp:84:54: warning: array subscript has type ‘char’ [-Wchar-subscripts]
lin[i][j] = an[mult[lin[i][j-1]][base] + x];
^
user.cpp:85:48: warning: array subscript has type ‘char’ [-Wchar-subscripts]
col[i][j] = an[mult[col[i-1][j]][base] + x];
^
user.cpp:85:54: warning: array subscript has type ‘char’ [-Wchar-subscripts]
col[i][j] = an[mult[col[i-1][j]][base] + x];
^
user.cpp:92:68: warning: array subscript has type ‘char’ [-Wchar-subscripts]
while (len <= k && an[lin[i+len][j+len] + mult[r[len+1]][col[i-1][j+len]]] == an[col[i+len][j+len] + mult[r[len+1]][lin[i+len][j-1]]]) ++len;
^
user.cpp:92:85: warning: array subscript has type ‘char’ [-Wchar-subscripts]
while (len <= k && an[lin[i+len][j+len] + mult[r[len+1]][col[i-1][j+len]]] == an[col[i+len][j+len] + mult[r[len+1]][lin[i+len][j-1]]]) ++len;
^
user.cpp:92:127: warning: array subscript has type ‘char’ [-Wchar-subscripts]
while (len <= k && an[lin[i+len][j+len] + mult[r[len+1]][col[i-1][j+len]]] == an[col[i+len][j+len] + mult[r[len+1]][lin[i+len][j-1]]]) ++len;
^
user.cpp:92:144: warning: array subscript has type ‘char’ [-Wchar-subscripts]
while (len <= k && an[lin[i+len][j+len] + mult[r[len+1]][col[i-1][j+len]]] == an[col[i+len][j+len] + mult[r[len+1]][lin[i+len][j-1]]]) ++len;
^
| Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
| 1 | 0ms | 516kb | OK | 10 |
| 2 | 0ms | 584kb | OK | 10 |
| 3 | 12ms | 636kb | OK | 10 |
| 4 | 24ms | 676kb | OK | 10 |
| 5 | Depăşit | 804kb | Time limit exceeded. | 0 |
| 6 | Depăşit | 804kb | Time limit exceeded. | 0 |
| 7 | 104ms | 772kb | OK | 10 |
| 8 | Depăşit | 760kb | Time limit exceeded. | 0 |
| 9 | Depăşit | 836kb | Time limit exceeded. | 0 |
| 10 | 88ms | 776kb | OK | 10 |
| Punctaj total | 60 |