Pagini recente » Borderou de evaluare (job #2389974) | Borderou de evaluare (job #447101) | Borderou de evaluare (job #930167) | Borderou de evaluare (job #1958763) | Borderou de evaluare (job #1472772)
Borderou de evaluare (job #1472772)
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 | 512kb | OK | 10 |
2 | 0ms | 592kb | OK | 10 |
3 | 12ms | 648kb | OK | 10 |
4 | 20ms | 692kb | OK | 10 |
5 | Depăşit | 848kb | Time limit exceeded. | 0 |
6 | Depăşit | 828kb | Time limit exceeded. | 0 |
7 | 84ms | 788kb | OK | 10 |
8 | Depăşit | 804kb | Time limit exceeded. | 0 |
9 | Depăşit | 884kb | Time limit exceeded. | 0 |
10 | 72ms | 788kb | OK | 10 |
Punctaj total | 60 |