题目连接:http://acm.nyist.edu.cn/JudgeOnline/problem.php?pid=489
分析:我们规定哭泣的天使为1,微笑的为0,因为不确定矩阵中1的个数,我们用每行的编号对每列的列号建边,正好可以确定到每一个位置,添加一个源点S对每行建边,权值为该行哭泣天使的个数,添加一个汇点U对每列建边,权值为该列哭泣天使的个数,求S到U的最大流即可,就是最多可以确定多少条行到列的边,每条边确定一个哭泣天使,如果确定的不等于初始化的哭泣天使的个数(每行的和或者每列的和),就Trrible了,否则就Not sure了。
300++ms,参考代码:
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
using namespace std;
#define NN 305
#define INS 1<<30
#define CLR(a,v) memset(a,v,sizeof(a))
template<int MaxV,int MaxE>
class MaxFlow{
public:
void Clear(){
CLR(h,-1); CLR(cnt,0); CLR(vis,0);
flag = false;
pos = top = head = total = maxflow = 0;
}
void add(int u,int v,int flow){
num[pos] = v;
sur[pos] = flow;
next[pos] = h[u];
h[u] = pos++;
num[pos] = u;
sur[pos] = 0;
next[pos] = h[v];
h[v] = pos++;
}
int GetMaxFlow(int s,int t){
init(t);
stk[top] = s;
while(!flag){
minres = INS;
if(top < 0) top = 0;
if(!dfs(stk[top],-1,t,minres)) continue;
maxflow += minres;
while(dis != -1){
sur[dis] -= minres;
sur[dis^1] += minres;
dis = pre_e[dis];
}
top = 0;
}
return maxflow;
}
private:
int h[MaxV],num[MaxE],sur[MaxE],next[MaxE],gap[MaxV],cnt[MaxV],pre_e[MaxE],stk[MaxV],que[MaxV];
int pos,top,head,total,maxflow,minres,dis;
bool vis[MaxV],flag;
void init(int n){
que[total++] = n;
vis[n] = true;
while(head < total){
int p = que[head++];
if(head >= MaxV) head -= MaxV;
for(int i = h[p]; i != -1 ;i = next[i]){
if(!vis[ num[i] ]){
vis[ num[i] ] = true;
gap[ num[i] ] = gap[p] + 1;
cnt[ gap[ num[i] ] ]++;
que[total++] = num[i];
if(total >= MaxV) total -= MaxV;
}
}
}
}
bool dfs(int p,int father,int n,int &minres){
int m = minres;
for(int i = h[p]; i != -1 ;i = next[i]){
if(sur[i] > 0 && gap[p] - gap[ num[i] ] == 1){
minres = min(minres,sur[i]);
pre_e[i] = father;
if(num[i] != n) stk[++top] = num[i];
if(num[i] == n || dfs(num[i],i,n,minres)) {
if(num[i] == n) dis = i;
return true;
}
minres = m;
}
}
cnt[ gap[p] ]--;
cnt[ gap[p] + 1]++;
top--;
if(cnt[ gap[p] ] == 0) flag = true;
gap[p] += 1;
return false;
}
};
MaxFlow<NN*2,182005> g;
int main()
{
int T,m,n;
int C[NN],R[NN];
scanf("%d",&T);
while(T--)
{
g.Clear();
scanf("%d%d",&m,&n);
int sum1 = 0,sum2 = 0;
for(int i = 1;i <= m;++i)
{
scanf("%d",&C[i]);
sum1 += C[i];
}
for(int i = 1;i <= n;++i)
{
scanf("%d",&R[i]);
sum2 += R[i];
}
if(sum1 != sum2)
{
printf("Terrible\n");
continue;
}
for(int i = 1;i <= m;++i)
{
g.add(0,i,C[i]);
for(int j = 1;j <= n;++j)
{
g.add(i,j+m,1);
}
}
for(int i = 1;i <= n;++i)
g.add(i+m,m+n+1,R[i]);
sum2 = g.GetMaxFlow(0,m+n+1);
printf(sum2 == sum1?"Not Sure\n":"Terrible\n");
}
return 0;
}
下面的模式是借鉴别人,想了一天才弄明白,把深搜写成循环的形式 100--ms:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
#define NN 305
#define INS 1<<30
#define CLR(arr,v) memset(arr,v,sizeof(arr))
template<int MaxV,int MaxE>
class MaxFlow{
public:
void Clear(){
pos = head = total = 0;
CLR(h,-1); CLR(cnt,0); CLR(Flow,0);
CLR(gap,0);CLR(next,-1);
}
void add(int u,int v,int f){
num[pos] = v;
cap[pos] = f;
next[pos] = h[u];
h[u] = pos++;
num[pos] = u;
cap[pos] = 0;
next[pos] = h[v];
h[v] = pos++;
}
int GetMaxFlow(int s,int t){
int maxflow = 0,cur = s,minflow = INS;
memcpy(Cur,h,sizeof(h));
Init(t);
while(gap[cur] < t){
int &i = Cur[cur];
for(;i != -1;i = next[i]){
if(cap[i] - Flow[i] > 0 && gap[cur] - gap[ num[i] ] == 1){
minflow = min(minflow,cap[i] - Flow[i]);
pre_v[ num[i] ] = cur;
pre_e[ num[i] ] = i;
cur = num[i];
if(cur == t){
maxflow += minflow;
while(cur != s){
Flow[ pre_e[cur] ] += minflow;
Flow[ pre_e[cur]^1 ] -= minflow;
cur = pre_v[cur];
}
minflow = INS;
}
break;
}
}
if(i == -1){
if(--cnt[ gap[cur] ] == 0) return maxflow;
i = h[cur];
gap[cur] = INS;
for(int j = h[cur];j != -1;j = next[j])
if(gap[ num[j] ] + 1 < gap[cur] && cap[j] > Flow[j])
gap[cur] = gap[ num[j] ] + 1;
if(gap[cur] < INS) ++cnt[ gap[cur] ];
cur = pre_v[cur];
}
}
return maxflow;
}
private:
int h[MaxV],Cur[MaxV],num[MaxE],cap[MaxE],next[MaxE],gap[MaxV],cnt[MaxV],pre_v[MaxV],pre_e[MaxE],Flow[MaxE],que[MaxV];
int pos,head,total;
void Init(int n){
cnt[0] = 1;
que[total++] = n;
while(head < total){
int p = que[head++];
for(int i = h[p]; i != -1;i = next[i]){
if((i&1) && !gap[ num[i] ]){
gap[ num[i] ] = gap[p] + 1;
cnt[ gap[ num[i] ] ]++;
que[total++] = num[i];
}
}
}
}
};
int main()
{
int T,m,n;
int C[NN],R[NN];
scanf("%d",&T);
while(T--)
{
g.Clear();
scanf("%d%d",&m,&n);
int sum1 = 0,sum2 = 0;
for(int i = 1;i <= m;++i)
{
scanf("%d",&C[i]);
sum1 += C[i];
}
for(int i = 1;i <= n;++i)
{
scanf("%d",&R[i]);
sum2 += R[i];
}
if(sum1 != sum2)
{
printf("Terrible\n");
continue;
}
for(int i = 1;i <= m;++i)
{
g.add(0,i,C[i]);
for(int j = 1;j <= n;++j)
{
g.add(i,j+m,1);
}
}
for(int i = 1;i <= n;++i)
g.add(i+m,m+n+1,R[i]);
sum2 = g.GetMaxFlow(0,m+n+1);
printf(sum2 == sum1?"Not Sure\n":"Terrible\n");
}
return 0;
}