ANDROUND - AND Rounds
You are given a cyclic array A having N numbers. In an AND round, each element of the array A is replaced by the bitwise AND of itself, the previous element, and the next element in the array. All operations take place simultaneously. Can you calculate A after K such AND rounds ?
The first line contains the number of test cases T (T <= 50).
There follow 2T lines, 2 per test case. The first line contains two space seperated integers N (3 <= N <= 20000) and K (1 <= K <= 1000000000). The next line contains N space seperated integers Ai (0 <= Ai <= 1000000000), which are the initial values of the elements in array A.
Output T lines, one per test case. For each test case, output a space seperated list of N integers, specifying the contents of array A after K AND rounds.
Sample Input :
1 2 3
1 11 111 1111 11111
Sample Output :
0 0 0
1 1 1 1 1
My first segment tree problem with A.C. in one go..yippie :)
Segment Tree rocks!!
Accepted in one go, simple seg tree
If solving with segment tree just take care what value you return if that segment does not lie in the range :D
Why the answer of first test case 0 0 0?
Very interesting problem. Solved with BIT :)
I don't know about how others solved it but for me Segment Tree worked wonders, constant TLE and WA before that.Last edit: 2016-08-22 17:30:42
What a blunder i was committing. 0&A=a. :P finally AC