Submission #49081242

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll MOD=998244353;
// head
const int dx[4]={0,1,0,-1};
const int dy[4]={1,0,-1,0};
const int N=55;
int n;
int s[N][N];
void dfs(int x,int y,int dir,int step)
{
	if(step==n*n) {return ;}
	s[x][y]=step;
	int fx=x+dx[dir];
	int fy=y+dy[dir];
	if(fx>=1&&fx<=n&&fy>=1&&fy<=n&&s[fx][fy]==0){
		dfs(fx,fy,dir,step+1);
	}
	else {
		dir=(dir+1)%4;
		fx=x+dx[dir];
		fy=y+dy[dir];
		dfs(fx,fy,dir,step+1);
	}
}
signed main() 
{
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	cin>>n;
	s[(n+1)/2][(n+1)/2]=-1;
	dfs(1,1,0,1);
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(s[i][j]==-1) cout<<"T ";
			else cout<<s[i][j]<<" ";
		}
		cout<<endl;
	}
}

Submission Info

Judge Result