結果

問題 No.2131 Concon Substrings (COuNt Version)
ユーザー 👑 deuteridayodeuteridayo
提出日時 2022-11-25 21:43:29
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 893 ms / 2,000 ms
コード長 2,827 bytes
コンパイル時間 4,773 ms
コンパイル使用メモリ 264,624 KB
実行使用メモリ 496,256 KB
最終ジャッジ日時 2024-04-10 02:56:43
合計ジャッジ時間 11,104 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,816 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 1 ms
6,944 KB
testcase_03 AC 390 ms
227,072 KB
testcase_04 AC 2 ms
6,944 KB
testcase_05 AC 2 ms
6,940 KB
testcase_06 AC 2 ms
6,944 KB
testcase_07 AC 893 ms
496,256 KB
testcase_08 AC 228 ms
126,720 KB
testcase_09 AC 878 ms
495,872 KB
testcase_10 AC 877 ms
493,824 KB
testcase_11 AC 605 ms
345,728 KB
testcase_12 AC 568 ms
327,808 KB
testcase_13 AC 2 ms
6,940 KB
testcase_14 AC 259 ms
147,456 KB
testcase_15 AC 211 ms
119,680 KB
testcase_16 AC 3 ms
6,940 KB
testcase_17 AC 190 ms
107,008 KB
testcase_18 AC 193 ms
108,544 KB
testcase_19 AC 97 ms
56,064 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
using lint = long long;
using ulint = unsigned long long;
#define endl '\n'
int const INF = 1<<30;
lint const INF64 = 1LL<<61;
// lint const mod = 1e9+7;
long const mod = 998244353;
using mint = modint998244353;
lint ceilDiv(lint x, lint y){if(x >= 0){return (x+y-1)/y;}else{return x/y;}}
lint floorDiv(lint x, lint y){if(x >= 0){return x/y;}else{return (x-y+1)/y;}}
lint Sqrt(lint x){lint upper = 1e9;lint lower = 0;while(upper - lower > 0){lint mid = (1+upper + lower)/2;if(mid * mid > x){upper = mid-1;}else{lower = mid;}}return upper;}
lint gcd(lint a,lint b){if(a<b)swap(a,b);if(a%b==0)return b;else return gcd(b,a%b);}
lint lcm(lint a,lint b){return (a / gcd(a,b)) * b;}
lint chmin(vector<lint>&v){lint ans = INF64;for(lint i:v){ans = min(ans, i);}return ans;}
lint chmax(vector<lint>&v){lint ans = -INF64;for(lint i:v){ans = max(ans, i);}return ans;}
double dist(double x1, double y1, double x2, double y2){return sqrt(pow(x1-x2, 2) + pow(y1-y2,2));}
string toString(lint n){string ans = "";if(n == 0){ans += "0";}else{while(n > 0){int a = n%10;char b = '0' + a;string c = "";c += b;n /= 10;ans = c + ans;}}return ans;}
string toString(lint n, lint k){string ans = toString(n);string tmp = "";while(ans.length() + tmp.length() < k){tmp += "0";}return tmp + ans;}
vector<lint>prime;void makePrime(lint n){prime.push_back(2);for(lint i=3;i<=n;i+=2){bool chk = true;for(lint j=0;j<prime.size() && prime[j]*prime[j] <= i;j++){if(i % prime[j]==0){chk=false;break;}}if(chk)prime.push_back(i);}}
lint Kai[20000001]; bool firstCallnCr = true; 
lint ncrmodp(lint n,lint r,lint p){ if(firstCallnCr){ Kai[0] = 1; for(int i=1;i<=20000000;i++){ Kai[i] = Kai[i-1] * i; Kai[i] %= mod;} firstCallnCr = false;} if(n<0)return 0;
if(n < r)return 0;if(n==0)return 1;lint ans = Kai[n];lint tmp = (Kai[r] * Kai[n-r]) % p;for(lint i=1;i<=p-2;i*=2){if(i & p-2){ans *= tmp;ans %= p;}tmp *= tmp;tmp %= p;}return ans;}
#define rep(i, n) for(int i = 0; i < n; i++)
#define repp(i, x, y) for(int i = x; i < y; i++)
#define vec vector

struct edge{
    int to;
};
using graph = vector<vector<edge>>;

int main(){
    lint n;
    cin >> n;
    vec<vec<vec<mint>>>dp(n+1, vec<vec<mint>>(n+2, vec<mint>(3, 0)));
    dp[0][0][0] = 1;
    rep(i, n) {
        for(int j = n; j >= 0; j--) { 

            dp[i+1][j+1][0] += dp[i][j][2]; 
            dp[i+1][j][0] += dp[i][j][0] * 25;
            dp[i+1][j][1] += dp[i][j][0] + dp[i][j][1] * 25;
            dp[i+1][j][2] += dp[i][j][1] + dp[i][j][2] * 25;
        }
    }
    mint ans = 0;
    rep(i, n+1) {
        // cerr << i << " ";
        rep(j, 3) {
            ans += dp[n][i][j] * i;
            // cerr << dp[n][i][j].val() << " ";
        }
        cerr << endl;
    }
    cout << ans.val() << endl;
}
0