forked from matthewsamuel95/ACM-ICPC-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathnqueens.cpp
60 lines (60 loc) · 1.32 KB
/
nqueens.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
#include <iostream>
#include <set>
#include <vector>
using namespace std;
set<int> row_c,col_c,mai_c,opp_c;
void printBoard(vector<vector<int> > board){
static int k = 1;
cout<<"Board "<<k++<<":\n";
for(int i=0;i<board.size();i++){
for(int j=0;j<board[i].size();j++){
cout<<board[i][j]<<" ";
}
cout<<endl;
}
cout<<endl;
}
bool isSafe(int row,int col){
if(row_c.find(row)!=row_c.end())
return false;
if(col_c.find(col)!=col_c.end())
return false;
if(mai_c.find(row-col)!=mai_c.end())
return false;
if(opp_c.find(row+col)!=opp_c.end())
return false;
return true;
}
void setBoard(vector<vector<int> >&board, int row,int col){
board[row][col] = 1;
row_c.insert(row);
col_c.insert(col);
mai_c.insert(row-col);
opp_c.insert(row+col);
}
void unsetBoard(vector<vector<int> >&board, int row,int col){
board[row][col] = 0;
row_c.erase(row);
col_c.erase(col);
mai_c.erase(row-col);
opp_c.erase(row+col);
}
void solveBoard(vector<vector<int> > &board,int row){
if(row==board.size()){
printBoard(board);
return;
}
for(int i=0;i<board.size();i++){
if(isSafe(row,i)){
setBoard(board,row,i);
solveBoard(board,row+1);
unsetBoard(board,row,i);
}
}
}
int main(){
cout<<"Enter size of board: ";
int n; cin>>n;
vector<vector<int> > board = vector<vector<int> >(n,std::vector<int> (n,0));
solveBoard(board,0);
}