受伤的皇后(蓝桥云课)(dfs)

受伤的皇后 - 蓝桥云课 (lanqiao.cn)

 

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <unordered_map>
#include <queue>
#include <set>
#include <algorithm>
#define x first
#define y second
#define int long long 
#define pb emplace_back
#define fu(i,a,b) for(int i=a;i<=b; ++ i)
#define fd(i,a,b) for(int i=a;i>=b;    -- i)
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<vector<LL>> VVL;
typedef vector<vector<int>> VVI;
typedef vector<LL> VL;
typedef vector<int> VI;
typedef vector<string> VS;
typedef pair<int,int> PII;
typedef vector<PII> VPII;
typedef pair<PII,int> PIII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<int,char> PIC;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N =10+ 10,M = N * 2,base =400  ,INF = 0x3f3f3f3f,P = 131;
const double eps = 1e-8;
const int mod = 998244353;
const LL LNF=(LL) INF * INF;


int row[N];
int n,ans;


bool check(int x,int y)
{
    fu(i,1,x-1)
    if(row[i] == y) return 0;
    else if(abs(i-x) == abs(row[i]-y) && abs(i-x) < 3  )
    return 0;
    
    return 1;
}


void dfs(int x)
{
    if(x== n +1 ) 
    {
        ans ++ ;return;
    }
    fu(i,1,n)
    if(check(x,i))
    {
        row[x]= i;
        dfs(x+1);
    }
    
    
}




inline void solve()
{
    cin >> n ;
    dfs(1);
    cout << ans <<endl;    
    
}
signed main()
{
//  freopen("1.txt","r",stdin);
//    #define int long long 
    ios
//    cout << fixed<<setprecision(2);
    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Case #"; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}