201312-5 I’m stuck

题目：

思路分析：

最开始想的是 起点先dfs跑一边 得到可以达到的点 然后在这些点里面继续跑dfs判断是否可以到达终点就行 爆肝1小时  可是只能拿到80分 

又想到完全没有必要直接正向跑一边dfs然后反向跑一遍 容斥判定一下就行 100分

代码实现：

80分代码

/*
*@Author:   GuoJinlong
*@Language: C++
*/
//#include <bits/stdc++.h>
/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *                               神兽保佑            永无BUG
 */



const int MAX=55;
char a[MAX][MAX];
int b[MAX][MAX];
int c[MAX][MAX];
int vis[MAX][MAX];
int vis1[MAX][MAX];
int sx,sy;
int ex,ey;
int n,m;
int xd1[2]={1,-1};
int yd1[2]={0,0};
int xd2[2]={0,0};
int yd2[2]={1,-1};
struct node{
    int x,y;
};

void dfs(int x,int y,int o){
    queue<node>qu;
    qu.push({x,y});
    while (!qu.empty()) {
        node now=qu.front();
        qu.pop();
        int x1=now.x;
        int y1=now.y;
        char p;
        p=a[x1][y1];
        vis[x1][y1]=1;
        if(p=='+'||p=='S'||p=='T'){
            for(int i=0;i<4;i++){
                int x2=x1+xd[i];
                int y2=y1+yd[i];
                p=a[x2][y2];
                if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis[x2][y2])
                    continue;
//                cout<<x2<<" "<<y2<<endl;
                qu.push({x2,y2});
            }
        }
        else if(p=='-'){
            for(int i=0;i<2;i++){
                int x2=x1+xd2[i];
                int y2=y1+yd2[i];
                p=a[x2][y2];
                if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis[x2][y2])
                    continue;
//                cout<<"-"<<endl;
//                cout<<x2<<" "<<y2<<endl;
                qu.push({x2,y2});
            }
        }
        else if(p=='|'){
            for(int i=0;i<2;i++){
                int x2=x1+xd1[i];
                int y2=y1+yd1[i];
                p=a[x2][y2];
                if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis[x2][y2])
                    continue;
//                cout<<x2<<" "<<y2<<endl;
                qu.push({x2,y2});
            }
        }
        else if(p=='.'){
            int x2=x1+1;
            int y2=y1;
            p=a[x2][y2];
            if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis[x2][y2])
                continue;
//            cout<<x2<<" "<<y2<<endl;
            qu.push({x2,y2});
        }
    }
    return;
}
void dfs1(int x,int y,int o){
    queue<node>qu;
    qu.push({x,y});
    while (!qu.empty()) {
        node now=qu.front();
        qu.pop();
        int x1=now.x;
        int y1=now.y;
        char p;
        p=a[x1][y1];
        vis1[x1][y1]=1;
        if(p=='+'||p=='S'||p=='T'){
            for(int i=0;i<4;i++){
                int x2=x1+xd[i];
                int y2=y1+yd[i];
                p=a[x2][y2];
                if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis1[x2][y2])
                    continue;
//                cout<<x2<<" "<<y2<<endl;
                qu.push({x2,y2});
            }
        }
        else if(p=='-'){
            for(int i=0;i<2;i++){
                int x2=x1+xd2[i];
                int y2=y1+yd2[i];
                p=a[x2][y2];
                if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis1[x2][y2])
                    continue;
//                cout<<"-"<<endl;
//                cout<<x2<<" "<<y2<<endl;
                qu.push({x2,y2});
            }
        }
        else if(p=='|'){
            for(int i=0;i<2;i++){
                int x2=x1+xd1[i];
                int y2=y1+yd1[i];
                p=a[x2][y2];
                if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis1[x2][y2])
                    continue;
//                cout<<x2<<" "<<y2<<endl;
                qu.push({x2,y2});
            }
        }
        else if(p=='.'){
            int x2=x1+1;
            int y2=y1;
            p=a[x2][y2];
//            cout<<x2<<" "<<y2<<endl;
            if(x2<1||x2>n||y2<1||y2>m||p=='#'||vis1[x2][y2])
                continue;
//            cout<<x2<<" "<<y2<<endl;
            qu.push({x2,y2});
        }
    }
    return;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
            if(a[i][j]=='S'){
                sx=i;
                sy=j;
            }
            if(a[i][j]=='T'){
                ex=i;
                ey=j;
            }
        }
    }
//    cout<<sx<<" "<<sy<<endl;
//    cout<<ex<<" "<<ey<<endl;
    dfs(sx,sy,1);
    if(vis[ex][ey]==0){
        cout<<"I'm stuck!";
        return 0;
    }
//    for(int i=1;i<=n;i++){
//        for(int j=1;j<=m;j++){
//            cout<<vis[i][j]<<" ";
//        }
//        cout<<endl;
//    }
//    cout<<"---------------"<<endl;
    int ans=0;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            if(vis[i][j]){
                dfs1(i,j,1);
                if(vis1[ex][ey]==0)
                {
                    ans++;
//                    cout<<i<<" "<<j<<endl;
                }
                mms(vis1,0);

            }
        }
    }
    cout<<ans<<endl;

}

/*
*@Author:   GuoJinlong
*@Language: C++
*/
//#include <bits/stdc++.h>
/*
 *                                                     __----~~~~~~~~~~~------___
 *                                    .  .   ~~//====......          __--~ ~~
 *                    -.            \_|//     |||\\  ~~~~~~::::... /~
 *                 ___-==_       _-~o~  \/    |||  \\            _/~~-
 *         __---~~~.==~||\=_    -_--~/_-~|-   |\\   \\        _/~
 *     _-~~     .=~    |  \\-_    '-~7  /-   /  ||    \      /
 *   .~       .~       |   \\ -_    /  /-   /   ||      \   /
 *  /  ____  /         |     \\ ~-_/  /|- _/   .||       \ /
 *  |~~    ~~|--~~~~--_ \     ~==-/   | \~--===~~        .\
 *           '         ~-|      /|    |-~\~~       __--~~
 *                       |-~~-_/ |    |   ~\_   _-~            /\
 *                            /  \     \__   \/~                \__
 *                        _--~ _/ | .-~~____--~-/                  ~~==.
 *                       ((->/~   '.|||' -_|    ~~-/ ,              . _||
 *                                  -_     ~\      ~~---l__i__i__i--~~_/
 *                                  _-~-__   ~)  \--______________--~~
 *                                //.-~~~-~_--~- |-------~~~~~~~~
 *                                       //.-~~~--\
 *                       ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
 *
 *                               神兽保佑            永无BUG
 */





const int N = 55;
int n, m;
char g[N][N];
int st1[N][N], st2[N][N]; //起点是否能到，能否能到终点

int dx[] = {-1, 0 ,1, 0};
int dy[] = {0, 1, 0, -1};

int check(int x, int y, int d) //(x,y) 能否朝 d 走
{
    char c = g[x][y];
    if(c == 'S' || c=='T' || c=='+') return 1;
    if(c == '|' && d%2==0) return 1;
    if(c == '-' && d%2==1) return 1;
    if(c == '.' && d==2) return 1;
    return 0;
}

void dfs1(int x, int y)
{
    if(st1[x][y]) return ;
    st1[x][y] = 1;
    for(int i=0; i<4; i++)
    {
        int a = x+dx[i], b = y+dy[i];
        if(a<0 || a>=n || b<0 || b>=m || g[a][b]=='#') continue;
        if(check(x, y, i)) dfs1(a, b);
    }
}

void dfs2(int x, int y)
{
    if(st2[x][y]) return ;
    st2[x][y] = 1;
    for(int i=0; i<4; i++) {
        int a = x+dx[i], b = y+dy[i];
        if(a<0 || a>=n || b<0 || b>=m || g[a][b]=='#') continue;
        if(check(a, b, i^2)) dfs2(a, b);
    }
}

int main()
{
    cin >> n >> m;
    for(int i=0; i<n; i++) {
        cin >> g[i];
    }

    int xe, ye;
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            if(g[i][j] == 'S') {
                dfs1(i, j);
            }else if(g[i][j] == 'T') {
                xe = i, ye = j;
                dfs2(i, j);
            }
        }
    }

    if(st1[xe][ye] == 0) {
        puts("I'm stuck!");
        return 0;
    }

    int ans = 0;
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            if(st1[i][j]==1 && st2[i][j]==0) ans++;
        }
    }
    cout << ans << endl;
    return 0;
}