/* * 地址: http://acm.hdu.edu.cn/showproblem.php?pid=3657 * 题意: 给定一个 n * m 大小的矩阵, 矩阵中每个格子都有一个不大于 1000 的正整数, * 现在要从矩阵中选出若干个格子, 使得得分最大. 得分等于选取的格子里的数字 * 和. 如果有两个格子相邻, 则得分将减去 2 * (x & y), x 和 y 为相邻两个格 * 子内的数字. 此外, 还有一些格子是必选的. * 解法: 此题是个最大流算法, 和 NOI 国家集训队论文上的最大流题目类似. 建图方法 * 是设置一个超级源点和一个超级汇点, 将横坐标和纵坐标之和为偶数的格子和源 * 点相连, 边权值为格子的数值. 将横坐标和纵坐标之和为奇数的格子和汇点相连, * 边权值为格子的数值, 如果两个格子相邻, 则在它们所代表的顶点之间连一条边, * 权值为 2 * (x & y) . 对于必选的顶点, 将它们和源点或者汇点相连的边权值 * 改为正无穷, 最大得分数为所有格子数值相加减去图的最大流. */ #include <iostream> using namespace std; #define typec int #define inf 0x00ffffff #define E 200000 #define V 60000 struct edge { int x, y, nxt; typec c; } bf[2 * E]; int ne, head[V], cur[V], ps[V], dep[V]; void init(int n) { memset(head, 0, (n+1) * sizeof(int)); ne = 2; } void addedge(int x, int y, typec c) { bf[ne].x = x; bf[ne].y = y; bf[ne].c = c; bf[ne].nxt = head[x]; head[x] = ne++; bf[ne].x = y; bf[ne].y = x; bf[ne].c = 0; bf[ne].nxt = head[y]; head[y] = ne++; } typec flow(int n, int s, int t) { typec tr, res = 0; int i, j, k, f, r, top; while (true) { memset(dep, -1, (n+1) * sizeof(int)); for (f = dep[ps[0] = s] = 0, r = 1; f != r; ) for (i = ps[f++], j = head[i]; j; j = bf[j].nxt) { if (bf[j].c && -1 == dep[k = bf[j].y]) { dep[k] = dep[i] + 1; ps[r++] = k; if (k == t) { f = r; break; } } } if (-1 == dep[t]) break; memcpy(cur, head, (n+1) * sizeof(int)); for (i = s, top = 0; ; ) { if (i == t) { for (k = 0, tr = inf; k < top; ++k) if (bf[ps[k]].c < tr) tr = bf[ps[f = k]].c; for (k = 0; k < top; ++k) bf[ps[k]].c -= tr, bf[ps[k]^1].c += tr; res += tr; i = bf[ps[top = f]].x; } for (j = cur[i]; cur[i]; j = cur[i] = bf[cur[i]].nxt) if(bf[j].c && dep[i]+1 == dep[bf[j].y]) break; if(cur[i]) { ps[top++] = cur[i]; i = bf[cur[i]].y; } else { if(0 == top) break; dep[i] = -1; i = bf[ps[--top]].x; } } } return res; } int n, m, k; int map[50][50]; bool solve() { int res = 0; if (scanf("%d %d %d", &n, &m, &k) == EOF) { return false; } for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { scanf("%d", &map[i][j]); res += map[i][j]; } } init(n * m + 2); for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { int p = i * m + j; if ((i + j) % 2 == 0) { addedge(n * m, p, map[i][j]); if (i + 1 < n) { addedge(p, (i + 1) * m + j, 2 * (map[i][j] & map[i+1][j])); // cout << p << ' ' << (i + 1) * m + j << ' ' << 2 * (map[i][j] & map[i+1][j]) << endl; } if (j + 1 < m) { addedge(p, i * m + j + 1, 2 * (map[i][j] & map[i][j+1])); // cout << p << ' ' << i * m + j + 1 << ' ' << 2 * (map[i][j] & map[i][j+1]) << endl; } } else { addedge(p, n * m + 1, map[i][j]); if (i + 1 < n) { addedge((i + 1) * m + j, p, 2 * (map[i][j] & map[i+1][j])); // cout << (i + 1) * m + j << ' ' << p << ' ' << 2 * (map[i][j] & map[i+1][j]) << endl; } if (j + 1 < m) { addedge(i * m + j + 1, p, 2 * (map[i][j] & map[i][j+1])); // cout << i * m + j + 1 << ' ' << p << ' ' << 2 * (map[i][j] & map[i][j+1]) << endl; } } } } for (int i = 0; i < k; i++) { int x, y, p; scanf("%d %d", &x, &y); x--, y--; p = x * m + y; if ((x + y) % 2 == 0) { addedge(n * m, p, inf); } else { addedge(p, n * m + 1, inf); } } res -= flow(n * m + 2, n * m, n * m + 1); printf("%d/n", res); } int main() { while (solve()); return 0; }