結果
問題 | No.1239 Multiplication -2 |
ユーザー | sahiya |
提出日時 | 2020-12-14 20:50:01 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 56 ms / 2,000 ms |
コード長 | 3,283 bytes |
コンパイル時間 | 1,700 ms |
コンパイル使用メモリ | 114,664 KB |
実行使用メモリ | 11,392 KB |
最終ジャッジ日時 | 2023-10-20 05:12:57 |
合計ジャッジ時間 | 4,875 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
5,660 KB |
testcase_01 | AC | 3 ms
5,660 KB |
testcase_02 | AC | 2 ms
5,660 KB |
testcase_03 | AC | 2 ms
5,716 KB |
testcase_04 | AC | 2 ms
5,716 KB |
testcase_05 | AC | 3 ms
5,724 KB |
testcase_06 | AC | 2 ms
5,680 KB |
testcase_07 | AC | 3 ms
5,680 KB |
testcase_08 | AC | 2 ms
5,660 KB |
testcase_09 | AC | 2 ms
5,660 KB |
testcase_10 | AC | 2 ms
5,660 KB |
testcase_11 | AC | 2 ms
5,660 KB |
testcase_12 | AC | 2 ms
5,660 KB |
testcase_13 | AC | 2 ms
5,656 KB |
testcase_14 | AC | 2 ms
5,660 KB |
testcase_15 | AC | 15 ms
7,620 KB |
testcase_16 | AC | 24 ms
9,208 KB |
testcase_17 | AC | 31 ms
6,664 KB |
testcase_18 | AC | 41 ms
6,676 KB |
testcase_19 | AC | 26 ms
6,664 KB |
testcase_20 | AC | 33 ms
6,664 KB |
testcase_21 | AC | 54 ms
11,320 KB |
testcase_22 | AC | 43 ms
11,128 KB |
testcase_23 | AC | 41 ms
10,008 KB |
testcase_24 | AC | 32 ms
9,872 KB |
testcase_25 | AC | 9 ms
5,992 KB |
testcase_26 | AC | 36 ms
9,644 KB |
testcase_27 | AC | 17 ms
7,296 KB |
testcase_28 | AC | 51 ms
10,740 KB |
testcase_29 | AC | 56 ms
11,080 KB |
testcase_30 | AC | 22 ms
8,160 KB |
testcase_31 | AC | 32 ms
9,500 KB |
testcase_32 | AC | 53 ms
11,392 KB |
testcase_33 | AC | 37 ms
9,972 KB |
testcase_34 | AC | 35 ms
9,740 KB |
testcase_35 | AC | 19 ms
7,636 KB |
testcase_36 | AC | 17 ms
7,424 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include <algorithm> #include <bitset> #include <climits> #include <cmath> #include <cstring> #include <deque> #include <forward_list> #include <iomanip> #include <iostream> #include <list> #include <map> #include <queue> #include <set> #include <string> #include <unordered_map> #include <unordered_set> #include <utility> #include <vector> using namespace std; typedef long long ll; typedef pair<int, int> P; typedef bitset<16> BS; const ll MOD = 998244353; const ll INF = 1E18; const int MAX_N = 2E+05; int N; ll A[MAX_N + 1], L[MAX_N + 1][2], R[MAX_N + 1][2]; ll modPow(ll x, ll a); int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cin >> N; for (int i = 1; i <= N; i++) { cin >> A[i]; } for (int i = 1; i <= N;) { if (A[i] == 2 || A[i] == -2) { int j = i, res = 1; while (true) { if (res == -1) { R[i][0] += modPow(2, max(0, N - j - 1)); R[i][0] %= MOD; } else { R[i][1] += modPow(2, max(0, N - j - 1)); R[i][1] %= MOD; } j++; res *= A[j]; if (!(A[j] == 1 || A[j] == -1) || j > N) break; } i = j; } else { i++; } } for (int i = N; i >= 1;) { if (A[i] == 2 || A[i] == -2) { int j = i, res = 1; while (true) { if (res == -1) { L[i][0] += modPow(2, max(0, j - 2)); L[i][0] %= MOD; } else { L[i][1] += modPow(2, max(0, j - 2)); L[i][1] %= MOD; } j--; res *= A[j]; if (!(A[j] == 1 || A[j] == -1) || j < 1) break; } i = j; } else { i--; } } /* for (int i = 1; i <= N; i++) { cout << "i = " << i << ", L0 = " << L[i][0] << ", L1 = " << L[i][1] << "\n"; } for (int i = 1; i <= N; i++) { cout << "i = " << i << ", R0 = " << R[i][0] << ", R1 = " << R[i][1] << "\n"; } */ ll ans = 0; for (int i = 1; i <= N; i++) { if (A[i] == 2) { ll res = L[i][1] * R[i][0] + L[i][0] * R[i][1]; res %= MOD; ans += res; ans %= MOD; } else if (A[i] == -2) { ll res = L[i][0] * R[i][0] + L[i][1] * R[i][1]; res %= MOD; ans += res; ans %= MOD; } //cout << "i = " << i << ", ans = " << ans << "\n"; } ll Q = modPow(2, N - 1); Q = modPow(Q, MOD - 2); ans *= Q; ans %= MOD; /* for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cout << "i = " << i << ", j = " << j << ", dp = " << dp[i][j] << "\n"; } } */ cout << ans << "\n"; return 0; } ll modPow(ll x, ll a) { ll ans = 1; while (a > 0) { if (a & 1) { ans = (ans * x) % MOD; } x = (x * x) % MOD; a >>= 1; } return ans; }