XJOI网上同步测试DAY14 T1

思路:线段树维护最短路

#include<cstdio>
#include<cmath>
#include<iostream>
#include<algorithm>
#include<cstring>
struct node{
     int l,r,c[][];
}t[];
int id[][];
int s[][];
int fa[],n;
int read(){
    int t=,f=;char ch=getchar();
    while (ch<''||ch>''){if (ch=='-') f=-;ch=getchar();}
    while (''<=ch&&ch<=''){t=t*+ch-'';ch=getchar();}
    return t*f;
}
int find(int x){
     if (fa[x]==x) return x;
         else return fa[x]=find(fa[x]);
}
node operator +(node a,node b){
     node p;
     p.l=std::min(a.l,b.l);
     p.r=std::max(a.r,b.r);
     p.c[][]=p.c[][]=p.c[][]=p.c[][]=0x3f3f3f3f;
     for (int i=;i<=;i++)
        if (s[i][a.l]==)
        for (int j=;j<=;j++)
            if (s[j][b.r]==)
            for (int k=;k<=;k++)
                if (s[k][a.r]==&&s[k][b.l]==)
                    p.c[i][j]=std::min(p.c[i][j],a.c[i][k]+b.c[k][j]+);

     return p;
}
void build(int k,int l,int r){
    t[k].c[][]=t[k].c[][]=t[k].c[][]=t[k].c[][]=0x3f3f3f3f;
    if (l==r){
        t[k].l=t[k].r=l;
        if (s[][l]==) t[k].c[][]=;
        if (s[][l]==) t[k].c[][]=;
        if (s[][l]==&&s[][l]==) t[k].c[][]=t[k].c[][]=;
        return;
    }
    int mid=(l+r)>>;
    build(k*,l,mid);
    build(k*+,mid+,r);
    t[k]=t[k*]+t[k*+];
}
void init(){
    char S[];
    scanf("%s",S+);
    for (int i=;i<=n;i++)
        s[][i]=S[i]-'';
    scanf("%s",S+);
    for (int i=;i<=n;i++)
        s[][i]=S[i]-'';
    int sz=;
    for (int i=;i<;i++)
        for (int j=;j<=n;j++)
            id[i][j]=++sz;
    for (int i=;i<=*n;i++) fa[i]=i;
    for (int i=;i<n;i++)
        if (s[][i]==&&s[][i+]==) fa[find(id[][i])]=find(id[][i+]);
    for (int i=;i<n;i++)
        if (s[][i]==&&s[][i+]==) fa[find(id[][i])]=find(id[][i+]);
    for (int i=;i<=n;i++)
        if (s[][i]==&&s[][i]==) fa[find(id[][i])]=find(id[][i]);        

}
node query(int k,int l,int r,int x,int y){
    int mid=(l+r)>>;
    node tmp;
    if (l==x&&r==y) return t[k];
    if (y<=mid) return query(k*,l,mid,x,y);
    else
    if (x>mid) return query(k*+,mid+,r,x,y);
    else return query(k*,l,mid,x,mid)+query(k*+,mid+,r,mid+,y);
}
int main(){
    int T;
    n=read();T=read();
    init();
    build(,,n);
    while (T--){
        int x=read(),y=read();
        if (x==y) {puts("");continue;}
        if (find(x)!=find(y)){puts("You have been confusional!");continue;}
        int x1=(x>n)?x-n:x;int y1=(y>n)?y-n:y;
        if (x1>y1) std::swap(x,y),std::swap(x1,y1);
        node tmp=query(,,n,x1,y1);
        int id1,id2;
        if (x>n) id1=;else id1=;
        if (y>n) id2=;else id2=;
        int ans=tmp.c[id1][id2];
        if (ans==0x3f3f3f3f) puts("You have been confusional!");
        else printf("%d\n",ans);
    }
}