Submission #2866786


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();}

void test(){
    vector<ll> ve;
    rep(i, 8){
        ve.pb(i);
    }

    ll cnt = 0 ;
    do{
        cnt ++;
    }while(next_permutation(all(ve)));

    cout << cnt << endl;
    return ;
}

bool qx[8];
bool qy[8];

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

    vector<pair<ll,ll>> Q;
    rep(i, 8){
        string inp;
        cin >> inp;
        rep(j, 8){
            if(inp[j] == 'Q'){
                Q.pb(mp(i,j));
                qx[i] = true;
                qy[j] = true;
            }
        }
    }
    vector<ll> x, y;
    rep(i, 8){
        if(qx[i] == false) x.pb(i);
        if(qy[i] == false) y.pb(i);
    }

    // 同じ行、もしくは列にQが存在する。
    if(x.size() != y.size()){
        cout << "No Answer" << endl ;
        return 0;
    }

    do{
        vector<ll> diffxy, diffyx;
        rep(i,Q.size()){
            diffxy.pb(Q[i].first-Q[i].second);
            diffyx.pb(Q[i].second-Q[i].first);
        }
        rep(i,x.size()){
            diffxy.pb(x[i]-y[i]);
            diffyx.pb(y[i]-x[i]);
        }

        rmsame(diffxy);
        rmsame(diffyx);

        if(diffxy.size() == 8  && diffyx.size() == 8){
            rep(i,Q.size()){
                x.pb(Q[i].first);
                y.pb(Q[i].second);
            }
            vector<string> ans ;
            rep(i, 8) ans.pb("........");
            rep(i,x.size()){
                ans[x[i]][y[i]] = 'Q';
            }
            rep(i, 8){
                cout << ans[i] << endl ;
            }
            return 0;
        }


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

    cout << "No Answer" << endl;

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

Submission Info

Submission Time
Task C - パズルのお手伝い
User ukohank517
Language C++14 (GCC 5.4.1)
Score 0
Code Size 2588 Byte
Status WA
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 24
WA × 18
Set Name Test Cases
All 00_sample1.txt, 00_sample2.txt, 01_rnd_00.txt, 01_rnd_01.txt, 01_rnd_02.txt, 01_rnd_03.txt, 01_rnd_04.txt, 01_rnd_05.txt, 01_rnd_06.txt, 01_rnd_07.txt, 01_rnd_08.txt, 01_rnd_09.txt, 01_rnd_10.txt, 01_rnd_11.txt, 01_rnd_12.txt, 01_rnd_13.txt, 01_rnd_14.txt, 01_rnd_15.txt, 01_rnd_16.txt, 01_rnd_17.txt, 01_rnd_18.txt, 01_rnd_19.txt, 01_rnd_20.txt, 01_rnd_21.txt, 01_rnd_22.txt, 01_rnd_23.txt, 01_rnd_24.txt, 01_rnd_25.txt, 01_rnd_26.txt, 01_rnd_27.txt, 01_rnd_28.txt, 01_rnd_29.txt, 01_rnd_30.txt, 01_rnd_31.txt, 01_rnd_32.txt, 01_rnd_33.txt, 01_rnd_34.txt, 01_rnd_35.txt, 01_rnd_36.txt, 01_rnd_37.txt, 01_rnd_38.txt, 01_rnd_39.txt
Case Name Status Exec Time Memory
00_sample1.txt AC 1 ms 256 KB
00_sample2.txt WA 1 ms 256 KB
01_rnd_00.txt WA 1 ms 256 KB
01_rnd_01.txt WA 1 ms 256 KB
01_rnd_02.txt AC 1 ms 256 KB
01_rnd_03.txt WA 1 ms 256 KB
01_rnd_04.txt WA 1 ms 256 KB
01_rnd_05.txt WA 1 ms 256 KB
01_rnd_06.txt AC 1 ms 256 KB
01_rnd_07.txt AC 1 ms 256 KB
01_rnd_08.txt AC 1 ms 256 KB
01_rnd_09.txt AC 1 ms 256 KB
01_rnd_10.txt AC 1 ms 256 KB
01_rnd_11.txt AC 1 ms 256 KB
01_rnd_12.txt WA 1 ms 256 KB
01_rnd_13.txt WA 1 ms 256 KB
01_rnd_14.txt AC 1 ms 256 KB
01_rnd_15.txt AC 1 ms 256 KB
01_rnd_16.txt AC 1 ms 256 KB
01_rnd_17.txt AC 1 ms 256 KB
01_rnd_18.txt AC 1 ms 256 KB
01_rnd_19.txt WA 1 ms 256 KB
01_rnd_20.txt WA 1 ms 256 KB
01_rnd_21.txt AC 1 ms 256 KB
01_rnd_22.txt AC 1 ms 256 KB
01_rnd_23.txt WA 1 ms 256 KB
01_rnd_24.txt AC 1 ms 256 KB
01_rnd_25.txt WA 1 ms 256 KB
01_rnd_26.txt AC 1 ms 256 KB
01_rnd_27.txt AC 1 ms 256 KB
01_rnd_28.txt WA 1 ms 256 KB
01_rnd_29.txt AC 1 ms 256 KB
01_rnd_30.txt WA 1 ms 256 KB
01_rnd_31.txt AC 1 ms 256 KB
01_rnd_32.txt WA 1 ms 256 KB
01_rnd_33.txt AC 1 ms 256 KB
01_rnd_34.txt AC 1 ms 256 KB
01_rnd_35.txt WA 1 ms 256 KB
01_rnd_36.txt AC 1 ms 256 KB
01_rnd_37.txt AC 1 ms 256 KB
01_rnd_38.txt WA 1 ms 256 KB
01_rnd_39.txt WA 1 ms 256 KB