题意:给定一个n*m的棋盘,每一行的和给出,每一列的和给出,问是否存在这种摆法。每个位置放的数字都只能是0到9。
解法:建图方面,源点和每一行连一条流量为当前行的和的边,每一列和汇点连一条流量为当前列的和的边,然后每一行和每一列都连上一条流量为9的边。跑一边dinic即可。这个问题卡的是如何判断有多种情况符合,我写了个dfs然后T了。判环的话,前段时间写的一道题找负环是用spfa,这道题的话其实只是要走有流量的边,并且边数大于等于2即可,所以用个tarjan判断一下即可。加深一下对tarjan的理解。
这个题的数据十分的水。
1.没有判断行和列的和要相等也过了。
2.用强联通找环是错误的,毕竟存在强联通不代表存在边数大于2的环存在。
具体移步到http://blog.csdn.net/llzhh/article/details/77374730也就是hdu4888这题吧,两道题其实是一样的,但是fudan的数据严谨很多。
代码如下:(代码虽然很长,但是其中70行是dinic模版,然后自己写的也就是80行的样子)
#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>
#include<utility>
#include<stack>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
using namespace std;
const int maxn = 1000 + 10;
const int maxm = maxn * maxn;
const int INF = 0x3f3f3f3f;
int n, m;
int row[maxn], column[maxn];
int head[maxn],cur[maxn],nx[maxm<<1],to[maxm<<1],flow[maxm<<1],ppp=0;
struct Dinic
{
int dis[maxn];
int s, t;
long long ans;
void init() {
memset(head, -1, sizeof(head));
ppp = 0;
}
void AddEdge(int u, int v, int c)
{
to[ppp]=v;flow[ppp]=c;nx[ppp]=head[u];head[u]=ppp++;swap(u,v);
to[ppp]=v;flow[ppp]=0;nx[ppp]=head[u];head[u]=ppp++;
}
bool BFS()
{
memset(dis, -1, sizeof(dis));
dis[s] = 1;
queue<int> Q;
Q.push(s);
while(!Q.empty())
{
int x = Q.front();
Q.pop();
for(int i = head[x]; ~i; i = nx[i])
{
if(flow[i] && dis[to[i]] == -1)
{
dis[to[i]] = dis[x] + 1;
Q.push(to[i]);
}
}
}
return dis[t] != -1;
}
int DFS(int x, int maxflow)
{
if(x == t || !maxflow){
ans += maxflow;
return maxflow;
}
int ret = 0, f;
for(int &i = cur[x]; ~i; i = nx[i])
{
if(dis[to[i]] == dis[x] + 1 && (f = DFS(to[i], min(maxflow, flow[i]))))
{
ret += f;
flow[i] -= f;
flow[i^1] += f;
maxflow -= f;
if(!maxflow)
break;
}
}
return ret;
}
long long solve(int source, int tank)
{
s = source;
t = tank;
ans = 0;
while(BFS())
{
memcpy(cur, head, sizeof(cur));
DFS(s, INF);
}
return ans;
}
}dinic;
int key[maxn], low[maxn], dfn[maxn], ok, scc;
stack <int> sta;
void tarjan(int u) {
key[u] = 2;
low[u] = dfn[u] = scc++;
sta.push(u);
for(int i = head[u]; ~i; i = nx[i]) {
int v = to[i];
if(flow[i] == 0)
continue;
if(dfn[v] == -1) {
tarjan(v);
low[u] = min(low[u], low[v]);
} else if(key[v] == 2) {
low[u] = min(dfn[v], low[u]);
}
}
if(low[u] == dfn[u]) {
int cnt = 0;
while(!sta.empty()) {
int v = sta.top();
sta.pop();
key[v] = 1;
cnt++;
if(v == u)
break;
}
if(cnt > 2)
ok = 1;
}
}
int main() {
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
// freopen("out.txt", "w", stdout);
#endif
int T, Case = 1;
cin >> T;
while(T--) {
int sum = 0;
scanf("%d%d", &n, &m);
for(int i = 0; i < n; i++) {
scanf("%d", &row[i]);
sum += row[i];
}
for(int i = 0; i < m; i++) {
scanf("%d", &column[i]);
}
dinic.init();
int s = n + m, t = s + 1;
for(int i = 0; i < n; i++) {
for(int j = 0; j < m; j++) {
dinic.AddEdge(i, n + j, 9);
}
}
for(int i = 0; i < n; i++) {
dinic.AddEdge(s, i, row[i]);
}
for(int i = 0; i < m; i++) {
dinic.AddEdge(n + i, t, column[i]);
}
int ans = dinic.solve(s, t);
if(ans != sum) {
printf("Case #%d: So naive!\n", Case++);
continue;
}
memset(dfn, -1, sizeof(dfn));
memset(key, 0, sizeof(key));
memset(low, -1, sizeof(low));
ok = scc = 0;
while(!sta.empty())
sta.pop();
for(int i = 0; i < s; i++) {
if(dfn[i] == -1) {
tarjan(i);
}
}
if(ok)
printf("Case #%d: So young!\n", Case++);
else
printf("Case #%d: So simple!\n", Case++);
}
return 0;
}