Submission #1839977


Source Code Expand

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#define fi first
#define se second
#define pb push_back

using namespace std;

typedef pair<int,int> abcd;

const int N=510;

int n,m;
char a[N][N],b[N][N],c[N][N];
set<int> h[N],w[N];

int main(){
  scanf("%d%d",&n,&m);
  for(int i=1;i<=n;i++){
    scanf("%s",a[i]+1);
    for(int j=1;j<=m;j++){
      if(a[i][j]=='#') h[i].insert(j),w[j].insert(i);
      b[i][j]=c[i][j]='.';
    }
  }
  for(int i=1;i<=n;i++) b[i][1]=c[i][m]='#';
  for(int i=1;i<=n;i++)
    if(i&1)
      for(int j=1;j<=m-1;j++) b[i][j]='#';
    else
      for(int j=2;j<=m;j++) c[i][j]='#';
  for(int i=1;i<=n;i++)
    for(int j=1;j<=m;j++)
      if(a[i][j]=='#') b[i][j]=c[i][j]='#';
  for(int i=1;i<=n;i++) puts(b[i]+1);
  puts("");
  for(int i=1;i<=n;i++) puts(c[i]+1);
  return 0;
}

Submission Info

Submission Time
Task C - AND Grid
User SBP
Language C++14 (GCC 5.4.1)
Score 700
Code Size 892 Byte
Status AC
Exec Time 119 ms
Memory 24832 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:21:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d",&n,&m);
                      ^
./Main.cpp:23:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
     scanf("%s",a[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 20 ms 7296 KB
1_02.txt AC 36 ms 13184 KB
1_03.txt AC 39 ms 13184 KB
1_04.txt AC 37 ms 13184 KB
1_05.txt AC 63 ms 18944 KB
1_06.txt AC 89 ms 24832 KB
1_07.txt AC 4 ms 1536 KB
1_08.txt AC 37 ms 13184 KB
1_09.txt AC 50 ms 13184 KB
1_10.txt AC 47 ms 11648 KB
1_11.txt AC 46 ms 11776 KB
1_12.txt AC 40 ms 10368 KB
1_13.txt AC 43 ms 10752 KB
1_14.txt AC 37 ms 9600 KB
1_15.txt AC 37 ms 9600 KB
1_16.txt AC 31 ms 8320 KB
1_17.txt AC 32 ms 8576 KB
1_18.txt AC 27 ms 7296 KB
1_19.txt AC 26 ms 7296 KB
1_20.txt AC 21 ms 6016 KB
1_21.txt AC 21 ms 6144 KB
1_22.txt AC 16 ms 4992 KB
1_23.txt AC 16 ms 4992 KB
1_24.txt AC 11 ms 3840 KB
1_25.txt AC 12 ms 3840 KB
1_26.txt AC 7 ms 2560 KB
1_27.txt AC 7 ms 2688 KB
1_28.txt AC 78 ms 16896 KB
1_29.txt AC 77 ms 17024 KB
1_30.txt AC 67 ms 14848 KB
1_31.txt AC 66 ms 14976 KB
1_32.txt AC 60 ms 13568 KB
1_33.txt AC 60 ms 13696 KB
1_34.txt AC 55 ms 11648 KB
1_35.txt AC 53 ms 11776 KB
1_36.txt AC 40 ms 9728 KB
1_37.txt AC 41 ms 10112 KB
1_38.txt AC 33 ms 8448 KB
1_39.txt AC 33 ms 8448 KB
1_40.txt AC 24 ms 6656 KB
1_41.txt AC 24 ms 6656 KB
1_42.txt AC 16 ms 4992 KB
1_43.txt AC 17 ms 4992 KB
1_44.txt AC 9 ms 3328 KB
1_45.txt AC 10 ms 3200 KB
1_46.txt AC 119 ms 22272 KB
1_47.txt AC 109 ms 22144 KB
1_48.txt AC 97 ms 20096 KB
1_49.txt AC 106 ms 19712 KB
1_50.txt AC 83 ms 17536 KB
1_51.txt AC 79 ms 17152 KB
1_52.txt AC 70 ms 15488 KB
1_53.txt AC 77 ms 15360 KB
1_54.txt AC 59 ms 12928 KB
1_55.txt AC 58 ms 12800 KB
1_56.txt AC 47 ms 10752 KB
1_57.txt AC 48 ms 10752 KB
1_58.txt AC 33 ms 8448 KB
1_59.txt AC 35 ms 8448 KB
1_60.txt AC 21 ms 6144 KB
1_61.txt AC 21 ms 6144 KB
1_62.txt AC 11 ms 3840 KB
1_63.txt AC 11 ms 3712 KB