Borderou de evaluare (job #3039071)

Utilizator ezluciPirtac Eduard ezluci Data 28 martie 2023 09:59:11
Problema Heavy Path Decomposition Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 20

Raport evaluator

Compilare: main.cpp: In function 'void buildAint(int, int, int, int)': main.cpp:101:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses] 101 | int mj = st+dr >> 1; | ~~^~~ main.cpp: In function 'int queryAint(std::vector<int>&, int, int, int, int, int)': main.cpp:112:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses] 112 | int mj = st+dr >> 1; | ~~^~~ main.cpp: In function 'void updateAint(std::vector<int>&, int, int, int, int, int)': main.cpp:127:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses] 127 | int mj = st+dr >> 1; | ~~^~~ main.cpp: In function 'void genRMQ()': main.cpp:145:36: warning: suggest parentheses around '-' inside '<<' [-Wparentheses] 145 | int b = rmq[j-1][i + (1<<j-1)]; | ~^~ main.cpp: In function 'void dfsDecompose(int, std::vector<int>&, int)': main.cpp:82:22: warning: 'i' may be used uninitialized [-Wmaybe-uninitialized] 82 | dfsDecompose(fiu, p, nod); | ~~~~~~~~~~~~^~~~~~~~~~~~~ main.cpp:64:17: note: 'i' was declared here 64 | int max = 0, i; | ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
11ms303kbOK510
21ms303kbOK5
32ms819kbOK510
44ms1081kbOK5
5302ms11636kbTime limit exceeded00
674ms10391kbOK5
7302ms11169kbTime limit exceeded0
874ms10485kbOK5
921ms21086kbMemory limit exceeded00
10103ms20443kbOK5
1122ms21008kbMemory limit exceeded0
1289ms20459kbOK5
1324ms20955kbMemory limit exceeded00
1424ms20971kbMemory limit exceeded0
1523ms21053kbMemory limit exceeded0
1624ms20930kbMemory limit exceeded0
1727ms20856kbMemory limit exceeded00
1826ms20996kbMemory limit exceeded0
1927ms20951kbMemory limit exceeded0
2026ms20951kbMemory limit exceeded0
Punctaj total20

Ceva nu functioneaza?