Submission #7174565


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[30],flag=false;
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;
	} 
	flag=true;
}
int dfs(int k){
	if(k==9){print();return 0;}
	if(ans[k]!=0)dfs(k+1);
	for(int i=1;i<=8;i++){
		if(a[k]&&b[i]&&c[k+i]&&d[k-i+7]){if(flag)return 0;
			a[k]=false,b[i]=false,c[k+i]=false,d[k-i+7]=false;
			ans[k]=i;
			dfs(k+1);
			a[k]=true,b[i]=true,c[k+i]=true,d[k-i+7]=true;
			if(flag)return 0;
		}	
	}
	if(flag)return 0;
} 
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++)s[i][j+1]=p[i][j];
	}
	for(int i=1;i<=n;i++)
	for(int j=1;j<=n;j++){
		if(s[i][j]=='Q')
			if(a[i]&&b[j]&&c[i+j]&&d[i-j+7])a[i]=false,b[j]=false,c[i+j]=false,d[i-j+7]=false,ans[i]=j;
			else{printf("No Answer\n");return 0;}
		}
	dfs(1);
	if(flag==0)printf("No Answer\n");
	return 0;
}

Submission Info

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

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 35
WA × 7
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 WA 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 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 AC 1 ms 256 KB
01_rnd_13.txt WA 2 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 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 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 2 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