Borderou de evaluare (job #2901910)

Utilizator stefanliciuLiciu Vasile-Stefan stefanliciu Data 14 mai 2022 19:38:01
Problema Plantatie Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 100

Raport evaluator

Compilare: main.cpp: In function 'int main()': main.cpp:31:54: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 31 | d[i][j][k] = max({ d[i][j][k - 1], d[i + (1 << k - 1)][j][k - 1], d[i][j + (1 << k - 1)][k - 1], d[i + (1 << k - 1)][j + (1 << k - 1)][k - 1]}); | ~~^~~ main.cpp:31:88: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 31 | d[i][j][k] = max({ d[i][j][k - 1], d[i + (1 << k - 1)][j][k - 1], d[i][j + (1 << k - 1)][k - 1], d[i + (1 << k - 1)][j + (1 << k - 1)][k - 1]}); | ~~^~~ main.cpp:31:116: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 31 | d[i][j][k] = max({ d[i][j][k - 1], d[i + (1 << k - 1)][j][k - 1], d[i][j + (1 << k - 1)][k - 1], d[i + (1 << k - 1)][j + (1 << k - 1)][k - 1]}); | ~~^~~ main.cpp:31:134: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 31 | d[i][j][k] = max({ d[i][j][k - 1], d[i + (1 << k - 1)][j][k - 1], d[i][j + (1 << k - 1)][k - 1], d[i + (1 << k - 1)][j + (1 << k - 1)][k - 1]}); | ~~^~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms184kbOK1010
23ms184kbOK1010
31ms184kbOK1010
415ms4632kbOK1010
510ms4771kbOK1010
625ms6918kbOK1050
748ms6914kbOK10
889ms9146kbOK10
9113ms10620kbOK10
10162ms10715kbOK10
Punctaj total100

Ceva nu functioneaza?