蓝桥杯练习

1.深搜回溯

1320: [蓝桥杯2017初赛]方格分割

简单的深搜回溯题

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N=1e6+10;
const ll mod = 31536000;
int vis[15][15];
int ans;
int tx[4]={1,0,-1,0},ty[4]={0,1,0,-1};
void dfs(int x,int y)
{
    if(x<=0||x>=6||y<=0||y>=6)
    {
        ans++;
        return ;
    }
    for(int i = 0;i<4;i++)
    {
        int nowx = x+tx[i];
        int nowy = y+ty[i];
        if(!vis[nowx][nowy]&&!vis[6-nowx][6-nowy])
        {
            vis[nowx][nowy]=1;
            vis[6-nowx][6-nowy]=1;
            dfs(nowx,nowy);
            vis[nowx][nowy]=0;
            vis[6-nowx][6-nowy]=0;
        }
    }
}
int main()
{
    ios::sync_with_stdio(false);cin.tie(0),cout.tie(0);
    vis[3][3]=1;
    dfs(3,3);
    cout<<ans/4<<endl;
    return 0;
}
//31536000