刚开始做的时候,以为跟hdu 上那两道方格取数很像。事实它们的确很像= =,但看到下面的条件当时就傻了。
题意:
给你一个n*m个数,让你取出其中的数让总值最大。其中有k个数必须取的。
每取一个数,总值就加上那个数的值。
若取了相邻数,加上该数值后还应减去 2*(x&y) //x, y是你所取的相邻的两个数。
思路:
一直在考虑要不要写这题的思路,毕竟是参考别人的,而且在犹豫自己能否写得比别人好。
就先这样,后面再补,当作给自己的提醒。
建图:
(INF:不限流量)
必选的点:由于是二分图,我是源点放左边,汇点放右边。必选点u。u在左边:s->u,容量INF;u在右边:u -> t,容量INF
相邻的点:相邻的点,左边连到右边,容量为2*(x&y);
用所有点总和减去最大流就是答案。
AC代码:(Dinic最大流)
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <queue>
#include <vector>
#define debug cout<<"debug"<<endl;
using namespace std;
const int MAXEDGE = 5*1e5 + 5;
const int INF = 0x3f3f3f3f;
const int MAXN = 2550;
int n ,m, k;
bool flag[55][55];
struct Edge
{
int to, cap, flow, next;
}edge[MAXEDGE];
struct Dinic
{
int s, t, pp;
int head[MAXN], cur[MAXN], d[MAXN];
bool vis[MAXN];
Dinic(int ss, int tt)
{
s = ss, t = tt;
pp = 0;
memset(head, -1, sizeof(head));
}
void addEdge(int u, int v, int c)
{
edge[pp] = (Edge){v, c, 0, head[u]};
head[u] = pp++;
edge[pp] = (Edge){u, 0, 0, head[v]};
head[v] = pp++;
}
bool bfs()
{
memset(vis, false, sizeof(vis));
d[s] = 0;
queue <int> q;
q.push(s);
vis[s] = true;
while(!q.empty())
{
int u = q.front();
q.pop();
int next = head[u];
while(next != -1)
{
Edge &e = edge[next];
if(!vis[e.to] && e.cap > e.flow)
{
q.push(e.to);
vis[e.to] = true;
d[e.to] = d[u] + 1;
}
next = e.next;
}
}
return vis[t];
}
int dfs(int u, int a)
{
if(u == t || a == 0) return a;
int flow = 0, f;
int &next = cur[u];
while(next != -1)
{
Edge &e = edge[next];
if(d[e.to] == d[u] + 1 && (f = dfs(e.to, min(a, e.cap - e.flow))) > 0)
{
e.flow += f;
edge[next^1].flow -= f;
flow += f;
a -= f;
if(a == 0) break;
}
next = e.next;
}
return flow;
}
int getMaxFlow()
{
int res = 0;
while(bfs())
{
for(int i = 0;i < n*m +5; i++)
{
cur[i] = head[i];
}
res += dfs(s, INF);
}
return res;
}
};
int a[MAXN][MAXN];
int main()
{
while(scanf("%d%d%d", &n, &m, &k) != EOF)
{
memset(flag, false, sizeof(flag));
int s = 0, t = n*m + 1;
Dinic dinic(s, t);
int sum = 0;
for(int i = 0; i < n; i++)
{
for(int j = 1; j <= m; j++)
{
scanf("%d", &a[i][j]);
sum += a[i][j];
}
}
int x, y;
for(int i = 0; i < k; i++)
{
scanf("%d%d",&x, &y);
flag[x][y] = true;
}
for(int i = 0;i < n; i++)
{
for(int j = 1;j <= m; j++)
{
if((i+j)%2)
{
if(flag[i+1][j]) dinic.addEdge(s, i*m + j, INF);
else dinic.addEdge(s, i*m + j, a[i][j]);
if(i != 0) dinic.addEdge(i*m + j, (i-1)*m + j, 2*(a[i][j] & a[i-1][j]));
if(i != n-1) dinic.addEdge(i*m + j, (i+1)*m + j, 2*(a[i][j] & a[i+1][j]));
if(j != 1) dinic.addEdge(i*m + j, i*m + j - 1, 2*(a[i][j] & a[i][j-1]));
if(j != m) dinic.addEdge(i*m + j, i*m + j + 1, 2*(a[i][j] & a[i][j+1]));
}
else
{
if(flag[i+1][j]) dinic.addEdge(i*m + j, t, INF);
else dinic.addEdge(i*m + j, t, a[i][j]);
}
}
}
printf("%d\n", sum - dinic.getMaxFlow());
}
return 0;
}