USACO 1.5.4 Checker Challenge

/*
ID: tgh7281
LANG: C++
TASK: checker
*/
#include <iostream>
#include <fstream>
using namespace std;
 
bool ColCheck[13]={false}; //初始状态所有行均未放置皇后
bool sum[25]={false},diff[25]={false};
bool CanPlace(int row,int col,int N);
 
int main()
{
    ifstream fin("checker.in");
    ofstream fout("checker.out");
 
    int N;
    int queen[13]={0}; //第i个皇后的位置:i行，queen[i]列
    int row=0,col=0;
    int total=0,total1=0; //放置的方法总数
 
    fin>>N;
    while (row<n)
    {
        if (N>6&&queen[0]>(N-1)/2) break; //利用对称性优化
        while (col<n&&(!CanPlace(row,col,N))) col++;
        if (col<n) //放置
        {
            queen[row]=col;
            ColCheck[col]=true; //第col列已放置皇后
            sum[row+col]=true;
            diff[row-col+N-1]=true;
            row++;
//col=0;
 
            if (row>=N)
            {
//输出
                total++;
                if (N%2)
                {
                    if (queen[0]==N/2) total1++;
                    else total1+=2;
                }
                else
                {
                    total1+=2;
                }
 
                if (total<=3)
                {
                    for (int i=0;i<n;i++)
                    {
                        fout<<queen[i]+1;
                        if (i<n-1) fout<<’ ‘;
                    }
                    fout<<endl;
                }
 
                ColCheck[queen[N-1]]=false;
                sum[N-1+queen[N-1]]=false;
                diff[2*N-2-queen[N-1]]=false;
                row=N-1;
                col++;
            }
            else col=0;
        }
        else //回溯
        {
            row–;
            if (row<0) break;
            col=queen[row]+1;
            ColCheck[queen[row]]=false;
            sum[row+queen[row]]=false;
            diff[row-queen[row]+N-1]=false;
        }
    }
    fout<<(N>6?total1:total)<<endl;
 
    fin.close();
    fout.close();
 
    return 0;
}
 
bool CanPlace(int row,int col,int N)
{
    if (ColCheck[col]||sum[row+col]||diff[row-col+N-1]) return false;
 
    return true;
}