[家里训练20_02_16]C

地里有水，多少种形态。

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int len=9;
const ll base=1000000000;
int n,m,a[105][105];
int tot,tmp[105*105];
int dx[4]={-1,0,1,0};
int dy[4]={0,1,0,-1};
bool vis[105][105],can[105][105];
struct BN
{
    vector<ll>dig;
    BN(ll x=0)
    {
        dig.push_back(x);
    }
    BN(vector<ll>x)
    {
        dig=x;
    }
    inline void addup(vector<ll>&a)
    {
        int len=a.size();
        for(int i=0;i<len;++i)
            if(a[i]>=base)
            {
                if(i==len-1)
                    a.push_back(0),++len;
                a[i+1]+=a[i]/base;
                a[i]-=a[i]/base*base;
            }
    }
    BN operator+(const BN&A)
    {
        vector<ll>a=dig;
        int len=max(dig.size(),A.dig.size());
        while(a.size()<len)
            a.push_back(0);
        for(int i=0;i<A.dig.size();++i)
            a[i]+=A.dig[i];
        addup(a);
        return BN(a);
    }
    BN operator*(const BN&A)
    {
        vector<ll>a;
        a.resize(dig.size()+A.dig.size()-1);
        for(int i=0;i<A.dig.size();++i)
        {
            ll x=A.dig[i];
            for(int j=0;j<dig.size();++j)
                a[i+j]+=A.dig[i]*dig[j];
            addup(a);
        }
        return BN(a);
    }
    inline int length(ll x)
    {
        int i=0;
        do{x/=10;++i;}while(x);
        return i;
    }
    void out()
    {
        cout<<dig[dig.size()-1];
        for(int i=dig.size()-2;i>=0;--i)
        {
            int x=len-length(dig[i]);
            while(x--)
                cout<<0;
            cout<<dig[i];
        }
        cout<<endl;
    }
}ans[105*105];
struct UUU
{
    int fa[105*105];
    inline void init()
    {
        for(int i=1;i<=n*n;++i)
            fa[i]=i;
    }
    inline int find(int x)
    {
        return fa[x]==x?fa[x]:fa[x]=find(fa[x]);
    }
}U;
struct pt
{
    int x,y;
    pt(int a=0,int b=0):x(a),y(b){}
};
pt Q[105*105];
vector<int>wait;
bool color[105*105];
inline int num(int x,int y)
{
    return (x-1)*n+y;
}
inline void merge(int x,int y)
{
    if(!can[x][y])
        return;
    int L=1,R=0;
    Q[++R]=pt(x,y);
    if(!color[U.find(num(x,y))])
    {
        wait.push_back(U.find(num(x,y)));
        color[U.find(num(x,y))]=1;
    }
    while(L<=R)
    {
        pt u=Q[L++];
        x=u.x,y=u.y;
        for(int i=0;i<4;++i)
        {
            int nx=x+dx[i],ny=y+dy[i];
            if(vis[nx][ny]||!can[nx][ny])
                continue;
            if(!color[U.find(num(nx,ny))])
            {
                wait.push_back(U.find(num(nx,ny)));
                color[U.find(num(nx,ny))]=1;
            }
            Q[++R]=pt(nx,ny);
            vis[nx][ny]=1;
        }
    }
}
inline void solve(int x,int c)
{
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            vis[i][j]=0,color[num(i,j)]=0;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            if(a[i][j]<x)
                can[i][j]=1;
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            if(can[i][j]&&!vis[i][j])
            {
                wait.clear();
                merge(i,j);
                BN sum(1);
                for(int k=0;k<wait.size();++k)
                {
//                    cout<<wait[k]<<" ";
                    sum=sum*ans[U.find(wait[k])];
                    U.fa[U.find(wait[k])]=U.find(num(i,j));
                }
                sum=sum+BN(c);
//                cout<<": ";
//                sum.out();
                ans[U.find(num(i,j))]=sum;
            }
//    for(int i=1;i<=n;++i,cout<<endl)
//        for(int j=1;j<=n;++j)
//            cout<<U.find(num(i,j))<<" ";
}
int main()
{
//    freopen("stage.in","r",stdin);
//    freopen("stage.out","w",stdout);
    ios::sync_with_stdio(false);
    cin>>n>>m;
    U.init();
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            cin>>a[i][j];
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            ans[num(i,j)]=BN(1);
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            tmp[++tot]=a[i][j];
    tmp[++tot]=m;
    sort(tmp+1,tmp+tot+1);
    tot=unique(tmp+1,tmp+tot+1)-tmp-1;
    for(int i=1;i<=tot;++i)
        solve(tmp[i],tmp[i]-tmp[i-1]);
    BN sum(1);
    wait.clear();
    memset(vis,0,sizeof(vis));
    memset(color,0,sizeof(color));
    for(int i=1;i<=n;++i)
        for(int j=1;j<=n;++j)
            can[i][j]=1;
    merge(1,1);
    for(int i=0;i<wait.size();++i)
        sum=sum*ans[U.find(wait[i])];
    sum.out();
    return 0;
}