Pagini recente » Borderou de evaluare (job #232638) | Borderou de evaluare (job #2359669) | Borderou de evaluare (job #1299355) | Borderou de evaluare (job #1820872) | Borderou de evaluare (job #3152557)
Borderou de evaluare (job #3152557)
Raport evaluator
Compilare:
main.cpp: In constructor 'minSegTree::minSegTree(long long int)':
main.cpp:138:8: warning: 'minSegTree::len' will be initialized after [-Wreorder]
138 | ll len;
| ^~~
main.cpp:137:16: warning: 'std::vector<long long int> minSegTree::tree' [-Wreorder]
137 | vector<ll> tree;
| ^~~~
main.cpp:140:5: warning: when initialized here [-Wreorder]
140 | 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:165:5: warning: no return statement in function returning non-void [-Wreturn-type]
165 | }
| ^
main.cpp:152:8: warning: infinite recursion detected [-Winfinite-recursion]
152 | ll query(ll l, ll r, ll tl, ll tr, ll v, ll &mxx) {
| ^~~~~
main.cpp:159:22: note: recursive call
159 | query(l, r, tl, tm, 2 * v, mxx);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
main.cpp:162:22: note: recursive call
162 | query(l, r, tm + 1, tr, 2 * v + 1, mxx);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Test |
Timp executie |
Memorie folosita |
Mesaj |
Punctaj/test |
Punctaj/grupa |
1 | 253ms | 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 | 3969kb | Time limit exceeded | 0 | 0 |
7 | 253ms | 4227kb | Time limit exceeded | 0 |
8 | 253ms | 3702kb | Time limit exceeded | 0 |
9 | 253ms | 4227kb | Time limit exceeded | 0 |
10 | 253ms | 4231kb | Time limit exceeded | 0 |
Punctaj total | 0 |