Pagini recente » Borderou de evaluare (job #637015) | Borderou de evaluare (job #1222773) | Borderou de evaluare (job #2869941) | Borderou de evaluare (job #1147179) | Borderou de evaluare (job #3152559)
Borderou de evaluare (job #3152559)
Raport evaluator
Compilare:
main.cpp: In constructor 'minSegTree::minSegTree(long long int)':
main.cpp:140:8: warning: 'minSegTree::len' will be initialized after [-Wreorder]
140 | ll len;
| ^~~
main.cpp:139:16: warning: 'std::vector<long long int> minSegTree::tree' [-Wreorder]
139 | vector<ll> tree;
| ^~~~
main.cpp:142:5: warning: when initialized here [-Wreorder]
142 | minSegTree(ll _len) : len(_len), tree(4 * _len + 1, 0) {}
| ^~~~~~~~~~
main.cpp: In member function 'long long int minSegTree::query(long long int, long long int, long long int, long long int, long long int, long long int&)':
main.cpp:167:5: warning: no return statement in function returning non-void [-Wreturn-type]
167 | }
| ^
main.cpp:154:8: warning: infinite recursion detected [-Winfinite-recursion]
154 | ll query(ll l, ll r, ll tl, ll tr, ll v, ll &mxx) {
| ^~~~~
main.cpp:161:22: note: recursive call
161 | query(l, r, tl, tm, 2 * v, mxx);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:164:22: note: recursive call
164 | query(l, r, tm + 1, tr, 2 * v + 1, mxx);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 252ms | 303kb | Time limit exceeded | 0 | 0 |
2 | 253ms | 303kb | Time limit exceeded | 0 | 0 |
3 | 253ms | 303kb | Time limit exceeded | 0 | 0 |
4 | 253ms | 557kb | Time limit exceeded | 0 | 0 |
5 | 253ms | 3178kb | Time limit exceeded | 0 | 0 |
6 | 253ms | 3964kb | Time limit exceeded | 0 | 0 |
7 | 252ms | 4370kb | Time limit exceeded | 0 |
8 | 253ms | 3702kb | Time limit exceeded | 0 |
9 | 253ms | 4227kb | Time limit exceeded | 0 |
10 | 253ms | 4227kb | Time limit exceeded | 0 |
Punctaj total | 0 |