惊了我竟然排Rank 2,咸鱼有朝一日也能翻身。1A
先留个坑
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int N = 5005, M = N * 10, inf = 0x3f3f3f3f;
namespace Graph {
int head[N], next[M], to[M], vis[N], cur[N], level[N], que[N * 20], w[M];
int edge_cnt = 0, s, t;
void add(int a, int b, int c) {
next[edge_cnt] = head[a]; to[edge_cnt] = b; w[edge_cnt] = c; head[a] = edge_cnt++;
next[edge_cnt] = head[b]; to[edge_cnt] = a; w[edge_cnt] = 0; head[b] = edge_cnt++;
}
bool bfs() {
memset(level, -1, sizeof level);
int f = 0, r = 0;
que[r++] = s; level[s] = 0;
while (f < r) {
int u = que[f++];
for (int i = head[u]; i != -1; i = next[i])
if (w[i] > 0 && level[to[i]] == -1) {
level[to[i]] = level[u] + 1;
if (to[i] == t) return 1;
que[r++] = to[i];
}
}
return level[t] != -1;
}
int dfs(int u, int low) {
if (u == t) return low;
int res = 0;
for (int i = cur[u]; i != -1 && res < low; i = next[i])
if (w[i] > 0 && level[to[i]] == level[u] + 1) {
int tmp = dfs(to[i], min(low - res, w[i]));
res += tmp; w[i] -= tmp; w[i ^ 1] += tmp;
if (w[i]) cur[u] = i;
}
if (!res) level[u] = -1;
return res;
}
int solve() {
int ans = 0;
while (bfs()) {
memcpy(cur, head, sizeof cur);
ans += dfs(s, inf);
}
return ans;
}
}
int dx[] = {0, 0, -1, 1};
int dy[] = {1, -1, 0, 0};
int main() {
using namespace Graph;
int n, m, i, j, k, x, sum = 0;
memset(head, -1, sizeof head);
scanf("%d%d", &n, &m);
#define p1(i, j) (((i - 1) * m + j) << 1)
#define p2(i, j) ((((i - 1) * m + j) << 1) | 1)
s = 0; t = p2(n, m) + 1;
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
scanf("%d", &x);
if (i + j & 1)
add(s, p1(i, j), x);
else
add(p1(i, j), t, x);
}
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++) {
scanf("%d", &x); sum += x;
if (i + j & 1)
add(p1(i, j), p2(i, j), x);
else
add(p2(i, j), p1(i, j), x);
}
for (i = 1; i <= n; i++)
for (j = 1; j <= m; j++)
for (k = 0; k < 4; k++) {
int nx = i + dx[k], ny = j + dy[k];
if (nx < 1 || nx > n || ny < 1 || ny > m) continue;
if (i + j & 1)
add(p2(i, j), p1(nx, ny), inf);
else
add(p1(nx, ny), p2(i, j), inf);
}
printf("%d", sum - solve());
return 0;
}
3774: 最优选择
Time Limit: 1 Sec Memory Limit: 128 MB
Submit: 103 Solved: 52
Description
小N手上有一个N*M的方格图,控制某一个点要付出Aij的代价,然后某个点如果被控制了,或者他周围的所有点(上下左右)都被控制了,那么他就算是被选择了的。一个点如果被选择了,那么可以得到Bij的回报,现在请你帮小N选一个最优的方案,使得回报-代价尽可能大。
Input
第一行两个正整数N,M表示方格图的长与宽。
接下来N行每行M个整数Aij表示控制的代价。
接下来N行每行M个整数Bij表示选择的回报。
Output
一个整数,表示最大的回报-代价(如果一个都不控制那么就是0)。
Sample Input
3 3
1 100 100
100 1 100
1 100 100
2 0 0
5 2 0
2 0 0
Sample Output
8
HINT
对于100%的数据,N,M<=50,Aij,Bij都是小于等于100的正整数。