2010年10月20日

Hi，大家好，我又来了！

 

......

 

 

这个，我在跟谁说话呢？或许只有我自己吧。。。

 

 

好吧继续，今天主要做搜索题。PS：好像几乎全部都是BFS...话说RQ上搜索题好少啊。

题目清单：

八数码难题

24点

魔兽世界

Fish学数学

校园迷宫

医院的设置

 

额。。。一共六道

 

八数码难题：题目上说的A*，我（们）真的不会，所以说嘛，这是道搜索题，BFS轻松AC（难点：hash函数）

program rq70; const vx:array[1..4] of integer=(1,-1,3,-3); type rec=record s:string[9]; total:longint; end; re=record f:boolean; s:string[9]; end; var d:array[0..1200007] of rec; flag:array[0..1200007] of re; i,j,p,q,n,m,x,w,k:longint; v:boolean; st,y:string[9]; function hash(s:string):int64; var tmp:int64; begin val(s,tmp); exit(tmp mod 1200007); end; procedure check; begin if d[m].s='123804765' then begin writeln (d[m].total); halt; end; end; begin readln(st); d[1].s:=st; d[1].total:=0; x:=hash(st); flag[x].f:=true; flag[x].s:=st; p:=1;q:=1; while p<=q do begin w:=pos('0',d[p].s); for k:=1 to 4 do if ((w mod 3=1) and (k<>2) or ((w mod 3=0)) and (k<>1))or (w mod 3=2) then if (w+vx[k]>0) and (w+vx[k]<=9) then begin y:=d[p].s; y[w]:=y[w+vx[k]]; y[w+vx[k]]:='0'; x:=hash(y); v:=false; while (x<1200007) and (flag[x].f) do begin if flag[x].s=y then begin v:=true; break; end; inc(x); end; if not v then begin inc(q); m:=q mod 1200007; d[m].s:=y; d[m].total:=d[p].total+1; flag[x].f:=true; flag[x].s:=y; check; end; end; inc(p); end; end.

The End.

2010年10月21日0:01:27

24点：哈哈哈DFS！！！

type arr=array[0..5]of real; var i,j,k:integer; a:arr; ch:char; procedure dfs(l1,l2:integer;a:arr); var i,j,k,m,n,t:integer; b:array[0..5]of real; begin fillchar(b,sizeof(b),0); if (l1=l2)and(abs(A[L1]-24)<0.0001) then begin writeln('yes'); halt; end; for i:=l1 to l2 do for j:=l1 to l2 do if i<>j then begin t:=0; for k:=L1 to l2 do if (k<>I)and(k<>J) then begin inc(t); b[t]:=a[k]; end; inc(t); b[t]:=a[i]+a[j]; dfs(1,t,b); b[t]:=a[i]-a[j]; dfs(1,t,b); b[t]:=a[i]*a[j]; dfs(1,t,b); if a[j]<>0 then b[t]:=a[i]/a[j]; dfs(1,t,b); end; end; begin for i:=1 to 4 do begin read(ch); if ord(ch)<60 then a[i]:=ord(ch)-48; if ch='A' then a[i]:=1; if ch='J' then a[i]:=11; if ch='Q' then a[I]:=12; if ch='K' then a[i]:=13; if not eoln then read(ch); if ch='0' then a[i]:=10; end; dfs(1,4,a); writeln('no'); end.

魔兽世界：带有传送门的BFS，处理一下下就好了。

var f,a,b:array[0..100,0..100]of longint; x,y:array[1..10000]of longint; h:array[0..100,0..100]of boolean; ch:array[0..100,0..100]of char; n,m,i,j,l,r,tx,ty:longint; begin fillchar(f,sizeof(f),127); readln(n,m); for i:=1 to n do begin for j:=1 to m do begin read(ch[i,j]); end; readln; end; for i:=1 to n do for j:=1 to m do begin if ch[i,j]='0'then begin a[i,j]:=i; b[i,j]:=j; end else if ch[i,j]='1'then else for l:=1 to n do for r:=1 to m do if (ch[l,r]=ch[i,j])and((l<>i)or(r<>j))then begin a[i,j]:=l; b[i,j]:=r; break; end; end; l:=0;r:=1; x[1]:=1;y[1]:=1; f[1,1]:=0; h[1,1]:=true; while l<r do begin inc(l); tx:=x[l];ty:=y[l]; if (tx=n)and(ty=m)then break; if (tx>1)and(a[tx-1,ty]<>0)and not h[a[tx-1,ty],b[tx-1,ty]] and(f[tx,ty]+1<f[a[tx-1,ty],b[tx-1,ty]])then begin inc(r);x[r]:=a[tx-1,ty];y[r]:=b[tx-1,ty]; h[x[r],y[r]]:=true;f[x[r],y[r]]:=f[tx,ty]+1; end; if (tx<n)and(a[tx+1,ty]<>0)and not h[a[tx+1,ty],b[tx+1,ty]] and(f[tx,ty]+1<f[a[tx+1,ty],b[tx+1,ty]])then begin inc(r);x[r]:=a[tx+1,ty];y[r]:=b[tx+1,ty]; h[x[r],y[r]]:=true;f[x[r],y[r]]:=f[tx,ty]+1; end; if (ty>1)and(a[tx,ty-1]<>0)and not h[a[tx,ty-1],b[tx,ty-1]] and(f[tx,ty]+1<f[a[tx,ty-1],b[tx,ty-1]])then begin inc(r);x[r]:=a[tx,ty-1];y[r]:=b[tx,ty-1]; h[x[r],y[r]]:=true;f[x[r],y[r]]:=f[tx,ty]+1; end; if (ty<m)and(a[tx,ty+1]<>0)and not h[a[tx,ty+1],b[tx,ty+1]] and(f[tx,ty]+1<f[a[tx,ty+1],b[tx,ty+1]])then begin inc(r);x[r]:=a[tx,ty+1];y[r]:=b[tx,ty+1]; h[x[r],y[r]]:=true;f[x[r],y[r]]:=f[tx,ty]+1; end; end; if f[n,m]=f[0,0]then writeln('No Solution.') else writeln(f[n,m]); end.

Fish学数学： 本来应该是用归并排序的说....可是可是....这样的代码也能AC？！明天考虑贴上归并版。

var n,i,j,k,p,s:longint; a:array[1..20000]of longint; begin s:=0; readln(n); for i:=1 to n do read(a[i]); for i:=1 to n do begin k:=a[i];p:=0; for j:=i+1 to n do if a[j]<k then inc(p); inc(s,p); end; writeln(s); end.

校园迷宫：简简单单BFS，没有一点附加条件的就是爽！

program rq195; const dx:array[1..4]of longint=(0,0,1,-1); dy:Array[1..4]of longint=(1,-1,0,0); var n,m,i,j,x1,y1,x2,y2,p,q,nx,ny:longint; a:array[0..2001,0..2001]of longint; d:array[1..10000,1..3]of longint; v:array[0..2001,0..2001]of boolean; begin readln(n,m); fillchar(a,sizeof(a),$3f); for i:=1 to n do for j:=1 to m do read(a[i,j]); readln(x1,y1,x2,y2); d[1,1]:=x1;d[1,2]:=y1;d[1,3]:=0; p:=1;q:=1;v[x1,y1]:=true; while p<=q do begin if (d[p,1]=x2)and(d[p,2]=y2)then begin writeln(d[p,3]); halt; end; for i:=1 to 4 do begin nx:=d[p,1]+dx[i]; ny:=d[p,2]+dy[i]; if not v[nx,ny]and(a[nx,ny]=0)then begin inc(q); d[q,1]:=nx; d[q,2]:=ny; d[q,3]:=d[p,3]+1; v[nx,ny]:=true; end; end; inc(p); end; writeln('No Answer!'); end.

医院的设置：题目具有很强的迷惑性，说的是树，实际上还是图...先用floyd求最短路，然后枚举每一个节点，求距离和。

program rq319; var a:array[0..100]of longint; map:array[0..100,0..100]of longint; v,min,n,x,y,i,j,k:longint; begin readln(n); for i:=1 to n do begin readln(a[i],x,y); if x<>0 then begin map[i,x]:=1; map[x,i]:=1; end; if y<>0 then begin map[i,y]:=1; map[y,i]:=1; end; end; for k:=1 to n do for i:=1 to n do if k<>i then for j:=1 to n do if (i<>j)and(j<>k)then if (map[i,k]<>0)and(map[k,j]<>0)then if (map[i,k]+map[k,j]<map[i,j])or(map[i,j]=0) then map[i,j]:=map[i,k]+map[k,j]; min:=maxlongint; for i:=1 to n do begin v:=0; for j:=1 to n do inc(v,map[j,i]*a[j]); if v<min then min:=v; end; writeln(min); end.