結果
| 問題 | No.235 めぐるはめぐる (5) |
| コンテスト | |
| ユーザー |
 zeta
|
| 提出日時 | 2026-03-14 04:08:56 |
| 言語 | C++23 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 659 ms / 10,000 ms |
| コード長 | 38,147 bytes |
| 記録 | |
| コンパイル時間 | 4,374 ms |
| コンパイル使用メモリ | 315,516 KB |
| 実行使用メモリ | 26,068 KB |
| 最終ジャッジ日時 | 2026-03-14 04:09:05 |
| 合計ジャッジ時間 | 7,571 ms |
|
ジャッジサーバーID （参考情報） |
judge3_1 / judge1_1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 3 |
ソースコード
#define YRSD
#include <iostream>
#include <algorithm>
#include <array>
#include <bitset>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <string>
#include <tuple>
#include <bit>
#include <chrono>
#include <functional>
#include <iomanip>
#include <utility>
#include <type_traits>
#include <cassert>
#include <cctype>
#include <cmath>
#include <cstring>
#include <ctime>
#include <limits>
#include <ranges>
#include <concepts>
#define TE template <typename T>
#define TES template <typename T, typename ...S>
#define Z auto
#define ep emplace_back
#define eb emplace
#define fi first
#define se second
#define bg begin
#define ed end
#define all(x) bg(x), ed(x)
#define ov(a, b, c, d, e, ...) e
#define FO1(a) for (int _ = 0; _ < (a); ++_)
#define FO2(i, a) for (int i = 0; i < (a); ++i)
#define FO3(i, a, b) for (int i = (a); i < (b); ++i)
#define FO4(i, a, b, c) for (int i = (a); i < (b); i += (c))
#define FOR(...) ov(__VA_ARGS__, FO4, FO3, FO2, FO1)(__VA_ARGS__)
#define FF1(a) for (int _ = (a) - 1; _ >= 0; --_)
#define FF2(i, a) for (int i = (a) - 1; i >= 0; --i)
#define FF3(i, a, b) for (int i = (b) - 1; i >= (a); --i)
#define FF4(i, a, b, c) for (int i = (b) - 1; i >= (a); i -= (c))
#define FOR_R(...) ov(__VA_ARGS__, FF4, FF3, FF2, FF1)(__VA_ARGS__)
#define FOR_subset(t, s) for (int t = (s); t > -1; t = (t == 0 ? -1 : (t - 1) & s))
#define sort ranges::sort
using namespace std;
TE using vc = vector<T>;
TE using vvc = vc<vc<T>>;
TE using T1 = tuple<T>;
TE using T2 = tuple<T, T>;
TE using T3 = tuple<T, T, T>;
TE using T4 = tuple<T, T, T, T>;
TE using max_heap = priority_queue<T>;
TE using min_heap = priority_queue<T, vc<T>, greater<T>>;
using u8 = unsigned char; using uint = unsigned int; using ll = long long; using ull = unsigned long long;
using ld = long double; using i128 = __int128; using u128 = __uint128_t; using f128 = __float128;
using u16 = uint16_t;
using PII = pair<int, int>; using PLL = pair<ll, ll>;
#ifdef YRSD
constexpr bool dbg = 1;
#else
constexpr bool dbg = 0;
#endif
istream &operator>>(istream &I, i128 &x) {
static string s;
I >> s;
int f = s[0] == '-';
x = 0;
const int N = (int)s.size();
FOR(i, f, N) x = x * 10 + s[i] - '0';
if (f) x = -x;
return I;
}
ostream &operator<<(ostream &O, i128 x) {
static string s;
s.clear();
bool f = x < 0;
if (f) x = -x;
while (x) s += '0' + x % 10, x /= 10;
if (s.empty()) s += '0';
if (f) s += '-';
reverse(all(s));
return O << s;
}
istream &operator>>(istream &I, f128 &x) {
static string s;
I >> s, x = stold(s);
return I;
}
ostream &operator<<(ostream &O, const f128 x) { return O << ld(x); }
template <typename... S>
istream &operator>>(istream &I, tuple<S...> &t) {
return apply([&I](Z &...s) { ((I >> s), ...); }, t), I;
}
template <typename T, typename U>
istream &operator>>(istream &I, pair<T, U> &x) {
return I >> x.fi >> x.se;
}
template <typename T, typename U>
ostream &operator<<(ostream &O, const pair<T, U> &x) {
return O << x.fi << ' ' << x.se;
}
TE requires requires(T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, string>)
istream &operator>>(istream &I, T &c) {
for (Z &e : c) I >> e;
return I;
}
TE requires requires(const T &c) { begin(c); end(c); } and
(not is_same_v<decay_t<T>, const char*>) and
(not is_same_v<decay_t<T>, string>) and
(not is_array_v<remove_reference_t<T>> or
not is_same_v<remove_extent_t<remove_reference_t<T>>, char>)
ostream &operator<<(ostream &O, const T &a) {
if (a.empty()) return O;
Z i = a.begin();
O << *i++;
for (; i != a.end(); ++i) O << ' ' << *i;
return O;
}
void IN() {}
TE void IN(T &x, Z &...s) { cin >> x, IN(s...); }
void print() { cout << '\n'; }
TES void print(T &&x, S &&...y) {
cout << x;
if constexpr (sizeof...(S)) cout << ' ';
print(forward<S>(y)...);
}
void put() {}
TES void put(T &&x, S &&...y) {
cout << x;
put(forward<S>(y)...);
}
#define INT(...) int __VA_ARGS__; IN(__VA_ARGS__)
#define UINT(...) uint __VA_ARGS__; IN(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; IN(__VA_ARGS__)
#define ULL(...) ull __VA_ARGS__; IN(__VA_ARGS__)
#define I128(...) i128 __VA_ARGS__; IN(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; IN(__VA_ARGS__)
#define CH(...) char __VA_ARGS__; IN(__VA_ARGS__)
#define REAL(...) re __VA_ARGS__; IN(__VA_ARGS__)
#define VEC(T, a, n) vc<T> a(n); IN(a)
void YES(bool o = 1) { print(o ? "YES" : "NO"); }
void Yes(bool o = 1) { print(o ? "Yes" : "No"); }
void yes(bool o = 1) { print(o ? "yes" : "no"); }
void NO(bool o = 1) { YES(not o); }
void No(bool o = 1) { Yes(not o); }
void no(bool o = 1) { yes(not o); }
void ALICE(bool o = 1) { print(o ? "ALICE" : "BOB"); }
void Alice(bool o = 1) { print(o ? "Alice" : "Bob"); }
void alice(bool o = 1) { print(o ? "alice" : "bob"); }
void BOB(bool o = 1) { ALICE(not o); }
void Bob(bool o = 1) { Alice(not o); }
void bob(bool o = 1) { alice(not o); }
void POSSIBLE(bool o = 1) { print(o ? "POSSIBLE" : "IMPOSSIBLE"); }
void Possible(bool o = 1) { print(o ? "Possible" : "Impossible"); }
void possible(bool o = 1) { print(o ? "possible" : "impossible"); }
void IMPOSSIBLE(bool o = 1) { POSSIBLE(not o); }
void Impossible(bool o = 1) { Possible(not o); }
void impossible(bool o = 1) { possible(not o); }
void TAK(bool o = 1) { print(o ? "TAK" : "NIE"); }
void NIE(bool o = 1) { TAK(not o); }
#if (__cplusplus >= 202002L)
#include <numbers>
constexpr ld pi = numbers::pi_v<ld>;
#endif
TE constexpr T inf = numeric_limits<T>::max();
template <> constexpr i128 inf<i128> = i128(inf<ll>) * 2'000'000'000'000'000'000;
template <typename T, typename U>
constexpr pair<T, U> inf<pair<T, U>> = {inf<T>, inf<U>};
TE constexpr static inline int pc(T x) { return popcount(make_unsigned_t<T>(x)); }
constexpr static inline ll len(const Z &a) { return a.size(); }
void reverse(Z &a) { reverse(all(a)); }
void unique(Z &a) {
sort(a);
a.erase(unique(all(a)), a.end());
}
TE vc<int> inverse(const vc<T> &a) {
int N = len(a);
vc<int> b(N, -1);
FOR(i, N) if (a[i] != -1) b[a[i]] = i;
return b;
}
Z QMAX(const Z &a) { return *max_element(all(a)); }
Z QMIN(const Z &a) { return *min_element(all(a)); }
TE Z QMAX(T l, T r) { return *max_element(l, r); }
TE Z QMIN(T l, T r) { return *min_element(l, r); }
constexpr bool chmax(Z &a, const Z &b) { return (a < b ? a = b, 1 : 0); }
constexpr bool chmin(Z &a, const Z &b) { return (a > b ? a = b, 1 : 0); }
vc<int> argsort(const Z &a) {
vc<int> I(len(a));
iota(all(I), 0);
sort(I, [&](int i, int k) { return a[i] < a[k] or (a[i] == a[k] and i < k); });
return I;
}
TE vc<T> rearrange(const vc<T> &a, const vc<int> &I) {
int N = len(I);
vc<T> b(N);
FOR(i, N) b[i] = a[I[i]];
return b;
}
template <int of = 1, typename T>
vc<T> pre_sum(const vc<T> &a) {
int N = len(a);
vc<T> c(N + 1);
FOR(i, N) c[i + 1] = c[i] + a[i];
if (of == 0) c.erase(c.begin());
return c;
}
TE constexpr static int topbit(T x) {
if (x == 0) return - 1;
if constexpr (sizeof(T) <= 4) return 31 - __builtin_clz(x);
else return 63 - __builtin_clzll(x);
}
TE constexpr static int lowbit(T x) {
if (x == 0) return -1;
if constexpr (sizeof(T) <= 4) return __builtin_ctz(x);
else return __builtin_ctzll(x);
}
TE constexpr T floor(T x, T y) { return x / y - (x % y and (x ^ y) < 0); }
TE constexpr T ceil(T x, T y) { return floor(x + y - 1, y); }
TE constexpr T bmod(T x, T y) { return x - floor(x, y) * y; }
TE constexpr pair<T, T> divmod(T x, T y) {
T q = floor(x, y);
return pair{q, x - q * y};
}
template <typename T = ll>
T SUM(const Z &v) {
return accumulate(all(v), T(0));
}
int lb(const Z &a, Z x) { return lower_bound(all(a), x) - a.begin(); }
TE int lb(T l, T r, Z x) { return lower_bound(l, r, x) - l; }
int ub(const Z &a, Z x) { return upper_bound(all(a), x) - a.begin(); }
TE int ub(T l, T r, Z x) { return upper_bound(l, r, x) - l; }
template <bool ck = 1>
ll bina(Z f, ll l, ll r) {
if constexpr (ck) assert(f(l));
while (abs(l - r) > 1) {
ll x = (r + l) >> 1;
(f(x) ? l : r) = x;
}
return l;
}
TE T bina_real(Z f, T l, T r, int c = 100) {
while (c--) {
T x = (l + r) / 2;
(f(x) ? l : r) = x;
}
return (l + r) / 2;
}
Z pop(Z &s) {
if constexpr (requires { s.pop_back(); }) {
Z x = s.back();
return s.pop_back(), x;
} else if constexpr (requires { s.top(); }) {
Z x = s.top();
return s.pop(), x;
} else {
Z x = s.front();
return s.pop(), x;
}
}
void setp(int x) { cout << fixed << setprecision(x); }
TE inline void sh(vc<T> &a, int N, T b = {}) {
a.resize(N, b);
}
#define FIO
static constexpr uint SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
char out[100];
uint pil = 0, pir = 0, por = 0;
struct Pre {
char num[10000][4];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i][j] = n % 10 | '0';
n /= 10;
}
}
}
} constexpr pre;
inline void load() {
memcpy(ibuf, ibuf + pil, pir - pil);
pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
pil = 0;
if (pir < SZ) ibuf[pir++] = '\n';
}
inline void flush() {
fwrite(obuf, 1, por, stdout);
por = 0;
}
inline void rd(char &c) {
do {
if (pil + 1 > pir) load();
c = ibuf[pil++];
} while (isspace(c));
}
inline void rd(string &x) {
x.clear();
char c;
do {
if (pil + 1 > pir) load();
c = ibuf[pil++];
} while (isspace(c));
do {
x += c;
if (pil == pir) load();
c = ibuf[pil++];
} while (!isspace(c));
}
TE inline void rd_real(T &x) {
string s;
rd(s);
x = stod(s);
}
TE inline void rd_integer(T &x) {
if (pil + 100 > pir) load();
char c;
do c = ibuf[pil++];
while (c < '-');
bool minus = 0;
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (c == '-') {
minus = 1, c = ibuf[pil++];
}
}
x = 0;
while ('0' <= c) {
x = x * 10 + (c & 15), c = ibuf[pil++];
}
if constexpr (is_signed<T>::value || is_same_v<T, i128>) {
if (minus) x = -x;
}
}
inline void rd(int16_t &x) { rd_integer(x); }
inline void rd(uint16_t &x) { rd_integer(x); }
inline void rd(int &x) { rd_integer(x); }
inline void rd(long &x) { rd_integer(x); }
inline void rd(ll &x) { rd_integer(x); }
inline void rd(i128 &x) { rd_integer(x); }
inline void rd(uint &x) { rd_integer(x); }
inline void rd(ull &x) { rd_integer(x); }
inline void rd(u128 &x) { rd_integer(x); }
inline void rd(double &x) { rd_real(x); }
inline void rd(long double &x) { rd_real(x); }
inline void rd(f128 &x) { rd_real(x); }
template <typename T, typename U>
inline void rd(pair<T, U> &p) {
return rd(p.fi), rd(p.se);
}
template <size_t N = 0, typename T>
inline void rd_tuple(T &t) {
if constexpr (N < tuple_size<T>::value) {
Z &x = get<N>(t);
rd(x);
rd_tuple<N + 1>(t);
}
}
template <typename... T>
inline void rd(tuple<T...> &tpl) {
rd_tuple(tpl);
}
template <size_t N = 0, typename T>
inline void rd(array<T, N> &x) {
for (Z &e : x) rd(e);
}
TE inline void rd(vc<T> &x) {
for (Z &e : x) rd(e);
}
inline void read() {}
template <typename H, typename... T>
inline void read(H &h, T &...t) {
rd(h), read(t...);
}
inline void wt(const char c) {
if (por == SZ) flush();
obuf[por++] = c;
}
inline void wt(const string s) {
for (char c : s) wt(c);
}
inline void wt(const char *s) {
size_t len = strlen(s);
for (size_t i = 0; i < len; i++) wt(s[i]);
}
TE inline void wt_integer(T x) {
if (por > SZ - 100) flush();
if (x < 0) {
obuf[por++] = '-', x = -x;
}
int outi;
for (outi = 96; x >= 10000; outi -= 4) {
memcpy(out + outi, pre.num[x % 10000], 4);
x /= 10000;
}
if (x >= 1000) {
memcpy(obuf + por, pre.num[x], 4);
por += 4;
} else if (x >= 100) {
memcpy(obuf + por, pre.num[x] + 1, 3);
por += 3;
} else if (x >= 10) {
int q = (x * 103) >> 10;
obuf[por] = q | '0';
obuf[por + 1] = (x - q * 10) | '0';
por += 2;
} else
obuf[por++] = x | '0';
memcpy(obuf + por, out + outi + 4, 96 - outi);
por += 96 - outi;
}
TE inline void wt_real(T x) {
ostringstream oss;
oss << fixed << setprecision(10) << double(x);
string s = oss.str();
wt(s);
}
inline void wt(int x) { wt_integer(x); }
inline void wt(long x) { wt_integer(x); }
inline void wt(ll x) { wt_integer(x); }
inline void wt(i128 x) { wt_integer(x); }
inline void wt(uint x) { wt_integer(x); }
inline void wt(ull x) { wt_integer(x); }
inline void wt(u128 x) { wt_integer(x); }
inline void wt(double x) { wt_real(x); }
inline void wt(long double x) { wt_real(x); }
inline void wt(f128 x) { wt_real(x); }
template <typename T, typename U>
inline void wt(const pair<T, U> &val) {
wt(val.fi);
wt(' ');
wt(val.se);
}
template <size_t N = 0, typename T>
inline void wt_tuple(const T &t) {
if constexpr (N < tuple_size<T>::value) {
if constexpr (N > 0) {
wt(' ');
}
const Z x = get<N>(t);
wt(x);
wt_tuple<N + 1>(t);
}
}
template <typename... T>
inline void wt(tuple<T...> &tpl) {
wt_tuple(tpl);
}
template <typename T, size_t S>
inline void wt(const array<T, S> &val) {
Z n = val.size();
for (size_t i = 0; i < n; i++) {
if (i) wt(' ');
wt(val[i]);
}
}
TE inline void wt(const vc<T> &a) {
int N = len(a);
FOR(i, N) {
if (i) wt(' ');
wt(a[i]);
}
}
TE inline void wt(const vc<vc<T>> &v) {
int N = len(v);
FOR(i, N) {
wt(v[i]);
if (i + 1 != N) wt('\n');
}
}
template <typename T, const size_t s>
inline void wt(const vc<array<T, s>> &v) {
int N = len(v);
FOR(i, N) {
wt(v[i]);
if (i + 1 != N) wt('\n');
}
}
inline void __attribute__((destructor)) _d() { flush(); }
inline void println() { wt('\n'); }
template <typename Head, typename... Tail>
inline void println(Head &&head, Tail &&...tail) {
wt(head);
if (sizeof...(Tail)) wt(' ');
println(forward<Tail>(tail)...);
}
#define IN(...) read(__VA_ARGS__)
#define print(...) println(__VA_ARGS__)
#define FLUSH() flush()
#define c constexpr
template <int mod>
struct mint_t {
using T = mint_t;
static c uint m = mod;
uint x;
c inline uint val() const { return x; }
c mint_t() : x(0) {}
TE requires(is_unsigned_v<T>) mint_t(T x) : x(x % m) {}
mint_t(u128 x) : x(x % m) {}
TE requires(is_signed_v<T>) mint_t(T x) : x((x %= mod) < 0 ? x + mod : x) {}
mint_t(i128 x) : x((x %= mod) < 0 ? x + mod : x) {}
c T &operator+=(T p) {
if ((x += p.x) >= m) x -= m;
return *this;
}
c T &operator-=(T p) {
if ((x += m - p.x) >= m) x -= m;
return *this;
}
c T operator+(T p) const { return T(*this) += p; }
c T operator-(T p) const { return T(*this) -= p; }
c T &operator*=(T p) {
x = ull(x) * p.x % m;
return *this;
}
c T operator*(T p) const { return T(*this) *= p; }
c T &operator/=(T p) { return *this *= p.inv(); }
c T operator/(T p) const { return T(*this) /= p; }
c T operator-() const { return T::gen(x ? mod - x : 0); }
c T inv() const {
int a = x, b = mod, x = 1, y = 0;
while (b > 0) {
int t = a / b;
swap(a -= t * b, b);
swap(x -= t * y, y);
}
return T(x);
}
c T pow(ll k) const {
if (k < 0) return inv().pow(-k);
T s(1), a(x);
for (; k; k >>= 1, a *= a)
if (k & 1) s *= a;
return s;
}
c bool operator<(T p) const { return x < p.x; }
c bool operator==(T p) const { return x == p.x; }
c bool operator!=(T p) const { return x != p.x; }
static c T gen(uint x) {
T s;
s.x = x;
return s;
}
friend istream &operator>>(istream &cin, T &p) {
ll t;
cin >> t;
p = t;
return cin;
}
friend ostream &operator<<(ostream &cout, T p) { return cout << p.x; }
static c int get_mod() { return mod; }
static c PII ntt_info() {
if (mod == 167772161) return {25, 17};
if (mod == 469762049) return {26, 30};
if (mod == 754974721) return {24, 362};
if (mod == 998244353) return {23, 31};
if (mod == 120586241) return {20, 74066978};
if (mod == 880803841) return {23, 211};
if (mod == 943718401) return {22, 663003469};
if (mod == 1004535809) return {21, 582313106};
if (mod == 1012924417) return {21, 368093570};
return {-1, -1};
}
static c bool can_ntt() { return ntt_info().fi != -1; }
};
#undef c
using M99 = mint_t<998244353>;
using M17 = mint_t<1000000007>;
using M11 = M17;
#ifdef FIO
template <int mod>
void rd(mint_t<mod> &x) {
LL(y);
x = y;
}
template <int mod>
void wt(mint_t<mod> x) {
wt(x.x);
}
#endif
template <typename am>
struct segl_t {
using AM = am;
using MX = AM::MX;
using MA = AM::MA;
using X = MX::X;
using A = MA::X;
int N, n, sz;
vc<X> a;
vc<A> c;
segl_t() {}
segl_t(int N) { build(N, [](int) { return MX::unit(); }); }
segl_t(int N, Z f) { build(N, f); }
segl_t(const vc<X> &a) { build(a); }
void build(const vc<X> &a) {
build(len(a), [&](int i) { return a[i]; });
}
void build(int M, Z f) {
N = M, n = 1;
while ((1 << n) < N) ++n;
sz = 1 << n;
a.assign(sz << 1, MX::unit());
c.assign(sz, MA::unit());
FOR(i, N) a[sz + i] = f(i);
FOR_R(i, 1, sz) upd(i);
}
void upd(int k) { a[k] = MX::op(a[k << 1], a[k << 1 | 1]); }
void app(int k, A f) {
a[k] = AM::act(a[k], f, 1 << (n - topbit(k)));
if (k < sz) c[k] = MA::op(c[k], f);
}
void push(int k) {
if (c[k] == MA::unit()) return;
app(k << 1, c[k]), app(k << 1 | 1, c[k]);
c[k] = MA::unit();
}
void apply(int l, int r, A f) {
assert(-1 < l);
assert(l <= r);
assert(r <= N);
if (l == r) return;
l += sz, r += sz;
FOR_R(i, 1, n + 1) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push((r - 1) >> i);
}
int cl = l, cr = r;
while (l < r) {
if (l & 1) app(l++, f);
if (r & 1) app(--r, f);
l >>= 1, r >>= 1;
}
l = cl, r = cr;
FOR(i, 1, n + 1) {
if (((l >> i) << i) != l) upd(l >> i);
if (((r >> i) << i) != r) upd((r - 1) >> i);
}
}
X prod(int l, int r) {
assert(-1 < l and l < r + 1 and r < N + 1);
if (l == r) return MX::unit();
l += sz, r += sz;
FOR_R(i, 1, n + 1){
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push((r - 1) >> i);
}
X ls = MX::unit(), rs = MX::unit();
while (l < r) {
if (l & 1) ls = MX::op(ls, a[l++]);
if (r & 1) rs = MX::op(a[--r], rs);
l >>= 1, r >>= 1;
}
return MX::op(ls, rs);
}
void apply(int x, const A &f) {
assert(-1 < x and x < N);
x += sz;
FOR_R(i, 1, n + 1) push(x >> i);
a[x] = AM::act(a[x], f, 1);
FOR(i, 1, n + 1) upd(x >> i);
}
void multiply(int x, const X &w) {
assert(0 <= x and x < N);
x += sz;
FOR_R(i, 1, n + 1) push(x >> i);
a[x] = MX::op(a[x], w);
FOR(i, 1, n + 1) upd(x >> i);
}
void set(int x, X w) {
assert(-1 < x and x < N);
x += sz;
FOR_R(i, 1, n + 1) push(x >> i);
a[x] = w;
FOR(i, 1, n + 1) upd(x >> i);
}
X get(int x) {
assert(x > -1 and x < N);
x += sz;
FOR_R(i, 1, n + 1) push(x >> i);
return a[x];
}
X prod_all() { return a[1]; }
int max_right(Z ck, int l) {
assert(0 <= l and l <= N);
assert(ck(MX::unit()));
if (l == N) return N;
l += sz;
FOR_R(i, 1, n + 1) push(l >> i);
X sm = MX::unit();
do {
while (l % 2 == 0) l >>= 1;
if (not ck(MX::op(sm, a[l]))) {
while (l < sz) {
push(l);
l = l << 1;
if (ck(MX::op(sm, a[l]))) sm = MX::op(sm, a[l++]);
}
return l - sz;
}
sm = MX::op(sm, a[l++]);
} while ((l & -l) != l);
return N;
}
int min_left(Z ck, int r) {
assert(0 <= r and r <= N);
assert(ck(MX::unit()));
if (r == 0) return 0;
r += sz;
FOR_R(i, 1, n + 1) push((r - 1) >> i);
X sm = MX::unit();
do {
r--;
while (r > 1 and (r % 2)) r >>= 1;
if (not ck(MX::op(a[r], sm))) {
while (r < sz) {
push(r);
r = r << 1 | 1;
if (ck(MX::op(a[r], sm))) sm = MX::op(a[r--], sm);
}
return r + 1 - sz;
}
sm = MX::op(a[r], sm);
} while ((r & -r) != r);
return 0;
}
};
#include <random>
#ifdef MeIoN
std::mt19937 rg(0);
std::mt19937_64 rd_64(0);
#else
std::mt19937 rg(std::chrono::steady_clock::now().time_since_epoch().count());
std::mt19937_64 rd_64(std::chrono::steady_clock::now().time_since_epoch().count());
#endif
uint rng() { return rg(); }
uint rng(uint lim) { return rg() % lim; }
int rng(int l, int r) { return l + rg() % (r - l); }
ull rng_64() { return rd_64(); }
ull rng_64(ull lim) { return rd_64() % lim; }
ll rng_64(ll l, ll r) { return l + rd_64() % (r - l); }
template <typename T>
void shuffle(vector<T> &v) {
const int N = len(v);
FOR(i, 1, N) {
int k = rng(0, i + 1);
if (i != k) swap(v[i], v[k]);
}
}
TE ull hsh(const pair<T, T> &X) {
static ull B = rng_64();
if (not B) B = rng_64();
return B * X.fi + X.se;
}
TE struct hashmap {
uint ls, msk;
vc<ull> ke;
vc<T> val;
vc<u8> vis;
ull hash(ull x) const {
static const ull bs =
chrono::steady_clock::now().time_since_epoch().count();
x += bs;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return (x ^ (x >> 31)) & msk;
}
void extend() {
vc<pair<ull, T>> dat;
const int N = len(vis);
dat.reserve(N / 2 - ls);
FOR(i, N) if (vis[i]) dat.ep(ke[i], val[i]);
build(dat.size() << 1);
for (Z &[a, b] : dat) (*this)[a] = b;
}
hashmap(uint N = 0) { build(N); }
void build(uint N) {
uint k = 8;
while (k < (N << 1)) k <<= 1;
ls = k >> 1, msk = k - 1;
ke.resize(k);
val.resize(k);
vis.assign(k, 0);
}
void clear() {
fill(all(vis), 0);
ls = (msk + 1) >> 1;
}
ll size() const { return vis.size() / 2 - ls; }
int id(ull k) const {
int i = hash(k);
while (vis[i] and ke[i] != k) i = (i + 1) & msk;
return i;
}
T &operator[](ull k) {
if (ls == 0) extend();
int i = id(k);
if (not vis[i]) {
vis[i] = 1;
ke[i] = k;
val[i] = T {};
--ls;
}
return val[i];
}
T &operator[](PII p) {
ll k = hsh(p);
if (ls == 0) extend();
int i = id(k);
if (not vis[i]) {
vis[i] = 1;
ke[i] = k;
val[i] = T {};
--ls;
}
return val[i];
}
T get(ull k, T fail) const {
int i = id(k);
return (vis[i] ? val[i] : fail);
}
bool contains(ull k) const {
int i = id(k);
return vis[i] and ke[i] == k;
}
vc<pair<ull, T>> get_all() const {
int N = len(vis);
vc<pair<ull, T>> s;
FOR(i, N) if (vis[i]) s.ep(ke[i], val[i]);
return s;
}
void enumerate_all(Z f) const {
const int N = len(vis);
FOR(i, N) if (vis[i]) f(ke[i], val[i]);
}
};
TE struct edge {
int f, to;
T w;
int id;
};
template <typename T = int, bool dir = 0>
struct graph {
static constexpr bool is_dir = dir;
int N, M;
using cost_type = T;
using ee = edge<T>;
vc<ee> es;
vc<int> in;
vc<ee> c;
bool ok;
bool isok() { return ok; }
struct px {
const graph *g;
int l, r;
px(const graph *g, int l, int r) : g(g), l(l), r(r) {}
const ee *begin() const {
if (l == r) return 0;
return &g->c[l];
}
const ee *end() const {
if (l == r) return 0;
return &g->c[r];
}
};
px operator[](int i) const {
assert(ok);
return {this, in[i], in[i + 1]};
}
graph() : N(0), M(0), ok(0) {}
graph(int N) : N(N), M(0), ok(0) {}
void add(int f, int t, T w = 1, int i = -1) {
assert(not ok);
assert(-1 < f and -1 < t and t < N and f < N);
if (i == -1) i = M;
es.ep(ee{f, t, w, i});
++M;
}
void build() {
assert(not ok);
ok = 1;
in.assign(N + 1, 0);
for (Z &&e : es) {
in[e.f + 1]++;
if (not dir) in[e.to + 1]++;
}
FOR(i, N) in[i + 1] += in[i];
Z cc = in;
c.resize(in.back() + 1);
for (Z &&e : es) {
c[cc[e.f]++] = e;
if (not dir) c[cc[e.to]++] = {e.to, e.f, e.w, e.id};
}
}
template <bool wt = 0, int of = 1>
void sc() { sc<wt, of>(N - 1); }
template <bool wt = 0, int of = 1>
void sc(int M) {
es.reserve(M * (dir ? 1 : 2));
FOR(M) {
INT(x, y);
x -= of, y -= of;
if (not wt) {
add(x, y);
} else {
T w;
IN(w);
add(x, y, w);
}
}
build();
}
vc<int> deg() {
vc<int> in(N);
for (Z &&e : es) ++in[e.f], ++in[e.to];
return in;
}
pair<vc<int>, vc<int>> deg_inout() {
vc<int> in(N), ou(N);
for (Z &&e : es) ++in[e.to], ++ou[e.f];
return {in, ou};
}
vc<int> ni;
vc<u8> vis;
graph<T, dir> rearrange(const vc<int> &v, bool keep_eid = 0) {
if (len(ni) != N) ni.assign(N, -1);
int N = len(v);
FOR(i, N) ni[v[i]] = i;
graph<T, dir> g(N);
vc<int> s;
FOR(i, N) {
for (Z &&e : (*this)[v[i]]) {
if (len(vis) <= e.id) vis.resize(e.id + 1);
if (vis[e.id]) continue;
int f = e.f, to = e.to;
if (ni[f] != -1 and ni[to] != -1) {
s.ep(e.id);
vis[e.id] = 1;
int id = (keep_eid ? e.id : -1);
g.add(ni[f], ni[to], e.w, id);
}
}
}
FOR(i, N) ni[v[i]] = -1;
for (int i : s) vis[i] = 0;
return g.build(), g;
}
ull has(ull x, ull y) {
if (not dir and x > y) swap(x, y);
return x * N + y;
}
hashmap<int> mp;
int get_eid(ull x, ull y) {
if (mp.size() == 0) {
mp.build(N - 1);
for (Z &&e : es) {
ull x = e.f, y = e.to;
ull k = has(x, y);
mp[k] = e.id;
}
}
return mp.get(has(x, y), -1);
}
graph rev() const requires(dir) {
graph ng(N);
for (Z &&[f, t, w, id] : es) ng.add(t, f, w, id);
return ng;
}
};
TE struct hld {
using G = graph<T, 0>;
G &g;
int N, t = 0;
vc<int> L, R, hd, V, fa, to, d;
hld(G &g, int r = 0)
: g(g), N(g.N), L(N, -1), R(L), hd(N, r), V(L), fa(L), to(L), d(N) {
if (r == -1) return;
assert(g.isok());
dfs(r, -1);
hl(r, r);
}
void dfs(int n, int f) {
fa[n] = f;
R[n] = 1;
int l = g.in[n], r = g.in[n + 1], m = 0;
Z &c = g.c;
if (r - l > 1 and c[l].to == f) swap(c[l], c[l + 1]);
FOR(i, l, r) if (c[i].to != f) {
Z e = c[i];
to[e.to] = e.id;
d[e.to] = d[n] + 1;
dfs(e.to, n);
R[n] += R[e.to];
if (chmax(m, R[e.to]) and l < i) swap(c[l], c[i]);
}
}
void hl(int n, int p) {
R[n] += L[n] = t;
V[t++] = n;
bool f = 1;
for (Z &&e : g[n]) if (e.to != p) {
hd[e.to] = f ? hd[n] : e.to;
f = 0;
hl(e.to, n);
}
}
vc<int> hp(int n) {
vc<int> s{n};
while (1) {
int x = hc(s.back());
if (x == -1 or hd[x] != n) return s;
s.ep(x);
}
}
inline int hc(int x) {
int i = L[x] + 1;
if (i == N) return -1;
int a = V[i];
return fa[a] == x ? a : -1;
}
int ev(int i) {
Z &e = g.es[i];
return (fa[e.f] == e.to ? e.f : e.to);
}
int ve(int x) { return to[x]; }
int gei(int x, int y) {
if (fa[x] != y) swap(x, y);
assert(fa[x] == y);
return to[x];
}
int el(int i) { return 2 * L[i] - d[i]; }
int er(int i) { return 2 * R[i] - d[i] - 1; }
int la(int n, int k) {
assert(k <= d[n]);
while (1) {
int x = hd[n];
if (L[n] - k >= L[x]) return V[L[n] - k];
k -= L[n] - L[x] + 1;
n = fa[x];
}
}
int lca(int x, int y) {
for (;; y = fa[hd[y]]) {
if (L[x] > L[y]) swap(x, y);
if (hd[x] == hd[y]) return x;
}
}
int dist(int a, int b) { return d[a] + d[b] - 2 * d[lca(a, b)]; }
int meet(int a, int b, int c) { return lca(a, b) ^ lca(a, c) ^ lca(b, c); }
bool ins(int x, int y) { return L[y] <= L[x] and L[x] < R[y]; }
int jump(int x, int y, int k) {
if (k == 1) {
if (x == y) return -1;
return ins(y, x) ? la(y, d[y] - d[x] - 1) : fa[x];
}
int c = lca(x, y);
int a = d[x] - d[c];
int b = d[y] - d[c];
if (k > a + b) return -1;
if (k <= a) return la(x, k);
return la(y, a + b - k);
}
int size(int x, int r = -1) {
if (r == -1) return R[x] - L[x];
if (x == r) return N;
int y = jump(x, r, 1);
if (ins(x, y)) return R[x] - L[x];
return N - R[y] + L[y];
}
vc<int> size_arr(int r = -1) {
vc<int> sz(N);
FOR(i, N) sz[i] = size(i, r);
return sz;
}
vc<int> cc(int n) {
vc<int> s;
for (Z &&e : g[n]) if (e.to != fa[n]) s.ep(e.to);
return s;
}
vc<int> cl(int n) {
vc<int> s;
bool f = 1;
for (Z &&e : g[n]) {
if (e.to != fa[n]) {
if (not f) s.ep(e.to);
f = 0;
}
}
return s;
}
vc<PII> dec(int x, int y, bool e) {
vc<PII> a, b;
while (1) {
if (hd[x] == hd[y]) break;
if (L[x] < L[y]) {
b.ep(L[hd[y]], L[y]);
y = fa[hd[y]];
} else {
a.ep(L[x], L[hd[x]]);
x = fa[hd[x]];
}
}
if (L[x] < L[y]) b.ep(L[x] + e, L[y]);
else if (L[y] + e <= L[x]) a.ep(L[x], L[y] + e);
reverse(b);
a.insert(a.end(), all(b));
return a;
}
vc<int> rest_path(int x, int y) {
vc<int> s;
for (Z [a, b] : dec(x, y, 0)) {
if (a <= b) FOR(i, a, b + 1) s.ep(V[i]);
else FOR_R(i, b, a + 1) s.ep(V[i]);
}
return s;
}
PII cross(int a, int b, int c, int d) {
int ab = lca(a, b), ac = lca(a, c), ad = lca(a, d);
int bc = lca(b, c), bd = lca(b, d), cd = lca(c, d);
int x = ab ^ ac ^ bc, y = ab ^ ad ^ bd;
if (x != y) return {x, y};
int z = ac ^ ad ^ cd;
if (x != z) x = -1;
return {x, x};
}
int max_path(Z f, int x, int y) {
if (not f(x)) return -1;
for (Z [a, b] : dec(x, y, 0)) {
if (not f(V[a])) return x;
if (f(V[b])) {
x = V[b];
continue;
}
int c = bina<0>([&](int c) -> bool { return f(V[c]); }, a, b);
return V[c];
}
return x;
}
};
template <typename T, typename mono, bool E>
struct hld_mono_lazy_commute {
using AM = mono;
using MX = AM::MX;
using MA = AM::MA;
using X = MX::X;
using A = MA::X;
hld<T> &t;
vc<int> &hd, &fa, &L;
int N;
segl_t<AM> sa;
hld_mono_lazy_commute(hld<T> &t) : t(t), hd(t.hd), fa(t.fa), L(t.L), N(t.N) {
build([&](int) { return MX::unit(); });
}
hld_mono_lazy_commute(hld<T> &t, vc<X> &a) : t(t), hd(t.hd), fa(t.fa), L(t.L), N(t.N) {
build([&](int i) { return a[i]; });
}
hld_mono_lazy_commute(hld<T> &t, Z f) : t(t), hd(t.hd), fa(t.fa), L(t.L), N(t.N) {
build(f);
}
void build(Z f) {
sa.build(N, [&](int i) {
return not E ? f(t.V[i]) : i ? f(t.ve(t.V[i])) : MX::unit();
});
}
inline X f(int x, int y) { return sa.prod(min(x, y), max(x, y) + 1); }
X prod(int x, int y) {
X s = MX::unit();
while (hd[x] != hd[y]) {
if (L[x] < L[y]) swap(x, y);
s = MX::op(s, f(L[hd[x]], L[x]));
x = fa[hd[x]];
}
if (L[x] < L[y]) s = MX::op(s, f(L[x] + E, L[y]));
else if (L[y] + E <= L[x]) s = MX::op(s, f(L[x], L[y] + E));
return s;
}
X prod_sub(int x) { return sa.prod(t.L[x] + E, t.R[x]); }
X prod_sub(int x, int rt) {
if (rt == x) return prod_all();
if (not t.ins(rt, x)) {
int l = t.L[x], r = t.R[x];
return sa.prod(l + E, r);
}
x = t.jump(x, rt, 1);
int L = t.L[x], R = t.R[x];
return MX::op(sa.prod(0, L), sa.prod(R, N));
}
X prod_all() { return prod_sub(t.V[0]); }
void apply(int x, int y, A f) {
for (Z [l, r] : t.dec(x, y, E)) {
if (l > r) swap(l, r);
sa.apply(l, r + 1, f);
}
}
void apply_sub(int x, A f) {
int l = t.L[x], r = t.R[x];
sa.apply(l + E, r, f);
}
void apply_out(int x, A f) {
int l = t.L[x], r = t.R[x];
sa.apply(E, l + E, f);
sa.apply(r, N, f);
}
inline int ts(int i) {
if (E) i = t.ev(i);
return t.L[i];
}
void set(int i, X x) { sa.set(ts(i), x); }
void multiply(int i, X x) { sa.multiply(ts(i), x); }
void apply(int i, A f) { sa.apply(ts(i), f); }
X get(int i) { return sa.get(ts(i)); }
vc<X> get_all() {
vc<X> dat = sa.get_all(), s(N - E);
FOR(i, N - E) s[i] = dat[ts(i)];
return s;
}
int max_path(Z ck, int x, int y) {
if (E) return max_re(ck, x, y);
if (not ck(prod(x, x))) return - 1;
X s = MX::unit();
for (Z &&[a, b] : t.dec(x, y, E)) {
X w = f(a, b);
if (ck(MX::op(s, w))) {
s = MX::op(s, w);
x = t.V[b];
continue;
}
Z ckt = [&](X x) -> bool { return ck(MX::op(s, x)); };
if (a <= b) {
int i = sa.max_right(ckt, a);
return(i == a ? x : t.V[i - 1]);
} else {
int i = sa.min_left(ckt, a + 1);
if (i == a + 1) return x;
return t.V[i];
}
}
return y;
}
int max_re(Z ck, int x, int y) {
static_assert(E);
if (not ck(MX::unit())) return -1;
int fa = t.lca(x, y);
X s = MX::unit();
for (Z [a, b] : t.dec(x, fa, E)) {
X w = f(a, b);
if (ck(MX::op(s, w))) {
s = MX::op(s, w);
x = fa[t.V[b]];
continue;
}
Z ckt = [&](X x) -> bool { return ck(MX::op(s, x)); };
int i = sa.min_left(ckt, a + 1);
if (i == a + 1) return x;
return fa[t.V[i]];
}
for (Z [a, b] : t.dec(fa, y, E)) {
X x = f(a, b);
if (ck(MX::op(s, x))) {
s = MX::op(s, x);
x = (t.V[b]);
continue;
}
Z ckt = [&](X x) -> bool { return ck(MX::op(s, x)); };
Z i = sa.max_right(ckt, a);
return(i == a ? x : t.V[i - 1]);
}
return y;
}
};
template <typename T, typename mono, bool E>
struct hld_mono_lazy_nc {
using AM = mono;
using MX = AM::MX;
using MA = AM::MA;
using X = MX::X;
using A = MA::X;
hld<T> &t;
int N;
segl_t<AM> sa, sb;
hld_mono_lazy_nc(hld<T> &t) : t(t), N(t.N) {
build([](int) -> X { return MX::unit(); });
}
hld_mono_lazy_nc(hld<T> &t, vc<X> &a) : t(t), N(t.N) {
build([&](int i) -> X { return a[i]; });
}
hld_mono_lazy_nc(hld<T> &t, Z f) : t(t), N(t.N) { build(f); }
void build(Z f) {
Z g = [&](int i) {
return not E ? f(t.V[i]) : i ? f(t.ve(t.V[i])) : MX::unit();
};
sa.build(N, g);
sb.build(N, [&](int i) { return g(N - i - 1); });
}
inline X f(int x, int y) {
return x <= y ? sa.prod(x, y + 1) : sb.prod(N - x - 1, N - y);
}
X prod(int x, int y) {
X s = MX::unit();
for (Z &&[a, b] : t.dec(x, y, E)) s = MX::op(s, f(a, b));
return s;
}
void apply(int x, int y, A f) {
for (Z [l, r] : t.dec(x, y, E)) {
if (l > r) swap(l, r);
sa.apply(l, r + 1, f);
}
}
void apply_sub(int x, A f) {
int l = t.L[x], r = t.R[x];
sa.apply(l + E, r, f);
}
void apply_out(int x, A f) {
int l = t.L[x], r = t.R[x];
sa.apply(E, l + E, f);
sa.apply(r, N, f);
}
inline int ts(int i) {
if (E) i = t.ev(i);
return t.L[i];
}
void set(int i, X x) { sa.set(ts(i), x); }
void multiply(int i, X x) { sa.multiply(ts(i), x); }
void apply(int i, A f) { sa.apply(ts(i), f); }
X get(int i) { return sa.get(ts(i)); }
vc<X> get_all() {
vc<X> dat = sa.get_all(), s(N - E);
FOR(i, N - E) s[i] = dat[ts(i)];
return s;
}
int max_path(Z ck, int x, int y) {
if (E) return max_path_edge(ck, x, y);
if (not ck(prod(x, x))) return - 1;
Z pd = t.dec(x, y, E);
X s = MX::unit();
for (Z &&[a, b] : pd) {
X w = f(a, b);
if (ck(MX::op(s, w))) {
s = MX::op(s, w);
x = (t.V[b]);
continue;
}
Z ckt = [&](X x) -> bool { return ck(MX::op(s, x)); };
if (a <= b) {
Z i = sa.max_right(ckt, a);
return(i == a ? x : t.V[i - 1]);
} else {
int i = sb.min_left(ckt, a + 1);
if (i == a + 1) return x;
return t.V[i];
}
}
return y;
}
int max_path_edge(Z ck, int x, int y) {
static_assert(E);
if (not ck(MX::unit())) return -1;
int fa = t.lca(x, y);
X s = MX::unit();
for (Z [a, b] : t.dec(x, fa, E)) {
X w = f(a, b);
if (ck(MX::op(s, w))) {
s = MX::op(s, w);
x = (t.fa[t.V[b]]);
continue;
}
Z ckt = [&](X x) -> bool { return ck(MX::op(s, x)); };
int i = sb.min_left(ckt, a + 1);
if (i == a + 1) return x;
return t.fa[t.V[i]];
}
for (Z [a, b] : t.dec(fa, y, E)) {
X x = f(a, b);
if (ck(MX::op(s, x))) {
s = MX::op(s, x);
x = (t.V[b]);
continue;
}
Z ckt = [&](X x) -> bool { return ck(MX::op(s, x)); };
Z i = sa.max_right(ckt, a);
return(i == a ? x : t.V[i - 1]);
}
return y;
}
};
template <typename T, typename mono, bool E = 0>
using hld_mono_laz = conditional_t<mono::MX::commute, hld_mono_lazy_commute<T, mono, E>,
hld_mono_lazy_nc<T, mono, E>>;
using mint = M11;
struct MX {
struct X {
mint s, c;
};
static X op(const X &a, const X &b) { return {a.s + b.s, a.c + b.c}; }
static X unit() { return {}; }
static constexpr bool commute = 1;
};
struct MA {
using X = mint;
static X op(X a, X b) { return a + b; }
static X unit() { return 0; }
static constexpr bool commute = 1;
};
struct AM {
using MX = ::MX;
using X = MX::X;
using MA = ::MA;
using A = MA::X;
static X act(X a, A b, ll) { return {a.s + a.c * b, a.c}; }
};
void Yorisou() {
INT(N);
VEC(mint, a, N);
VEC(mint, b, N);
graph g(N);
g.sc();
hld v(g);
hld_mono_laz<int, AM> ds(v, [&](int i) { return MX::X{a[i], b[i]}; });
INT(Q);
FOR(Q) {
INT(op, x, y);
--x, --y;
if (op == 0) {
INT(w);
ds.apply(x, y, w);
} else {
print(ds.prod(x, y).s);
}
}
}
constexpr int tests = 0, fl = 0, DB = 10;
int main() {
cin.tie(0)->sync_with_stdio(0);
int T = 1;
if (fl) cerr.tie(0);
if (tests and not fl) IN(T);
for (int i = 0; i < T or fl; ++i) {
Yorisou();
if (fl and i % DB == 0) cerr << "Case: " << i << '\n';
}
return 0;
}