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 ?
Input
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
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.
Example
Sample Input: 2 3 1 1 2 3 5 100 1 11 111 1111 11111 Sample Output: 0 0 0 1 1 1 1 1
hide comments
shubhshrma:
20180103 11:37:34
Solved with simple arrays in 0.22s :) 

spojabhi:
20171220 21:34:54
good implementation of segment tree *_*


hemakshis:
20170624 18:32:25
My first segment tree problem with A.C. in one go..yippie :) 

akt_1998:
20170606 20:52:34
sweet :) 

and_roid:
20170605 19:40:24
Segment Tree rocks!! 

lord_poseidon:
20170601 12:34:11
Accepted in one go, simple seg tree 

yash_18:
20170601 10:36:53
If solving with segment tree just take care what value you return if that segment does not lie in the range :D 

sfialok98:
20170528 12:01:12
AC finally...!!!


xariniov9:
20170526 10:48:19
Why the answer of first test case 0 0 0?


nabila ahmed:
20161102 06:08:49
Very interesting problem. Solved with BIT :)

Added by:  Varun Jalan 
Date:  20100111 
Time limit:  0.625s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC PERL6 SQLITE VB.NET 
Resource:  Own Problem, used for Codechef Snackdown http://www.codechef.com/ 