結果

問題 No.599 回文かい
ユーザー __math__math
提出日時 2017-11-24 22:39:20
言語 C++11
(gcc 11.4.0)
結果
WA  
実行時間 -
コード長 5,460 bytes
コンパイル時間 1,623 ms
コンパイル使用メモリ 164,100 KB
実行使用メモリ 5,376 KB
最終ジャッジ日時 2024-05-05 11:08:40
合計ジャッジ時間 2,801 ms
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 1 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 1 ms
5,376 KB
testcase_04 AC 1 ms
5,376 KB
testcase_05 WA -
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 1 ms
5,376 KB
testcase_08 AC 1 ms
5,376 KB
testcase_09 AC 1 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 WA -
testcase_14 WA -
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 1 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 1 ms
5,376 KB
evil_0.txt WA -
権限があれば一括ダウンロードができます

ソースコード

diff #

#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

template<int a, int m>
struct hasher {
public:
	struct X {
		int hash;
		int len;
		X() : hash(0), len(0) {}
		X(int hash, int len) : hash(hash), len(len) {
			this->hash %= m;
			if (this->hash < 0) this->hash += m;
		}
	};
	const int n;
	vector<int> mtbl;
	vector<int> h, rh;

	hasher(const string& s) : n(sz(s)), mtbl(sz(s) + 1), h(sz(s) + 1), rh(sz(s) + 1) {
		h[0] = rh[0] = 0;
		FOR(i, n) h[i + 1] = (ll(h[i]) * a + s[i]) % m;
		FOR(i, n) rh[i + 1] = (ll(rh[i]) * a + s[n - i - 1]) % m;
		mtbl[0] = 1;
		FOR(i, n) mtbl[i + 1] = ll(mtbl[i]) * a % m;
	}
	X substr(int l, int r) const {
		assert(l <= r);
		return X(ll(h[r] - ll(h[l]) * mtbl[r - l]) % m, r - l);
	}

	X revsubstr(int l, int r) const {
		assert(l <= r);
		return X(ll(rh[n - l] - ll(rh[n - r]) * mtbl[r - l]) % m, r - l);
	}
	// l + r
	X add(X l, X r) const {
		X ret;
		ret.hash = (ll(l.hash) * mtbl[r.len] + r.hash) % m;
		ret.len = l.len + r.len;
		return ret;
	}
};

struct Matcher {
	using H1 = hasher<ten(8) + 7, ten(9) + 7>;
	using H2 = hasher<ten(8) + 7, ten(9) + 9>;

	H1 h1;
	H2 h2;

	Matcher(string& s) :h1(s), h2(s) {
	}

	bool match(int l1, int r1, int l2, int r2) {
		if (r1 - l1 != r2 - l2) return false;
		if (h1.substr(l1, r1).hash != h1.substr(l2, r2).hash) return false;
		if (h2.substr(l1, r1).hash != h2.substr(l2, r2).hash) return false;
		return true;
	}
};

int dp[ten(4)];
string s;

ll solve(int i, Matcher& matcher) {
	if (dp[i] != -1) return dp[i];
	auto& ans = dp[i];
	ans = 1;
	const int r = sz(s) - i;
	for (int len = 1; i + len <= r - len; len++) {
		bool b = matcher.match(i, i + len, r - len, r);
		if (!b) continue;
		ll cur = solve(i + len, matcher);
		ans += cur;
	}

	return ans %= (ten(9)+7);
}

int main() {
	 reader(s);
	Matcher matcher(s);

	memset(dp, -1, sizeof(dp));

	auto ans = solve(0, matcher);
	writerLn(ans);

	return 0;
}
0