fork download 
  1. /* paiza POH! vol.2
  2.  * result:
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/9ff3312da163b66180c9e5c7e39766de
  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. 						if (y == H - 1 && space2top[y][x] > 1)
  46. 						{
  47. 							space2topCount[space2top[y][x]]++;
  48. 						}
  49. 					}
  50. 					else // if (y == 0) 
  51. 					{
  52. 						space2top[y][x] = 1;
  53. 					}
  54. 				}
  55. 				else // if (ch == '1') // 埋
  56. 				{
  57. 					if (spaceCount > 1)
  58. 					{
  59. 						startPointX[startPointCount] = x - 1;
  60. 						startPointY[startPointCount] = y;
  61. 						startPointCount++;
  62. 						space2leftCount[spaceCount]++;
  63. 					}
  64. 					spaceCount = 0;
  65. 					// space2top[y][x] = 0; // 初期値のまんま
  66. 					if (y > 0) {
  67. 						space2topCount[space2top[y - 1][x]]++;
  68. 					}
  69. 				}
  70. 				space2left[y][x] = spaceCount;
  71. 			} // for(x)
  72. 			if (spaceCount > 1)
  73. 			{
  74. 				startPointX[startPointCount] = W - 1;
  75. 				startPointY[startPointCount] = y;
  76. 				startPointCount++;
  77. 				space2leftCount[spaceCount]++;
  78. 			}
  79. 		} // for(y)
  80.  
  81. 		final int N = Integer.parseInt(in.readLine());
  82. 		int[][] result = new int[301][301];
  83.  
  84.  
  85. 		if (W < 300) {
  86. 			for (int y = 0; y <= H; y++)
  87. 			{
  88. 				Arrays.fill(result[y], W + 1, 301, 1);
  89. 			}
  90. 		}
  91. 		for (int y = H + 1; y < 301; y++)
  92. 		{
  93. 			Arrays.fill(result[y], 0, 301, 1);
  94. 		}
  95.  
  96. 		for (int i = 0; i < N; i++)
  97. 		{
  98. 			String[] st = in.readLine().split(" ");
  99. 			int s = Integer.parseInt(st[0]);
  100. 			int t = Integer.parseInt(st[1]);
  101.  
  102. 			int count = 0;
  103.  
  104. 			//if (s <= H && t <= W)
  105. 			{
  106. 				if (result[s][t] > 0)
  107. 				{
  108. 					count = result[s][t] - 1;
  109. 				}
  110. 				else if (s != 1 && t != 1)
  111. 				{
  112. 					for (int j = 0; j < startPointCount; j++)
  113. 					{
  114. 						int x = startPointX[j];
  115. 						int y = startPointY[j];
  116. 						int seekLength = space2left[y][x] - t + 1;
  117.  
  118. 						for (int dx = 0; dx < seekLength; dx++)
  119. 						{
  120. 							int tx = x - dx;
  121. 							if (space2top[y][tx] >= s)
  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. 							}
  136. 						} // for(dx)
  137. 					} // for(j)
  138. 				}
  139. 				else if (s != 1)
  140. 				{
  141. 					for (int j = s; j <= H; j++)
  142. 					{
  143. 						count += space2topCount[j] * (j - s + 1);
  144. 					}
  145. 				}
  146. 				else if (t != 1)
  147. 				{
  148. 					for (int j = t; j <= W; j++)
  149. 					{
  150. 						count += space2leftCount[j] * (j - t + 1);
  151. 					}
  152. 				}
  153. 				else // if (s == 1 && t == 1)
  154. 				{
  155. 					count = allSpaceCount;
  156. 				}
  157. 			}
  158. 			System.out.println(count);
  159. 			result[s][t] = count + 1;
  160. 		} // for(i)
  161.  
  162. 	} // void main([String)
  163.  
  164. } // class Main
Success #stdin #stdout 0.07s 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/SfeogR
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!