Submission #2867595

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cstring>
#include <map>
#include <stack>
#include <queue>
#include <cmath>
#include <complex> // complex<double> a(1.2 , 2.3);// real(): 1.2, imag()2.3
using namespace std;

#define MOD 1000000007
#define ll long long
#define ld long double
#define FOR(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define mp make_pair
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rmsame(a) sort(all(a)),a.erase(unique(all(a)), a.end())
#define rmvector(a,b) rep(i,a.size())rep(j,b.size())if(a[i]==b[j]){a.erase(a.begin()+i);i--;break;}
template<typename X> bool exist(vector<X> vec, X item){return find(all(vec), item)!=vec.end();}

char board[8][8];
bool usedx[8];
bool usedy[8];
vector<ll> x, y ;
vector<pair<ll,ll>> Q;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    rep(i, 8){
        string inp;
        cin >> inp;
        rep(j, 8){
            board[i][j] = inp[j];
            if(board[i][j] == 'Q'){
                Q.pb(mp(i,j));
                usedx[i] = true;
                usedy[j] = true;
            }
        }
    }
    rep(i, 8){
        if(usedx[i] == false) x.pb(i);
        if(usedy[i] == false) y.pb(i);
    }
    if(x.size() != y.size()) {
        cout << "No Answer"  << endl;
        return 0;
    }

    do{
        vector<ll> su, de;

        rep(i,Q.size()){
            su.pb(Q[i].first - Q[i].second);
            de.pb(Q[i].first + Q[i].second);
        }
        rep(i, x.size()){
            su.pb(x[i]-y[i]);
            de.pb(x[i]+y[i]);
        }

        rmsame(su), rmsame(de);

        if(su.size() == 8 && de.size()==8){
            rep(i, x.size())board[x[i]][y[i]]='Q';
            rep(i, 8) {
                rep(j, 8) cout << board[i][j];
                cout << endl ;
            }
            return 0;
        }

    }while(next_permutation(all(x)));

    cout << "No Answer" << endl ;

    //cout << fixed << setprecision(16) << ans << endl;
    return 0;
}

Submission Info

Judge Result