膜拜Tim神程序。。

#include <cstdio> #include <cstdlib> #include <cstring> #define MAXN 100 #define INFINITE 1000000000 using namespace std; char horizontal[MAXN + 1], vertical[MAXN + 1]; int cost_horizontal[MAXN + 1], cost_vertical[MAXN + 1]; int x1[MAXN + 1], y1[MAXN + 1], x2[MAXN + 1], y2[MAXN + 1]; int n, m, K; class Demand { public: int x1, y1, x2, y2; int dirx, diry; }; Demand demand[MAXN + 1]; void Init() { scanf("%d%d", &m, &n); scanf("%s", horizontal); scanf("%s", vertical + 1); for (int i = 0; i < m; i ++) scanf("%d", &cost_horizontal[i]); for (int i = 1; i <= n; i ++) scanf("%d", &cost_vertical[i]); scanf("%d", &K); for (int i = 1; i <= K; i ++) { scanf("%d%d%d%d", &demand[i].x1, &demand[i].y1, &demand[i].x2, &demand[i].y2); demand[i].x1 --; demand[i].x2 --; } } #define Dir(p1, p2) ((p1) < (p2)) #define P(s, p) (((s) >> (p)) & 1) int Ans = 0; inline int max(int a, int b) { return a > b ? a : b; } int Cnt = 0; int left[MAXN * 2 + 1], right[MAXN * 2 + 1], dir[MAXN * 2 + 1]; void AddDemand(int l, int r, int _dir) { Cnt ++; left[Cnt] = l, right[Cnt] = r, dir[Cnt] = _dir; } int Count = 0; int begin[MAXN * 2 + 1], next[MAXN * 2 + 1], L[MAXN * 2 + 1]; void AddEdge(int l, int r, int _dir) { Count ++; next[Count] = begin[r]; begin[r] = Count; L[Count] = l; dir[Count] = _dir; } bool ok(int i, int j, int k) { for (int now = begin[i]; now; now = next[now]) if (L[now] >= j) if (dir[now] != k) return false; return true; } bool hash[MAXN * 2 + 1]; int f[MAXN + 1][MAXN + 1][2]; int s[MAXN + 1][MAXN + 1][2][2]; #define Cost(p, t) ((vertical[p] != (t)) * cost_vertical[p]) void Renew(int ii, int jj, int kk, int i, int j, int k, int cost) { if (f[i][j][k] + cost < f[ii][jj][kk]) { f[ii][jj][kk] = f[i][j][k] + cost; s[ii][jj][kk][0] = j; s[ii][jj][kk][1] = k; } } int Calculate(int s) { Cnt = 0; int cost = 0; for (int i = 0; i < m; i ++) cost += (horizontal[i] != ((s >> i) & 1)) * cost_horizontal[i]; for (int i = 1; i <= K; i ++) { int x1 = demand[i].x1, y1 = demand[i].y1, x2 = demand[i].x2, y2 = demand[i].y2; int dirx = Dir(x1, x2); int diry = Dir(y1, y2); if (x1 == x2) { if (Dir(y1, y2) != P(s, x1)) return INFINITE; } if (y1 == y2) AddDemand(y1, y2, dirx); else if (P(s, x1) == diry && P(s, x2) == diry) AddDemand(y1, y2, dirx); else if (P(s, x1) == diry && P(s, x2) != diry) AddDemand(y2, y2, dirx); else if (P(s, x1) != diry && P(s, x2) == diry) AddDemand(y1, y1, dirx); else { bool boo = false; for (int j = x1 + 1; j <= x2 - 1; j ++) if (P(s, j) == diry) { boo = true; break; } if (!boo) return INFINITE; AddDemand(y1, y1, dirx); AddDemand(y2, y2, dirx); } } memset(hash, 0, sizeof(hash)); for (int i = 1; i <= Cnt; i ++) for (int j = 1; j <= Cnt; j ++) if (i != j && left[j] <= left[i] && right[i] <= right[j] && dir[i] == dir[j]) hash[j] = true; Count = 0; memset(begin, 0, sizeof(begin)); for (int i = 1; i <= Cnt; i ++) if (!hash[i]) AddEdge(left[i], right[i], dir[i]); memset(f, 0x3f, sizeof(0x3f)); f[1][1][0] = Cost(1, 0); f[1][1][1] = Cost(1, 1); for (int i = 1; i < n; i ++) for (int j = 1; j <= i; j ++) for (int k = 0; k < 2; k ++) if (ok(i, j, k)) { Renew(i + 1, j, k, i, j, k, Cost(i + 1, k)); Renew(i + 1, i + 1, k ^ 1, i, j, k, Cost(i + 1, k ^ 1)); } int ans = INFINITE, pos = -1, id = -1; for (int j = 1; j <= n; j ++) for (int k = 0; k < 2; k ++) if (ok(n, j, k) && f[n][j][k] < ans) { ans = f[n][j][k]; pos = j; id = k; } return ans; } void Solve() { for (int i = 0; i < m; i ++) horizontal[i] = (horizontal[i] == 'E'); for (int i = 1; i <= n; i ++) vertical[i] = (vertical[i] == 'N'); for (int s = 0; s < (1 << m); s ++) Ans = max(Ans, Calculate(s)); } void Print() { if (Ans >= INFINITE) printf("impossible/n"); else { printf("%d/n", Ans); } } int main() { freopen("manhattan.in", "r", stdin); freopen("manhattan.out", "w", stdout); Init(); Solve(); Print(); return 0; }

 

输入文件：

 

2010-05-16 20:25:49 jiakai@JiaKai tmp 23 1020
$ cat manhattan.in
2 3
WE
NNS
3 9
1 4 2
2
1 3 2 1
2 3 2 2

编译参数：

g++ manhattan.cpp -o manhattan -g -Wall

软件版本：

2010-05-16 20:27:43 jiakai@JiaKai tmp 25 1022
$ g++ --version
g++ (GCC) 4.1.2
Copyright (C) 2006 Free Software Foundation, Inc.
本程序是自由软件；请参看源代码的版权声明。本软件没有任何担保；
包括没有适销性和某一专用目的下的适用性担保。

2010-05-16 20:28:23 jiakai@JiaKai tmp 26 1023
$ gdb --version
GNU gdb (GDB) 7.1
Copyright (C) 2010 Free Software Foundation, Inc.
License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it.
There is NO WARRANTY, to the extent permitted by law.  Type "show copying"
and "show warranty" for details.
This GDB was configured as "i686-pc-linux-gnu".
For bug reporting instructions, please see:
<http://www.gnu.org/software/gdb/bugs/>.

开始gdb：

2010-05-16 20:28:26 jiakai@JiaKai tmp 27 1024
$ gdb ./manhattan
GNU gdb (GDB) 7.1
Copyright (C) 2010 Free Software Foundation, Inc.
License GPLv3+: GNU GPL version 3 or later <http://gnu.org/licenses/gpl.html>
This is free software: you are free to change and redistribute it.
There is NO WARRANTY, to the extent permitted by law.  Type "show copying"
and "show warranty" for details.
This GDB was configured as "i686-pc-linux-gnu".
For bug reporting instructions, please see:
<http://www.gnu.org/software/gdb/bugs/>...
Reading symbols from /tmp/manhattan...done.
(gdb) b 105
Breakpoint 1 at 0x8048894: file manhattan.cpp, line 105.
(gdb) r
Starting program: /tmp/manhattan

Breakpoint 1, Calculate (s=0) at manhattan.cpp:105
105                     if (x1 == x2)
(gdb) s
110                     if (y1 == y2)
(gdb)
112                     else if (P(s, x1) == diry && P(s, x2) == diry)
(gdb)
113                             AddDemand(y1, y2, dirx);
(gdb)
AddDemand (l=3, r=1, _dir=1) at manhattan.cpp:54
54          Cnt ++;
(gdb)
55          left[Cnt] = l, right[Cnt] = r, dir[Cnt] = _dir;
(gdb)
56      }
(gdb)
Calculate (s=0) at manhattan.cpp:112
112                     else if (P(s, x1) == diry && P(s, x2) == diry)
(gdb)

113行执行完了，又回到了112.。。。 我表示目前无法解释。 记下来，以后慢慢研究。