fork(1) download 
  1. /* paiza POH! vol.2
  2.  * result:
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/d49e324a9921efb4c5c64a2a857b83f6
  4.  * author: Leonardone @ NEETSDKASU
  5.  */
  6. import java.util.*;
  7. import java.lang.*;
  8. import java.io.*;
  9.  
  10. class Main
  11. {
  12. 	static int[][] space2left = new int[300][300];
  13. 	static int[][] space2top = new int[300][300];
  14. 	static int[][] result = new int[301][301];
  15. 	static int[] space2leftCount = new int[301];
  16. 	static int[] space2topCount = new int[301];
  17. 	static int[] startPointX = new int[30300];
  18. 	static int[] startPointY = new int[30300];
  19. 	static final String NEWLINE = System.getProperty("line.separator");
  20.  
  21. 	public static void main (String[] args) throws java.lang.Exception
  22. 	{
  23. 		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  24.  
  25. 		String[] hw = in.readLine().split(" ", 2);
  26. 		final int H = Integer.parseInt(hw[0]);
  27. 		final int W = Integer.parseInt(hw[1]);
  28.  
  29. 		int allSpaceCount = 0;
  30.  
  31. 		int startPointCount = 0;
  32.  
  33.  
  34. 		int maxSpace2leftLen = 0;
  35. 		int maxSpace2topLen = 0;
  36.  
  37. 		int[] tempSP2Ty1 = null;;
  38.  
  39. 		for (int y = 0; y < H; y++)
  40. 		{
  41. 			int[] tempSP2Ty = space2top[y];
  42. 			String line = in.readLine();
  43. 			int spaceCount = 0;
  44. 			for (int x = 0; x < W; x++)
  45. 			{
  46. 				if (line.charAt(x) == '0') // 空
  47. 				{
  48. 					spaceCount++;
  49. 					allSpaceCount++;
  50. 					if (y > 0)
  51. 					{
  52. 						int tempCount = tempSP2Ty[x] = tempSP2Ty1[x] + 1;
  53. 						if (y == H - 1 && tempCount > 1)
  54. 						{
  55. 							space2topCount[tempCount]++;
  56. 							if (tempCount > maxSpace2topLen)
  57. 							{
  58. 								maxSpace2topLen = tempCount;
  59. 							}
  60. 						}
  61. 					}
  62. 					else // if (y == 0) 
  63. 					{
  64. 						tempSP2Ty[x] = 1;
  65. 					}
  66. 				}
  67. 				else // if (ch == '1') // 埋
  68. 				{
  69. 					if (spaceCount > 1)
  70. 					{
  71. 						startPointX[startPointCount] = x - 1;
  72. 						startPointY[startPointCount] = y;
  73. 						startPointCount++;
  74. 						space2leftCount[spaceCount]++;
  75. 						if (spaceCount > maxSpace2leftLen)
  76. 						{
  77. 							maxSpace2leftLen = spaceCount;
  78. 						}
  79. 					}
  80. 					spaceCount = 0;
  81. 					// space2top[y][x] = 0; // 初期値のまんま
  82. 					if (y > 0) {
  83. 						space2topCount[tempSP2Ty1[x]]++;
  84. 						if (tempSP2Ty1[x] > maxSpace2topLen)
  85. 						{
  86. 							maxSpace2topLen = tempSP2Ty1[x];
  87. 						}
  88. 					}
  89. 				}
  90. 				space2left[y][x] = spaceCount;
  91. 			} // for(x)
  92. 			if (spaceCount > 1)
  93. 			{
  94. 				startPointX[startPointCount] = W - 1;
  95. 				startPointY[startPointCount] = y;
  96. 				startPointCount++;
  97. 				space2leftCount[spaceCount]++;
  98. 				if (spaceCount > maxSpace2leftLen)
  99. 				{
  100. 					maxSpace2leftLen = spaceCount;
  101. 				}
  102. 			}
  103. 			tempSP2Ty1 = tempSP2Ty;
  104. 		} // for(y)
  105.  
  106. 		final int N = Integer.parseInt(in.readLine());
  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. 						int tx = x;
  134. 						for (int dx = 0; dx < seekLength; dx++)
  135. 						{
  136. 							if (tempSP2Ty[tx] >= s)
  137. 							{
  138. 								int dy;
  139. 								int ty = y;
  140. 								for (dy = 0; dy < s; dy++)
  141. 								{
  142. 									if (space2left[ty][tx] < t)
  143. 									{
  144. 										break;
  145. 									}
  146. 									ty--;
  147. 								} // for(dy)
  148. 								if (dy == s)
  149. 								{
  150. 									count++;
  151. 								}
  152. 							}
  153. 							tx--;
  154. 						} // for(dx)
  155. 					} // for(j)
  156. 				}
  157. 				else if (s != 1)
  158. 				{
  159. 					for (int j = s; j <= maxSpace2topLen; j++)
  160. 					{
  161. 						count += space2topCount[j] * (j - s + 1);
  162. 					}
  163. 				}
  164. 				else if (t != 1)
  165. 				{
  166. 					for (int j = t; j <= maxSpace2leftLen; j++)
  167. 					{
  168. 						count += space2leftCount[j] * (j - t + 1);
  169. 					}
  170. 				}
  171. 				else // if (s == 1 && t == 1)
  172. 				{
  173. 					count = allSpaceCount;
  174. 				}
  175. 			}
  176. 			output.append(count);
  177. 			output.append(NEWLINE);
  178. 			result[s][t] = count + 1;
  179. 		} // for(i)
  180.  
  181. 		System.out.print(output);
  182.  
  183. 	} // void main([String)
  184.  
  185. } // class Main
Success #stdin #stdout 0.07s 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/hhbmVN
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!