-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy patha.cpp
47 lines (42 loc) · 1.41 KB
/
a.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
freopen("a.txt", "w", stdout);
int T; cin >> T;
for(int tc = 1; tc <= T; tc++){
int N; cin >> N;
string si, so; cin >> si >> so;
string adj[N];
for(int i = 0; i < N; i++){
string curr (N, 'N');
curr[i] = 'Y';
for(int j = i+1; j < N; j++){
if(so[j-1] == 'N' || si[j] == 'N') break;
curr[j] = 'Y';
}
for(int j = i-1; j >= 0; j--){
if(so[j+1] == 'N' || si[j] == 'N') break;
curr[j] = 'Y';
}
adj[i] = curr;
}
cout << "Case #" << tc << ":" << endl;
for(int i = 0; i < N; i++){
cout << adj[i] << endl;
}
}
return 0;
}