Borderou de evaluare (job #2901911)

Utilizator stefanliciuLiciu Vasile-Stefan stefanliciu Data 14 mai 2022 19:40:19
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:29:52: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 29 | 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:29:85: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 29 | 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:29:112: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 29 | 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:29:130: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 29 | 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
21ms184kbOK1010
31ms184kbOK1010
43ms4603kbOK1010
520ms4796kbOK1010
639ms6942kbOK1050
747ms6922kbOK10
892ms9154kbOK10
9136ms10592kbOK10
10123ms10727kbOK10
Punctaj total100

Ceva nu functioneaza?