hihocoder #1632 : Secret Poems

#include <bits/stdc++.h>
using namespace std;
const int maxn = 105;
char str[maxn][maxn],ans[maxn][maxn],vis[maxn][maxn],vis2[maxn][maxn];
int dir1[4][2] = { {-1,1},{ 1,-1 },{0,1},{1,0} };
int dir2[4][2] = { {-1,1},{1,-1},{1,0},{0,1} };
int dir3[4][2] = { {-1,0},{0,1},{1,0},{0,-1} };
int main(){
    int  n;
    while( 1 == scanf("%d",&n) ){
        int x1 = 0,y1 = 0,x2 = 0,y2 = 0,cnt = 0;
        memset( vis,0,sizeof(vis) );
        memset( vis2,0,sizeof(vis2) );
        for( int i = 0;i < n;i++ ) scanf("%s",str[i]);
        while( cnt < n*n ){
            ans[x2][y2] = str[x1][y1];
            vis2[x2][y2] = vis[x1][y1] = 1;
            if( x1 == 0 || x1 == n-1 )for( int i = 0;i < 4;i++ ){
                int xx = x1 + dir1[i][0],yy = y1 + dir1[i][1];
                if( xx >= n || xx < 0 || yy >= n || yy < 0 ) continue;
                if( vis[xx][yy] ) continue;
                x1 = xx;y1 = yy;
                break;
            }
            else for(int i = 0;i < 4;i++){
                int xx = x1 + dir2[i][0],yy = y1 + dir2[i][1];
                    if( xx >= n || xx < 0 || yy >= n || yy < 0 ) continue;
                    if( vis[xx][yy] ) continue;
                    x1 = xx;y1 = yy;
                    break;
            }
            bool flag = false;
           // cout <<"debug" << endl;
            if( (x2 + 1>= n || vis2[x2+1][y2])   ){
                int yy = y2-1;
                if( yy >= 0 && yy < n && !vis2[x2][yy] ){
                    flag = true;
                    y2 = yy;
                }
            }
            if(!flag)for( int i = 0;i < 4;i++ ){
                int xx = x2 + dir3[i][0],yy = y2+dir3[i][1];
                if( xx < 0 || xx >= n || yy < 0 || yy >= n ) continue;
                if( vis2[xx][yy] ) continue;
                x2 =xx;y2 = yy;
                break;
            }
            cnt++;
        }
        for( int i =0;i < n;i++ ){
            for( int j = 0;j < n;j++ ){
                putchar( ans[i][j] );
            }
            puts("");
        }
    }

    return 0;
}