《补题》(Codeforces Round 856 (Div. 2), problem: (A) Prefix and Suffix Array)

97 阅读1分钟

思维 + 反向迭代器

#include <bits/stdc++.h>

using i64 = long long;

void solve() {
	int n;
	std::cin >> n;

	std::vector<std::string> a;
	for (int i = 0; i < 2 * n - 2; i++) {
		std::string s;
		std::cin >> s;

		if (s.size() == n - 1) {
			a.push_back(s);
		}
	}

	// if (a[0] == std::string(a[1].rbegin(), a[1].rend())) {
	// 	std::cout << "YES\n";
	// } else {
	// 	std::cout << "NO\n";
	// }

	std::cout << (a[0] == std::string(a[1].rbegin(), a[1].rend()) ? "YES\n" : "NO\n");
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);

	int t;
	std::cin >> t;

	while (t--) {
		solve();
	}

	return 0;
}