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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
| #include <bits/stdc++.h>
#pragma optimization_level 3
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimization ("unroll-loops")
struct PairHash {inline std::size_t operator()(const std::pair<int,int> & v) const {return v.first*31+v.second;}};
#define MAX_N 10101
#define INF 987654321
#define EPS 1e-9
#define ll long long
#define pll pair<ll, ll>
#define vpll vector<pll>
#define vall3 vector<array<ll,3>>
#define all3 array<ll,3>
#define all5 array<ll,5>
#define vall5 vector<all5>
#define vll vector<ll>
#define vi vector<int>
#define vs vector<string>
#define usll unordered_set<ll>
#define uspll unordered_set<pll, PairHash>
#define vvs vector<vs>
#define vvll vector<vll>
#define all(a) begin(a), end(a)
#define rall(a) rbegin(a), rend(a)
using namespace std;
char now(queue<ll>& A, queue<ll>& B, queue<ll>& C) {
char now = '#';
ll pos = INT_MAX;
if(!A.empty() and A.front() < pos) {
now = 'a';
pos = A.front();
}
if(!B.empty() and B.front() < pos) {
now = 'b';
pos = B.front();
}
if(!C.empty() and C.front() < pos) {
now = 'c';
pos = C.front();
}
return now;
}
string solve(string& s, string& t) {
ll n = s.length();
queue<ll> qa, qb, qc;
for(ll i = 0; i < n; i++) {
if(s[i] == 'a') qa.push(i);
else if(s[i] == 'b') qb.push(i);
else if(s[i] == 'c') qc.push(i);
}
for(ll i = 0; i < n; i++) {
char ch = now(qa, qb, qc);
if(ch == t[i]) {
if(ch == 'a') qa.pop();
else if(ch == 'b') qb.pop();
else if(ch == 'c') qc.pop();
} else {
if(t[i] == 'a') return "NO";
if(t[i] == 'b') {
if(qb.empty()) return "NO";
ll b = qb.front();
if(!qc.empty() and qc.front() < b) return "NO";
qb.pop();
}
if(t[i] == 'c') {
if(qc.empty()) return "NO";
ll c = qc.front();
if(!qa.empty() and qa.front() < c) return "NO";
qc.pop();
}
}
}
return "YES";
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
ll tc = 1;
cin>>tc;
for(ll i = 1; i <= tc; i++) {
ll n;
string s, t;
cin>>n>>s>>t;
cout<<solve(s,t)<<endl;
}
return 0;
}
|
