HDU4888 Redraw Beautiful Drawings

Redraw Beautiful Drawings

Time Limit: 3000/1500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)

Total Submission(s): 848 Accepted Submission(s): 139

Problem Description
Alice and Bob are playing together. Alice is crazy about art and she has visited many museums around the world. She has a good memory and she can remember all drawings she has seen.

Today Alice designs a game using these drawings in her memory. First, she matches K+1 colors appears in the picture to K+1 different integers(from 0 to K). After that, she slices the drawing into grids and there are N rows and M columns. Each grid has an integer on it(from 0 to K) representing the color on the corresponding position in the original drawing. Alice wants to share the wonderful drawings with Bob and she tells Bob the size of the drawing, the number of different colors, and the sum of integers on each row and each column. Bob has to redraw the drawing with Alice's information. Unfortunately, somtimes, the information Alice offers is wrong because of Alice's poor math. And sometimes, Bob can work out multiple different drawings using the information Alice provides. Bob gets confused and he needs your help. You have to tell Bob if Alice's information is right and if her information is right you should also tell Bob whether he can get a unique drawing.


Input
The input contains mutiple testcases.

For each testcase, the first line contains three integers N(1 ≤ N ≤ 400) , M(1 ≤ M ≤ 400) and K(1 ≤ K ≤ 40).
N integers are given in the second line representing the sum of N rows.
M integers are given in the third line representing the sum of M columns.

The input is terminated by EOF.


Output
For each testcase, if there is no solution for Bob, output "Impossible" in one line(without the quotation mark); if there is only one solution for Bob, output "Unique" in one line(without the quotation mark) and output an N * M matrix in the following N lines representing Bob's unique solution; if there are many ways for Bob to redraw the drawing, output "Not Unique" in one line(without the quotation mark).


Sample Input
2 2 4
4 2
4 2
4 2 2
2 2 5 0
5 4
1 4 3
9
1 2 3 3


Sample Output
Not Unique
Impossible
Unique
1 2 3 3


Author
Fudan University


Source
2014 Multi-University Training Contest 3

题意：给你一个n*m的矩阵，要求用不超过k的数字填满，而且行和和列和要满足要求

网络流。。。按题解上说的建图，每行当做一个点，从源点连起来，流量为行和，每列也当做一点连接汇点，流量为列和，然后每一行到每一列连接，流量为k，这样每一条边消耗的流量就是对应一个格子里应填的值，从x行流到y列就相当于经过了格子（x,y），这条边的流量也就是这个格子应填的值（如果唯一），然后判断是否唯一就要看残存流量里还没有环，如果有的话就有多个解，就是那条边多跑一点，这里少跑一点就出现另外一个解了，唯一打印矩阵，值就是流量，用k减去剩下的流量就是了。