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