You are given an array A of size N; find the minimum value of K such that number of subarrays with XOR value at most K is at least X:
- 1 <=N << 10^5
- 1 <= X <= N*(N+2)/2
1 <= A[i] <= 10^6
For Input : 4 7 1 2 3 4 Output : 4
# | User | Rating |
---|---|---|
1 | tourist | 3880 |
2 | jiangly | 3669 |
3 | ecnerwala | 3654 |
4 | Benq | 3627 |
5 | orzdevinwang | 3612 |
6 | Geothermal | 3569 |
6 | cnnfls_csy | 3569 |
8 | jqdai0815 | 3532 |
9 | Radewoosh | 3522 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 157 |
4 | maroonrk | 154 |
5 | -is-this-fft- | 148 |
5 | atcoder_official | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | TheScrasse | 145 |
9 | nor | 145 |
Need Help in this question...
You are given an array A of size N; find the minimum value of K such that number of subarrays with XOR value at most K is at least X:
1 <= A[i] <= 10^6
For Input :
4 7
1 2 3 4
Output : 4
Name |
---|