結果

問題 No.1740 Alone 'a'
ユーザー kaikeykaikey
提出日時 2021-11-12 22:01:13
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 53 ms / 2,000 ms
コード長 6,092 bytes
コンパイル時間 2,151 ms
コンパイル使用メモリ 212,964 KB
実行使用メモリ 32,940 KB
最終ジャッジ日時 2023-08-17 01:27:33
合計ジャッジ時間 4,597 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 1 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 53 ms
32,936 KB
testcase_04 AC 52 ms
32,940 KB
testcase_05 AC 4 ms
4,380 KB
testcase_06 AC 3 ms
4,376 KB
testcase_07 AC 2 ms
4,376 KB
testcase_08 AC 1 ms
4,500 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 1 ms
4,376 KB
testcase_11 AC 11 ms
8,652 KB
testcase_12 AC 42 ms
27,192 KB
testcase_13 AC 40 ms
25,888 KB
testcase_14 AC 49 ms
31,404 KB
testcase_15 AC 2 ms
4,376 KB
testcase_16 AC 40 ms
24,808 KB
testcase_17 AC 2 ms
4,376 KB
testcase_18 AC 8 ms
6,800 KB
testcase_19 AC 42 ms
27,192 KB
testcase_20 AC 26 ms
15,508 KB
testcase_21 AC 35 ms
20,212 KB
testcase_22 AC 38 ms
23,560 KB
testcase_23 AC 36 ms
23,492 KB
testcase_24 AC 26 ms
15,724 KB
testcase_25 AC 26 ms
15,788 KB
testcase_26 AC 33 ms
19,940 KB
testcase_27 AC 37 ms
21,200 KB
testcase_28 AC 31 ms
17,888 KB
testcase_29 AC 50 ms
31,420 KB
testcase_30 AC 36 ms
20,748 KB
testcase_31 AC 38 ms
24,228 KB
testcase_32 AC 31 ms
18,432 KB
testcase_33 AC 38 ms
23,952 KB
testcase_34 AC 10 ms
7,600 KB
testcase_35 AC 30 ms
17,556 KB
testcase_36 AC 26 ms
15,252 KB
testcase_37 AC 9 ms
7,540 KB
testcase_38 AC 21 ms
13,120 KB
testcase_39 AC 4 ms
4,740 KB
testcase_40 AC 12 ms
9,396 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include "bits/stdc++.h"
#include <random>
#include <chrono>
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define SZ(x) ((lint)(x).size())
#define FOR(i, begin, end) for(lint i=(begin),i##_end_=(end);i<i##_end_;++i)
#define IFOR(i, begin, end) for(lint i=(end)-1,i##_begin_=(begin);i>=i##_begin_;--i)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
#define endk '\n'
using namespace std; typedef unsigned long long _ulong; typedef long long int lint; typedef long double ld; typedef pair<lint, lint> plint; typedef pair<ld, ld> pld;
struct fast_ios { fast_ios() { cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
template<class T> auto add = [](T a, T b) -> T { return a + b; };
template<class T> auto mul = [](T a, T b) -> T { return a * b; };
template<class T> auto f_max = [](T a, T b) -> T { return max(a, b); };
template<class T> auto f_min = [](T a, T b) -> T { return min(a, b); };
template<class T> using V = vector<T>;
using Vl = V<lint>; using VVl = V<Vl>;
template< typename T > ostream& operator<<(ostream& os, const vector< T >& v) {
    for (int i = 0; i < (int)v.size(); i++) os << v[i] << (i + 1 != v.size() ? " " : "");
    return os;
}
template< typename T >istream& operator>>(istream& is, vector< T >& v) {
    for (T& in : v) is >> in;
    return is;
}
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; }
template <class T>
T div_floor(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
    if (b < 0) a *= -1, b *= -1;
    return a > 0 ? (a - 1) / b + 1 : a / b;
}
template <class F> struct rec {
    F f;
    rec(F&& f_) : f(std::forward<F>(f_)) {}
    template <class... Args> auto operator()(Args &&... args) const {
        return f(*this, std::forward<Args>(args)...);
    }
};
lint gcd(lint a, lint b) { if (b == 0) return a; else return gcd(b, a % b); }
lint digit(lint a) { return (lint)log10(a); }
lint e_dist(plint a, plint b) { return abs(a.first - b.first) * abs(a.first - b.first) + abs(a.second - b.second) * abs(a.second - b.second); }
lint m_dist(plint a, plint b) { return abs(a.first - b.first) + abs(a.second - b.second); }
bool check_overflow(lint a, lint b, lint limit) { if (b == 0) return false; return a > limit / b; } // a * b > c => true
void Worshall_Floyd(VVl& g) { REP(k, SZ(g)) REP(i, SZ(g)) REP(j, SZ(g)) chmin(g[i][j], g[i][k] + g[k][j]); }
const lint MOD1000000007 = 1000000007, MOD998244353 = 998244353, INF = 2e9;
lint dx[8] = { 0, -1, 0, 1, 1, -1, 1, -1 }, dy[8] = { -1, 0, 1, 0, -1, -1, 1, 1 };
bool YN(bool flag) { cout << (flag ? "YES" : "NO") << endk; return flag; } bool yn(bool flag) { cout << (flag ? "Yes" : "No") << endk; return flag; }
struct Edge {
    lint from, to;
    lint cost;
    Edge() {

    }
    Edge(lint u, lint v, lint c) {
        cost = c;
        from = u;
        to = v;
    }
    bool operator<(const Edge& e) const {
        return cost < e.cost;
    }
};
struct WeightedEdge {
    lint to;
    lint cost;
    WeightedEdge(lint v, lint c = 1) {
        to = v;
        cost = c;
    }
    bool operator<(const WeightedEdge& e) const {
        return cost < e.cost;
    }
};
using WeightedGraph = V<V<WeightedEdge>>;
typedef pair<plint, lint> tlint;
typedef pair<tlint, plint> qlint;
typedef pair<string, lint> valstr;
typedef pair<Vl, lint> valv;

template <std::int_fast64_t Modulus>
class modint
{
	using u64 = std::int_fast64_t;

public:
	u64 a;
	constexpr modint(const u64 x = 0) noexcept : a(x% Modulus) {}
	constexpr u64& value() noexcept { return a; }
	constexpr const u64& value() const noexcept { return a; }
	constexpr modint operator+(const modint rhs) const noexcept
	{
		return modint(*this) += rhs;
	}
	constexpr modint operator-(const modint rhs) const noexcept
	{
		return modint(*this) -= rhs;
	}
	constexpr modint operator*(const modint rhs) const noexcept
	{
		return modint(*this) *= rhs;
	}
	constexpr modint operator/(const modint rhs) const noexcept
	{
		return modint(*this) /= rhs;
	}
	constexpr modint& operator+=(const modint rhs) noexcept
	{
		a += rhs.a;
		if (a >= Modulus)
		{
			a -= Modulus;
		}
		return *this;
	}
	constexpr modint& operator-=(const modint rhs) noexcept
	{
		if (a < rhs.a)
		{
			a += Modulus;
		}
		a -= rhs.a;
		return *this;
	}
	constexpr modint& operator*=(const modint rhs) noexcept
	{
		a = a * rhs.a % Modulus;
		return *this;
	}
	constexpr modint& operator/=(modint rhs) noexcept
	{
		u64 exp = Modulus - 2;
		while (exp)
		{
			if (exp % 2)
			{
				*this *= rhs;
			}
			rhs *= rhs;
			exp /= 2;
		}
		return *this;
	}
};
typedef modint<MOD998244353> ModInt;

ModInt mod_pow(ModInt x, lint n) {
	ModInt ret = 1;
	while (n > 0) {
		if (n & 1) (ret *= x);
		(x *= x);
		n >>= 1;
	}
	return ret;
}

ModInt func[200000];
void funcinit(int N)
{
	func[0] = 1;
	for (int i = 1; i <= N; i++)
	{
		func[i] = func[i - 1] * i;
	}
}
ModInt comb(ModInt n, ModInt r)
{
	if (n.a <= 0 || n.a < r.a)
	{
		return 1;
	}
	return func[n.a] / (func[r.a] * func[(n - r).a]);
}

int main() {
	lint N;
	string s;
	cin >> N >> s;
	V<V<V<ModInt>>> dp(N + 1, V<V<ModInt>>(2, V<ModInt>(2)));
	dp[0][0][0] = 1;
	REP(i, N) {
		lint d = s[i] - 'a';
		if (d == 0) {
			dp[i + 1][0][1] += dp[i][0][0];
			dp[i + 1][1][1] += dp[i][1][0];
			dp[i + 1][1][0] += dp[i][0][0] * d;
			dp[i + 1][1][0] += dp[i][1][0] * 25;
			dp[i + 1][1][1] += dp[i][1][1] * 25;
		}
		else {
			dp[i + 1][0][0] += dp[i][0][0]; //dを使う
			dp[i + 1][0][1] += dp[i][0][1]; //dを使う
			dp[i + 1][1][1] += dp[i][0][0]; //aを使う
			dp[i + 1][1][1] += dp[i][1][0]; //aを使う
			dp[i + 1][1][0] += dp[i][0][0] * (d - 1);
			dp[i + 1][1][1] += dp[i][0][1] * (d - 1);
			dp[i + 1][1][0] += dp[i][1][0] * 25;
			dp[i + 1][1][1] += dp[i][1][1] * 25;
		}
	}
	cout << dp[N][1][1].a << endk;
}
0