Submission #1135068


Source Code Expand

#include <iostream>
#include <vector>
#include <string>
using namespace std;

int f(int i, int j) {
    int res = i - j;
    if(res < 0) {
        res = abs(res) + 7;
    }
    return res;
}

bool solve(vector<string>& v, int i, vector<bool>& tate, vector<bool>& yoko, vector<bool>& naname1, vector<bool>& naname2) {
    if(i == 8) {
        return true;
    }
    if(tate[i]) {
        return solve(v, i+1, tate, yoko, naname1, naname2);
    }
    for(int j=0; j<8; ++j) {
        if(!yoko[j] && !naname1[f(i, j)] && !naname2[i+j]) {
            v[i][j] = 'Q';
            tate[i] = yoko[j] = naname1[f(i, j)] = naname2[i+j] = true;
            if(solve(v, i+1, tate, yoko, naname1, naname2)) {
                return true;
            }
            v[i][j] = '.';
            tate[i] = yoko[j] = naname1[f(i, j)] = naname2[i+j] = false;
        }
    }
    return false;
}

int main() {
    vector<string> v(8);
    for(int i=0; i<8; ++i) {
        cin >> v[i];
    }
    vector<bool> tate(8), yoko(8), naname1(15), naname2(15);
    for(int i=0; i<8; ++i) {
        for(int j=0; j<8; ++j) {
            if(v[i][j] == 'Q') {
                if(tate[i] || yoko[j] || naname1[f(i, j)] || naname2[i+j]) {
                    cout << "No Answer" << endl;
                    return 0;
                }
                tate[i] = yoko[j] = naname1[f(i, j)] = naname2[i+j] = true;
            }
        }
    }
    if(solve(v, 0, tate, yoko, naname1, naname2)) {
        for(auto& x : v) {
            cout << x << endl;
        }
    } else {
        cout << "No Answer" << endl;
    }
}

Submission Info

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

Judge Result

Set Name All
Score / Max Score 100 / 100
Status
AC × 42
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 AC 1 ms 256 KB
01_rnd_00.txt AC 1 ms 256 KB
01_rnd_01.txt AC 1 ms 256 KB
01_rnd_02.txt AC 1 ms 256 KB
01_rnd_03.txt AC 1 ms 256 KB
01_rnd_04.txt AC 1 ms 256 KB
01_rnd_05.txt AC 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 AC 1 ms 256 KB
01_rnd_13.txt AC 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 AC 1 ms 256 KB
01_rnd_20.txt AC 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 AC 1 ms 256 KB
01_rnd_24.txt AC 1 ms 256 KB
01_rnd_25.txt AC 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 AC 1 ms 256 KB
01_rnd_29.txt AC 1 ms 256 KB
01_rnd_30.txt AC 1 ms 256 KB
01_rnd_31.txt AC 1 ms 256 KB
01_rnd_32.txt AC 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 AC 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 AC 1 ms 256 KB
01_rnd_39.txt AC 1 ms 256 KB