fork(3) download
  1. /* paiza POH! vol.2
  2.  * result:
  3.  * http://p...content-available-to-author-only...a.jp/poh/paizen/result/28503d5b3dc823b4be20494a26418e70
  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.  
  15. String[] hw = in.readLine().split(" ");
  16. final int H = Integer.parseInt(hw[0]);
  17. final int W = Integer.parseInt(hw[1]);
  18.  
  19. int[][] space2left = new int[H][W];
  20. int[][] space2top = new int[H][W];
  21. int allSpaceCount = 0;
  22.  
  23. int[] startPointX = new int[H * (1 + W / 3)];
  24. int[] startPointY = new int[H * (1 + W / 3)];
  25. int startPointCount = 0;
  26.  
  27. int[] space2leftCount = new int[W + 1];
  28. int[] space2topCount = new int[H + 1];
  29.  
  30. for (int y = 0; y < H; y++)
  31. {
  32. String line = in.readLine();
  33. int spaceCount = 0;
  34. for (int x = 0; x < W; x++)
  35. {
  36. char ch = line.charAt(x);
  37. if (ch == '0') // 空
  38. {
  39. spaceCount++;
  40. allSpaceCount++;
  41. if (y > 0)
  42. {
  43. space2top[y][x] = space2top[y - 1][x] + 1;
  44. if (y == H - 1 && space2top[y][x] > 1)
  45. {
  46. space2topCount[space2top[y][x]]++;
  47. }
  48. }
  49. else // if (y == 0)
  50. {
  51. space2top[y][x] = 1;
  52. }
  53. }
  54. else // if (ch == '1') // 埋
  55. {
  56. if (spaceCount > 1)
  57. {
  58. startPointX[startPointCount] = x - 1;
  59. startPointY[startPointCount] = y;
  60. startPointCount++;
  61. space2leftCount[spaceCount]++;
  62. }
  63. spaceCount = 0;
  64. // space2top[y][x] = 0; // 初期値のまんま
  65. if (y > 0) {
  66. space2topCount[space2top[y - 1][x]]++;
  67. }
  68. }
  69. space2left[y][x] = spaceCount;
  70. } // for(x)
  71. if (spaceCount > 1)
  72. {
  73. startPointX[startPointCount] = W - 1;
  74. startPointY[startPointCount] = y;
  75. startPointCount++;
  76. space2leftCount[spaceCount]++;
  77. }
  78. } // for(y)
  79.  
  80. final int N = Integer.parseInt(in.readLine());
  81. int[][] result = new int[301][301];
  82.  
  83. for (int i = 0; i < N; i++)
  84. {
  85. String[] st = in.readLine().split(" ");
  86. int s = Integer.parseInt(st[0]);
  87. int t = Integer.parseInt(st[1]);
  88.  
  89. int count = 0;
  90.  
  91. if (s <= H && t <= W)
  92. {
  93. if (result[s][t] > 0)
  94. {
  95. count = result[s][t] - 1;
  96. }
  97. else if (s != 1 && t != 1)
  98. {
  99. for (int j = 0; j < startPointCount; j++)
  100. {
  101. int x = startPointX[j];
  102. int y = startPointY[j];
  103. int seekLength = space2left[y][x] - t + 1;
  104.  
  105. for (int dx = 0; dx < seekLength; dx++)
  106. {
  107. int tx = x - dx;
  108. if (space2top[y][tx] < s)
  109. {
  110. continue;
  111. }
  112. int dy;
  113. for (dy = 0; dy < s; dy++)
  114. {
  115. if (space2left[y - dy][tx] < t)
  116. {
  117. break;
  118. }
  119. } // for(dy)
  120. if (dy == s)
  121. {
  122. count++;
  123. }
  124. } // for(dx)
  125. } // for(j)
  126. }
  127. else if (s != 1)
  128. {
  129. for (int j = s; j <= H; j++)
  130. {
  131. count += space2topCount[j] * (j - s + 1);
  132. }
  133. }
  134. else if (t != 1)
  135. {
  136. for (int j = t; j <= W; j++)
  137. {
  138. count += space2leftCount[j] * (j - t + 1);
  139. }
  140. }
  141. else // if (s == 1 && t == 1)
  142. {
  143. count = allSpaceCount;
  144. }
  145. }
  146. System.out.println(count);
  147. result[s][t] = count + 1;
  148. } // for(i)
  149.  
  150. } // void main([String)
  151.  
  152. } // class Main
Success #stdin #stdout 0.07s 380160KB
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