Submission #2124786


Source Code Expand

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

const int maxn=505;

int n,m;
int a[maxn][maxn],b[maxn][maxn];

int main()
{
	scanf("%d%d\n",&n,&m);
	char ch;
	for (int i=1; i<=n; i++)
	{
		for (int j=1; j<=m; j++)
		{
			ch=getchar();
			if (ch=='#') a[i][j]=b[i][j]=1;
		}
		scanf("\n");
	}
	for (int i=1; i<=n; i++) a[i][1]=1,b[i][m]=1;
	for (int i=2; i<=n-1; i++)
	{
		if (i%2==1) {
			for (int j=2; j<=m-1; j++) 
				a[i][j]=1;
		}
	}
	for (int i=2; i<=n-1; i++)
	{
		if (i%2==0) {
			for (int j=2; j<=m-1; j++)
				b[i][j]=1;
		}
	}
	for (int i=1; i<=n; i++)
	{
		for (int j=1; j<=m; j++)
			if (a[i][j]) printf("#");
			else printf(".");
		printf("\n");
	}
	printf("\n");
	for (int i=1; i<=n; i++)
	{
		for (int j=1; j<=m; j++)
			if (b[i][j]) printf("#");
			else printf(".");
		printf("\n");
	}
	
	return 0;
}

Submission Info

Submission Time
Task C - AND Grid
User Darkholme
Language C++14 (GCC 5.4.1)
Score 700
Code Size 922 Byte
Status AC
Exec Time 10 ms
Memory 2688 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:14:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d\n",&n,&m);
                       ^
./Main.cpp:23:14: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("\n");
              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 2
AC × 66
Set Name Test Cases
Sample 0_00.txt, 0_01.txt
All 0_00.txt, 0_01.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt, 1_43.txt, 1_44.txt, 1_45.txt, 1_46.txt, 1_47.txt, 1_48.txt, 1_49.txt, 1_50.txt, 1_51.txt, 1_52.txt, 1_53.txt, 1_54.txt, 1_55.txt, 1_56.txt, 1_57.txt, 1_58.txt, 1_59.txt, 1_60.txt, 1_61.txt, 1_62.txt, 1_63.txt
Case Name Status Exec Time Memory
0_00.txt AC 1 ms 256 KB
0_01.txt AC 1 ms 256 KB
1_00.txt AC 1 ms 256 KB
1_01.txt AC 8 ms 2688 KB
1_02.txt AC 8 ms 2688 KB
1_03.txt AC 8 ms 2688 KB
1_04.txt AC 8 ms 2688 KB
1_05.txt AC 8 ms 2688 KB
1_06.txt AC 8 ms 2688 KB
1_07.txt AC 8 ms 2688 KB
1_08.txt AC 8 ms 2688 KB
1_09.txt AC 8 ms 2688 KB
1_10.txt AC 8 ms 2688 KB
1_11.txt AC 8 ms 2688 KB
1_12.txt AC 8 ms 2560 KB
1_13.txt AC 9 ms 2688 KB
1_14.txt AC 9 ms 2688 KB
1_15.txt AC 9 ms 2688 KB
1_16.txt AC 9 ms 2688 KB
1_17.txt AC 9 ms 2688 KB
1_18.txt AC 9 ms 2688 KB
1_19.txt AC 9 ms 2688 KB
1_20.txt AC 9 ms 2688 KB
1_21.txt AC 10 ms 2688 KB
1_22.txt AC 9 ms 2688 KB
1_23.txt AC 9 ms 2688 KB
1_24.txt AC 8 ms 2688 KB
1_25.txt AC 9 ms 2688 KB
1_26.txt AC 8 ms 2688 KB
1_27.txt AC 8 ms 2688 KB
1_28.txt AC 8 ms 2688 KB
1_29.txt AC 8 ms 2688 KB
1_30.txt AC 9 ms 2688 KB
1_31.txt AC 9 ms 2688 KB
1_32.txt AC 9 ms 2688 KB
1_33.txt AC 9 ms 2688 KB
1_34.txt AC 9 ms 2688 KB
1_35.txt AC 10 ms 2688 KB
1_36.txt AC 9 ms 2560 KB
1_37.txt AC 10 ms 2688 KB
1_38.txt AC 9 ms 2688 KB
1_39.txt AC 9 ms 2688 KB
1_40.txt AC 9 ms 2688 KB
1_41.txt AC 9 ms 2688 KB
1_42.txt AC 9 ms 2688 KB
1_43.txt AC 9 ms 2688 KB
1_44.txt AC 8 ms 2688 KB
1_45.txt AC 9 ms 2688 KB
1_46.txt AC 9 ms 2688 KB
1_47.txt AC 9 ms 2688 KB
1_48.txt AC 9 ms 2688 KB
1_49.txt AC 9 ms 2688 KB
1_50.txt AC 9 ms 2688 KB
1_51.txt AC 9 ms 2560 KB
1_52.txt AC 10 ms 2688 KB
1_53.txt AC 10 ms 2688 KB
1_54.txt AC 10 ms 2688 KB
1_55.txt AC 10 ms 2688 KB
1_56.txt AC 10 ms 2688 KB
1_57.txt AC 10 ms 2688 KB
1_58.txt AC 9 ms 2688 KB
1_59.txt AC 9 ms 2688 KB
1_60.txt AC 9 ms 2688 KB
1_61.txt AC 9 ms 2688 KB
1_62.txt AC 9 ms 2688 KB
1_63.txt AC 8 ms 2560 KB