結果

問題 No.1239 Multiplication -2
ユーザー heno239heno239
提出日時 2020-11-18 20:34:10
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 25 ms / 2,000 ms
コード長 4,555 bytes
コンパイル時間 1,886 ms
コンパイル使用メモリ 129,168 KB
実行使用メモリ 10,900 KB
最終ジャッジ日時 2024-07-23 09:10:06
合計ジャッジ時間 3,949 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
7,492 KB
testcase_01 AC 4 ms
7,616 KB
testcase_02 AC 5 ms
7,496 KB
testcase_03 AC 4 ms
7,624 KB
testcase_04 AC 5 ms
7,616 KB
testcase_05 AC 4 ms
7,496 KB
testcase_06 AC 5 ms
7,744 KB
testcase_07 AC 5 ms
7,616 KB
testcase_08 AC 4 ms
7,620 KB
testcase_09 AC 5 ms
7,620 KB
testcase_10 AC 5 ms
7,488 KB
testcase_11 AC 5 ms
7,492 KB
testcase_12 AC 5 ms
7,620 KB
testcase_13 AC 4 ms
7,492 KB
testcase_14 AC 4 ms
7,620 KB
testcase_15 AC 11 ms
8,260 KB
testcase_16 AC 15 ms
8,516 KB
testcase_17 AC 21 ms
10,900 KB
testcase_18 AC 21 ms
10,564 KB
testcase_19 AC 21 ms
10,776 KB
testcase_20 AC 23 ms
10,692 KB
testcase_21 AC 22 ms
9,668 KB
testcase_22 AC 21 ms
9,540 KB
testcase_23 AC 18 ms
9,028 KB
testcase_24 AC 17 ms
8,896 KB
testcase_25 AC 13 ms
8,644 KB
testcase_26 AC 16 ms
8,772 KB
testcase_27 AC 10 ms
8,000 KB
testcase_28 AC 23 ms
9,152 KB
testcase_29 AC 24 ms
9,540 KB
testcase_30 AC 13 ms
8,256 KB
testcase_31 AC 17 ms
8,900 KB
testcase_32 AC 25 ms
9,540 KB
testcase_33 AC 19 ms
8,900 KB
testcase_34 AC 18 ms
8,904 KB
testcase_35 AC 11 ms
8,132 KB
testcase_36 AC 11 ms
8,000 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC optimize("Ofast")
#pragma GCC target ("sse4")

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 998244353;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m = mod) {
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
struct modint {
    ll n;
    modint() :n(0) { ; }
    modint(ll m) :n(m) {
        if (n >= mod)n %= mod;
        else if (n < 0)n = (n % mod + mod) % mod;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}

void solve() {
    int n; cin >> n;
    vector<int> a(n);
    rep(i, n)cin >> a[i];
    vector<modint> t2(n + 1);
    modint inv2 = (1 + mod) / 2;
    t2[0] = 1;
    rep(i, n)t2[i + 1] = t2[i] * inv2;
    vector<int> le[2], ri[2];

    modint ans = 0;
    rep(i, n) {
        if (abs(a[i]) == 2) {
            rep(j, 2) {
                le[j].clear();
                ri[j].clear();
            }
            int len = 1;
            if (i == 0)len = 0;
            le[0].push_back(len);
            len = 1;
            if (i == n - 1)len = 0;
            ri[0].push_back(len);
            int id = 0;
            for (int j = i + 1; j < n; j++) {
                if (abs(a[j]) != 1)break;
                if (a[j] < 0)id ^= 1;
                int len = j - i + 1;
                if (j == n - 1)len--;
                ri[id].push_back(len);
            }
            id = 0;
            for (int j = i - 1; j >= 0; j--) {
                if (abs(a[j]) != 1)break;
                if (a[j] < 0)id ^= 1;
                int len = i - j + 1;
                if (j == 0)len--;
                le[id].push_back(len);
            }
            if (a[i] < 0)swap(le[0], le[1]);
            modint s1 = 0, s2 = 0;
            for (int c : le[0])s1 += t2[c];
            for (int c : ri[1])s2 += t2[c];
            ans += s1 * s2;
            //cout << s1 << " " << s2 << "\n";
            s1 = 0, s2 = 0;
            for (int c : le[1])s1 += t2[c];
            for (int c : ri[0])s2 += t2[c];
            ans += s1 * s2;
            //cout << s1 << " " << s2 << "\n";
        }
    }
    cout << ans << "\n";
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(15);
    //init_f();
    //init();
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}
0