Pagini recente » Borderou de evaluare (job #1059212) | Borderou de evaluare (job #1090016) | Borderou de evaluare (job #2963068) | Borderou de evaluare (job #2900717) | Borderou de evaluare (job #3158330)
Borderou de evaluare (job #3158330)
Raport evaluator
Compilare:
main.cpp:7:24: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
7 | int const N=1e5+20,INF=1e18;
| ^~~~
main.cpp: In function 'void build_merge_tree(int, int, int)':
main.cpp:62:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
62 | while(i<V[2*node].size() && j<V[2*node+1].size()){
| ~^~~~~~~~~~~~~~~~~
main.cpp:62:34: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
62 | while(i<V[2*node].size() && j<V[2*node+1].size()){
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:68:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
68 | while(i<V[2*node].size())
| ~^~~~~~~~~~~~~~~~~
main.cpp:70:12: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
70 | while(j<V[2*node+1].size())
| ~^~~~~~~~~~~~~~~~~~~
main.cpp:74:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
74 | for(i=1;i<V[node].size();++i)
| ~^~~~~~~~~~~~~~~
main.cpp: In function 'void Query_merge(int, int, int, int, int, int)':
main.cpp:99:19: warning: unused variable 'H' [-Wunused-variable]
99 | long long H=S[node][S[node].size()-1],J=srt[val]*S[node].size();
| ^
main.cpp:99:47: warning: unused variable 'J' [-Wunused-variable]
99 | long long H=S[node][S[node].size()-1],J=srt[val]*S[node].size();
| ^
main.cpp:101:19: warning: unused variable 'Q' [-Wunused-variable]
101 | 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 | 823kb | OK | 10 | 10 |
2 | 3ms | 823kb | OK | 10 | 10 |
3 | 3ms | 819kb | Incorect | 0 | 0 |
4 | 8ms | 3178kb | Incorect | 0 | 0 |
5 | 29ms | 11403kb | Incorect | 0 | 0 |
6 | 19ms | 20537kb | Memory limit exceeded | 0 |
7 | 29ms | 20512kb | Memory limit exceeded | 0 |
8 | 34ms | 20877kb | Memory limit exceeded | 0 | 0 |
9 | 37ms | 21094kb | Memory limit exceeded | 0 | 0 |
10 | 40ms | 21004kb | Memory limit exceeded | 0 | 0 |
Punctaj total | 20 |