Pagini recente » Borderou de evaluare (job #2474801) | Borderou de evaluare (job #1572847) | Borderou de evaluare (job #2051869) | Borderou de evaluare (job #2636990) | Borderou de evaluare (job #1900412)
Borderou de evaluare (job #1900412)
Raport evaluator
Compilare:
user.cpp: In function ‘int main()’:
user.cpp:20:46: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
d1[i&1][j] = max(d1[i&1][j], d1[i&1^1][j]);
^
user.cpp:21:78: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
if(j+1 < 2 * 26 && j == str[i]) d1[i&1][j] = max(d1[i&1][j], d2[i&1^1][j+1] + 1);
^
user.cpp:25:46: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
d2[i&1][j] = max(d2[i&1][j], d2[i&1^1][j]);
^
user.cpp:27:74: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
if(j-1 >= 0 && j == str[i]) d2[i&1][j] = max(d2[i&1][j], d1[i&1^1][j-1] + 1); } }
^
user.cpp:28:18: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
g << max(d1[n&1^1][2*26-1], d2[n&1^1][0]) << endl;
^
user.cpp:28:37: warning: suggest parentheses around arithmetic in operand of ‘^’ [-Wparentheses]
g << max(d1[n&1^1][2*26-1], d2[n&1^1][0]) << endl;
^
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
1 | 0ms | 412kb | OK | 10 |
2 | 0ms | 416kb | OK | 10 |
3 | 0ms | 412kb | OK | 10 |
4 | 0ms | 420kb | OK | 10 |
5 | 4ms | 424kb | OK | 10 |
6 | 12ms | 428kb | OK | 10 |
7 | 76ms | 512kb | OK | 10 |
8 | 280ms | 760kb | OK | 10 |
9 | 400ms | 904kb | OK | 10 |
10 | 400ms | 904kb | OK | 10 |
Punctaj total | 100 |