Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<vector>
- using namespace std;
- int t;
- int main(){
- cin >> t;
- while (t--){
- string s1, s2;
- cin >> s1;
- cin >> s2;
- vector <vector <char> > ss1 (max(s1.length(), s2.length())); vector <vector <char> > ss2 (max(s1.length(), s2.length()));
- int j = 0; ss1[j].push_back(s1[0]);
- for (int i = 1; i < s1.length(); ++i){
- if (ss1[j][0] == s1[i]) ss1[j].push_back(s1[i]);
- else{
- j++;
- ss1[j].push_back(s1[i]);
- }
- }
- int k = 0; ss2[k].push_back(s2[0]);
- for (int i = 1; i < s2.length(); ++i){
- if (ss2[k][0] == s2[i]) ss2[k].push_back(s2[i]);
- else{
- k++;
- ss2[k].push_back(s2[i]);
- }
- }
- bool ok = true;
- if (j == k){
- for (int i = 0; i < j + 1; ++i)
- if (ss1[i][0] != ss2[i][0] || ss1[i].size() > ss2[i].size()) ok = false;
- }
- if (j == k && ok) cout << "YES" << endl;
- else cout << "NO" << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment