B. Counting Rectangles is Fun----dp
2017-08-20 10:33
405 查看
B. Counting Rectangles is Fun
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There is an n × m rectangular grid, each cell of the grid contains a single integer: zero or one. Let's call the cell on the i-th
row and thej-th column as (i, j).
Let's define a "rectangle" as four integers a, b, c, d (1 ≤ a ≤ c ≤ n; 1 ≤ b ≤ d ≤ m).
Rectangle denotes a set of cells of the grid{(x, y) : a ≤ x ≤ c, b ≤ y ≤ d}.
Let's define a "good rectangle" as a rectangle that includes only the cells with zeros.
You should answer the following q queries: calculate the number of good rectangles all of which cells are in the given rectangle.
Input
There are three integers in the first line: n, m and q (1 ≤ n, m ≤ 40, 1 ≤ q ≤ 3·105).
Each of the next n lines contains m characters
— the grid. Consider grid rows are numbered from top to bottom, and grid columns are numbered from left to right. Both columns and rows are numbered starting from 1.
Each of the next q lines contains a query — four integers that describe the current rectangle, a, b, c, d (1 ≤ a ≤ c ≤ n; 1 ≤ b ≤ d ≤ m).
Output
For each query output an answer — a single integer in a separate line.
Examples
input
output
input
output
Note
For the first example, there is a 5 × 5 rectangular grid, and the first, the second, and the third queries are represented in the following
image.
For the first query, there are 10 good rectangles, five 1 × 1,
two 2 × 1, two 1 × 2,
and one 1 × 3.
For the second query, there is only one 1 × 1 good rectangle.
For the third query, there are 7 good rectangles, four 1 × 1,
two 2 × 1, and one 3 × 1.
题目链接:http://codeforces.com/contest/372/problem/B
这个题当时确实没有想出来。
http://blog.csdn.net/u013912596/article/details/38796089
真的是,4D连续sum,涨姿势。
代码:
time limit per test
4 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
There is an n × m rectangular grid, each cell of the grid contains a single integer: zero or one. Let's call the cell on the i-th
row and thej-th column as (i, j).
Let's define a "rectangle" as four integers a, b, c, d (1 ≤ a ≤ c ≤ n; 1 ≤ b ≤ d ≤ m).
Rectangle denotes a set of cells of the grid{(x, y) : a ≤ x ≤ c, b ≤ y ≤ d}.
Let's define a "good rectangle" as a rectangle that includes only the cells with zeros.
You should answer the following q queries: calculate the number of good rectangles all of which cells are in the given rectangle.
Input
There are three integers in the first line: n, m and q (1 ≤ n, m ≤ 40, 1 ≤ q ≤ 3·105).
Each of the next n lines contains m characters
— the grid. Consider grid rows are numbered from top to bottom, and grid columns are numbered from left to right. Both columns and rows are numbered starting from 1.
Each of the next q lines contains a query — four integers that describe the current rectangle, a, b, c, d (1 ≤ a ≤ c ≤ n; 1 ≤ b ≤ d ≤ m).
Output
For each query output an answer — a single integer in a separate line.
Examples
input
5 5 5 00101 00000 00001 01000 00001 1 2 2 4 4 5 4 5 1 2 5 2 2 2 4 5 4 2 5 3
output
10 1 7 34 5
input
4 7 5 0000100 0000010 0011000 0000000 1 7 2 7 3 1 3 1 2 3 4 5 1 2 2 7 2 2 4 7
output
3 1 16 27 52
Note
For the first example, there is a 5 × 5 rectangular grid, and the first, the second, and the third queries are represented in the following
image.
For the first query, there are 10 good rectangles, five 1 × 1,
two 2 × 1, two 1 × 2,
and one 1 × 3.
For the second query, there is only one 1 × 1 good rectangle.
For the third query, there are 7 good rectangles, four 1 × 1,
two 2 × 1, and one 3 × 1.
题目链接:http://codeforces.com/contest/372/problem/B
这个题当时确实没有想出来。
http://blog.csdn.net/u013912596/article/details/38796089
真的是,4D连续sum,涨姿势。
代码:
#include <iostream> #include <cstdio> #include <cstring> using namespace std; int row[50][50],a[50][50],dp[50][50][50][50]; int main() { int n,m,q; scanf("%d%d%d",&n,&m,&q); for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ scanf("%1d",&a[i][j]); row[i][j]=row[i][j-1]; if(a[i][j]) row[i][j]=0; else row[i][j]++; } } for(int a=1;a<=n;a++) for(int b=1;b<=m;b++) for(int c=a;c<=n;c++) for(int d=b;d<=m;d++){ dp[a][b][c][d]=dp[a][b][c][d-1]+dp[a][b][c-1][d]-dp[a][b][c-1][d-1]; int r=d-b+1; for(int e=c;e>=a;e--){ r=min(r,row[e][d]); dp[a][b][c][d]+=r; } } while(q--){ int a,b,c,d; scanf("%d%d%d%d",&a,&b,&c,&d); cout<<dp[a][b][c][d]<<endl; } return 0; }
相关文章推荐
- CodeForces 372b_Counting Rectangles is Fun_dp(暴力)
- Codeforce 373 D Counting Rectangles is Fun (统计全0子矩阵)
- Codeforces Round #219 (Div. 2) D. Counting Rectangles is Fun 四维前缀和
- Codeforces Round #219 (Div. 2) D. Counting Rectangles is Fun
- codeforces 372B B. Counting Rectangles is Fun(暴力)
- Codeforces Round #219 (Div. 2) Counting Kangaroos is Fun
- Codeforces 373C:Counting Kangaroos is Fun(二分+贪心)
- Counting Kangaroos is Fun
- Codeforces-Counting Kangaroos is Fun【贪心】【二分】
- Codeforces Round #219 (Div. 1) A. Counting Kangaroos is Fun
- 【CodeForces】373C - Counting Kangaroos is Fun(二分)
- CodeForce Round 219 Div2 E Watching Fireworks is Fun 单调队列DP
- CodeForces 372 A Counting Kangaroos is Fun
- CF373C-Counting Kangaroos is Fun
- Codeforces Round #219 (Div. 1) A. Counting Kangaroos is Fun 【二分】
- CodeForces 372 A. Counting Kangaroos is Fun
- A. Counting Kangaroos is Fun----暴力
- CodeForces 372 A. Counting Kangaroos is Fun
- A. Counting Kangaroos is Fun(贪心)
- codeforces #373 C.Counting Kangaroos is Fun