Borderou de evaluare (job #3158330)

Utilizator PowerPlantNICOLAS ANDREI MANASIA PowerPlant Data 18 octombrie 2023 13:06:09
Problema Pikachu Status done
Runda Arhiva de probleme Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp:7:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow] 7 | int const N=1e5+20,INF=1e18; | ^~~~ main.cpp: In function 'void build_merge_tree(int, int, int)': main.cpp:62:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 62 | while(i<V[2*node].size() && j<V[2*node+1].size()){ | ~^~~~~~~~~~~~~~~~~ main.cpp:62:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 62 | while(i<V[2*node].size() && j<V[2*node+1].size()){ | ~^~~~~~~~~~~~~~~~~~~ main.cpp:68:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 68 | while(i<V[2*node].size()) | ~^~~~~~~~~~~~~~~~~ main.cpp:70:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 70 | while(j<V[2*node+1].size()) | ~^~~~~~~~~~~~~~~~~~~ main.cpp:74:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare] 74 | for(i=1;i<V[node].size();++i) | ~^~~~~~~~~~~~~~~ main.cpp: In function 'void Query_merge(int, int, int, int, int, int)': main.cpp:99:19: warning: unused variable 'H' [-Wunused-variable] 99 | long long H=S[node][S[node].size()-1],J=srt[val]*S[node].size(); | ^ main.cpp:99:47: warning: unused variable 'J' [-Wunused-variable] 99 | long long H=S[node][S[node].size()-1],J=srt[val]*S[node].size(); | ^ main.cpp:101:19: warning: unused variable 'Q' [-Wunused-variable] 101 | long long Q=S[node][S[node].size()-1]-srt[val]*S[node].size()-2*(S[node][ANS]-srt[val]*(ANS+1)); | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
13ms823kbOK1010
23ms823kbOK1010
33ms819kbIncorect00
48ms3178kbIncorect00
529ms11403kbIncorect00
619ms20537kbMemory limit exceeded0
729ms20512kbMemory limit exceeded0
834ms20877kbMemory limit exceeded00
937ms21094kbMemory limit exceeded00
1040ms21004kbMemory limit exceeded00
Punctaj total20

Ceva nu functioneaza?