noi2004 曼哈顿

说实话这题我不会，找了份题解然后研究了很长时间还是不是很没明白，反正就小的那个量搜索，大的就dp，恩，然后就过了。

题目大意：

  有一些道路，南北和东西的n<=100 m<=10，然后这些道路有初始的方向，和每条道路改变方向的费用。给你一点的对应，A（x1，

y1）B（x2，y2），就是从A到B必须走最短路，也就是两点的欧几里得距离。然后让你求解有没有一种方案，如果没有输出impossible，否则输出possible+最小费用+改变后的方向。

简略题解：

  由于m<=10所以这个可以枚举，每次枚举一个然后就开始dp另一个方向的。就是得让每一个都符合就行了。

附代码：

program manhattan; const inf=200000000; var bdx,tdx,edx,bdy,tdy,edy:array[1..100] of longint; a:array[1..100] of record x1,y1,x2,y2:longint; end; col:array[1..100] of record b,e,d:longint; end; costx,costy:array[1..100] of longint; n,m,na,nb:longint; ans,maxi:longint; {------------------------} procedure init; var i,k,x1,y1,x2,y2:longint; t:char; begin readln(m,n); for i:=1 to m do begin read(t); if t='E' then bdx[i]:=1 else bdx[i]:=-1; end;readln; for i:=1 to n do begin read(t); if t='S' then bdy[i]:=1 else bdy[i]:=-1; end;readln; for i:=1 to m do read(costx[i]); for i:=1 to n do read(costy[i]); readln(k); nb:=0; for i:=1 to k do begin readln(x1,y1,x2,y2); if (x1<>x2) or (y1<>y2) then begin inc(nb); a[nb].x1:=x1; a[nb].y1:=y1; a[nb].x2:=x2; a[nb].y2:=y2; end; end; end; {------------------------} function min(x,y:longint):longint; begin if x<y then exit(x);exit(y); end; {------------------------} function max(x,y:longint):longint; begin if x>y then exit(x);exit(y); end; {------------------------} procedure solve; var i,j,u,dx,dy,d1,d2,c:longint; find,more:boolean; begin fillchar(tdy,sizeof(tdy),0); na:=0; for i:=1 to nb do with a[i] do begin if y2>y1 then dx:=1 else if y1>y2 then dx:=-1 else dx:=0; if x2>x1 then dy:=1 else if x1>x2 then dy:=-1 else dy:=0; d1:=tdx[x1];d2:=tdx[x2]; if dy=0 then if d1<>dx then exit; if dx=0 then if tdy[y1]=-dy then exit else tdy[y1]:=dy else begin if (d1=dx) and (d2=dx) then begin inc(na); with col[na] do begin b:=min(y1,y2); e:=max(y1,y2); d:=dy; end; end; if d1<>dx then if tdy[y1]=-dy then exit else tdy[y1]:=dy; if d2<>dx then if tdy[y2]=-dy then exit else tdy[y2]:=dy; if (d1<>dx) and (d2<>dx) then begin find:=false; for j:=min(x1,x2) to max(x1,x2) do if tdx[j]=dx then begin find:=true;break; end; if not find then exit; end; end; end; repeat more:=false; for i:=1 to na do with col[i] do begin find:=false; for j:=b to e do if (tdy[j]=d) or (tdy[j]=0) and (bdy[j]=d) then begin find:=true; break; end; if not find then begin c:=inf; for j:=b to e do if (tdy[j]=0) and (costy[j]<c) then begin u:=j;c:=costy[j]; end; if c=inf then exit; tdy[u]:=d; more:=true; end; end; until not more; for i:=1 to n do if tdy[i]=0 then tdy[i]:=bdy[i] else if tdy[i]<>bdy[i] then inc(maxi,costy[i]); if maxi<ans then begin ans:=maxi; edx:=tdx; edy:=tdy; end; end; {------------------------} procedure dfs(i,cost:longint); begin if i>m then begin if cost<ans then begin maxi:=cost;solve; end; exit; end; tdx[i]:=1; if bdx[i]=1 then dfs(i+1,cost) else dfs(i+1,cost+costx[i]); tdx[i]:=-1; if bdx[i]=-1 then dfs(i+1,cost) else dfs(i+1,cost+costx[i]); end; {------------------------} procedure main; var i:longint; begin ans:=inf; dfs(1,0); if ans=inf then writeln('impossible') else begin writeln('possible'); writeln(ans); for i:=1 to m do if edx[i]=1 then write('E') else write('W');writeln; for i:=1 to n do if edy[i]=1 then write('S') else write('N');writeln; end; end; {------------------------} begin assign(input,'manhattan.in');reset(input); assign(output,'manhattan.out');rewrite(output); init; main; close(output); end.