Borderou de evaluare (job #2241767)

Utilizator LucaSeriSeritan Luca LucaSeri Data 16 septembrie 2018 22:10:37
Problema Heavy Path Decomposition Status done
Runda Arhiva educationala Compilator cpp | Vezi sursa
Scor 0

Raport evaluator

Compilare: user.cpp: In member function ‘void Path::reversePathAndMakeTree()’: user.cpp:74:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while(nn < P.size()) nn <<= 1; ~~~^~~~~~~~~~ user.cpp:77:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i <= P.size(); ++ i) { ~~^~~~~~~~~~~ user.cpp: In function ‘int solve1(int, int)’: user.cpp:129:5: warning: this ‘if’ clause does not guard... [-Wmisleading-indentation] if (nodes[paths[nodes[a].pat].par].niv < nodes[paths[nodes[b].pat].par].niv) ^~ user.cpp:132:9: note: ...this statement, but the latter is misleadingly indented as if it is guarded by the ‘if’ ans = max(paths[nodes[a].pat].query(1, 1, paths[nodes[a].pat].P.size(), 1, nodes[a].pos), ans); ^~~ user.cpp: In function ‘int main()’: user.cpp:143:30: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] fscanf(f, "%d%d\n", &n, &m); ^ user.cpp:145:64: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] for (int i = 1; i <= n; ++ i) fscanf(f, "%d ", &nodes[i].val); ^ user.cpp:149:30: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] fscanf(f, "%d%d", &a, &b); ^ user.cpp:159:36: warning: ignoring return value of ‘int fscanf(FILE*, const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result] fscanf(f, "%d%d%d", &t, &a, &b); ^
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
1Depăşit4288kbTime limit exceeded.00
2Depăşit4292kbTime limit exceeded.0
3Depăşit4348kbTime limit exceeded.00
4Depăşit4400kbTime limit exceeded.0
5Depăşit7276kbTime limit exceeded.00
6Depăşit5332kbTime limit exceeded.0
7Depăşit6852kbTime limit exceeded.0
8Depăşit5328kbTime limit exceeded.0
9Depăşit10264kbTime limit exceeded.00
10Depăşit6244kbTime limit exceeded.0
11Depăşit9388kbTime limit exceeded.0
12Depăşit6248kbTime limit exceeded.0
13Depăşit10660kbTime limit exceeded.00
14Depăşit6964kbTime limit exceeded.0
15Depăşit11472kbTime limit exceeded.0
16Depăşit6960kbTime limit exceeded.0
17396ms12744kbOK50
18Depăşit7676kbTime limit exceeded.0
19Depăşit12176kbTime limit exceeded.0
20Depăşit7676kbTime limit exceeded.0
Punctaj total0

Ceva nu functioneaza?