-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy path2094D.cpp
More file actions
70 lines (59 loc) · 1.06 KB
/
2094D.cpp
File metadata and controls
70 lines (59 loc) · 1.06 KB
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
#include <bits/stdc++.h>
#define endl "\n"
#define ll long long
using namespace std;
void init_code() {
ios::sync_with_stdio(0);
cin.tie(0);
#ifndef ONLINE_JUDGE
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
void solve() {
string a, b; cin >> a >> b;
int n = a.size();
int m = b.size();
if (m < n || m > 2 * n || a[0] != b[0]) {
cout << "NO\n";
return;
}
vector<int> aa, bb;
int cnt = 1;
for (int i = 1; i < n; i++) {
if (a[i] != a[i-1]) {
aa.push_back(cnt);
cnt = 1;
}
else cnt++;
}
aa.push_back(cnt);
cnt = 1;
for (int i = 1; i < m; i++) {
if (b[i] != b[i-1]) {
bb.push_back(cnt);
cnt = 1;
}
else cnt++;
}
bb.push_back(cnt);
if (aa.size() != bb.size()) {
cout << "NO\n";
return;
}
n = aa.size();
for (int i = 0; i < n; i++) {
if (aa[i] > bb[i] || aa[i] * 2 < bb[i]) {
cout << "NO\n";
return;
}
}
cout << "YES\n";
}
int main() {
init_code();
int t;
cin >> t;
while (t--) solve();
return 0;
}