poj 2517

 

Cover
Time Limit: 20000MS Memory Limit: 65536K
Total Submissions: 134 Accepted: 13

Description

Given an N * N matrix A, whose elements are positive integers and not larger than 10000. There are also some '*'s in matrix A. Your program must find such three (perhaps overlapping) rectangles that they would contain all the '*'s which are in matrix A and the areas of these three rectangles (the area of one rectangle define as the number of elements it covers) must be non-negative and not exceed a given integer M. 

If several solutions exist, the program should find a solution with minimal total costs of these three rectangles. The cost of one rectangle defines as the sum of all the numbers it contains in matrix A.

Input

The first line of the input is an integer X representing the number of test cases. The following X blocks each represents a test case. 

The first line of each block contains two numbers N and M (1 <= N <= 30, 0 <= M <= N * N) representing the size of the matrix and the maximum area of each rectangle. The second line contains a number C (0 <= C <= N * N), representing the number of '*'s in matrix A. The following C lines each contains two numbers X and Y (1 <= X, Y <= N), representing A[X][Y] (A[X][Y] represents the element in the X-th row and Y-th column)contains a '*'. The following N lines each contains N numbers, representing the matrix A. 

Output

For each block output one line, which contains an integer representing the minimum total costs, or 'Impossible' (without quote) if no solution exists.

Sample Input

5
1 1
0
9
1 1
1
1 1
9
5 6
5
1 1
3 4
4 3
4 5
5 4
5 3 1 1 1
3 1 1 1 1
1 1 1 2 1
1 1 2 5 2
1 1 1 2 1
5 3
5
1 1
3 4
4 3
4 5
5 4
5 3 1 1 1
3 1 1 1 1
1 1 1 2 1
1 1 2 5 2
1 1 1 2 1
5 2
4
1 1
3 4
4 3
4 5
5 3 1 1 1
3 1 1 1 1
1 1 1 2 1
1 1 2 5 2
1 1 1 2 1

Sample Output

0
9
20
23
Impossible

Source

POJ Monthly--2005.07.31, LouTianCheng
分析:矩形分割,分情况讨论。。。具体太复杂,就不说了。。。

过下面几组数据大概就能过了,就这几种情况

5 6

7

2 2

2 4

3 1

3 3

3 5

4 2

4 4

9 9 9 9 9

9 1 9 1 9

1 1 1 1 1

9 1 9 1 9

9 9 9 9 9

5 6

7

1 3

2 2

2 4

3 3

4 2

4 4

5 3

9 9 1 9 9

9 1 1 1 9

9 9 1 9 9

9 1 1 1 9

9 9 1 9 9

5 3

5

2 2

3 1

3 3

3 5

4 2

9 9 9 9 9

9 1 9 1 9

1 1 1 1 1

9 1 9 1 9

9 9 9 9 9

5 9

6

1 3

2 4

3 1

3 5

4 2

5 3

1 1 1 9 9

1 1 1 1 9

1 1 1 1 1

9 1 1 1 1

9 9 1 1 1

5 9

6

1 3

2 2

3 1

3 5

4 4

5 3

9 9 1 1 1

9 1 1 1 1

1 1 1 1 1

1 1 1 1 9

1 1 1 9 9

 

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值