引子(模拟)

模拟题，很水啦.............

判断好字符就好了

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cmath>
#include<set>
#include<vector>
#include<map>
#include<queue>
#define MAXN 1101
using namespace std;
int ans[MAXN*MAXN];
priority_queue<pair<int,int> >q;
struct no{int x1;int y1;int x2;int y2;}T[MAXN*MAXN];
char a[MAXN][MAXN];
int belong[MAXN][MAXN];
int conn[MAXN*10][1001];
int m,n;
void find(int i,int j,int x)
{
     int l=j-1,r=j+1;
     while(a[i][l]!='|')
     {
           l--;
     }
     while(a[i][r]!='|')
     {
           r++;
     }
     T[x].y1=l;T[x].y2=r;
     int up=i-1,dow=i+1;
     while(a[up][j]!='-')up--;
     while(a[dow][j]!='-')dow++;
     T[x].x1=up,T[x].x2=dow;
     for(int j=l;j<=r;++j)
     {
         belong[up][j]=x;belong[dow][j]=x;
     }
     for(int i=up;i<=dow;++i)
     {
         belong[i][l]=x;belong[i][r]=x;
         if(a[i][l-1]=='-')
         {
             conn[x][i]=l;
             //printf("conn[%d][%d]
",x,i);
         }
         else if(a[i][r+1]=='-')
         conn[x][i]=r;
     }
     //printf("T[%d].x1=%d T[%d].x2=%d T[%d].y1=%d T[%d].y2=%d
",x,T[x].x1,x,T[x].x2,x,T[x].y1,x,T[x].y2);
     return ;
}
int BFS(int x,int y)
{
     //printf("x=%d y=%d
",x,y);
     int l=x,r=y,ok_l=0,ok_r=0;//0 向左 1 向下
     if(a[l][r+1]=='-')ok_r=1;
     if(a[l][r-1]=='-')ok_r=-1;
     l+=ok_l;r+=ok_r;
     //printf("ok_r=%d %d %d
",ok_r,l,r);
     while(belong[l][r]==0)
     {
           //printf("l=%d r=%d
",l,r);
           r+=ok_r;
           l+=ok_l;
           if(a[l][r]=='+')
           {
               if(ok_r!=0)
               {
                  ok_r=0;
                  ok_l=1;    
               }
               else if(ok_l!=0)
               {
                   ok_l=0;
                   if(a[l][r+1]=='-')ok_r=1;
                   else ok_r=-1;
               }
           }
     }
     return belong[l][r];
}
void DFS(int x)
{
    for(int i=T[x].x2;i>=T[x].x1;--i)
    {
        if(conn[x][i]!=0)
        {
           int nxt=BFS(i,conn[x][i]);
           //printf("nxt=%d
",nxt);
           DFS(nxt);     
        }
    }
    ans[++ans[0]]=x;
    //printf("ans=%d
",x);
}
signed main()
{
     scanf("%d%d",&n,&m);
     for(int i=1;i<=n;++i)
     {
         scanf("%s",a[i]+1);
     }
     for(int i=1;i<=n;++i)
     {
         int j=1;
         while(j<=m)
         {
             int x=0;int r=j;
             if(a[i][j]>='0'&&a[i][j]<='9')
             {
                 while(a[i][r]>='0'&&a[i][r]<='9')
                 {
                       x=x*10+a[i][r]-'0';
                       r++;
                 }
                 find(i,j,x);
             }
             j=r;j++;
         }
     }
     DFS(1);
     for(int i=1;i<=ans[0];++i)
     {
         printf("%d
",ans[i]);
     }
}