2020/quals/travel_restrictions.cpp

// Travel Restrictions
// Solution by Jacob Plachta

#include <algorithm>
#include <functional>
#include <numeric>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <cstring>
#include <cassert>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <sstream>
using namespace std;

#define LL long long
#define LD long double
#define PR pair<int,int>

#define Fox(i,n) for (i=0; i<n; i++)
#define Fox1(i,n) for (i=1; i<=n; i++)
#define FoxI(i,a,b) for (i=a; i<=b; i++)
#define FoxR(i,n) for (i=(n)-1; i>=0; i--)
#define FoxR1(i,n) for (i=n; i>0; i--)
#define FoxRI(i,a,b) for (i=b; i>=a; i--)
#define Foxen(i,s) for (i=s.begin(); i!=s.end(); i++)
#define Min(a,b) a=min(a,b)
#define Max(a,b) a=max(a,b)
#define Sz(s) int((s).size())
#define All(s) (s).begin(),(s).end()
#define Fill(s,v) memset(s,v,sizeof(s))
#define pb push_back
#define mp make_pair
#define x first
#define y second

template<typename T> T Abs(T x) { return(x < 0 ? -x : x); }
template<typename T> T Sqr(T x) { return(x * x); }
string plural(string s) { return(Sz(s) && s[Sz(s) - 1] == 'x' ? s + "en" : s + "s"); }

const int INF = (int)1e9;
const LD EPS = 1e-12;
const LD PI = acos(-1.0);

#define GETCHAR getchar_unlocked

bool Read(int& x) {
  char c, r = 0, n = 0;
  x = 0;
  for (;;) {
    c = GETCHAR();
    if ((c < 0) && (!r))
      return(0);
    if ((c == '-') && (!r))
      n = 1;
    else if ((c >= '0') && (c <= '9'))
      x = x * 10 + c - '0', r = 1;
    else if (r)
      break;
  }
  if (n)
    x = -x;
  return(1);
}

#define LIM 55

int N;
char I[LIM], O[LIM];
bool P[LIM][LIM];

void ProcessCase()
{
  // input
  Read(N);
  scanf("%s%s", I, O);
  // simulate rightward trips
  int i, j;
  Fill(P, 0);
  Fox(i, N)
  {
    j = i;
    for (;;)
    {
      P[i][j] = 1;
      if (j + 1 == N || O[j] == 'N' || I[j + 1] == 'N')
        break;
      j++;
    }
  }
  // simulate leftward trips
  Fox(i, N)
  {
    j = i;
    for (;;)
    {
      P[i][j] = 1;
      if (j - 1 < 0 || O[j] == 'N' || I[j - 1] == 'N')
        break;
      j--;
    }
  }
  // output
  Fox(i, N)
  {
    Fox(j, N)
      printf("%c", P[i][j] ? 'Y' : 'N');
    printf("\n");
  }
}

int main() {
  int T, t;
  Read(T);
  Fox1(t, T)
  {
    printf("Case #%d:\n", t);
    ProcessCase();
  }
  return(0);
}