Submission #2206529

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n)   FOR(i,0,n)
#define pb emplace_back
typedef long long ll;
typedef pair<int,int> pint;
 
int x[8],y[8],ax[8],ay[8];
bool used[8];
bool ok;
void dfs(int cur){
    if(cur==8){
        rep(i,8) ax[i]=x[i],ay[i]=y[i];
        ok=true;
        return;
    }
    int ty=0;
    while(used[ty]) ++ty;
    rep(i,8){
        bool flag=true;
        rep(j,cur){
            if(i==x[j]) flag=false;
            if(abs(ty-y[j])==abs(i-x[j])) flag=false;
        }
        if(flag){
            x[cur]=i,y[cur]=ty;
            used[ty]=true;
            dfs(cur+1);
            used[ty]=false;
        }
    }
}
string s[8],ans[8];
int main(){
    bool flag=true;
    int c=0;
    rep(i,8){
        cin>>s[i];
        rep(j,s[i].size())if(s[i][j]=='Q'){
            x[c]=j,y[c]=i;++c;used[i]=true;
        }
    }
    rep(i,2){
        if(x[2]==x[i]||y[2]==y[i]||abs(x[2]-x[i])==abs(y[2]-y[i])) flag=false;
    }
    //cout<<flag<<endl;
    dfs(c);
    if(!flag||!ok){
        cout<<"No Answer"<<endl;
        return 0;
    }
    rep(i,8)rep(j,8) ans[i]+='.';
    rep(i,8) ans[ay[i]][ax[i]]='Q';
    rep(i,8) cout<<ans[i]<<endl;
    return 0;
}

Submission Info

Judge Result