L-shapes Gym - 101845L

 https://cn.vjudge.net/problem/Gym-101845L

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <set>
#include <map>
#include <stack>
//#include <tr1/unordered_map>
//#include <unordered_map>
#include <cmath>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
//#define sfl(i) scanf("%I64d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define prl(i) printf("%I64d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define uint unsigned int
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define inf 1e18
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define lson (rt<<1)
#define rson (rt<<1|1)
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

template<typename T>inline void read(T &x)
{
    x=0;
    static int p;p=1;
    static char c;c=getchar();
    while(!isdigit(c)){if(c=='-')p=-1;c=getchar();}
    while(isdigit(c)) {x=(x<<1)+(x<<3)+(c-48);c=getchar();}
    x*=p;
}

//-----------------------------------------------
const int maxn=2050+9;
const int mod=1e9+7;

char ans[maxn][maxn];
int a[maxn][maxn];

int ch(int xl,int xr,int yl,int yr,int x,int y)
{
    int xm=(xl+xr)>>1;
    int ym=(yl+yr)>>1;
    if(x<=xm&&x>=xl&&y<=ym&&y>=yl) return 1;
    if(x<=xm&&x>=xl&&y>ym&&y<=yr) return 2;
    if(x>xm&&x<=xr&&y<=ym&&y>=yl) return 3;
    return 4;
}
int cnt=0;
void dfs(int xl,int xr,int yl,int yr,int x,int y)
{
    int op=ch(xl,xr,yl,yr,x,y);
    int xm=(xl+xr)>>1;
    int ym=(yl+yr)>>1;
    if(op==1) a[xm+1][ym]=a[xm][ym+1]=a[xm+1][ym+1]=++cnt;
    else if(op==2) a[xm][ym]=a[xm+1][ym]=a[xm+1][ym+1]=++cnt;
    else if(op==3) a[xm][ym]=a[xm][ym+1]=a[xm+1][ym+1]=++cnt;
    else a[xm][ym]=a[xm+1][ym]=a[xm][ym+1]=++cnt;
    if(xr<=xl+1)
    {
        return ;
    }
    if(op==1)
    {
        dfs(xl,xm,yl,ym,x,y);
        dfs(xl,xm,ym+1,yr,xm,ym+1);
        dfs(xm+1,xr,yl,ym,xm+1,ym);
        dfs(xm+1,xr,ym+1,yr,xm+1,ym+1);
    }
    else if(op==2)
    {
        dfs(xl,xm,yl,ym,xm,ym);
        dfs(xl,xm,ym+1,yr,x,y);
        dfs(xm+1,xr,yl,ym,xm+1,ym);
        dfs(xm+1,xr,ym+1,yr,xm+1,ym+1);
    }
    else if(op==3)
    {
        dfs(xl,xm,yl,ym,xm,ym);
        dfs(xl,xm,ym+1,yr,xm,ym+1);
        dfs(xm+1,xr,yl,ym,x,y);
        dfs(xm+1,xr,ym+1,yr,xm+1,ym+1);
    }
    else
    {
        dfs(xl,xm,yl,ym,xm,ym);
        dfs(xl,xm,ym+1,yr,xm,ym+1);
        dfs(xm+1,xr,yl,ym,xm+1,ym);
        dfs(xm+1,xr,ym+1,yr,x,y);
    }
}

int main()
{
    //FAST_IO;

    freopen("input.txt","r",stdin);

    int n,x,y;
    scanf("%d%d%d",&n,&x,&y);

    if(n==1)
    {
        puts(".");
        return 0;
    }
    dfs(1,n,1,n,x,y);

    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            ans[i][j]=a[i][j]%26+'A';
        }
    }
    ans[x][y]='.';
    for(int i=1;i<=n;i++)
    {
        for(int j=1;j<=n;j++)
        {
            printf("%c",ans[i][j]);
        }
        printf("\n");
    }

    return 0;
}