#558763 (C++14) No.1239 Multiplication -2

• 問題: No.1239 Multiplication -2
• ユーザー: suta28407928
• 提出日時: 2020-09-26 01:52:41
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 84 ms / 2,000 ms
• コード長: 4,476 bytes
• コンパイル時間: 993 ms
• コンパイル使用メモリ: 104,972 KB
• 実行使用メモリ: 9,492 KB
• 最終ジャッジ日時: 2023-09-10 18:58:46
• 合計ジャッジ時間: 3,934 ms
• ジャッジサーバーID （参考情報）: judge14 / judge13

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 4,376 KB
testcase_01	AC	2 ms; 4,376 KB
testcase_02	AC	2 ms; 4,380 KB
testcase_03	AC	2 ms; 4,380 KB
testcase_04	AC	3 ms; 4,380 KB
testcase_05	AC	2 ms; 4,376 KB
testcase_06	AC	2 ms; 4,376 KB
testcase_07	AC	2 ms; 4,376 KB
testcase_08	AC	2 ms; 4,376 KB
testcase_09	AC	2 ms; 4,376 KB
testcase_10	AC	2 ms; 4,376 KB
testcase_11	AC	1 ms; 4,380 KB
testcase_12	AC	2 ms; 4,376 KB
testcase_13	AC	1 ms; 4,380 KB
testcase_14	AC	1 ms; 4,380 KB
testcase_15	AC	23 ms; 5,156 KB
testcase_16	AC	39 ms; 6,252 KB
testcase_17	AC	71 ms; 9,488 KB
testcase_18	AC	76 ms; 9,376 KB
testcase_19	AC	60 ms; 9,332 KB
testcase_20	AC	76 ms; 9,492 KB
testcase_21	AC	83 ms; 9,064 KB
testcase_22	AC	70 ms; 8,900 KB
testcase_23	AC	64 ms; 7,240 KB
testcase_24	AC	54 ms; 7,448 KB
testcase_25	AC	20 ms; 6,760 KB
testcase_26	AC	54 ms; 7,000 KB
testcase_27	AC	24 ms; 4,732 KB
testcase_28	AC	77 ms; 8,436 KB
testcase_29	AC	84 ms; 9,000 KB
testcase_30	AC	33 ms; 5,360 KB
testcase_31	AC	50 ms; 7,000 KB
testcase_32	AC	84 ms; 9,492 KB
testcase_33	AC	58 ms; 7,264 KB
testcase_34	AC	54 ms; 7,112 KB
testcase_35	AC	27 ms; 4,836 KB
testcase_36	AC	24 ms; 4,892 KB

ソースコード

#include <iostream>
#include <string>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <unordered_map>
#include <map>
#include <set>
#include <algorithm>
#include <queue>
#include <stack>
#include <functional>
#include <bitset>
#include <assert.h>
#include <unordered_map>
#include <fstream>
#include <ctime>
#include <complex>
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = 1<<30;
const ll linf = 1LL<<62;
const int MAX = 2020000;
ll dy[8] = {1,-1,0,0,1,-1,1,-1};
ll dx[8] = {0,0,1,-1,1,-1,-1,1};
const double pi = acos(-1);
const double eps = 1e-7;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << "debug: " << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << "debug: " << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
//const int mod = 1e9 + 7;
const int mod = 998244353;

template <std::uint_fast64_t Modulus> class modint {
  using u64 = std::uint_fast64_t;

public:
  u64 a;

  constexpr modint(const u64 x = 0) noexcept : a(x % Modulus) {}
  constexpr u64 &value() noexcept { return a; }
  constexpr const u64 &value() const noexcept { return a; }
  constexpr modint operator+(const modint rhs) const noexcept {
	return modint(*this) += rhs;
  }
  constexpr modint operator-(const modint rhs) const noexcept {
	return modint(*this) -= rhs;
  }
  constexpr modint operator*(const modint rhs) const noexcept {
	return modint(*this) *= rhs;
  }
  constexpr modint operator/(const modint rhs) const noexcept {
	return modint(*this) /= rhs;
  }
  constexpr modint &operator+=(const modint rhs) noexcept {
	a += rhs.a;
	if (a >= Modulus) {
	  a -= Modulus;
	}
	return *this;
  }
  constexpr modint &operator-=(const modint rhs) noexcept {
	if (a < rhs.a) {
	  a += Modulus;
	}
	a -= rhs.a;
	return *this;
  }
  constexpr modint &operator*=(const modint rhs) noexcept {
	a = a * rhs.a % Modulus;
	return *this;
  }
  constexpr modint &operator/=(modint rhs) noexcept {
	u64 exp = Modulus - 2;
	while (exp) {
	  if (exp % 2) {
		*this *= rhs;
	  }
	  rhs *= rhs;
	  exp /= 2;
	}
	return *this;
  }
};

using mint = modint<mod>;

ll modpow(ll x, ll n, ll mod){
	ll res = 1;
	while(n > 0){
		if(n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

template<typename T> struct BIT{
	vector<T> dat;
	ll sz;
	//all 1-indexed
	BIT(ll sz) : sz(sz){
		dat.assign(++sz, 0);
	}

	T sum(ll k){
		T ret = 0;
		for(++k; k > 0; k -= k & -k) ret += dat[k];
		return (ret);
	}

	void add(ll k, T x){
		for(++k; k < dat.size(); k += k & -k) dat[k] += x;
	}
	
	ll get(T k){
		if(k <= 0) return 0; 
		ll ret = 0;
		int n = 1; while(n < sz) n *= 2;
		for(int i=n/2; i>0; i/=2){
			if(ret+i < sz && dat[ret+i] < k){
				k -= dat[ret+i];
				ret += i;
			}
		}
		return ret;
	}
};

int main(){
	int n; cin >> n;
	vl a(n); rep(i,n) cin >> a[i];
	vl nxt(n,n);
	for(int i=n-1; i>=1; i--){
		nxt[i-1] = nxt[i];
		if(abs(a[i]) == 2 || a[i] == 0) nxt[i-1] = i;
	}
	mint p = 0, q = modpow(2,n-1,mod);
	BIT<mint> m(n), M(n);
	bool plus = true;
	rep(i,n){
		if(a[i] < 0) plus = !plus;
		if(a[i] == 0) continue;
		if(plus) M.add(i,modpow(2,n-i-2,mod));
		else m.add(i,modpow(2,n-i-2,mod));
	}
	plus = true;
	rep(i,n){
		if(a[i] == 0) continue;
		int l,r;
		if(abs(a[i]) == 2){
			l = i;
			r = nxt[i];
		}else{
			l = nxt[i];
			r = nxt[l];
		}
		if(l == n) break;
		if(a[l] != 0){
			if(plus) p += (m.sum(r-1) - m.sum(l-1)) * modpow(2,i-1,mod);
			else p += (M.sum(r-1) - M.sum(l-1)) * modpow(2,i-1,mod);
		}
		if(a[i] < 0) plus = !plus;
	}
	cout << (p / q).value() << "\n";
}