結果

問題 No.985 Hadamard
ユーザー heno239heno239
提出日時 2020-02-11 16:42:16
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 84 ms / 2,000 ms
コード長 4,181 bytes
コンパイル時間 1,097 ms
コンパイル使用メモリ 117,044 KB
実行使用メモリ 17,604 KB
最終ジャッジ日時 2024-10-01 08:04:21
合計ジャッジ時間 3,778 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 6 ms
7,424 KB
testcase_01 AC 7 ms
7,488 KB
testcase_02 AC 6 ms
7,552 KB
testcase_03 AC 6 ms
7,496 KB
testcase_04 AC 80 ms
17,536 KB
testcase_05 AC 44 ms
12,484 KB
testcase_06 AC 6 ms
7,424 KB
testcase_07 AC 6 ms
7,424 KB
testcase_08 AC 7 ms
7,552 KB
testcase_09 AC 44 ms
12,416 KB
testcase_10 AC 7 ms
7,496 KB
testcase_11 AC 6 ms
7,424 KB
testcase_12 AC 7 ms
7,492 KB
testcase_13 AC 80 ms
17,536 KB
testcase_14 AC 78 ms
17,604 KB
testcase_15 AC 80 ms
17,536 KB
testcase_16 AC 80 ms
17,408 KB
testcase_17 AC 79 ms
17,536 KB
testcase_18 AC 82 ms
17,476 KB
testcase_19 AC 82 ms
17,480 KB
testcase_20 AC 80 ms
17,536 KB
testcase_21 AC 84 ms
17,536 KB
testcase_22 AC 83 ms
17,476 KB
testcase_23 AC 69 ms
17,536 KB
testcase_24 AC 73 ms
17,536 KB
testcase_25 AC 70 ms
17,604 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

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

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (1e+18) + 7;
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 long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

void debug(vector<int> &v) {
	rep(i, v.size()) {
		if (i > 0)cout << " ";
		cout << v[i];
	}
	cout << endl;
}

ll mod_pow(ll a, ll n,ll m=mod) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%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, int 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];
}

struct uf {
private:
	vector<int> par, ran;
public:
	uf(int n) {
		par.resize(n, 0);
		ran.resize(n, 0);
		rep(i, n) {
			par[i] = i;
		}
	}
	int find(int x) {
		if (par[x] == x)return x;
		else return par[x] = find(par[x]);
	}
	void unite(int x, int y) {
		x = find(x), y = find(y);
		if (x == y)return;
		if (ran[x] < ran[y]) {
			par[x] = y;
		}
		else {
			par[y] = x;
			if (ran[x] == ran[y])ran[x]++;
		}
	}
	bool same(int x, int y) {
		return find(x) == find(y);
	}
};
int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

vector<ll> hadamard_trans(vector<ll> &v) {
	vector<ll> res = v;
	int n = v.size();
	for (int i = 1; i < n; i <<= 1) {
		for (int j = 0; j < n; j+=2*i) {
			for (int k = 0; k < i; k++) {
				ll le = res[j + k];
				ll ri = res[j + k + i];
				res[j + k] = le + ri;
				res[j + k + i] = le - ri;
			}
		}
	}
	return res;
}

void solve() {
	int n; cin >> n;
	int m = 1 << n;
	vector<ll> c(m);
	rep(i, m) {
		cin >> c[i];
	}
	vector<ll> t(m), h(m);
	rep(i, m) {
		cin >> t[i] >> h[i];
	}

	vector<ll> tc = hadamard_trans(c);
	rep(i, m) {
		if (tc[i] >= 0)tc[i] = h[i];
		else tc[i] = t[i];
	}

	vector<ll> d = hadamard_trans(tc);

	modint ans = 0;
	rep(i, m) {
		ans += d[i] * c[i];
	}
	ans = ans / (modint)m;
	cout << ans << endl;
}


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