Submission #1697628

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<map>
#include<string>
#include<sstream>
#include<cmath>
#include<climits>
#include<algorithm>
#include<bitset>
#include<set>
#include<stack>
#include<queue>
#include<iomanip>
#include<memory.h>
#include<complex>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef tuple<int,int> tii;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pb push_back
#define mt make_tuple
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cerr<<"!"<<endl
#define SHOW(a,b) cerr<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cerr<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
#define DIV int(1e9+7)
inline ll pow(ll x,ll n,ll m){ll r=1;while(n>0){if((n&1)==1)r=r*x%m;x=x*x%m;n>>=1;}return r%m;}

/* Coding Space*/
vector<string> vs(8);
bool can = 0;
vi vec = {1,0,1,1,-1,0,-1,-1,1};

bool valid(vector<string> vss){
  rep(i,8)rep(j,8){
    if(vss[i][j] == 'Q'){
      rep(x,8){
        for(int k = 1;;k++){
          int xx = j + vec[x]*k;
          int yy = i + vec[x+1]*k;
          if(xx >= 8 || xx < 0 || yy >= 8 || yy < 0)  break;
          if(vss[yy][xx] == 'Q')  return false;
        }
      }
    }
  }
  return true;
}

void check(vector<string> vs,int line){
  if(valid(vs) == false) return;
  if(line == 8){
    for(auto out:vs)  cout << out << endl;
    exit(0);
  }
  bool q = false;
  rep(i,8)
    if(vs[line][i] == 'Q'){
      check(vs,line+1);
      q = true;
    }
  if(line < 8 && !q)
    rep(i,8){
      vector<string> vss = vs;
      vss[line][i] = 'Q';
      check(vss,line+1);
    }
}

int main(){
  rep(i,8) cin >> vs[i];
  check(vs,0);
  if(!can)
    cout << "No Answer" << endl;
  return 0;
}

Submission Info

Judge Result