fork download 
  1. /* paiza POH! vol.2
  2.  * result:
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/2006cee70fb890fb255a3eab6ec550cb
  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.  
  32. 		{
  33. 			// int y = 0;
  34. 			String line = in.readLine();
  35. 			int spaceCount = 0;
  36. 			for (int x = 0; x < W; x++)
  37. 			{
  38. 				char ch = line.charAt(x);
  39. 				if (ch == '0') // 空
  40. 				{
  41. 					spaceCount++;
  42. 					allSpaceCount++;
  43. 					space2top[0][x] = 1;
  44. 				}
  45. 				else // if (ch == '1') // 埋
  46. 				{
  47. 					if (spaceCount > 1)
  48. 					{
  49. 						startPointX[startPointCount] = x - 1;
  50. 						// startPointY[startPointCount] = 0;
  51. 						startPointCount++;
  52. 						space2leftCount[spaceCount]++;
  53. 					}
  54. 					spaceCount = 0;
  55. 					// space2top[0][x] = 0; // 初期値のまんま
  56. 				}
  57. 				space2left[0][x] = spaceCount;
  58. 			} // for(x)
  59. 			if (spaceCount > 1)
  60. 			{
  61. 				startPointX[startPointCount] = W - 1;
  62. 				// startPointY[startPointCount] = 0;
  63. 				startPointCount++;
  64. 				space2leftCount[spaceCount]++;
  65. 			}
  66. 		} // for(y)
  67.  
  68. 		for (int y = 1; y < H; y++)
  69. 		{
  70. 			String line = in.readLine();
  71. 			int spaceCount = 0;
  72. 			for (int x = 0; x < W; x++)
  73. 			{
  74. 				char ch = line.charAt(x);
  75. 				if (ch == '0') // 空
  76. 				{
  77. 					spaceCount++;
  78. 					allSpaceCount++;
  79. 					space2top[y][x] = space2top[y - 1][x] + 1;
  80. 					if (y == H - 1 && space2top[y][x] > 1)
  81. 					{
  82. 						space2topCount[space2top[y][x]]++;
  83. 					}
  84. 				}
  85. 				else // if (ch == '1') // 埋
  86. 				{
  87. 					if (spaceCount > 1)
  88. 					{
  89. 						startPointX[startPointCount] = x - 1;
  90. 						startPointY[startPointCount] = y;
  91. 						startPointCount++;
  92. 						space2leftCount[spaceCount]++;
  93. 					}
  94. 					spaceCount = 0;
  95. 					// space2top[y][x] = 0; // 初期値のまんま
  96. 					space2topCount[space2top[y - 1][x]]++;
  97. 				}
  98. 				space2left[y][x] = spaceCount;
  99. 			} // for(x)
  100. 			if (spaceCount > 1)
  101. 			{
  102. 				startPointX[startPointCount] = W - 1;
  103. 				startPointY[startPointCount] = y;
  104. 				startPointCount++;
  105. 				space2leftCount[spaceCount]++;
  106. 			}
  107. 		} // for(y)
  108.  
  109. 		final int N = Integer.parseInt(in.readLine());
  110. 		int[][] result = new int[301][301];
  111.  
  112. 		for (int i = 0; i < N; i++)
  113. 		{
  114. 			String[] st = in.readLine().split(" ");
  115. 			int s = Integer.parseInt(st[0]);
  116. 			int t = Integer.parseInt(st[1]);
  117.  
  118. 			int count = 0;
  119.  
  120. 			if (s <= H && t <= W)
  121. 			{
  122. 				if (result[s][t] > 0)
  123. 				{
  124. 					count = result[s][t] - 1;
  125. 				}
  126. 				else if (s != 1 && t != 1)
  127. 				{
  128. 					for (int j = 0; j < startPointCount; j++)
  129. 					{
  130. 						int x = startPointX[j];
  131. 						int y = startPointY[j];
  132. 						int seekLength = space2left[y][x] - t + 1;
  133.  
  134. 						for (int dx = 0; dx < seekLength; dx++)
  135. 						{
  136. 							int tx = x - dx;
  137. 							if (space2top[y][tx] < s)
  138. 							{
  139. 								continue;
  140. 							}
  141. 							int dy;
  142. 							for (dy = 0; dy < s; dy++)
  143. 							{
  144. 								if (space2left[y - dy][tx] < t)
  145. 								{
  146. 									break;
  147. 								}
  148. 							} // for(dy)
  149. 							if (dy == s)
  150. 							{
  151. 								count++;
  152. 							}
  153. 						} // for(dx)
  154. 					} // for(j)
  155. 				}
  156. 				else if (s != 1)
  157. 				{
  158. 					for (int j = s; j <= H; j++)
  159. 					{
  160. 						count += space2topCount[j] * (j - s + 1);
  161. 					}
  162. 				}
  163. 				else if (t != 1)
  164. 				{
  165. 					for (int j = t; j <= W; j++)
  166. 					{
  167. 						count += space2leftCount[j] * (j - t + 1);
  168. 					}
  169. 				}
  170. 				else // if (s == 1 && t == 1)
  171. 				{
  172. 					count = allSpaceCount;
  173. 				}
  174. 			}
  175. 			System.out.println(count);
  176. 			result[s][t] = count + 1;
  177. 		} // for(i)
  178.  
  179. 	} // void main([String)
  180.  
  181. } // class Main
Success #stdin #stdout 0.08s 380160KB
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/U1rDlV
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!