結果
問題 | No.2356 Back Door Tour in Four Seasons |
ユーザー | AngrySadEight |
提出日時 | 2023-04-18 14:37:50 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 570 ms / 2,000 ms |
コード長 | 2,791 bytes |
コンパイル時間 | 767 ms |
コンパイル使用メモリ | 78,932 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-04-27 18:55:50 |
合計ジャッジ時間 | 12,352 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 2 ms
6,940 KB |
testcase_03 | AC | 2 ms
6,944 KB |
testcase_04 | AC | 556 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 2 ms
6,940 KB |
testcase_07 | AC | 2 ms
6,940 KB |
testcase_08 | AC | 535 ms
6,940 KB |
testcase_09 | AC | 548 ms
6,944 KB |
testcase_10 | AC | 539 ms
6,940 KB |
testcase_11 | AC | 534 ms
6,944 KB |
testcase_12 | AC | 570 ms
6,940 KB |
testcase_13 | AC | 542 ms
6,944 KB |
testcase_14 | AC | 541 ms
6,940 KB |
testcase_15 | AC | 282 ms
6,940 KB |
testcase_16 | AC | 504 ms
6,940 KB |
testcase_17 | AC | 511 ms
6,940 KB |
testcase_18 | AC | 494 ms
6,944 KB |
testcase_19 | AC | 274 ms
6,940 KB |
testcase_20 | AC | 490 ms
6,940 KB |
testcase_21 | AC | 390 ms
6,940 KB |
testcase_22 | AC | 269 ms
6,940 KB |
testcase_23 | AC | 196 ms
6,940 KB |
testcase_24 | AC | 516 ms
6,940 KB |
testcase_25 | AC | 14 ms
6,940 KB |
testcase_26 | AC | 394 ms
6,940 KB |
testcase_27 | AC | 511 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,944 KB |
testcase_29 | AC | 1 ms
6,940 KB |
testcase_30 | AC | 530 ms
6,944 KB |
testcase_31 | AC | 528 ms
6,940 KB |
ソースコード
#include <iostream> #include <vector> using namespace std; typedef long long ll; ll mod2 = 998244353; ll my_pow(ll x, ll n, ll mod){ // 繰り返し二乗法.x^nをmodで割った余り. ll ret; if (n == 0){ ret = 1; } else if (n % 2 == 1){ ret = (x * my_pow((x * x) % mod, n / 2, mod)) % mod; } else{ ret = my_pow((x * x) % mod, n / 2, mod); } return ret; } ll inv(ll x, ll mod){ return my_pow(x, mod - 2, mod); } int main(){ ll N; cin >> N; vector<char> S(N); vector<ll> A(N); ll all_sum = 0; ll spring = 0; for (ll i = 0; i < N; i++){ cin >> S[i] >> A[i]; all_sum += A[i]; if (S[i] == 'P') spring++; } ll summer = 0; ll fall = 0; ll winter = 0; for (ll i = 0; i < N; i++){ ll prd = my_pow(N - 1, A[i], mod2); prd = (prd + mod2 - my_pow(N - 2, A[i], mod2)) % mod2; prd = (prd * inv(my_pow(N - 1, A[i], mod2) , mod2)) % mod2; if (S[i] == 'U') summer = (summer + prd) % mod2; if (S[i] == 'F') fall = (fall + prd) % mod2; if (S[i] == 'W') winter = (winter + prd) % mod2; } /* vector<ll> summer(201, 0); vector<ll> fall(201, 0); vector<ll> winter(201, 0); for (ll i = 0; i < N; i++){ if (S[i] == 'U') summer[A[i]]++; if (S[i] == 'F') fall[A[i]]++; if (S[i] == 'W') winter[A[i]]++; } vector<ll> pow_1(202, 0); vector<ll> pow_2(202, 0); vector<ll> pow_3(606, 0); for (ll i = 0; i <= 200; i++){ pow_1[i] = my_pow(N - 1, i, mod2); pow_2[i] = my_pow(N - 2, i, mod2); } for (ll i = 0; i <= 600; i++){ if (i <= all_sum) pow_3[i] = my_pow(N - 1, all_sum - i, mod2); } ll ans = 0; for (ll i = 1; i <= 200; i++){ for (ll j = 1; j <= 200; j++){ for (ll k = 1; k <= 200; k++){ if (summer[i] == 0 || fall[j] == 0 || winter[k] == 0) continue; ll prod = 1; prod = (prod * ((pow_1[i] - pow_2[i] + mod2) % mod2)) % mod2; prod = (prod * ((pow_1[j] - pow_2[j] + mod2) % mod2)) % mod2; prod = (prod * ((pow_1[k] - pow_2[k] + mod2) % mod2)) % mod2; prod = (prod * pow_3[i + j + k]) % mod2; prod = (prod * summer[i]) % mod2; prod = (prod * fall[j]) % mod2; prod = (prod * winter[k]) % mod2; prod = (prod * spring) % mod2; ans = (ans + prod) % mod2; } } }*/ ll ans = 1; ans = (ans * summer) % mod2; ans = (ans * fall) % mod2; ans = (ans * winter) % mod2; ans = (ans * spring) % mod2; ans = (ans * my_pow(N - 1, all_sum, mod2)) % mod2; cout << ans << endl; }