結果

問題 No.465 PPPPPPPPPPPPPPPPAPPPPPPPP
ユーザー heno239heno239
提出日時 2022-10-18 06:16:36
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 74 ms / 2,000 ms
コード長 7,822 bytes
コンパイル時間 2,331 ms
コンパイル使用メモリ 161,688 KB
実行使用メモリ 32,812 KB
最終ジャッジ日時 2023-09-11 02:10:50
合計ジャッジ時間 4,694 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 14 ms
19,964 KB
testcase_01 AC 13 ms
19,888 KB
testcase_02 AC 13 ms
19,784 KB
testcase_03 AC 13 ms
19,956 KB
testcase_04 AC 14 ms
19,888 KB
testcase_05 AC 17 ms
21,880 KB
testcase_06 AC 34 ms
30,744 KB
testcase_07 AC 19 ms
21,852 KB
testcase_08 AC 38 ms
30,196 KB
testcase_09 AC 32 ms
30,852 KB
testcase_10 AC 31 ms
30,732 KB
testcase_11 AC 74 ms
30,468 KB
testcase_12 AC 70 ms
27,348 KB
testcase_13 AC 48 ms
25,464 KB
testcase_14 AC 57 ms
30,808 KB
testcase_15 AC 41 ms
32,812 KB
testcase_16 AC 47 ms
32,384 KB
testcase_17 AC 47 ms
32,408 KB
testcase_18 AC 49 ms
32,400 KB
testcase_19 AC 50 ms
32,728 KB
testcase_20 AC 35 ms
30,692 KB
testcase_21 AC 42 ms
30,820 KB
32_ratsliveonnoevilstar.txt AC 41 ms
32,600 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//constexpr ll mod = 998244353;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 21;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
	a = abs(a); b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
//-----------------------------------------
void manacher(const string& s, vector<int>& r) {
	r.resize(s.size());
	int i = 0, j = 0;
	while (i < s.size()) {
		while (i - j >= 0 && i + j < s.size() && s[i - j] == s[i + j])++j;
		r[i] = j;
		int k = 1;
		while (i - k >= 0 && i + k < s.size() && k + r[i - k] < j)r[i + k] = r[i - k], ++k;
		i += k; j -= k;
	}
}
int calc(vector<int> v) {
	int res = 0;
	rep(i, v.size()) {
		res++;
		if (i + 1 == v.size())break;
		while (i + 2 < v.size() && v[i + 1] - v[i] == v[i + 2] - v[i + 1]) {
			i++;
		}
		i++;
	}
	return res;
}
//first,dif,length
using ar = array<int, 3>;
vector<ar> trans(vector<int> v) {
	vector<ar> res;
	rep(i, v.size()) {
		if (i + 1 == v.size()) {
			res.push_back({ v[i],1,1 });
			break;
		}
		int mem = v[i];
		int len = 2;
		while (i + 2 < v.size() && v[i + 1] - v[i] == v[i + 2] - v[i + 1]) {
			i++; len++;
		}
		res.push_back({ mem,v[i + 1] - v[i], len });
		i++;
	}
	return res;
}
void solve() {
	string s; cin >> s;
	int n = s.size();
	string al;
	rep(i, s.size()) {
		if (i > 0)al.push_back('?');
		al.push_back(s[i]);
	}
	vector<int> va;
	manacher(al, va);
	vector<int> v0;
	rep(i, al.size()) {
		if (i + 1 - va[i] == 0) {
			int ri = 2 * (va[i] - 1);
			int len = ri / 2 + 1;
			v0.push_back(len);
		}
	}
	sort(all(v0));
	vector<ar> vs = trans(v0);
	ll ans = 0;

	vector<int> cr(n);
	rep(i, al.size()) {
		if (i + va[i] - 1 == 2 * (n - 1)) {
			int le = i - (va[i] - 1);
			le /= 2;
			if (le > 0)cr[le - 1]++;
		}
	}
	per(i, n - 1)cr[i] += cr[i + 1];
	//coutarray(cr);
	for (auto p : vs) {
		vector<ll> rsum(n);
		int dif = p[1];
		//cout << "wow " << p[0] << " " << p[1] << " " << p[2] << "\n";
		per(i, n) {
			rsum[i] += cr[i];
			if (i + dif < n)rsum[i] += rsum[i + dif];
		}
		rep(i, al.size()) {
			int bl, br, len;
			if (i % 2) {
				if (va[i] == 1)continue;
				bl = (i - 1) / 2;
				br = (i + 1) / 2;
				len = va[i] / 2;
			}
			else {
				bl = i / 2;
				br = i / 2;
				len = (va[i] + 1) / 2;
			}
			//for j in range(len)
			//[bl-j,br+j] is paindrome
			if (p[0] > bl)continue;
			int d = (bl - p[0]) / dif;
			int dr = min(d, p[2] - 1);
			int sl = bl - (len - 1);
			int dl;
			if (sl < p[0])dl = 0;
			else {
				dl = (sl-p[0] + dif - 1) / dif;
			}
			//cout << "?? " << i << " " << bl<<" "<<br<<" "<<dl << " " << dr << "\n";
			if (dl <= dr) {
				int clen = dr - dl + 1;
				int cj = bl - (p[0] + dr * dif);
				int si = br + cj + 1;
				//cout << "e? " << si <<" "<<dif<<" "<<clen<< "\n";
				//si,si+dif,...,si+dif*(clen-1);
				ll val = 0;
				if (si < n)val = rsum[si];
				if (si + dif * clen < n)val -= rsum[si + dif * clen];
				ans += val;
				//cout << val << "\n";
			}
		}
	}
	cout << ans << "\n";
}





signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout << fixed << setprecision(10);
	//init_f();
	//init();
	//expr();
	//while(true)
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0