fork download 
  1. /* paiza POH! vol.2
  2.  * result:
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/15a9530dcae0cc55c1604f0b645b8f03
  4.  * author: Leonardone @ NEETSDKASU
  5.  */
  6. import java.util.*;
  7. import java.lang.*;
  8. import java.io.*;
  9.  
  10. class Main
  11. {
  12. 	public static void main (String[] args) throws java.lang.Exception
  13. 	{
  14. 		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  15.  
  16. 		String[] hw = in.readLine().split(" ");
  17. 		final int H = Integer.parseInt(hw[0]);
  18. 		final int W = Integer.parseInt(hw[1]);
  19.  
  20. 		int[][] space2left = new int[H][W];
  21. 		int[][] space2top = new int[H][W];
  22. 		int allSpaceCount = 0;
  23.  
  24. 		int[] startPointX = new int[H * (1 + W / 3)];
  25. 		int[] startPointY = new int[H * (1 + W / 3)];
  26. 		int startPointCount = 0;
  27.  
  28. 		int[] space2leftCount = new int[W + 1];
  29. 		int[] space2topCount = new int[H + 1];
  30.  
  31. 		for (int y = 0; y < H; y++)
  32. 		{
  33. 			String line = in.readLine();
  34. 			int spaceCount = 0;
  35. 			for (int x = 0; x < W; x++)
  36. 			{
  37. 				char ch = line.charAt(x);
  38. 				if (ch == '0') // 空
  39. 				{
  40. 					spaceCount++;
  41. 					allSpaceCount++;
  42. 					if (y > 0)
  43. 					{
  44. 						space2top[y][x] = space2top[y - 1][x] + 1;
  45. 					}
  46. 					else // if (y == 0) 
  47. 					{
  48. 						space2top[y][x] = 1;
  49. 					}
  50. 				}
  51. 				else // if (ch == '1') // 埋
  52. 				{
  53. 					if (spaceCount > 1)
  54. 					{
  55. 						startPointX[startPointCount] = x - 1;
  56. 						startPointY[startPointCount] = y;
  57. 						startPointCount++;
  58. 						space2leftCount[spaceCount]++;
  59. 					}
  60. 					spaceCount = 0;
  61. 					space2top[y][x] = 0;
  62. 					if (y > 0 && space2top[y - 1][x] > 1)
  63. 					{
  64. 						space2topCount[space2top[y - 1][x]]++;
  65. 					}
  66. 				}
  67. 				space2left[y][x] = spaceCount;
  68. 			} // for(x)
  69. 			if (spaceCount > 1)
  70. 			{
  71. 				startPointX[startPointCount] = W - 1;
  72. 				startPointY[startPointCount] = y;
  73. 				startPointCount++;
  74. 				space2leftCount[spaceCount]++;
  75. 			}
  76. 		} // for(y)
  77. 		for (int x = 0, y = H - 1; x < W; x++)
  78. 		{
  79. 			if (space2top[y][x] > 1)
  80. 			{
  81. 				space2topCount[space2top[y][x]]++;
  82. 			}
  83. 		} // for(x)
  84.  
  85. 		final int N = Integer.parseInt(in.readLine());
  86. 		int[][] result = new int[H + 1][W + 1];
  87.  
  88. 		for (int i = 0; i < N; i++)
  89. 		{
  90. 			String[] st = in.readLine().split(" ");
  91. 			int s = Integer.parseInt(st[0]);
  92. 			int t = Integer.parseInt(st[1]);
  93.  
  94. 			if (s > H || t > W)
  95. 			{
  96. 				System.out.println("0");
  97. 				continue;
  98. 			}
  99.  
  100. 			if (result[s][t] > 0)
  101. 			{
  102. 				System.out.println(result[s][t] - 1);
  103. 				continue;
  104. 			}
  105.  
  106. 			int count = 0;
  107.  
  108. 			if (s != 1 && t != 1)
  109. 			{
  110. 				for (int j = 0; j < startPointCount; j++)
  111. 				{
  112. 					int x = startPointX[j];
  113. 					int y = startPointY[j];
  114. 					int seekLength = space2left[y][x] - t + 1;
  115.  
  116. 					for (int dx = 0; dx < seekLength; dx++)
  117. 					{
  118. 						int tx = x - dx;
  119. 						if (space2top[y][tx] < s)
  120. 						{
  121. 							continue;
  122. 						}
  123. 						int dy;
  124. 						for (dy = 0; dy < s; dy++)
  125. 						{
  126. 							if (space2left[y - dy][tx] < t)
  127. 							{
  128. 								break;
  129. 							}
  130. 						} // for(dy)
  131. 						if (dy == s)
  132. 						{
  133. 							count++;
  134. 						}
  135. 					} // for(dx)
  136. 				} // for(j)
  137. 			}
  138. 			else if (s != 1)
  139. 			{
  140. 				for (int j = s; j <= H; j++)
  141. 				{
  142. 					count += space2topCount[j] * (j - s + 1);
  143. 				}
  144. 			}
  145. 			else if (t != 1)
  146. 			{
  147. 				for (int j = t; j <= W; j++)
  148. 				{
  149. 					count += space2leftCount[j] * (j - t + 1);
  150. 				}
  151. 			}
  152. 			else // if (s == 1 && t == 1)
  153. 			{
  154. 				count = allSpaceCount;
  155. 			}
  156. 			System.out.println(count);
  157. 			result[s][t] = count + 1;
  158. 		} // for(i)
  159.  
  160. 	} // void main([String)
  161.  
  162. } // class Main
Success #stdin #stdout 0.08s 380224KB
comments (?)
stdin 
5 5
00000
00100
00010
10001
10000
7
2 2
1 1
3 2
3 2
2 3
3 1
1 3
stdout 
6
20
2
2
1
6
7
https://ideone.com/PPvMv5
language:
Java (HotSpot 12)
created:
10 years ago
visibility:
secret

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!