# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3839 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3612 |
7 | Geothermal | 3569 |
7 | cnnfls_csy | 3569 |
9 | ecnerwala | 3494 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | Um_nik | 164 |
2 | maomao90 | 160 |
3 | -is-this-fft- | 159 |
4 | atcoder_official | 158 |
4 | awoo | 158 |
4 | cry | 158 |
7 | adamant | 155 |
8 | nor | 154 |
9 | TheScrasse | 152 |
10 | maroonrk | 151 |
Name |
---|
The algorithm basically reduces to this: the result for a position i = v[i-k] & v[i-k+1] & ... &v[i] & ... & v[i+k-1] & v[i+k], not taking into account the fact that the array is cyclical. The algorithm that you propose is O(log(maximum value) * N), as you do a pass for each bit in the values of the array. However, we can achieve O(N * log(N)) by using a interval tree which calculates the & value for arbitrary subsegments for the array. By using this, we can do a single pass through the results, and, for each result, calculate the value of v[i-k] & ... & v[i+k] (we have a special case in which either i-k or i+k reaches past the end of the array. Then we have v[0] & ... & v[(i+k)%n] & v[(i-k)&n] & ... & v[n-1], if we index the array v from 0). Since log(N) ~= 15, whereas log(maximum value) ~= 31, with this technique we can halve the execution time.
(for example source code you can look here http://pastebin.com/vD8renXr . I implemented the segment tree stupidly in this solution, so it might be a bit hard to understand -- sorry :( )