#849185 (C++17) No.1241 Eternal Tours

提出ソース

結果

問題	No.1241 Eternal Tours
ユーザー	heno239
提出日時	2023-03-14 23:33:28
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	385 ms / 6,000 ms
コード長	8,948 bytes
コンパイル時間	2,332 ms
コンパイル使用メモリ	173,952 KB
実行使用メモリ	28,496 KB
最終ジャッジ日時	2024-09-18 08:29:38
合計ジャッジ時間	9,521 ms
ジャッジサーバーID （参考情報）	judge3 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	7 ms 11,720 KB
testcase_01	AC	6 ms 11,648 KB
testcase_02	AC	86 ms 15,872 KB
testcase_03	AC	7 ms 11,724 KB
testcase_04	AC	7 ms 11,776 KB
testcase_05	AC	7 ms 11,648 KB
testcase_06	AC	7 ms 11,648 KB
testcase_07	AC	7 ms 11,776 KB
testcase_08	AC	6 ms 11,648 KB
testcase_09	AC	6 ms 11,720 KB
testcase_10	AC	6 ms 11,724 KB
testcase_11	AC	7 ms 11,724 KB
testcase_12	AC	7 ms 11,776 KB
testcase_13	AC	7 ms 11,648 KB
testcase_14	AC	171 ms 14,024 KB
testcase_15	AC	8 ms 11,776 KB
testcase_16	AC	49 ms 12,488 KB
testcase_17	AC	385 ms 28,360 KB
testcase_18	AC	360 ms 17,280 KB
testcase_19	AC	334 ms 16,292 KB
testcase_20	AC	9 ms 11,776 KB
testcase_21	AC	13 ms 12,032 KB
testcase_22	AC	350 ms 22,016 KB
testcase_23	AC	18 ms 11,852 KB
testcase_24	AC	7 ms 11,648 KB
testcase_25	AC	7 ms 11,720 KB
testcase_26	AC	7 ms 11,648 KB
testcase_27	AC	6 ms 11,776 KB
testcase_28	AC	198 ms 15,872 KB
testcase_29	AC	198 ms 15,812 KB
testcase_30	AC	244 ms 15,944 KB
testcase_31	AC	170 ms 13,772 KB
testcase_32	AC	376 ms 28,368 KB
testcase_33	AC	369 ms 18,036 KB
testcase_34	AC	363 ms 15,872 KB
testcase_35	AC	336 ms 15,816 KB
testcase_36	AC	8 ms 11,648 KB
testcase_37	AC	7 ms 11,720 KB
testcase_38	AC	382 ms 17,896 KB
testcase_39	AC	367 ms 17,028 KB
testcase_40	AC	361 ms 15,944 KB
testcase_41	AC	259 ms 28,496 KB
testcase_42	AC	221 ms 17,028 KB
testcase_43	AC	217 ms 15,940 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#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;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
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;

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);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
	vector<T> res;
	int ida = 0, idb = 0;
	while (ida < a.size() || idb < b.size()) {
		if (idb == b.size()) {
			res.push_back(a[ida]); ida++;
		}
		else if (ida == a.size()) {
			res.push_back(b[idb]); idb++;
		}
		else {
			if (a[ida] < b[idb]) {
				res.push_back(a[ida]); ida++;
			}
			else {
				res.push_back(b[idb]); idb++;
			}
		}
	}
	return res;
}
template<typename T>
void cinarray(vector<T>& v) {
	rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
	rep(i, v.size()) {
		if (i > 0)cout << " "; cout << v[i];
	}
	cout << "\n";
}
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;
	//if (x == 0)return 0;
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
//mod should be <2^31
struct modint {
	int n;
	modint() :n(0) { ; }
	modint(ll m) {
		if (m < 0 || mod <= m) {
			m %= mod; if (m < 0)m += mod;
		}
		n = m;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.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 -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)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];
}

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;
}
using ld = long double;
//typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);
template<typename T>
void addv(vector<T>& v, int loc, T val) {
	if (loc >= v.size())v.resize(loc + 1, 0);
	v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
	fill(isp + 2, isp + mn, true);
	for (int i = 2; i < mn; i++) {
		if (!isp[i])continue;
		ps.push_back(i);
		for (int j = 2 * i; j < mn; j += i) {
			isp[j] = false;
		}
	}
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	if (res == st.begin())return st.end();
	res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
	auto res = st.lower_bound(val);
	return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
	return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
	a = a + b; return a;
}
mP operator-(mP a, mP b) {
	return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
	a = a - b; return a;
}
LP operator+(LP a, LP b) {
	return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
	a = a + b; return a;
}
LP operator-(LP a, LP b) {
	return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
	a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------


int get_premitive_root() {
	int primitive_root = 0;
	if (!primitive_root) {
		primitive_root = [&]() {
			set<int> fac;
			int v = mod - 1;
			for (ll i = 2; i * i <= v; i++) while (v % i == 0) fac.insert(i), v /= i;
			if (v > 1) fac.insert(v);
			for (int g = 1; g < mod; g++) {
				bool ok = true;
				for (auto i : fac) if (mod_pow(g, (mod - 1) / i) == 1) { ok = false; break; }
				if (ok) return g;
			}
			return -1;
		}();
	}
	return primitive_root;
}
const int proot = get_premitive_root();

typedef vector <modint> poly;
void dft(poly& f, bool inverse = false) {
	int n = f.size(); if (n == 1)return;

	static poly w{ 1 }, iw{ 1 };
	for (int m = w.size(); m < n / 2; m *= 2) {
		modint dw = mod_pow(proot, (mod - 1) / (4 * m)), dwinv = (modint)1 / dw;
		w.resize(m * 2); iw.resize(m * 2);
		for (int i = 0; i < m; i++)w[m + i] = w[i] * dw, iw[m + i] = iw[i] * dwinv;
	}
	if (!inverse) {
		for (int m = n; m >>= 1;) {
			for (int s = 0, k = 0; s < n; s += 2 * m, k++) {
				for (int i = s; i < s + m; i++) {
					modint x = f[i], y = f[i + m] * w[k];
					f[i] = x + y, f[i + m] = x - y;
				}
			}
		}
	}
	else {
		for (int m = 1; m < n; m *= 2) {
			for (int s = 0, k = 0; s < n; s += 2 * m, k++) {
				for (int i = s; i < s + m; i++) {
					modint x = f[i], y = f[i + m];
					f[i] = x + y, f[i + m] = (x - y) * iw[k];
				}
			}
		}
		modint n_inv = (modint)1 / (modint)n;
		for (modint& v : f)v *= n_inv;
	}
}
poly multiply(poly g, poly h) {
	int n = 1;
	int pi = 0, qi = 0;
	rep(i, g.size())if (g[i])pi = i;
	rep(i, h.size())if (h[i])qi = i;
	int sz = pi + qi + 2;
	while (n < sz)n *= 2;
	g.resize(n); h.resize(n);
	dft(g); dft(h);
	rep(i, n) {
		g[i] *= h[i];
	}
	dft(g, true);
	return g;
}

//i<=j
poly ordered_multiply(poly p, poly q, bool eq) {
	poly res;
	function<void(int, int)> dfs = [&](int l, int r) {
		if (l + 1 == r)return;
		int m = (l + r) / 2;
		dfs(l, m);
		dfs(m, r);
		poly pl, pr;
		Rep(j, l, m)if (j < p.size())pl.push_back(p[j]);
		Rep(j, m, r)pr.push_back(q[j]);
		poly pp = multiply(pl, pr);
		rep(j, pp.size())addv(res, l + m + j, pp[j]);
	};
	dfs(0, q.size());
	if (eq) {
		rep(j, q.size())if (j < p.size())addv(res, 2 * j, p[j] * q[j]);
	}
	return res;

}
void solve() {
	int x, y; ll t; int a, b, c, d;
	cin >> x >> y >> t >> a >> b >> c >> d;
	int h = (1 << (x + 1));
	int w = (1 << (y + 1));
	vector<vector<modint>> val(h, vector<modint>(w));
	val[0][0] += 1;
	val[0][1] += 1;
	val[0][w - 1] += 1;
	val[1][0] += 1;
	val[h - 1][0] += 1;
	rep(i, h) {
		poly cur(w);
		rep(j, w)cur[j] = val[i][j];
		dft(cur);
		rep(j, w)val[i][j] = cur[j];
	}
	rep(j, w) {
		poly cur(h);
		rep(i, h)cur[i] = val[i][j];
		dft(cur);
		rep(i, h)val[i][j] = cur[i];
	}
	rep(i, h)rep(j, w) {
		val[i][j] = mod_pow(val[i][j], t);
	}
	rep(i, h) {
		poly cur(w);
		rep(j, w)cur[j] = val[i][j];
		dft(cur,true);
		rep(j, w)val[i][j] = cur[j];
	}
	rep(j, w) {
		poly cur(h);
		rep(i, h)cur[i] = val[i][j];
		dft(cur,true);
		rep(i, h)val[i][j] = cur[i];
	}
	auto query = [&](int x, int y) {
		x %= h; if (x < 0)x += h;
		y %= w; if (y < 0)y += w;
		return val[x][y];
	};
	modint ans = 0;
	rep(i, 2)rep(j, 2) {
		int cx = a, cy = b;
		int coef = 1;
		if (i) {
			cx = h - cx; coef *= -1;
		}
		if (j) {
			cy = w - cy; coef *= -1;
		}
		modint val = (modint)coef * query(c - cx, d - cy);
		ans += val;
	}
	cout << ans << "\n";
}


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

yukicoder

結果

テストケース

ソースコード