提出 #67006098

---

ソースコード 拡げる

#include<bits/stdc++.h>
#include<atcoder/all>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
typedef long long ll;
typedef pair<int, int> P;

template <int m> ostream& operator<<(ostream& os, const static_modint<m>& a) {os << a.val(); return os;}
template <int m> ostream& operator<<(ostream& os, const dynamic_modint<m>& a) {os << a.val(); return os;}
template <int m> istream& operator>>(istream& is, static_modint<m>& a) {long long x; is >> x; a = x; return is;}
template <int m> istream& operator>>(istream& is, dynamic_modint<m>& a) {long long x; is >> x; a = x; return is;}
template<typename T> istream& operator>>(istream& is, vector<T>& v){int n = v.size(); assert(n > 0); rep(i, n) is >> v[i]; return is;}
template<typename U, typename T> ostream& operator<<(ostream& os, const pair<U, T>& p){os << p.first << ' ' << p.second; return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<T>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : " "); return os;}
template<typename T> ostream& operator<<(ostream& os, const vector<vector<T>>& v){int n = v.size(); rep(i, n) os << v[i] << (i == n - 1 ? "\n" : ""); return os;}
template<typename T> ostream& operator<<(ostream& os, const set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename T> ostream& operator<<(ostream& os, const unordered_set<T>& se){for(T x : se) os << x << " "; os << "\n"; return os;}
template<typename S, auto op, auto e> ostream& operator<<(ostream& os, const atcoder::segtree<S, op, e>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}
template<typename S, auto op, auto e, typename F, auto mapping, auto composition, auto id> ostream& operator<<(ostream& os, const atcoder::lazy_segtree<S, op, e, F, mapping, composition, id>& seg){int n = seg.max_right(0, [](S){return true;}); rep(i, n) os << seg.get(i) << (i == n - 1 ? "\n" : " "); return os;}

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);}

random_device rd;
mt19937 mt(rd());

int random_prime(){
    while (true){
        int pr = mt() % 100000000 + 900000000;
        if (atcoder::internal::is_prime_constexpr(pr)){
            return pr;
        }
    }
}

using ull = unsigned long long;

using mint1 = atcoder::dynamic_modint<1>;
using mint2 = atcoder::dynamic_modint<2>;

struct mints{
	mint1 d1;
	mint2 d2;
	mints(long long val = 0) : d1(val), d2(val) {}
	mints(mint1 d1, mint2 d2) : d1(d1), d2(d2) {}
	mints& operator++() {
		d1++; d2++;
		return *this;
	}
	mints& operator--() {
		d1--; d2--;
		return *this;
	}
	mints& operator+=(const mints& a) {
		d1 += a.d1;	d2 += a.d2;
		return *this;
	}
	mints& operator-=(const mints& a) {
		d1 -= a.d1;	d2 -= a.d2;
		return *this;
	}
	mints& operator*=(const mints& a) {
		d1 *= a.d1;	d2 *= a.d2;
		return *this;
	}
	mints& operator/=(const mints& a) { return *this = *this * a.inv(); }
	mints operator+() const { return *this; }
	mints operator-() const { return mints(0) - *this; }
	
	mints pow(long long n) const {
		return mints(d1.pow(n), d2.pow(n));
	}
	mints inv() const {
		return mints(d1.inv(), d2.inv());
	}
	
	mints operator+(const mints& a) const {
		return mints(d1 + a.d1, d2 + a.d2);
	}
	mints operator-(const mints& a) const {
		return mints(d1 - a.d1, d2 - a.d2);
	}
	mints operator*(const mints& a) const {
		return mints(d1 * a.d1, d2 * a.d2);
	}
	mints operator/(const mints& a) const {
		return mints(d1 / a.d1, d2 / a.d2);
	}
	bool operator==(const mints& a) const {
		return d1 == a.d1 and d2 == a.d2;
	}
	bool operator!=(const mints& a) const {
		return d1 != a.d1 or d2 != a.d2;
	}
    ull val(){
        return (ull(d1.val()) << 32) + ull(d2.val());
    };
};
ostream& operator<<(ostream& os, const mints& a) {os << a.d1 << '&' << a.d2; return os;}

const int base = 334;

void random_mod(){
	const int p1 = random_prime();
	const int p2 = random_prime();
	mint1::set_mod(p1);
	mint2::set_mod(p2);
}

struct RH{
	int n;
	string s;
	vector<mints> cum;
	RH(string s) : n(s.size()), s(s){
		mints tmp(0);
		cum.push_back(tmp);
		for(auto c : s){
			tmp *= base;
			tmp += (c - 'A' + 1);
			cum.push_back(tmp);
		}
	}
	mints get(int left, int right){
		return cum[right] - cum[left] * mints(base).pow(right - left);
	}
};

struct S{
	mints val, c;
	S(mints val, mints c) : val(val), c(c) {}
};
S op(S a, S b){
	S res(a.val * b.c + b.val, a.c * b.c);
	return res;
}
S e(){
	S e(mints(0), mints(1));
	return e;
}

using mint = modint998244353;

int main(){
	random_mod();
	
	int t;
	cin >> t;
	
	map<ull, mint> f;
	map<ull, mint> g;
	set<ull> se;
	
	auto getf = [&](mints key){
		if(f.find(key.val()) == f.end()) return f[key.val()] = 0;
		else return f[key.val()];
	};
	
	auto getg = [&](mints key){
		if(g.find(key.val()) == g.end()) return g[key.val()] = 1;
		else return g[key.val()];
	};
	
	rep(_, t){
		string s;
		cin >> s;
		
		int n = s.size();
		
		RH rh(s);
		se.insert(rh.get(0, n).val());
		
		for(int x = n; x >= 0; x--){
			mints key = rh.get(0, x);
			mints keya = key * base + 1;
			mints keyb = key * base + 2;
			
			mint sum = (getf(keya) + getg(keya)) * (getf(keyb) + getg(keyb));
			if(se.find(key.val()) == se.end()){
				f[key.val()] = getf(keya) * getf(keyb);
				g[key.val()] = sum - getf(keya) * getf(keyb);
			}else{
				f[key.val()] = sum + getf(keya) * getf(keyb);
				g[key.val()] = sum - getf(keya) * getf(keyb);
			}
//			cout << f[key.val()] << "\n";
//			cout << g[key.val()] << "\n";
			
//			cerr << key.val() << "\n";
//			cerr << keya.val() << "\n";
//			cerr << keyb.val() << "\n";
		}
//		cout << "\n";
		cout << f[rh.get(0, 0).val()] << "\n";
	}
	
	return 0;
}

提出情報

ジャッジ結果