fork(2) download
copy 
  1. /* paiza POH! vol.2
  2.  * result: 
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/52163a4e1d60e34a8e854214187c4699
  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(
  15. 			new InputStreamReader(System.in));
  16.  
  17. 		String[] hw = in.readLine().split(" ");
  18. 		final int H = Integer.valueOf(hw[0]); // ホーム画面縦の区画数
  19. 		final int W = Integer.valueOf(hw[1]); // ホーム画面横の区画数
  20.  
  21. 		int[][] space2left = new int[H][W];
  22. 		int[][] space2top = new int[H][W];
  23. 		int spacecount = 0;
  24.  
  25. 		List<Position> startposition2left = new ArrayList<Position>();
  26. 		List<Position> startposition2top = new ArrayList<Position>();
  27.  
  28. 		for (int y = 0; y < H; y++)
  29. 		{
  30. 			String line = in.readLine();
  31. 			int space2leftSize = 0;
  32. 			for (int x = 0; x < W; x++)
  33. 			{
  34. 				char ch = line.charAt(x);
  35. 				if (ch == '1')
  36. 				{
  37. 					space2leftSize = 0;
  38. 					space2top[y][x] = 0;
  39. 					if (x > 0 && space2left[y][x - 1] > 0)
  40. 					{
  41. 						startposition2left.add(
  42. 							new Position(y, x - 1));
  43. 					}
  44. 					if (y > 0 && space2top[y - 1][x] > 0)
  45. 					{
  46. 						startposition2top.add(
  47. 							new Position(y - 1, x));
  48. 					}
  49. 				}
  50. 				else // if (ch == '0')
  51. 				{
  52. 					spacecount++;
  53. 					space2leftSize++;
  54. 					if (y > 0)
  55. 					{
  56. 						space2top[y][x] = space2top[y - 1][x] + 1;
  57. 						if (y == H - 1)
  58. 						{
  59. 							startposition2top.add(
  60. 								new Position(y, x));
  61. 						}
  62. 					}
  63. 					else // if (y == 0)
  64. 					{
  65. 						space2top[y][x] = 1;
  66. 					}
  67. 					if (x == W - 1)
  68. 					{
  69. 						startposition2left.add(
  70. 							new Position(y, x));
  71. 					}
  72. 				}
  73. 				space2left[y][x] = space2leftSize;
  74. 			}
  75. 		}
  76. 		// print2dArray(space2left);
  77. 		// print2dArray(space2top);
  78. 		// System.out.println(startposition2left);
  79. 		// System.out.println(startposition2top);
  80.  
  81. 		final int N = Integer.valueOf(in.readLine()); // ウィジェット数
  82. 		HashSet<Position> placeablePosition = new HashSet<Position>();
  83.  
  84. 		for (int i = 0; i < N; i++)
  85. 		{
  86. 			String[] st = in.readLine().split(" ");
  87. 			int s = Integer.valueOf(st[0]); // ウィジェットの縦サイズ
  88. 			int t = Integer.valueOf(st[1]); // ウィジェットの横サイズ
  89. 			int placeableCount = 0;
  90.  
  91. 			if (s == 1) // 横長のウィジェット
  92. 			{
  93. 				if (t == 1) // 1x1のウィジェット
  94. 				{
  95. 					placeableCount = spacecount;
  96. 				}
  97. 				else // if (t != 1) // 横長のウィジェット
  98. 				{
  99. 					for (Position position : startposition2left)
  100. 					{
  101. 						int spaceWSize = space2left[position.y][position.x];
  102. 						if (spaceWSize >= t)
  103. 						{
  104. 							placeableCount += spaceWSize - t + 1;
  105. 						}
  106. 					}
  107. 				}
  108. 			}
  109. 			else if (t == 1) // 縦長のウィジェット
  110. 			{
  111. 				for (Position position : startposition2top)
  112. 				{
  113. 					int spaceHSize = space2top[position.y][position.x];
  114. 					if (spaceHSize >= s)
  115. 					{
  116. 						placeableCount += spaceHSize - s + 1;
  117. 					}
  118. 				}
  119. 			}
  120. 			else // if (s != 1 && t != 1)
  121. 			{
  122. 				placeablePosition.clear();
  123. 				// 横に走査していく
  124. 				for (Position position : startposition2left)
  125. 				{
  126. 					int spaceWSize = space2left[position.y][position.x];
  127. 					for (int dx = 0; dx < spaceWSize; dx++)
  128. 					{
  129. 						int x = position.x - dx;
  130. 						int spaceHSize = space2top[position.y][x];
  131. 						if (spaceHSize < s)
  132. 						{
  133. 							continue; // 縦サイズが足りない
  134. 						}
  135. 						// 縦に走査して横サイズ以上の連続する空所を数える
  136. 						int count = 0;
  137. 						for (int dy = 0; dy < spaceHSize; dy++)
  138. 						{
  139. 							int y = position.y - dy;
  140. 							if (space2left[y][x] >= t) 
  141. 							{
  142. 								count++;
  143. 								if (count >= s) // ウィジェットが確保できる
  144. 								{
  145. 									boolean placed = placeablePosition.add(
  146. 														new Position(y, x));
  147. 									if (placed == false)
  148. 									{
  149. 										break; // これ以上の縦の走査は走査済み
  150. 									}
  151. 								}
  152. 							}
  153. 							else
  154. 							{
  155. 								count = 0; // 連続の途切れ
  156. 							}
  157. 						}
  158. 					}
  159. 				}
  160. 				placeableCount = placeablePosition.size();
  161. 			} 
  162. 			System.out.println(placeableCount);
  163. 		}
  164.  
  165. 	} // end of main(String[])
  166.  
  167. 	static void print2dArray(int[][] array)
  168. 	{
  169. 		for (int i = 0; i < array.length; i++)
  170. 		{
  171. 			for (int j = 0; j < array[i].length; j++)
  172. 			{
  173. 				System.out.print(array[i][j] + " ");
  174. 			}
  175. 			System.out.println();
  176. 		}
  177. 		System.out.println();
  178. 	}
  179.  
  180. 	static class Position
  181. 	{
  182. 		final int y;
  183. 		final int x;
  184. 		Position(int y, int x)
  185. 		{
  186. 			this.y = y;
  187. 			this.x = x;
  188. 		}
  189.  
  190. 		@Override public String toString()
  191. 		{
  192. 			return "(" + x + ", " + y + ")";
  193. 		}
  194.  
  195. 		@Override public int hashCode()
  196. 		{
  197. 			return y * (x + y);
  198. 		}
  199.  
  200. 		@Override public boolean equals(Object obj)
  201. 		{
  202. 			if (this == obj)
  203. 			{
  204. 				return true;
  205. 			}
  206. 			if (obj == null)
  207. 			{
  208. 				return false;
  209. 			}
  210. 			if (this.getClass().equals(obj.getClass()) == false)
  211. 			{
  212. 				return false;
  213. 			}
  214. 			Position pos = (Position)obj;
  215. 			return y == pos.y && x == pos.x;
  216. 		}
  217. 	} // end of class Position
  218. }
  219.  
Success #stdin #stdout 0.08s 380224KB
comments (?)
stdin
copy 
5 5
00000
00100
00010
10001
10000
3
2 2
1 1
3 2
stdout
copy 
6
20
2
https://ideone.com/Wy2fdQ
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!