# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 170 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 160 |
5 | djm03178 | 158 |
5 | -is-this-fft- | 158 |
7 | adamant | 154 |
7 | Dominater069 | 154 |
9 | awoo | 153 |
10 | luogu_official | 152 |
CSES — Hotel Queries
Question. I understand how to solve this using Segment Trees.
I saw this solution by pikmike.
#include <iostream>
using namespace std;
#define f() for (i = y = 0; k = i / P, i < n; ++i)
main(){
int P = 450, n, m, x, y, i, k, a[P*P], b[P];
cin >> n >> m;
f() cin >> a[i], b[k] = 2e9;
for(;m--, cin >> x; cout << y << " ")
f() i%P || !y * b[k] >= x ? y | a[i] < x ? : (a[y = i] -= x, ++y), b[k] = max(i%P ? b[k] : 0, a[i]) : i += P - 1;
}
Can someone explain how this works?
Name |
---|