Submission #7174286

---

Source Code Expand

#include <bits/stdc++.h>
#define n 8
using namespace std;
string p[10];char s[10][10];
bool a[10],b[10],c[20],d[20];
int ans[10];
void print(){
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
		if(j==ans[i])printf("Q");
		else printf(".");
	}
	cout<<endl;
	} 
}
int dfs(int k){
	if(k==9){print();exit(0);}
	for(int i=1;i<=8;i++){
		if(a[k]&&b[i]&&c[k+i]){
			a[k]=false,b[i]=false,c[k+i]=false;
			ans[k]=i;
			dfs(k+1);
			a[k]=true,b[i]=true,c[k+i]=true;
		}
	} 
} 
int main()
{
	memset(a,true,sizeof(a));memset(b,true,sizeof(b));
	memset(c,true,sizeof(c));memset(d,true,sizeof(d));
	for(int i=1;i<=8;i++){
		cin>>p[i];
		for(int j=0;j<=p[i].length()-1;j++){
		if(p[i][j]=='.')s[i][j+1]='.';else s[i][j+1]='Q';
		if(s[i][j+1]=='Q')
			if(a[i]&&b[i]&&c[i+j])a[i]=false,b[i]=false,c[i+j]=false,ans[i]=j;
			else{printf("No Answer\n");return 0;}
		}
	}
	dfs(1);
	printf("No Answer\n");
	return 0;
}

Submission Info

Judge Result