Borderou de evaluare (job #2499944)

Utilizator mihnea00Duican Mihnea mihnea00 Data 26 noiembrie 2019 23:36:07
Problema Lowest Common Ancestor Status done
Runda Arhiva educationala Compilator cpp-64 | Vezi sursa
Scor 70

Raport evaluator

Compilare: main.cpp: In function 'void recursiveDfs(int&, std::vector<std::vector<int> >&, std::vector<std::vector<std::pair<int, int> > >&, bool*, int*, int*, int*, std::vector<int>&)': main.cpp:97:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < graph[node].size(); ++i) { ~~^~~~~~~~~~~~~~~~~~~~ main.cpp:109:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < queries[node].size(); ++i) { ~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'std::vector<int> lca(std::vector<std::vector<int> >&, std::vector<std::pair<int, int> >&)': main.cpp:128:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < queries.size(); ++i) { ~~^~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:195:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 0; i < ans.size(); ++i) { ~~^~~~~~~~~~~~ main.cpp:169:12: warning: unused variable 'parent' [-Wunused-variable] int n, m, parent, node1, node2; ^~~~~~
Test Timp executie Memorie folosita Mesaj Punctaj/test Punctaj/grupa
12ms131kbOK1010
24ms262kbOK1010
324ms1572kbOK1010
4253ms11132kbOK1010
5315ms14409kbOK1010
6456ms18337kbOK1010
71222ms51490kbOK1010
82106ms63283kbOK100
92606ms82853kbOK10
102801ms89104kbTime limit exceeded0
Punctaj total70

Ceva nu functioneaza?