118-N-Queens II

-52. N-Queens II QuestionEditorial Solution My Submissions
Total Accepted: 49400
Total Submissions: 120574
Difficulty: Hard
Follow up for N-Queens problem.

Now, instead outputting board configurations, return the total number of distinct solutions.
思路不详细展开说，简言之：深搜+剪枝

#include <algorithm>
#include <iostream>
#include <map>
#include <vector>
#include <iterator>
#include <string.h>
#define IMIN numeric_limits<int>::min()
#define IMAX numeric_limits<int>::max()
#define FR(i,n) for(int i=0;i<n;i++)
#define CLC(x) memset(x,0,sizeof(x))
#define FILL(x,c) memset(x,c,sizeof(x))
#define viter vector<int>::const_iterator
#define vcter vector<int>::const_iterator
//    typedef ostream_iterator<int> OstreamItr;
 //   copy(res.begin(), res.end(), OstreamItr(cout, " "));
using namespace std;
#include <time.h>
#include <sys/timeb.h>

int get_time(string r)
{
    struct timeb rawtime;
    ftime(&rawtime);
    static int ms = rawtime.millitm;
    static unsigned long s = rawtime.time;
    int out_ms = rawtime.millitm - ms;
    unsigned long out_s = rawtime.time - s;
    if (out_ms < 0)
    {
        out_ms += 1000;
        out_s -= 1;
    }
    ms = rawtime.millitm;
    s = rawtime.time;
    int total = 1000*out_s+out_ms;
    cout<<r<<": "<<total<<"ms"<<endl;
    return total;
}
class Solution {
public:
    int solveNQueens(int n) {
      int sum = 0;
      vector<int> vis(n,0),resid(n,0);
      vector<string> vs;
      solveNQueens2(n,sum,resid,vs,vis,0);
      return sum;
    }
    void solveNQueens2(int n,int &sum,vector<int> resid,vector<string> vs,vector<int> vis,int j) {
        if(j==n){
          sum++;
        }
        else{
          string s(n,'.');
          //从第一行的每一个位置分支进入深度搜索
          for(int i=0;i<n;++i){
                if(vis[i]==0){
                    vis[i]=1;//放置该元素
                    s[i] = 'Q'; 
                    resid[j]=i;
                    //判定合法性
                    if(!isLegal(resid,j,i)){
                      s[i] = '.';
                      vis[i]=0;
                      continue;
                    }
                    vs.push_back(s);
                    solveNQueens2(n,sum,resid,vs,vis,j+1);
                    vs.erase(vs.end()-1);
                    s[i] = '.'; //回到父节点重新选择
                    vis[i]=0; 
                }
            }
        }         
    }
    bool isLegal(const vector<int> &resid,int row,int col)
    {
      for(int i=0;i<row;++i){//是否在同一对角线上 
        if(abs(col-resid[i])==abs(row-i))return false;
      }
      return true; 
    }       
};
int main()
{
     Solution s;
     get_time("begin");
     cout<<s.solveNQueens(5)<<endl;
     get_time("end");
     return 0;
}