Submission #3643789


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair


class UnionFind {
  vector<int> data;
 public:
  UnionFind(int size) : data(size, -1) { }
  bool unionSet(int x, int y) {
    x = root(x); y = root(y);
    if (x != y) {
      if (data[y] < data[x]) swap(x, y);
      data[x] += data[y]; data[y] = x;
    }
    return x != y;
  }
  bool findSet(int x, int y) { return root(x) == root(y); }
  int root(int x) { return data[x] < 0 ? x : data[x] = root(data[x]); }
  int size(int x) { return -data[root(x)]; }
};

#define IJ(i,j) (i)*W+(j)


void solve(int H,int W,vs& m){
    vvi a(H,vi(W,0)), b(H,vi(W,0));

    for (int j=0; j<W; ++j) a[0][j] = 1;
    for (int j=0; j<W; j+=2) {
        for (int i=1; i<H-1; ++i) {
            a[i][j] = 1;
        }
    }
    for (int j=1; j<W; j+=2) {
        for (int i=1; i<H-1; ++i) {
            b[i][j] = 1;
        }
    }
    for (int j=0; j<W; ++j) b[H-1][j] = 1;

    rep(i,H) rep(j,W) if (m[i][j] == '#') a[i][j] = b[i][j] = 1;


    rep(i,H){
        rep(j,W) putchar(".#"[a[i][j]]);
        putchar('\n');
    }
    putchar('\n');
    rep(i,H){
        rep(j,W) putchar(".#"[b[i][j]]);
        putchar('\n');
    }
}

int main() {
    int H, W; cin >> H >> W;
    vs a(H);
    rep(i,H) cin >> a[i];
    solve(H,W,a);
    return 0;
}

Submission Info

Submission Time
Task C - AND Grid
User naoya_t
Language C++14 (GCC 5.4.1)
Score 700
Code Size 2444 Byte
Status
Exec Time 17 ms
Memory 2944 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 0_00.txt, 0_01.txt
All 700 / 700 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 1 ms 256 KB
0_01.txt 1 ms 256 KB
1_00.txt 1 ms 256 KB
1_01.txt 15 ms 2944 KB
1_02.txt 16 ms 2944 KB
1_03.txt 16 ms 2944 KB
1_04.txt 15 ms 2944 KB
1_05.txt 16 ms 2944 KB
1_06.txt 16 ms 2944 KB
1_07.txt 15 ms 2944 KB
1_08.txt 16 ms 2944 KB
1_09.txt 16 ms 2944 KB
1_10.txt 15 ms 2944 KB
1_11.txt 15 ms 2944 KB
1_12.txt 15 ms 2944 KB
1_13.txt 16 ms 2944 KB
1_14.txt 16 ms 2944 KB
1_15.txt 16 ms 2944 KB
1_16.txt 16 ms 2944 KB
1_17.txt 16 ms 2944 KB
1_18.txt 16 ms 2944 KB
1_19.txt 16 ms 2944 KB
1_20.txt 16 ms 2944 KB
1_21.txt 16 ms 2944 KB
1_22.txt 16 ms 2944 KB
1_23.txt 16 ms 2944 KB
1_24.txt 15 ms 2944 KB
1_25.txt 16 ms 2944 KB
1_26.txt 15 ms 2944 KB
1_27.txt 15 ms 2944 KB
1_28.txt 15 ms 2944 KB
1_29.txt 16 ms 2944 KB
1_30.txt 16 ms 2944 KB
1_31.txt 16 ms 2944 KB
1_32.txt 16 ms 2944 KB
1_33.txt 16 ms 2944 KB
1_34.txt 16 ms 2944 KB
1_35.txt 16 ms 2944 KB
1_36.txt 16 ms 2816 KB
1_37.txt 16 ms 2944 KB
1_38.txt 16 ms 2944 KB
1_39.txt 16 ms 2944 KB
1_40.txt 16 ms 2944 KB
1_41.txt 16 ms 2944 KB
1_42.txt 16 ms 2944 KB
1_43.txt 16 ms 2944 KB
1_44.txt 16 ms 2944 KB
1_45.txt 15 ms 2944 KB
1_46.txt 16 ms 2944 KB
1_47.txt 16 ms 2944 KB
1_48.txt 16 ms 2944 KB
1_49.txt 16 ms 2944 KB
1_50.txt 16 ms 2944 KB
1_51.txt 16 ms 2944 KB
1_52.txt 17 ms 2944 KB
1_53.txt 17 ms 2944 KB
1_54.txt 17 ms 2944 KB
1_55.txt 16 ms 2944 KB
1_56.txt 17 ms 2944 KB
1_57.txt 17 ms 2944 KB
1_58.txt 16 ms 2944 KB
1_59.txt 16 ms 2944 KB
1_60.txt 16 ms 2944 KB
1_61.txt 16 ms 2944 KB
1_62.txt 16 ms 2944 KB
1_63.txt 15 ms 2816 KB