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