Pagini recente » Borderou de evaluare (job #1231821) | Borderou de evaluare (job #2964049) | Borderou de evaluare (job #864600) | Borderou de evaluare (job #2986261) | Borderou de evaluare (job #3158294)
Borderou de evaluare (job #3158294)
Raport evaluator
Compilare:
main.cpp: In function 'void build_merge_tree(long long int, long long int, long long int)':
main.cpp:61:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | while(i<V[2*node].size() && j<V[2*node+1].size()){
| ~^~~~~~~~~~~~~~~~~
main.cpp:61:34: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
61 | while(i<V[2*node].size() && j<V[2*node+1].size()){
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:67:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
67 | while(i<V[2*node].size())
| ~^~~~~~~~~~~~~~~~~
main.cpp:69:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
69 | while(j<V[2*node+1].size())
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:73:14: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
73 | for(i=1;i<V[node].size();++i)
| ~^~~~~~~~~~~~~~~
main.cpp: In function 'void Query_merge(long long int, long long int, long long int, long long int, long long int, long long int)':
main.cpp:98:19: warning: unused variable 'H' [-Wunused-variable]
98 | long long H=S[node][S[node].size()-1],J=srt[val]*S[node].size();
| ^
main.cpp:98:47: warning: unused variable 'J' [-Wunused-variable]
98 | long long H=S[node][S[node].size()-1],J=srt[val]*S[node].size();
| ^
main.cpp:100:19: warning: unused variable 'Q' [-Wunused-variable]
100 | 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 |
1 | 3ms | 1081kb | OK | 10 | 10 |
2 | 3ms | 1081kb | OK | 10 | 10 |
3 | 3ms | 1081kb | Incorect | 0 | 0 |
4 | 4ms | 3964kb | Incorect | 0 | 0 |
5 | 29ms | 13717kb | Incorect | 0 | 0 |
6 | 18ms | 20881kb | Memory limit exceeded | 0 |
7 | 28ms | 21032kb | Memory limit exceeded | 0 |
8 | 33ms | 21008kb | Memory limit exceeded | 0 | 0 |
9 | 36ms | 20963kb | Memory limit exceeded | 0 | 0 |
10 | 38ms | 20951kb | Memory limit exceeded | 0 | 0 |
Punctaj total | 20 |