Submission #1691958


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef double db;
typedef long long ll;
#define w1 first
#define w2 second
#define ls (x<<1)
#define rs (x<<1|1)
#define pb push_back
#define mid ((l+r)>>1)
#define SZ(x) ((x).size())
#define All(x) (x).begin(),(x).end()
#define rep(i,a,b) for(int (i)=(a);(i)<=(b);(i)++)
#define rep2(i,a,b) for(int (i)=(a);(i)<(b);(i)++)
#define per(i,a,b) for(int (i)=(a);(i)>=(b);(i)--)
#define Rep(p,x) for(int (p)=head[(x)];(p);(p)=nxt[(p)])
template<class T>void read(T&num){
	num=0;T f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9')num=num*10+ch-'0',ch=getchar();
	num*=f;
}
int power(int x,int k,int p){int res=1;for(;k;k>>=1,x=1ll*x*x%p)if(k&1)res=1ll*res*x%p;return res;}
const int maxn=505;
int n,m;
char str[maxn][maxn],ans1[maxn][maxn],ans2[maxn][maxn];
int main(){
	read(n);read(m);
	rep(i,1,n){
		scanf("%s",str[i]+1);
		rep(j,1,m)ans1[i][j]=ans2[i][j]=str[i][j];
	}
	rep(i,1,n)ans1[i][1]='#',ans2[i][m]='#';
	rep(i,1,n)rep(j,2,m-1)if(i&1)ans1[i][j]='#';
	else ans2[i][j]='#';
	rep(i,1,n)puts(ans1[i]+1);
	puts("");
	rep(i,1,n)puts(ans2[i]+1);
	return 0;
}

Submission Info

Submission Time
Task C - AND Grid
User Vegetable
Language C++14 (GCC 5.4.1)
Score 700
Code Size 1193 Byte
Status AC
Exec Time 3 ms
Memory 1536 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:30:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%s",str[i]+1);
                       ^

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 3 ms 1536 KB
1_02.txt AC 3 ms 1536 KB
1_03.txt AC 3 ms 1536 KB
1_04.txt AC 3 ms 1536 KB
1_05.txt AC 3 ms 1536 KB
1_06.txt AC 3 ms 1536 KB
1_07.txt AC 3 ms 1536 KB
1_08.txt AC 3 ms 1536 KB
1_09.txt AC 3 ms 1536 KB
1_10.txt AC 3 ms 1408 KB
1_11.txt AC 3 ms 1408 KB
1_12.txt AC 3 ms 1408 KB
1_13.txt AC 3 ms 1408 KB
1_14.txt AC 3 ms 1408 KB
1_15.txt AC 3 ms 1408 KB
1_16.txt AC 3 ms 1408 KB
1_17.txt AC 3 ms 1536 KB
1_18.txt AC 3 ms 1408 KB
1_19.txt AC 3 ms 1408 KB
1_20.txt AC 3 ms 1408 KB
1_21.txt AC 3 ms 1536 KB
1_22.txt AC 3 ms 1408 KB
1_23.txt AC 3 ms 1408 KB
1_24.txt AC 3 ms 1408 KB
1_25.txt AC 3 ms 1408 KB
1_26.txt AC 3 ms 1408 KB
1_27.txt AC 3 ms 1408 KB
1_28.txt AC 3 ms 1408 KB
1_29.txt AC 3 ms 1536 KB
1_30.txt AC 3 ms 1408 KB
1_31.txt AC 3 ms 1408 KB
1_32.txt AC 3 ms 1408 KB
1_33.txt AC 3 ms 1536 KB
1_34.txt AC 3 ms 1408 KB
1_35.txt AC 3 ms 1408 KB
1_36.txt AC 3 ms 1408 KB
1_37.txt AC 3 ms 1408 KB
1_38.txt AC 3 ms 1536 KB
1_39.txt AC 3 ms 1536 KB
1_40.txt AC 3 ms 1408 KB
1_41.txt AC 3 ms 1408 KB
1_42.txt AC 3 ms 1408 KB
1_43.txt AC 3 ms 1536 KB
1_44.txt AC 3 ms 1536 KB
1_45.txt AC 3 ms 1536 KB
1_46.txt AC 3 ms 1408 KB
1_47.txt AC 3 ms 1408 KB
1_48.txt AC 3 ms 1536 KB
1_49.txt AC 3 ms 1408 KB
1_50.txt AC 3 ms 1408 KB
1_51.txt AC 3 ms 1408 KB
1_52.txt AC 3 ms 1536 KB
1_53.txt AC 3 ms 1536 KB
1_54.txt AC 3 ms 1408 KB
1_55.txt AC 3 ms 1408 KB
1_56.txt AC 3 ms 1536 KB
1_57.txt AC 3 ms 1536 KB
1_58.txt AC 3 ms 1536 KB
1_59.txt AC 3 ms 1408 KB
1_60.txt AC 3 ms 1408 KB
1_61.txt AC 3 ms 1408 KB
1_62.txt AC 3 ms 1408 KB
1_63.txt AC 3 ms 1408 KB