Need For Fantasy

此时此刻,双星2终于破关,好辛苦!!!(我很菜)

感觉及其磨,剧情还可以,不知还有那个OIer,玩这个游戏.

eeeeeeeeeeeeeeeeee...........

本空间没死,但是将暂时冰冻,所有程序版权开放.可任意发布,使用,调试,鄙视,禁止膜拜.

谢谢合作

有意思的事情最近少了一些,发现某些东西诸如:usaco的程序代码也蛮长的,平时没注意,贴出来才发现.嗯,最后再声明,恐怕到7月我会一直消失,其间会不间断的路过.
后会有期.

----------------------------------------come back---------------------------------------------

过几天整理一下资料.发现资料由于某些比赛而冲乱了,麻烦.

整理以下就顺了

usaco一贯的出题风格,比较繁琐,由于数组开小了,所以提交了7次!

Compiling...
Compile: OK

Executing...
   Test 1: TEST OK [0.011 secs, 1480 KB]
   Test 2: TEST OK [0.000 secs, 1480 KB]
   Test 3: TEST OK [0.000 secs, 1476 KB]
   Test 4: TEST OK [0.000 secs, 1480 KB]
   Test 5: TEST OK [0.011 secs, 1480 KB]
   Test 6: TEST OK [0.011 secs, 1480 KB]
   Test 7: TEST OK [0.000 secs, 1476 KB]
   Test 8: TEST OK [0.022 secs, 1480 KB]
   Test 9: TEST OK [0.000 secs, 1476 KB]
   Test 10: TEST OK [0.011 secs, 1480 KB]

All tests OK.

Your program ('maze1') produced all correct answers!  This is your
submission #7 for this problem.  Congratulations!

用dfs进行的话只可以过4个(如果不处理),以下是多进程bfs

program test;
type node=array[-1..500,-1..50

一道水题,一次AC,而且也快:

Compiling...
Compile: OK

Executing...
   Test 1: TEST OK [0.000 secs, 208 KB]
   Test 2: TEST OK [0.000 secs, 208 KB]
   Test 3: TEST OK [0.011 secs, 204 KB]
   Test 4: TEST OK [0.000 secs, 208 KB]
   Test 5: TEST OK [0.000 secs, 204 KB]
   Test 6: TEST OK [0.011 secs, 204 KB]
   Test 7: TEST OK [0.000 secs, 204 KB]
   Test 8: TEST OK [0.000 secs, 208 KB]
   Test 9: TEST OK [0.011 secs, 208 KB]

All tests OK.

YOUR PROGRAM ('ttwo') WORKED FIRST TIME!  That's fantastic
-- and a rare thing.  Please accept these special automated
congratulations.

program ttwo;
var map:array[1..10,1..10]of char;
 xc,yc,xf,yf,x1,y1,x2,y2,fc,ff:integer;
 total:longint;
procedure zh1;
begin
 case x1

很简单也很经典,一维的程序贴上:

Compiling...
Compile: OK

Executing...
   Test 1: TEST OK [0.000 secs, 288 KB]
   Test 2: TEST OK [0.011 secs, 288 KB]
   Test 3: TEST OK [0.000 secs, 284 KB]
   Test 4: TEST OK [0.000 secs, 284 KB]
   Test 5: TEST OK [0.000 secs, 288 KB]
   Test 6: TEST OK [0.000 secs, 284 KB]
   Test 7: TEST OK [0.000 secs, 284 KB]
   Test 8: TEST OK [0.000 secs, 284 KB]
   Test 9: TEST OK [0.011 secs, 284 KB]
   Test 10: TEST OK [0.000 secs, 288 KB]
   Test 11: TEST OK [0.000 secs, 284 KB]
   Test 12: TEST OK [0.000 secs, 288 KB]
   Test 13: TEST OK [0.000 secs, 288 KB]

All tests OK.

Your program ('money') produced all correct answers!  This is your
submission #1 for this problem.  Congratulat

这道题过了,但是这道题就不贴时间和程序的全部了,因为我原来用超级复杂的邻接表做的,最后的一个数据没有过(第9个),后来发现邻接矩阵这么简单,于是此刻我充分感受到了KISS原则的宝贵,毕竟usaco的第二章不会考到多么精尖的算法,与其用2、3个小时编写一个0s的程序,倒不如用40min写一个0.1s的程序的性价比高!!!

以下是片断:

矩阵:

procedure DFS (s:byte);
var
  i:byte;
begin
  if vis[s] then
    exit;
  vis[s]:=true;
  for i:=1 to m do
  begin
    inc(cx[i],con[s,i]);
    if cx[i]>50 then
    begin
      own[i]:=true;
      DFS(i);
    end;
  end;
end;

表:

procedure dfs1(x,y:integer);
var i,j:integer;
begin
 if b[x]=false then exit;
 b[x]:=false;
 if x<>y then

本题不难,但是由于没有好的算术方案,所以编的时间长,又因为pascal递归不稳定,所以调试时间长,提交了三次.

Compiling...

 这个程序是有史以来我编得最认真的usaco题目，虽然这个程序很慢，甚至在主程序部分使用了一点歪招？！但是这是使用递归思想的，非指针的Trie!没有优化，所以在贴上这个程序后，再贴一个正规一点的。

  Compiling... 

  Compile: OK Executing...

  Test 1: TEST OK [0.000 secs, 6792 KB] 

  Test 2: TEST OK [0.000 secs, 6796 KB]

  Test 3: TEST OK [0.000 secs, 6828 KB]

  Test 4: TEST OK [0.000 secs, 6824 KB]

  Test 5: TEST OK [0.032 secs, 6828 KB]

  Test 6: TEST OK [0.670 secs, 6828 KB]

  All tests OK.  

 program prefix;

 type node=record    

         data:char;

         son:integer;

         jl:boolean;

         er:array[1..1800]of integer;

       &