Borderou de evaluare (job #1139722)

Utilizator unholyfrozenCostea Andrei unholyfrozen Data 11 martie 2014 13:38:23
Problema Ninja Status done
Runda Arhiva de probleme Compilator cpp | Vezi sursa
Scor 80

Raport evaluator

Compilare: user.cpp: In function ‘void build_tree(int, int, int)’: user.cpp:34:38: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < V[node].size(); i++) ^ user.cpp:43:33: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (i = 0, j = 0; i < A.size() && j < B.size();) { ^ user.cpp:43:49: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (i = 0, j = 0; i < A.size() && j < B.size();) { ^ user.cpp:54:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (;i < A.size(); i++) { ^ user.cpp:58:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (;j < B.size(); j++) { ^ user.cpp:62:36: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (int i = 1; i < V[node].size(); i++) ^ user.cpp: In function ‘int bin_search(std::vector<long long int>&, int)’: user.cpp:68:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for (; k <= A.size(); k <<= 1); ^ user.cpp:70:26: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (i + k < A.size() && (A[i + k] - (i + k > 0 ? A[i + k - 1] : 0)) <= val) ^ user.cpp: In function ‘long long int search(int, int, int, int, int, bool, int)’: user.cpp:85:23: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if (V[node].size() > poz) ^
Test Timp executie Memorie folosita Mesaj Punctaj/test
18ms3328kbOK10
28ms3376kbOK10
324ms3648kbOK10
4248ms7252kbOK10
5420ms9156kbOK10
6612ms11352kbOK10
7812ms13428kbOK10
81020ms15352kbOK10
9Depăşit24484kbTime limit exceeded.0
10Depăşit24504kbTime limit exceeded.0
Punctaj total80

Ceva nu functioneaza?