prefix and suffix array codeforces solution contest

[bytebuster-euuw]

Code is-
#include <bits/stdc++.h>
using namespace std;

int main()
{

int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
vector<string> a(2 * (n - 1));
for (int i = 0; i < 2 * (n - 1); i++)
{
cin >> a[i];
}
vector<string> s;
for (int i = 0; i < 2 * (n - 1); i++)
{
if (a[i].size() == n - 1)
s.push_back(a[i]);
}
if (s[0].substr(1) != s[1].substr(0, n - 2))
{
swap(s[0], s[1]);
}
string t = s[0] + s[1][n - 2];
string tm = t;
reverse(tm.begin(), tm.end());
if (t == tm)
{
cout << "YES" << endl;
}
else
cout << "NO" << endl;
}
return 0;
}