话说为什么就记录周围四种就够了?

P3408 恋爱

是的所以题解似乎有点问题。这样的状态其实是远远不够用的w
by Xiaojian_xiang @ 2016-10-16 10:40:23


那么数据会不会也有问题?
by zx2003 @ 2016-10-16 10:47:36


@[kkksc03](/space/show?uid=1)
by zx2003 @ 2016-10-16 10:48:17


```cpp #include <stdio.h> #define chmin(a,b) if ((a) > (b)) { a = (b); } const int INF = 1000000; int H, W; int shop[1020][1020]; int dp[1020][1020][16]; int bc[] = { 0, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4 }; int main() { int i, j, k, k2, cost; char in[1020]; scanf("%d%d", &H, &W); for (i = 0; i < H + 3; ++i) { for (j = 0; j < W + 3; ++j) { shop[i][j] = 0; for (k = 0; k < 16; ++k) dp[i][j][k] = INF; } } for (i = 0; i < H; ++i) { scanf("%s", in); for (j = 0; j < W; ++j) { shop[i + 1][j + 1] = (in[j] == '.' ? 0 : (in[j] - '0')); } } dp[1][1][15] = 0; for (i = 1; i <= H; ++i) { for (j = 1; j <= W; ++j) { for (k = 0; k < 16; ++k) { // move to (i + 1, j) for (k2 = 0; k2 < 16; ++k2) { if ( ((k & 4) == 0) != ((k2 & 8) == 0) ||!(k & 2) ||(bc[k & 1] + bc[k2 & 6] <= 1) ) continue; cost = dp[i][j][k]; if (k2 & 1) cost += shop[i + 2][j - 1]; if (k2 & 2) cost += shop[i + 2][j]; if (k2 & 4) cost += shop[i + 1][j + 1]; chmin(dp[i + 1][j][k2], cost); } // move to (i, j + 1) for (k2 = 0; k2 < 16; ++k2) { if ( ((k & 2) == 0) != ((k2 & 1) == 0) ||!(k & 4) ||(bc[k & 8] + bc[k2 & 6] <= 1) ) continue; cost = dp[i][j][k]; if (k2 & 8) cost += shop[i - 1][j + 2]; if (k2 & 4) cost += shop[i][j + 2]; if (k2 & 2) cost += shop[i + 1][j + 1]; chmin(dp[i][j + 1][k2], cost); } } } } printf("%d\n", dp[H][W][15]); return 0; } ```
by kkksc03 @ 2016-10-16 10:49:39


请问bc数组是什么意思?
by apt123 @ 2016-10-16 11:05:48


@[apt123](/space/show?uid=14769) bc[i]=i在二进制下中一的个数
by kimi0503 @ 2016-10-16 11:25:37


果断状压六个
by DOFY @ 2016-10-16 21:59:49


比赛的时候我请一个银牌爷看了,他一眼看出六个
by DOFY @ 2016-10-16 22:00:23


这里应该是状压左下、下、右、右上四个吧。 麻烦看下std就是写的这四个啊好不好。。 题解写的什么鬼?!
by TA123 @ 2016-10-17 18:39:09


|