提出 #38459272

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
typedef long long ll;
using namespace std;
const int maxn = 2e5 + 5;
int n;
ll k;
char a[maxn];
bool check(int l, int r) {
	for(int i = l, j = r; i < j; i++, j--) {
		if(a[i] != a[j]) {
			return 0;
		}
	}
	return 1;
}
void solve() {
	cin >> n >> k >> (a + 1);
	int d = k % (n * 2);
//	cout << d << '\n';
	if(d < n) {
		for(int i = 1; i <= d; i++) {
			if(a[i] != a[n - d + i]) {
				cout << "No\n";
				return;
			}
		}
		if(!check(d + 1, n) || !check(1, n - d)) {
			cout << "No\n";
			return;
		}
	}
	else {
		int l = d - n;
		if(!check(1, l) || !check(n - l + 1, n)) {
			cout << "No\n";
			return;
		}
		for(int i = 1; i <= n - l; i++) {
			if(a[i] != a[l + i]) {
				cout << "No\n";
				return;
			}
		}
	}
	cout << "Yes\n";
}
int main() {
#ifdef DEBUG
	freopen("1.in", "r", stdin);
#endif
	ios::sync_with_stdio(0);
	cin.tie(0);
	int T;
	cin >> T;
	while(T--) {
		solve();
	}
	return 0;
}

提出情報

ジャッジ結果