fork download
copy 
  1. import java.io.DataInputStream;
  2. import java.io.FileInputStream;
  3. import java.io.IOException;
  4. import java.io.PrintWriter;
  5.  
  6.  
  7. class ANDROUND {
  8. static int a[];
  9. 	public static void main(String[] args) throws IOException {
  10. 		// TODO Auto-generated method stub
  11. 		Reader ir = new Reader();
  12. 		int t = ir.nextInt();
  13. 		StringBuilder sb = new StringBuilder();
  14. 		PrintWriter pr = new PrintWriter(System.out);
  15. 		 while (t-- > 0) {
  16. 			int n = ir.nextInt();
  17. 			int k = ir.nextInt();
  18. 			a = new int[n+1];
  19. 		//	int b[] = new int[n];
  20. 			 k=k<n?k:n;
  21. 			for (int i = 1; i <= n; i++) {
  22. 				a[i] = ir.nextInt();
  23.  
  24. 			}
  25. 			Segment_Tree st=new Segment_Tree(1,n);
  26. 		for(int i=1;i<= n ;i++){
  27. 			int s=(i-k+n)%n;
  28. 			int e=(i+k)%n;
  29. 			if(s==0)s=n;
  30. 			if(e==0)e=n;
  31. 			int res=-1;
  32. 			if(s<i)
  33. 			 res&=st.query(s, i).value;
  34. 			else res&= st.query(s, n).value & st.query(1, i).value;
  35. 			 if(e>i)res&= st.query(i, e).value;
  36. 			 else res &= st.query(1, e).value & st.query(i,n).value;
  37. 			sb.append(res+" ");
  38. 			//System.out.println(res);
  39. 		}
  40. 		sb.append("\n");
  41.  
  42. 		}
  43.  
  44. 		pr.write(sb.toString());
  45. 		pr.flush();
  46. 	}
  47. static class Segment_Tree{
  48. 	int start, end, value;
  49. 	Segment_Tree left_child,right_child;
  50. 	public Segment_Tree(int a,int b){
  51. 		start=a;
  52. 		end=b;
  53. 		if(start!=end){
  54. 			int mid=(start+end)>>1;
  55. 			left_child=new Segment_Tree(a, mid);
  56. 			right_child=new Segment_Tree(mid+1, b);
  57. 			join(this, left_child, right_child);
  58. 		}
  59. 		else this.value=ANDROUND.a[start];
  60. 	}
  61. 	public Segment_Tree(){}
  62. 	public void join(Segment_Tree parent,Segment_Tree left_child,Segment_Tree right_child){
  63. 		parent.value=left_child.value&right_child.value;
  64. 	}
  65. 	public Segment_Tree query(int a,int b){
  66. 		if(start==a && end==b){
  67. 			return this;
  68. 		}
  69. 		int mid=(start+end)>>1;
  70. 		if(a>mid)return right_child.query(a, b);
  71. 		else if(b<=mid)return left_child.query(a, b);
  72. 		Segment_Tree ans=new Segment_Tree();
  73. 		join(ans,left_child.query(a,mid),right_child.query(mid+1, b));
  74. 		return ans;
  75. 	}
  76. }
  77. 	static class Reader {
  78. 		final private int BUFFER_SIZE = 1 << 16;
  79. 		private DataInputStream din;
  80. 		private byte[] buffer;
  81. 		private int bufferPointer, bytesRead;
  82.  
  83. 		public Reader() {
  84. 			din = new DataInputStream(System.in);
  85. 			buffer = new byte[BUFFER_SIZE];
  86. 			bufferPointer = bytesRead = 0;
  87. 		}
  88.  
  89. 		public Reader(String file_name) throws IOException {
  90. 			din = new DataInputStream(new FileInputStream(file_name));
  91. 			buffer = new byte[BUFFER_SIZE];
  92. 			bufferPointer = bytesRead = 0;
  93. 		}
  94.  
  95. 		public String readLine() throws IOException {
  96. 			byte[] buf = new byte[64];
  97. 			int cnt = 0, c;
  98. 			while ((c = read()) != -1) {
  99. 				if (c == '\n')
  100. 					break;
  101. 				buf[cnt++] = (byte) c;
  102. 			}
  103. 			return new String(buf, 0, cnt);
  104. 		}
  105.  
  106. 		public int nextInt() throws IOException {
  107. 			int ret = 0;
  108. 			byte c = read();
  109. 			while (c <= ' ')
  110. 				c = read();
  111. 			boolean neg = (c == '-');
  112. 			if (neg)
  113. 				c = read();
  114. 			do {
  115. 				ret = ret * 10 + c - '0';
  116. 			} while ((c = read()) >= '0' && c <= '9');
  117. 			if (neg)
  118. 				return -ret;
  119. 			return ret;
  120. 		}
  121.  
  122. 		public long nextLong() throws IOException {
  123. 			long ret = 0;
  124. 			byte c = read();
  125. 			while (c <= ' ')
  126. 				c = read();
  127. 			boolean neg = (c == '-');
  128. 			if (neg)
  129. 				c = read();
  130. 			do {
  131. 				ret = ret * 10 + c - '0';
  132. 			} while ((c = read()) >= '0' && c <= '9');
  133. 			if (neg)
  134. 				return -ret;
  135. 			return ret;
  136. 		}
  137.  
  138. 		public double nextDouble() throws IOException {
  139. 			double ret = 0, div = 1;
  140. 			byte c = read();
  141. 			while (c <= ' ')
  142. 				c = read();
  143. 			boolean neg = (c == '-');
  144. 			if (neg)
  145. 				c = read();
  146. 			do {
  147. 				ret = ret * 10 + c - '0';
  148. 			} while ((c = read()) >= '0' && c <= '9');
  149. 			if (c == '.')
  150. 				while ((c = read()) >= '0' && c <= '9')
  151. 					ret += (c - '0') / (div *= 10);
  152. 			if (neg)
  153. 				return -ret;
  154. 			return ret;
  155. 		}
  156.  
  157. 		private void fillBuffer() throws IOException {
  158. 			bytesRead = din.read(buffer, bufferPointer = 0, BUFFER_SIZE);
  159. 			if (bytesRead == -1)
  160. 				buffer[0] = -1;
  161. 		}
  162.  
  163. 		private byte read() throws IOException {
  164. 			if (bufferPointer == bytesRead)
  165. 				fillBuffer();
  166. 			return buffer[bufferPointer++];
  167. 		}
  168.  
  169. 		public void close() throws IOException {
  170. 			if (din == null)
  171. 				return;
  172. 			din.close();
  173. 		}
  174. 	}
  175.  
  176. }
  177. //934600897 491649357 493374745 220431313 28399283
Success #stdin #stdout 0.07s 380160KB
comments (?)
stdin
copy 
2 
3 1 
1 2 3 
5 100 
1 11 111 1111 11111
stdout
copy 
0 0 0 
1 1 1 1 1
https://ideone.com/mq6vOl
language:
Java (HotSpot 12)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!