Submission #1570708


Source Code Expand

#include<stdio.h>

int tate[8] = {0}, yoko[8] = {0}, migisita[15] = {0}, migiue[15] = {0};
int end = 0;
char c[8][8];

void check()
{
	int i, j;

	for(i = 0; i < 8; i++)
		for(j = 0; j < 8; j++)
			if(c[i][j] == 'Q')
			{
				tate[j]++;
				yoko[i]++;
				migisita[i - j + 7]++;
				migiue[i + j]++;
			}

	for(i = 0; i < 8; i++)
		if(tate[i] > 1 || yoko[i] > 1)
			end = 1;

	for(i = 0; i < 15; i++)
		if(migisita[i] > 1 || migiue[i] > 1)
			end = 1;
}

void putting(int num)
{
	int i, j, m, n;

	for(i = 0; i < 8; i++)
		for(j = 0; j < 8; j++)
			if(tate[j]  == 0 && yoko[i] == 0 && migisita[i - j + 7] == 0 && migiue[i + j] == 0)
			{
				c[i][j] = 'Q';

				tate[j]++;
				yoko[i]++;
				migisita[i - j + 7]++;
				migiue[i + j]++;

				if(num == 7)
				{
					for(m = 0; m < 8; m++)
					{
						for(n = 0; n < 8; n++)
							putchar(c[m][n]);

						putchar('\n');
					}

					end = 1;
				}

				else
				{
					putting(num + 1);

					c[i][j] = '.';

					tate[j]--;
					yoko[i]--;
					migisita[i - j + 7]--;
					migiue[i + j]--;
				}
			}
}

int main()
{
	int i, j;

	for(i = 0; i < 8; i++)
	{
		for(j = 0; j < 8; j++)
			c[i][j] = getchar();

		while(getchar() != '\n')
			;
	}

	check();

	if(end)
		puts("No Answer");

	putting(3);

	if(!end)
		puts("No Answer");

	return 0;
}

Submission Info

Submission Time
Task C - パズルのお手伝い
User mafun
Language C (GCC 5.4.1)
Score 0
Code Size 1389 Byte
Status WA
Exec Time 1 ms
Memory 128 KB

Judge Result

Set Name All
Score / Max Score 0 / 100
Status
AC × 26
WA × 16
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 128 KB
00_sample2.txt AC 1 ms 128 KB
01_rnd_00.txt AC 1 ms 128 KB
01_rnd_01.txt AC 1 ms 128 KB
01_rnd_02.txt WA 1 ms 128 KB
01_rnd_03.txt AC 1 ms 128 KB
01_rnd_04.txt WA 1 ms 128 KB
01_rnd_05.txt AC 1 ms 128 KB
01_rnd_06.txt WA 1 ms 128 KB
01_rnd_07.txt WA 1 ms 128 KB
01_rnd_08.txt WA 1 ms 128 KB
01_rnd_09.txt WA 1 ms 128 KB
01_rnd_10.txt AC 1 ms 128 KB
01_rnd_11.txt AC 1 ms 128 KB
01_rnd_12.txt AC 1 ms 128 KB
01_rnd_13.txt AC 1 ms 128 KB
01_rnd_14.txt WA 1 ms 128 KB
01_rnd_15.txt AC 1 ms 128 KB
01_rnd_16.txt AC 1 ms 128 KB
01_rnd_17.txt WA 1 ms 128 KB
01_rnd_18.txt AC 1 ms 128 KB
01_rnd_19.txt AC 1 ms 128 KB
01_rnd_20.txt AC 1 ms 128 KB
01_rnd_21.txt WA 1 ms 128 KB
01_rnd_22.txt WA 1 ms 128 KB
01_rnd_23.txt AC 1 ms 128 KB
01_rnd_24.txt WA 1 ms 128 KB
01_rnd_25.txt AC 1 ms 128 KB
01_rnd_26.txt WA 1 ms 128 KB
01_rnd_27.txt AC 1 ms 128 KB
01_rnd_28.txt AC 1 ms 128 KB
01_rnd_29.txt AC 1 ms 128 KB
01_rnd_30.txt AC 1 ms 128 KB
01_rnd_31.txt WA 1 ms 128 KB
01_rnd_32.txt AC 1 ms 128 KB
01_rnd_33.txt AC 1 ms 128 KB
01_rnd_34.txt WA 1 ms 128 KB
01_rnd_35.txt WA 1 ms 128 KB
01_rnd_36.txt AC 1 ms 128 KB
01_rnd_37.txt WA 1 ms 128 KB
01_rnd_38.txt AC 1 ms 128 KB
01_rnd_39.txt AC 1 ms 128 KB