# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
3 | cry | 159 |
5 | atcoder_official | 158 |
5 | awoo | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | maroonrk | 152 |
10 | Dominater069 | 149 |
CSES — Hotel Queries
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 |
---|