Submission #1756840

---

Source Code Expand

#define FOR(i,j,n) for (int i=(j);i<(n);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define REPN(i,n) for (int i=(n);i>=0;i--)
#define I(n) scanf("%d", &(n))
#define pb(n) push_back((n))
#define mp(i,j) make_pair((i),(j))
#include <bits/stdc++.h>
using namespace std;

//------------------------------typedef集
typedef vector<int> vi;
typedef pair<int,int> pi;
typedef vector<pi> vpi;
typedef vector<vi> vvi;
typedef vector<vpi> vvpi;
typedef vector<vvi> vvvi;

vi cb;
string s;

int main(){
    REP(i,8){
        cin >> s;
        REP(j,8){
            if (s[j] == 'Q') cb.pb(i*8+j);
        }
    }
    REP(i,64){
        if (i == cb[0] || i == cb[1] || i == cb[2]) continue;
        FOR(j,i+1,64){
            if (j == cb[0] || j == cb[1] || j == cb[2]) continue;
            FOR(k,j+1,64){
                if (k == cb[0] || k == cb[1] || k == cb[2]) continue;
                FOR(l,k+1,64){
                    if (l == cb[0] || l == cb[1] || l == cb[2]) continue;
                    FOR(m,l+1,64){
                        if (m == cb[0] || m == cb[1] || m == cb[2]) continue;

                        set<int> s1{cb[0]/8,cb[1]/8,cb[2]/8,i/8,j/8,k/8,l/8,m/8};
                        if (s1.size() != 8) continue;
                        set<int> s2{cb[0]%8,cb[1]%8,cb[2]%8,i%8,j%8,k%8,l%8,m%8};
                        if (s2.size() != 8) continue;
                        set<int> s3{cb[0]%8+cb[0]/8,cb[1]%8+cb[1]/8,cb[2]%8+cb[2]/8,
                                    i%8+i/8,j%8+j/8,k%8+k/8,l%8+l/8,m%8+m/8};
                        if (s3.size() != 8) continue;
                        set<int> s4{cb[0]%8-cb[0]/8,cb[1]%8-cb[1]/8,cb[2]%8-cb[2]/8,
                                    i%8-i/8,j%8-j/8,k%8-k/8,l%8-l/8,m%8-m/8};
                        if (s4.size() != 8) continue;
                        cb.pb(i);
                        cb.pb(j);
                        cb.pb(k);
                        cb.pb(l);
                        cb.pb(m);
                        REP(v,8){
                            REP(h,8){
                                if (find(cb.begin(),cb.end(),v*8+h) == cb.end()){
                                    cout << ".";
                                }else{
                                    cout << "Q";
                                }
                            }
                            cout << endl;
                        }
                        return 0;
    } } } } }
    cout << "No Answer" << endl;
}

Submission Info

Judge Result