結果

問題 No.1758 Lazy Segment Tree...?
ユーザー heno239heno239
提出日時 2021-11-20 15:23:22
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,360 ms / 8,000 ms
コード長 5,916 bytes
コンパイル時間 2,393 ms
コンパイル使用メモリ 158,484 KB
実行使用メモリ 25,780 KB
最終ジャッジ日時 2023-09-02 09:54:05
合計ジャッジ時間 36,230 ms
ジャッジサーバーID
(参考情報)
judge12 / judge11
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 21 ms
19,808 KB
testcase_01 AC 21 ms
19,776 KB
testcase_02 AC 32 ms
19,884 KB
testcase_03 AC 21 ms
19,928 KB
testcase_04 AC 22 ms
19,728 KB
testcase_05 AC 21 ms
19,748 KB
testcase_06 AC 22 ms
19,772 KB
testcase_07 AC 25 ms
19,736 KB
testcase_08 AC 26 ms
19,832 KB
testcase_09 AC 36 ms
19,784 KB
testcase_10 AC 30 ms
20,028 KB
testcase_11 AC 30 ms
19,752 KB
testcase_12 AC 31 ms
19,772 KB
testcase_13 AC 35 ms
19,784 KB
testcase_14 AC 26 ms
20,028 KB
testcase_15 AC 32 ms
19,816 KB
testcase_16 AC 29 ms
20,060 KB
testcase_17 AC 36 ms
19,840 KB
testcase_18 AC 29 ms
19,980 KB
testcase_19 AC 28 ms
19,980 KB
testcase_20 AC 30 ms
19,764 KB
testcase_21 AC 1,727 ms
23,752 KB
testcase_22 AC 1,346 ms
23,224 KB
testcase_23 AC 1,813 ms
24,188 KB
testcase_24 AC 1,585 ms
23,888 KB
testcase_25 AC 1,159 ms
22,820 KB
testcase_26 AC 1,882 ms
24,528 KB
testcase_27 AC 1,371 ms
23,084 KB
testcase_28 AC 1,918 ms
24,808 KB
testcase_29 AC 1,878 ms
23,996 KB
testcase_30 AC 2,114 ms
25,576 KB
testcase_31 AC 1,505 ms
23,444 KB
testcase_32 AC 1,755 ms
24,196 KB
testcase_33 AC 1,670 ms
24,184 KB
testcase_34 AC 1,505 ms
24,008 KB
testcase_35 AC 1,157 ms
22,556 KB
testcase_36 AC 2,360 ms
25,764 KB
testcase_37 AC 2,273 ms
25,732 KB
testcase_38 AC 2,044 ms
25,780 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#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>
#include<chrono>
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 = mod * mod;
typedef pair<int, int>P;

#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-4;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
	a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
	a = max(a, b);
}
ll mod_pow(ll x, ll n, ll m = mod) {
	if (n < 0) {
		ll res = mod_pow(x, -n, m);
		return mod_pow(res, m - 2, m);
	}
	if (abs(x) >= m)x %= m;
	if (x < 0)x += m;
	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)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
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];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}


int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

ll gcd(ll a, ll b) {
	a = abs(a);
	b = abs(b);
	if (a < b)swap(a, b);
	while (b) {
		ll r = a % b; a = b; b = r;
	}
	return a;
}

template <typename T>
void fwt(vector<T>& f) {
	int n = f.size();
	for (int i = 1; i < n; i <<= 1) {
		for (int j = 0; j < n; j++) {
			if ((j & i) == 0) {
				T x = f[j], y = f[j | i];
				f[j] = x + y, f[j | i] = x - y;
			}
		}
	}
}
template <typename T>
void ifwt(vector<T>& f) {
	int n = f.size();
	for (int i = 1; i < n; i <<= 1) {
		for (int j = 0; j < n; j++) {
			if ((j & i) == 0) {
				T x = f[j], y = f[j | i];
				f[j] = (x + y) / 2, f[j | i] = (x - y) / 2;
			}
		}
	}
}

typedef vector<vector<modint>> mat;
typedef vector<modint> vec;
mat mtmul(mat& A, mat& B) {
	mat C(A.size(), vec(B[0].size()));
	rep(i, (int)A.size()) {
		rep(k, (int)B.size()) {
			rep(j, (int)B[0].size()) {
				C[i][j] += A[i][k] * B[k][j];
			}
		}
	}
	return C;
}
mat mtpow(mat A, ll n) {
	mat B(A.size(), vec(A.size()));
	rep(i, (int)A.size()) {
		B[i][i] = 1;
	}
	while (n > 0) {
		if (n & (ll)1)B = mtmul(B, A);
		A = mtmul(A, A);
		n >>= 1;
	}
	return B;
}


void solve() {
	int n, q; cin >> n >> q;
	vector<modint> f(n);
	rep(i, n) {
		modint p = (ll)(i + 1) * (n - i);
		modint ad = (ll)n * (n + 1) / 2;
		modint np = ad - p;
		mat A = { {np + ad,p,0},{p,np + ad,0},{1,0,1 } };
		A = mtpow(A, q);
		f[i] = A[2][1];
	}
	vector<modint> fd(n);
	rep(i, n) {
		modint p = (ll)(i) * (n - i+1);
		modint ad = (ll)n * (n + 1) / 2;
		modint np = ad - p;
		modint al = ad + ad;
		
		mat A = { {np + ad,p,0},{p,np + ad,0},{(modint)1,0,(modint)al } };
		A = mtpow(A, q);
		fd[i] = A[2][1];
	}
	vector<modint> r(n + 1);
	rep(i, n)r[i + 1] = r[i] + (modint)i;
	modint ans = 0;
	rep(x, n-1) {
		modint val = (modint)(x + 1) * f[x];
		int cy = n - x - 1;
		val *= (modint)cy * (modint)n - r[x + 2];
		ans += val;
	}
	//cout << ans << "\n";
	rep(y, n) {
		modint val = (modint)(n - y) * f[y] * (modint)-1;
		val *= r[y+1];
		ans += val;
	}
	//cout << ans << "\n";
	ans = 0;
	vector<modint> r2(n + 1);
	rep(i, n) {
		r2[i + 1] = r2[i] + (modint)(i + 1) * (modint)(n - i);
	}
	rep1(d, n-1) {
		modint val = fd[d];
		modint coef = 0;
		/*for (int x = 0; x +d < n; x++) {
			coef += (ll)(x + 1) * (n - (x + d));
		}*/
		coef = r2[n - d] - (modint)d * r[n - d+1];
		val *= coef;
		ans += val;
	}
	/*ans = 0;
	for (int d = 1; d <= n - 1; d++) {
		rep(x, n - d) {
			int i = d;
			modint p = (ll)(i) * (n - i + 1);
			modint ad = (ll)n * (n + 1) / 2;
			modint np = ad - p;
			mat A = { {np + ad,p,0},{p,np + ad,0},{(x+1)*(n-(x+d)) ,0,1 } };
			A = mtpow(A, q);
			ans += A[2][1];
		}
	}*/
	//cout << ans << "\n";
	ans /= 2;
	cout << ans << "\n";
}



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