清橙A1363. 水位 - 清华大学2012年信息学优秀高中学子夏令营

  1 const
  2     maxn=103;
  3     s=10000000;
  4     fx:array[1..4]of longint=(1,0,-1,0);
  5     fy:array[1..4]of longint=(0,1,0,-1);
  6 type
  7     point=record
  8       x,y:longint;
  9     end;
 10     big=array[0..2000]of int64;
 11 var
 12     a:array[0..maxn,0..maxn]of longint;
 13     b:array[0..maxn*maxn]of point;
 14     f,h:array[0..maxn*maxn]of longint;
 15     ans:array[0..maxn*maxn]of big;
 16     n,m:longint;
 17 
 18 operator *(var a,b:big)c:big;
 19 var
 20     i,j:longint;
 21 begin
 22     fillchar(c,sizeof(c),0);
 23     for i:=1 to a[0] do
 24       for j:=1 to b[0] do
 25         inc(c[i+j-1],a[i]*b[j]);
 26     c[0]:=a[0]+b[0]-1;
 27     for i:=1 to c[0]-1 do
 28       begin
 29         inc(c[i+1],c[i]div s);
 30         c[i]:=c[i]mod s;
 31       end;
 32     while c[c[0]]>=s do
 33       begin
 34         c[c[0]+1]:=c[c[0]]div s;
 35         c[c[0]]:=c[c[0]]mod s;
 36         inc(c[0]);
 37       end;
 38 end;
 39 
 40 procedure add(var a:big;b:longint);
 41 var
 42     i:longint;
 43 begin
 44     inc(a[1],b);
 45     i:=1;
 46     while a[i]>=s do
 47       begin
 48         inc(a[i+1],a[i]div s);
 49         a[i]:=a[i]mod s;
 50         inc(i);
 51       end;
 52     if i>a[0] then a[0]:=i;
 53 end;
 54 
 55 function calc(i,j:longint):longint;
 56 begin
 57     exit((i-1)*n+j);
 58 end;
 59 
 60 function find(x:longint):longint;
 61 begin
 62     if f[x]=x then exit(x);
 63     f[x]:=find(f[x]);
 64     exit(f[x]);
 65 end;
 66 
 67 procedure swap(var x,y:point);
 68 var
 69     t:point;
 70 begin
 71     t:=x;x:=y;y:=t;
 72 end;
 73 
 74 procedure sort(l,r:longint);
 75 var
 76     i,j,y:longint;
 77 begin
 78     i:=l;
 79     j:=r;
 80     y:=a[b[(l+r)>>1].x,b[(l+r)>>1].y];
 81     repeat
 82       while a[b[i].x,b[i].y]<y do
 83         inc(i);
 84       while a[b[j].x,b[j].y]>y do
 85         dec(j);
 86       if i<=j then
 87       begin
 88         swap(b[i],b[j]);
 89         inc(i);
 90         dec(j);
 91       end;
 92     until i>j;
 93     if i<r then sort(i,r);
 94     if j>l then sort(l,j);
 95 end;
 96 
 97 procedure print(a:big);
 98 var
 99     i:longint;
100     k:int64;
101 begin
102     write(a[a[0]]);
103     for i:=a[0]-1 downto 1 do
104       begin
105         k:=s div 10;
106         while k>1 do
107           begin
108             if a[i]<k then write(0)
109             else break;
110             k:=k div 10;
111           end;
112         write(a[i]);
113       end;
114 end;
115 
116 procedure main;
117 var
118     i,j,x,y:longint;
119 begin
120     read(n,m);
121     for i:=1 to n do
122       for j:=1 to n do
123         begin
124           read(a[i,j]);
125           h[calc(i,j)]:=a[i,j];
126           b[calc(i,j)].x:=i;
127           b[calc(i,j)].y:=j;
128         end;
129     sort(1,n*n);
130     for i:=1 to n*n do
131       begin
132         f[i]:=i;
133         ans[i][0]:=1;
134         ans[i][1]:=1;
135       end;
136     for i:=1 to n*n do
137       for j:=1 to 4 do
138         if (b[i].x+fx[j]>0) and (b[i].x+fx[j]<=n) and (b[i].y+fy[j]>0) and (b[i].y+fy[j]<=n) then
139         begin
140           x:=find(calc(b[i].x,b[i].y));
141           y:=find(calc(b[i].x+fx[j],b[i].y+fy[j]));
142           if (h[x]>=h[y]) and (x<>y) then
143           begin
144             add(ans[y],h[x]-h[y]);
145             ans[x]:=ans[x]*ans[y];
146             f[y]:=x;
147           end;
148         end;
149     add(ans[find(1)],m-a[b[n*n].x,b[n*n].y]);
150     print(ans[find(1)]);
151 end;
152 
153 begin
154     main;
155 end.