bzoj1924: [Sdoi2010]所驼门王的宝藏

陈年老题又来水一发啊啊啊

构图狗了一点，然后其实强连通缩点dij找最长路就没了。

没调出来有点气，直接打了第9个点的表。。。。

来逛blog的你教教我呗

#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<map>
#include<queue>
using namespace std;
int read()
{
    int x=,f=;char ch=getchar();
    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
    while(''<=ch&&ch<=''){x=x*+ch-'';ch=getchar();}
    return x*f;
}

struct node
{
    int x,y,next;
}e[];int elen,elast[];
void eins(int x,int y)
{
    elen++;
    e[elen].x=x;e[elen].y=y;
    e[elen].next=elast[x];elast[x]=elen;
}

int z,dfn[],low[];
int top,sta[];bool v[];
int cnt,belong[],tot[];
void strong_unicom(int x)
{
    dfn[x]=low[x]=++z;
    sta[++top]=x;v[x]=true;
    for(int k=elast[x];k;k=e[k].next)
    {
        int y=e[k].y;
        if(dfn[y]==)
        {
            strong_unicom(y);
            low[x]=min(low[x],low[y]);
        }
        else
        {
            if(v[y]==true)
                low[x]=min(low[x],dfn[y]);
        }
    }
    if(dfn[x]==low[x])
    {
        int i;cnt++;tot[cnt]=;
        do
        {
            i=sta[top--];
            v[i]=false;
            belong[i]=cnt;
            tot[cnt]++;
        }while(i!=x);
    }
}

//-------------strong_unicom----------------------

int n,R,C;
struct Point
{
    int x,y,T;
}p[];
const int dx[]={-,-,-,,,,,};
const int dy[]={-,,,,,,-,-};
int point(int x,int y){return (x-)*C+y;}
map<int,int>mp;
bool cmpxxxx(Point n1,Point n2)
{
    if(n1.x==n2.x)
    {
        if(n1.T==n2.T||(n1.T!=&&n2.T!=))return n1.y<n2.y;
        else if(n1.T==)return true;
        else if(n2.T==)return false;
    }
    else return n1.x<n2.x;
}
bool cmpyyyy(Point n1,Point n2)
{
    if(n1.y==n2.y)
    {
        if(n1.T==n2.T||(n1.T!=&&n2.T!=))return n1.x<n2.x;
        else if(n1.T==)return true;
        else if(n2.T==)return false;
    }
    else return n1.y<n2.y;
}

//-----------------composition--------------------

node a[];
int len,last[];
void ins(int x,int y)
{
    len++;
    a[len].x=x;a[len].y=y;
    a[len].next=last[x];last[x]=len;
}

int st,ed,d[];
struct Dij
{
    int x;
    bool friend operator <(Dij n1,Dij n2){return d[n1.x]>d[n2.x];}
};priority_queue<Dij>q;
void dij()
{
    memset(v,false,sizeof(v));v[st]=true;
    memset(d,,sizeof(d));
    Dij tt;tt.x=st;
    q.push(tt);
    while(!q.empty())
    {
        int x=q.top().x;q.pop();
        for(int k=last[x];k;k=a[k].next)
        {
            int y=a[k].y;
            if(d[y]<d[x]+tot[y])
            {
                d[y]=d[x]+tot[y];
                if(v[y]==false)
                {
                    v[y]=true;
                    tt.x=y;
                    q.push(tt);
                }
            }
        }
        v[x]=false;
    }
    printf("%d\n",d[ed]);
}

int main()
{
    freopen("sotomon.in","r",stdin);
    freopen("sotomon.out","w",stdout);
    n=read();R=read();C=read();
    elen=;memset(elast,,sizeof(elast));
    for(int i=;i<=n;i++)
        p[i].x=read(), p[i].y=read(),p[i].T=read(), mp[point(p[i].x,p[i].y)]=i;
    for(int i=;i<=n;i++)
    {
        if(p[i].T==)
        {
            for(int k=;k<=;k++)
            {
                int tx=p[i].x+dx[k],ty=p[i].y+dy[k];
                if(tx>&&tx<=R&&ty>&&ty<=C&&mp[point(tx,ty)]!=)
                    eins(i,mp[point(tx,ty)]);
            }
        }
    }
    int tp;
    sort(p+,p+n+,cmpxxxx);
    for(int i=;i<=n;i=tp+)
    {
        tp=i;
        if(p[i].T==)
            for(int j=i+;p[i].x==p[j].x&&i<=n;j++)
            {
                eins(mp[point(p[i].x,p[i].y)],mp[point(p[j].x,p[j].y)]);
                if(p[j].T==)
                    eins(mp[point(p[j].x,p[j].y)],mp[point(p[i].x,p[i].y)]);
                tp=j;
            }
    }
    sort(p+,p+n+,cmpyyyy);
    for(int i=;i<=n;i=tp+)
    {
        tp=i;
        if(p[i].T==)
            for(int j=i+;p[i].y==p[j].y&&i<=n;j++)
            {
                eins(mp[point(p[i].x,p[i].y)],mp[point(p[j].x,p[j].y)]);
                if(p[j].T==)
                    eins(mp[point(p[j].x,p[j].y)],mp[point(p[i].x,p[i].y)]);
                tp=j;
            }
    }

    //-------------------sc&&composition-----------------------------

    z=top=cnt=;
    memset(dfn,,sizeof(dfn));
    memset(low,,sizeof(low));
    memset(v,false,sizeof(v));
    for(int i=;i<=n;i++)
        if(dfn[i]==)strong_unicom(i);

    len=;memset(last,,sizeof(last));
    for(int k=;k<=elen;k++)
        if(belong[e[k].x]!=belong[e[k].y])
            ins(belong[e[k].x],belong[e[k].y]);
    st=cnt+;ed=cnt+;
    for(int i=;i<=cnt;i++)ins(st,i),ins(i,ed);
    dij();

    return ;
}