結果
問題 | No.1504 ヌメロニム |
ユーザー | SSRS |
提出日時 | 2021-05-07 22:54:42 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 593 ms / 2,000 ms |
コード長 | 2,512 bytes |
コンパイル時間 | 2,373 ms |
コンパイル使用メモリ | 174,608 KB |
実行使用メモリ | 76,272 KB |
最終ジャッジ日時 | 2023-10-13 14:13:35 |
合計ジャッジ時間 | 15,921 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,352 KB |
testcase_01 | AC | 1 ms
4,352 KB |
testcase_02 | AC | 1 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,352 KB |
testcase_04 | AC | 1 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,352 KB |
testcase_07 | AC | 2 ms
4,352 KB |
testcase_08 | AC | 2 ms
4,352 KB |
testcase_09 | AC | 1 ms
4,352 KB |
testcase_10 | AC | 2 ms
4,356 KB |
testcase_11 | AC | 2 ms
4,352 KB |
testcase_12 | AC | 2 ms
4,352 KB |
testcase_13 | AC | 1 ms
4,352 KB |
testcase_14 | AC | 1 ms
4,352 KB |
testcase_15 | AC | 2 ms
4,352 KB |
testcase_16 | AC | 2 ms
4,348 KB |
testcase_17 | AC | 2 ms
4,348 KB |
testcase_18 | AC | 2 ms
4,348 KB |
testcase_19 | AC | 1 ms
4,348 KB |
testcase_20 | AC | 5 ms
4,348 KB |
testcase_21 | AC | 3 ms
4,352 KB |
testcase_22 | AC | 5 ms
4,352 KB |
testcase_23 | AC | 2 ms
4,352 KB |
testcase_24 | AC | 571 ms
75,260 KB |
testcase_25 | AC | 282 ms
39,484 KB |
testcase_26 | AC | 593 ms
76,044 KB |
testcase_27 | AC | 292 ms
40,144 KB |
testcase_28 | AC | 295 ms
40,108 KB |
testcase_29 | AC | 575 ms
75,588 KB |
testcase_30 | AC | 569 ms
75,716 KB |
testcase_31 | AC | 284 ms
39,664 KB |
testcase_32 | AC | 290 ms
40,104 KB |
testcase_33 | AC | 580 ms
75,544 KB |
testcase_34 | AC | 69 ms
12,280 KB |
testcase_35 | AC | 62 ms
12,020 KB |
testcase_36 | AC | 256 ms
38,324 KB |
testcase_37 | AC | 33 ms
7,844 KB |
testcase_38 | AC | 583 ms
75,984 KB |
testcase_39 | AC | 581 ms
76,052 KB |
testcase_40 | AC | 580 ms
76,008 KB |
testcase_41 | AC | 580 ms
75,996 KB |
testcase_42 | AC | 578 ms
76,088 KB |
testcase_43 | AC | 574 ms
76,124 KB |
testcase_44 | AC | 581 ms
76,000 KB |
testcase_45 | AC | 590 ms
76,272 KB |
testcase_46 | AC | 591 ms
76,052 KB |
testcase_47 | AC | 582 ms
76,052 KB |
testcase_48 | AC | 282 ms
39,792 KB |
testcase_49 | AC | 277 ms
39,460 KB |
testcase_50 | AC | 5 ms
4,352 KB |
testcase_51 | AC | 3 ms
4,356 KB |
testcase_52 | AC | 2 ms
4,348 KB |
testcase_53 | AC | 3 ms
4,352 KB |
testcase_54 | AC | 2 ms
4,352 KB |
testcase_55 | AC | 62 ms
11,884 KB |
testcase_56 | AC | 1 ms
4,352 KB |
testcase_57 | AC | 2 ms
4,348 KB |
testcase_58 | AC | 2 ms
4,352 KB |
testcase_59 | AC | 1 ms
4,348 KB |
testcase_60 | AC | 1 ms
4,352 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; const long long MOD = 998244353; long long modpow(long long a, long long b){ long long ans = 1; while (b > 0){ if (b % 2 == 1){ ans *= a; ans %= MOD; } a *= a; a %= MOD; b /= 2; } return ans; } long long modinv(long long a){ return modpow(a, MOD - 2); } vector<long long> mf = {1}; long long modfact(int n){ if (mf.size() > n){ return mf[n]; } else { for (int i = mf.size(); i <= n; i++){ long long next = mf.back() * i % MOD; mf.push_back(next); } return mf[n]; } } vector<long long> ntt(vector<long long> A, bool inv){ int N = A.size(); long long r = 3; if (inv){ r = modinv(r); } vector<long long> B(N); for (int i = N / 2; i > 0; i /= 2){ long long z = modpow(r, (MOD - 1) / (N / i)); long long z2 = 1; for (int j = 0; j < N; j += i * 2){ for (int k = 0; k < i; k++){ A[i + j + k] *= z2; A[i + j + k] %= MOD; B[j / 2 + k] = (A[j + k] + A[i + j + k]) % MOD; B[N / 2 + j / 2 + k] = (A[j + k] - A[i + j + k] + MOD) % MOD; } z2 = z2 * z % MOD; } swap(A, B); } if (inv){ int Ninv = modinv(N); for (int i = 0; i < N; i++){ A[i] = A[i] * Ninv % MOD; } } return A; } vector<long long> convolution(vector<long long> A, vector<long long> B, int d = -1){ int deg = A.size() + B.size() - 1; int N = 1; while (N < deg){ N *= 2; } A.resize(N); B.resize(N); A = ntt(A, false); B = ntt(B, false); vector<long long> ans(N); for (int i = 0; i < N; i++){ ans[i] = A[i] * B[i] % MOD; } ans = ntt(ans, true); if (d != -1){ deg = d; } ans.resize(deg); return ans; } int main(){ int N; cin >> N; string S; cin >> S; vector<long long> f1(N, 0); for (int i = 0; i < N; i++){ if (S[i] == 'i'){ f1[N - 1 - i] = 1; } } vector<long long> g1(N, 0); for (int i = 0; i < N; i++){ if (S[i] == 'n'){ g1[i] = 1; } } vector<long long> h1 = convolution(f1, g1); vector<long long> t(N - 1); for (int i = 0; i < N - 1; i++){ t[i] = h1[i + N]; } vector<long long> f2(N - 1); for (int i = 0; i < N - 1; i++){ f2[i] = t[i] * modfact(i); } vector<long long> g2(N - 1); for (int i = 0; i < N - 1; i++){ g2[i] = modinv(modfact(N - 2 - i)); } vector<long long> h2 = convolution(f2, g2); vector<long long> X(N - 1); for (int i = 0; i < N - 1; i++){ X[i] = h2[i + N - 2] * modinv(modfact(i)) % MOD; } long long ans = 0; for (int i = 0; i < N - 1; i++){ ans ^= X[i]; } cout << ans << endl; }