fork(2) download
copy 
  1. /* paiza POH! vol.2
  2.  * result:
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/0bf10df52c3155b2048dd41ef28f648a
  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.parseInt(hw[0]); // ホーム画面縦の区画数
  19. 		final int W = Integer.parseInt(hw[1]); // ホーム画面横の区画数
  20.  
  21. 		int[][] home = new int[H][W];
  22. 		int[][] hoge = new int[H][W];
  23. 		int spacecount = 0;
  24.  
  25. 		for (int y = 0; y < H; y++)
  26. 		{
  27. 			String line = in.readLine();
  28. 			int count = 0;
  29. 			for (int x = 0; x < W; x++)
  30. 			{
  31. 				int tx = W - x - 1;
  32. 				char ch = line.charAt(tx);
  33. 				if (ch == '0')
  34. 				{
  35. 					spacecount++;
  36. 					count++;
  37. 					if (y > 0)
  38. 					{
  39. 						hoge[y][tx] = hoge[y - 1][tx] + 1;
  40. 					}
  41. 					else
  42. 					{
  43. 						hoge[y][tx] = hoge[y][tx] = 1;
  44. 					}
  45. 				}
  46. 				else
  47. 				{
  48. 					count = 0;
  49. 					hoge[y][tx] = 0;
  50. 				}
  51. 				home[y][tx] = count;
  52. 			}
  53. 		}
  54.  
  55. 		final int N = Integer.parseInt(in.readLine()); // ウィジェット数
  56.  
  57. 		int[][] result = new int[300][300];
  58.  
  59. 		for (int i = 0; i < N; i++)
  60. 		{
  61. 			String[] st = in.readLine().split(" ");
  62. 			int s = Integer.parseInt(st[0]); // ウィジェットの縦サイズ
  63. 			int t = Integer.parseInt(st[1]); // ウィジェットの横サイズ
  64.  
  65. 			if (s > H || t > W)
  66. 			{
  67. 				System.out.println(0);
  68. 				continue;
  69. 			}
  70.  
  71. 			if (result[s][t] > 0)
  72. 			{
  73. 				System.out.println(result[s][t] - 1);
  74. 				continue;
  75. 			}
  76.  
  77. 			if (s == 1 && t == 1)
  78. 			{
  79. 				System.out.println(spacecount);
  80. 				continue;
  81. 			}
  82.  
  83. 			int count = 0;
  84. 			if (W > H)
  85. 			{
  86. 				for (int hy = H - 1; hy >= s - 1; hy--)
  87. 				{
  88. 					for (int hx = 0; hx < W - t + 1; hx++)
  89. 					{
  90. 						if (home[hy][hx] < t)
  91. 						{
  92. 							hx += home[hy][hx];
  93. 							continue;
  94. 						}
  95. 						if (hoge[hy][hx] < s)
  96. 						{
  97. 							continue;
  98. 						}
  99. 						int dy;
  100. 						for (dy = 1; dy < s; dy++)
  101. 						{
  102. 							int y = hy - dy;
  103. 							if (y >= H)
  104. 							{
  105. 								break;
  106. 							}
  107. 							if (home[y][hx] < t)
  108. 							{
  109. 								break;
  110. 							}
  111. 						}
  112. 						if (dy == s)
  113. 						{
  114. 							count++;
  115. 						}
  116. 					}
  117. 				}
  118. 			}
  119. 			else
  120. 			{
  121. 				for (int hx = 0; hx < W - t + 1; hx++)
  122. 				{
  123. 					for (int hy = H - 1; hy >= s - 1; hy--)
  124. 					{
  125. 						if (home[hy][hx] < t)
  126. 						{
  127. 							continue;
  128. 						}
  129. 						if (hoge[hy][hx] < s)
  130. 						{
  131. 							hy -= hoge[hy][hx];
  132. 							continue;
  133. 						}
  134. 						int dy;
  135. 						for (dy = 1; dy < s; dy++)
  136. 						{
  137. 							int y = hy - dy;
  138. 							if (y >= H)
  139. 							{
  140. 								break;
  141. 							}
  142. 							if (home[y][hx] < t)
  143. 							{
  144. 								break;
  145. 							}
  146. 						}
  147. 						if (dy == s)
  148. 						{
  149. 							count++;
  150. 						}
  151. 					}
  152. 				}
  153. 			}
  154. 			System.out.println(count);
  155. 			result[s][t] = count + 1;
  156. 		}
  157.  
  158. 	} // end of main(String[])
  159.  
  160. }
  161.  
Success #stdin #stdout 0.07s 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/qWA8Um
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!