problem_id stringlengths 6 6 | language stringclasses 2 values | original_status stringclasses 3 values | original_src stringlengths 19 243k | changed_src stringlengths 19 243k | change stringclasses 3 values | i1 int64 0 8.44k | i2 int64 0 8.44k | j1 int64 0 8.44k | j2 int64 0 8.44k | error stringclasses 270 values | stderr stringlengths 0 226k |
|---|---|---|---|---|---|---|---|---|---|---|---|
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 200010;
const ll mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
vector<ll> inv, fact, invfact;
void mod_build(int n) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
rep(i, n) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return fact[n] * invfact[n - k] % mod;
}
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
}
ll modpow(ll n, ll k) {
k %= mod - 1;
if (k < 0)
k += mod - 1;
ll ret = 1;
while (k) {
if (k & 1)
ret = ret * n % mod;
n = n * n % mod;
k >>= 1;
}
return ret;
}
ll modinv(ll a) { return modpow(a, mod - 2); }
int main() {
mod_build(mx);
ll a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = 0;
ans += comb(c + 1 + d + 1, c + 1);
ans -= comb(c + 1 + b, c + 1);
ans -= comb(a + d + 1, d + 1);
ans += comb(a + b, a);
cout << ans.x << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> P;
typedef long long ll;
typedef long double ld;
const int inf = 1e9 + 7;
const ll longinf = 1LL << 60;
#define REP(i, m, n) for (int i = (int)(m); i < (int)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define F first
#define S second
const int mx = 2000010;
const ll mod = 1e9 + 7;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
vector<ll> inv, fact, invfact;
void mod_build(int n) {
fact.resize(n + 1);
inv.resize(n + 1);
invfact.resize(n + 1);
fact[0] = inv[0] = invfact[0] = 1;
inv[1] = 1;
rep(i, n) {
fact[i + 1] = fact[i] * (i + 1) % mod;
if (i > 0)
inv[i + 1] = mod - inv[mod % (i + 1)] * (mod / (i + 1)) % mod;
invfact[i + 1] = invfact[i] * inv[i + 1] % mod;
}
}
ll perm(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return fact[n] * invfact[n - k] % mod;
}
}
ll comb(int n, int k) {
if (n < 0 || k < 0 || k > n) {
return 0;
} else {
return (fact[n] * invfact[n - k] % mod) * invfact[k] % mod;
}
}
ll modpow(ll n, ll k) {
k %= mod - 1;
if (k < 0)
k += mod - 1;
ll ret = 1;
while (k) {
if (k & 1)
ret = ret * n % mod;
n = n * n % mod;
k >>= 1;
}
return ret;
}
ll modinv(ll a) { return modpow(a, mod - 2); }
int main() {
mod_build(mx);
ll a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = 0;
ans += comb(c + 1 + d + 1, c + 1);
ans -= comb(c + 1 + b, c + 1);
ans -= comb(a + d + 1, d + 1);
ans += comb(a + b, a);
cout << ans.x << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// return a^b O(log b)
template <typename T> T mypow(T a, T b) {
if (b == 0)
return 1;
T tmp = mypow(a, b / 2);
if (b % 2)
return (((tmp * tmp) % MOD) * a) % MOD;
else
return (tmp * tmp) % MOD;
}
// return nCk 前処理 O(N) + query あたり O(1)
static bool init = false;
ll cb_res = 1;
const ll M = 1e6 + 10;
vll frc(M + 10, 1), inv(M + 10, 1);
long long comb(int n, int k) {
if (!init) {
init = true;
REP(i, M) {
frc[i + 1] = (frc[i] * (i + 1)) % MOD;
inv[i + 1] = mypow(frc[i + 1], MOD - 2);
}
}
if (k < 0 || n < k)
return 0;
cb_res = (((frc[n] * inv[k]) % MOD) * inv[n - k]) % MOD;
return cb_res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// (0, 0) -> (r, c) : (r + c)Cr
// sum_{c = 0, ..., c2}rCc = (r + 1)Cc2
ll res = 0;
for (ll r = r1; r <= r2; r++) {
res += MOD + comb(r + 1 + c2, c2) - comb(r + 1 + c1 - 1, c1 - 1);
res %= MOD;
}
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for (int i = m; i <= n; i++)
#define FORR(i, m, n) for (int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.rbegin(), v.rend());
#define ALL(v) (v).begin(), (v).end()
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll, ll>;
const ll MOD = 1e9 + 7;
// return a^b O(log b)
template <typename T> T mypow(T a, T b) {
if (b == 0)
return 1;
T tmp = mypow(a, b / 2);
if (b % 2)
return (((tmp * tmp) % MOD) * a) % MOD;
else
return (tmp * tmp) % MOD;
}
// return nCk 前処理 O(N) + query あたり O(1)
static bool init = false;
ll cb_res = 1;
const ll M = 2e6 + 10;
vll frc(M + 1, 1), inv(M + 1, 1);
long long comb(int n, int k) {
if (!init) {
init = true;
REP(i, M) {
frc[i + 1] = (frc[i] * (i + 1)) % MOD;
inv[i + 1] = mypow(frc[i + 1], MOD - 2);
}
}
if (k < 0 || n < k)
return 0;
cb_res = (((frc[n] * inv[k]) % MOD) * inv[n - k]) % MOD;
return cb_res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// (0, 0) -> (r, c) : (r + c)Cr
// sum_{c = 0, ..., c2}rCc = (r + 1)Cc2
ll res = 0;
for (ll r = r1; r <= r2; r++) {
res += MOD + comb(r + 1 + c2, c2) - comb(r + 1 + c1 - 1, c1 - 1);
res %= MOD;
}
cout << res << endl;
return 0;
} | replace | 31 | 33 | 31 | 33 | 0 | |
p02782 | C++ | Runtime Error | // #undef _DEBUG
// #pragma GCC optimize("Ofast")
// 不動小数点の計算高速化
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
auto past_time = system_clock::now();
#define debugName(VariableName) #VariableName
// 最大引数がN
#define over2(o1, o2, name, ...) name
#define over3(o1, o2, o3, name, ...) name
#define over4(o1, o2, o3, o4, name, ...) name
#define over5(o1, o2, o3, o4, o5, name, ...) name
#define over6(o1, o2, o3, o4, o5, o6, name, ...) name
#define over7(o1, o2, o3, o4, o5, o6, o7, name, ...) name
#define over8(o1, o2, o3, o4, o5, o6, o7, o8, name, ...) name
#define over9(o1, o2, o3, o4, o5, o6, o7, o8, o9, name, ...) name
#define over10(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name
/*@formatter:off*/
//[-n, n)にアクセスできる
// また、外部関数resizeに渡せる
// sizeは[-n, n)でnを返す
template <class T> class mvec {
vector<T> v;
int n;
public:
mvec() : n(0), v(0) {}
mvec(int n) : n(n), v(n * 2) {}
mvec(int n, T val) : n(n), v(n * 2, val) {}
auto &operator[](int i) { return v[i + n]; }
auto size() { return n; }
void resize(int sn) {
assert(n == 0);
n = sn;
v.resize(sn * 2);
}
auto begin() { return v.begin(); }
auto rbegin() { return v.rbegin(); }
auto end() { return v.end(); }
auto rend() { return v.rend(); }
};
//[]でboolは参照を返さないため特殊化が必要
template <> struct mvec<bool> {
vector<bool> v;
int n;
mvec() : n(0), v(0) {}
mvec(int n) : n(n), v(n * 2) {}
mvec(int n, bool val) : n(n), v(n * 2, val) {}
auto operator[](int i) { return v[i + n]; }
auto size() { return v.size(); }
void resize(int sn) {
assert(n == 0);
n = sn;
v.resize(sn * 2);
}
auto begin() { return v.begin(); }
auto rbegin() { return v.rbegin(); }
auto end() { return v.end(); }
auto rend() { return v.rend(); }
};
template <class T> ostream &operator<<(ostream &os, mvec<T> &a) {
int spa = 3;
for (auto &&v : a) {
spa = max(spa, (int)(to_string(v).size()) + 1);
}
int n = (int)a.size();
os << endl;
for (int i = -n; i < n; i++) {
int need = spa - ((int)to_string(i).size());
if (i == -n) {
need -= min(need, spa - ((int)to_string(a[i]).size()));
}
while (need--) {
os << " ";
}
os << i;
}
os << endl;
int i = -n;
for (auto &&v : a) {
int need = spa - ((int)to_string(v).size());
if (i == -n) {
need -= min(need, spa - ((int)to_string(i).size()));
}
while (need--) {
os << " ";
}
os << v;
i++;
}
return os;
}
#define mv mvec
#define MV mvec
using mvi = mvec<ll>;
using mvb = mvec<bool>;
using mvs = mvec<string>;
using mvd = mvec<double>;
using mvc = mvec<char>;
#define mvvt0(t) mvec<mvec<t>>
#define mvvt1(t, a) mvec<mvec<t>> a
#define mvvt2(t, a, b) mvec<mvec<t>> a(b)
#define mvvt3(t, a, b, c) mvec<mvec<t>> a(b, mvec<t>(c))
#define mvvt4(t, a, b, c, d) mvec<mvec<t>> a(b, mvec<t>(c, d))
#define mvvi(...) \
over4(__VA_ARGS__, mvvt4, mvvt3, mvvt2, mvvt1, mvvt0)(ll, __VA_ARGS__)
template <typename T> mvec<T> make_mv(size_t a) { return mvec<T>(a); }
template <typename T, typename... Ts> auto make_mv(size_t a, Ts... ts) {
return mvec<decltype(make_mv<T>(ts...))>(a, make_mv<T>(ts...));
}
#define mvni(name, ...) auto name = make_mv<ll>(__VA_ARGS__)
#ifdef _DEBUG
string message;
// https://marycore.jp/prog/cpp/class-extension-methods/ 違うかも
template <class T, class A = std::allocator<T>>
struct debtor : std::vector<T, A> {
using std::vector<T, A>::vector;
template <class U> int deb_v(U a, int v) { return v; }
template <class U> int deb_v(debtor<U> &a, int v = 0) {
cerr << a.size() << " ";
return deb_v(a.at(0), v + 1);
}
template <class U> void deb_o(U a) { cerr << a << " "; }
template <class U> void deb_o(debtor<U> &a) {
for (int i = 0; i < min((int)a.size(), 15ll); i++) {
deb_o(a[i]);
}
if ((int)a.size() > 15) {
cerr << "...";
}
cerr << endl;
}
typename std::vector<T>::reference
operator[](typename std::vector<T>::size_type n) {
if (n < 0 || n >= (int)this->size()) {
int siz = (int)this->size();
cerr << "vector size = ";
int dim = deb_v((*this));
cerr << endl;
cerr << "out index at " << n << endl;
cerr << endl;
if (dim <= 2) {
deb_o((*this));
}
exit(0);
}
return this->at(n);
}
};
// #define vector debtor
// 区間削除は出来ない
template <class T> struct my_pbds_tree {
set<T> s;
auto begin() { return s.begin(); }
auto end() { return s.end(); }
auto rbegin() { return s.rbegin(); }
auto rend() { return s.rend(); }
auto empty() { return s.empty(); }
auto size() { return s.size(); }
void clear() { s.clear(); }
template <class U> void insert(U v) { s.insert(v); }
template <class U> void operator+=(U v) { insert(v); }
template <class F> auto erase(F v) { return s.erase(v); }
template <class U> auto find(U v) { return s.find(v); }
template <class U> auto lower_bound(U v) { return s.lower_bound(v); }
template <class U> auto upper_bound(U v) { return s.upper_bound(v); }
auto find_by_order(ll k) {
auto it = s.begin();
for (ll i = 0; i < k; i++)
it++;
return it;
}
auto order_of_key(ll v) {
auto it = s.begin();
ll i = 0;
for (; it != s.end() && *it < v; i++)
it++;
return i;
}
};
#define pbds(T) my_pbds_tree<T>
// gp_hash_tableでcountを使えないようにするため
template <class T, class U> struct my_unordered_map {
unordered_map<T, U> m;
my_unordered_map(){};
auto begin() { return m.begin(); }
auto end() { return m.end(); }
auto cbegin() { return m.cbegin(); }
auto cend() { return m.cend(); }
template <class V> auto erase(V v) { return m.erase(v); }
void clear() {
m.clear();
} /*countは gp_hash_tableに存在しない*/ /*!= m.end()*/
template <class V> auto find(V v) { return m.find(v); }
template <class V> auto &operator[](V n) { return m[n]; }
};
#define unordered_map my_unordered_map
#define umapi unordered_map<ll, ll>
#define umapp unordered_map<P, ll>
#define umapu unordered_map<uint64_t, ll>
#define umapip unordered_map<ll, P>
#else
#define endl '\n'
// umapはunorderd_mapになる
// umapiはgp_hash_table
// find_by_order(k) k番目のイテレーター
// order_of_key(k) k以上が前から何番目か
#define pbds(U) \
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, \
__gnu_pbds::tree_order_statistics_node_update>
#define umapi __gnu_pbds::gp_hash_table<ll, ll, xorshift>
#define umapp __gnu_pbds::gp_hash_table<P, ll, xorshift>
#define umapu __gnu_pbds::gp_hash_table<uint64_t, ll, xorshift>
#define umapip __gnu_pbds::gp_hash_table<ll, P, xorshift>
#endif
/*@formatter:on*/
struct xorshift {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(std::pair<ll, ll> x) const {
ll v = ((x.first) << 32) | x.second;
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(v + FIXED_RANDOM);
}
};
/*@formatter:off*/
template <class U, class L>
void operator+=(
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> &s,
L v) {
s.insert(v);
}
// 衝突対策
#define ws ws_
template <class A, class B, class C> struct T2 {
A f;
B s;
C t;
T2() { f = 0, s = 0, t = 0; }
T2(A f, B s, C t) : f(f), s(s), t(t) {}
bool operator<(const T2 &r) const {
return f != r.f ? f < r.f
: s != r.s ? s < r.s
: t < r.t; /*return f != r.f ? f > r.f : s != r.s ?n s >
r.s : t > r.t; 大きい順 */
}
bool operator>(const T2 &r) const {
return f != r.f ? f > r.f
: s != r.s ? s > r.s
: t > r.t; /*return f != r.f ? f > r.f : s != r.s ? s >
r.s : t > r.t; 小さい順 */
}
bool operator==(const T2 &r) const {
return f == r.f && s == r.s && t == r.t;
}
bool operator!=(const T2 &r) const {
return f != r.f || s != r.s || t != r.t;
}
};
template <class A, class B, class C, class D> struct F2 {
A a;
B b;
C c;
D d;
F2() { a = 0, b = 0, c = 0, d = 0; }
F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F2 &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d; /* return a != r.a ? a > r.a : b != r.b ? b
> r.b : c != r.c ? c > r.c : d > r.d;*/
}
bool operator>(const F2 &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d; /* return a != r.a ? a < r.a : b != r.b
? b < r.b : c != r.c ? c < r.c : d < r.d;*/
}
bool operator==(const F2 &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F2 &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
ll operator[](ll i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
typedef T2<ll, ll, ll> T;
typedef F2<ll, ll, ll, ll> F;
T mt(ll a, ll b, ll c) { return T(a, b, c); }
F mf(ll a, ll b, ll c, ll d) { return F(a, b, c, d); }
//@マクロ省略系 型,構造
#define double long double
using dou = double;
const double eps = 1e-9;
// 基本コメントアウト
/*
struct epsdou { double v; epsdou(double v = 0) : v(v) {} template<class
T> epsdou &operator+=(T b) { v += (double) b; return (*this); }
template<class T> epsdou &operator-=(T b) { v -= (double) b; return
(*this); } template<class T> epsdou &operator*=(T b) { v *=
(double) b; return (*this); } template<class T> epsdou
&operator/=(T b) { v /= (double) b; return (*this); } epsdou
operator+(epsdou b) { return v + (double) b; } epsdou operator-(epsdou b) {
return v - (double) b; } epsdou operator*(epsdou b) { return v * (double) b;
} epsdou operator/(epsdou b) { return v / (double) b; } epsdou operator-()
const { return epsdou(-v); } template<class T> bool operator<(T b) { return v
< (double) b; } template<class T> bool operator>(T b) { return v > (double)
b; } template<class T> bool operator==(T b) { return fabs(v - (double) b) <=
eps; } template<class T> bool operator<=(T b) { return v < (double) b ||
fabs(v - b) <= eps; } template<class T> bool operator>=(T b) { return v >
(double) b || fabs(v - b) <= eps; } operator double() { return v; }};istream
&operator>>(istream &iss, epsdou &a) { iss >> a.v; return iss;}ostream
&operator<<(ostream &os, epsdou &a) { os << a.v; return os;} #define
eps_conr_t(o) template<class T> epsdou operator o(T b, epsdou a){return a.v o
(dou)b;} #define eps_conl_t(o) template<class T> epsdou operator o(epsdou a, T
b){return a.v o (dou)b;}
eps_conl_t(+)eps_conl_t(-)eps_conl_t(*)eps_conl_t(/)eps_conr_t(+)eps_conr_t(-)eps_conr_t(*)eps_conr_t(/)
#undef double
#define double epsdou
*/
#define ull unsigned long long
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
using mvp = mvec<P>;
using mvt = mvec<T>;
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
#define fi first
#define se second
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define el else
#define elf else if
#define upd update
#define sstream stringstream
#define maxq 1
#define minq -1
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MALLOC(type, len) (type *)malloc((len) * sizeof(type))
#define lam1(ret) [&](auto &v) { return ret; }
#define lam2(v, ret) [&](auto &v) { return ret; }
#define lam(...) over2(__VA_ARGS__, lam2, lam1)(__VA_ARGS__)
#define lamr(right) [&](auto &p) { return p right; }
// マクロ省略系 コンテナ
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
using vt = vector<T>;
// #define V vector
#define vvt0(t) vector<vector<t>>
#define vvt1(t, a) vector<vector<t>> a
#define vvt2(t, a, b) vector<vector<t>> a(b)
#define vvt3(t, a, b, c) vector<vector<t>> a(b, vector<t>(c))
#define vvt4(t, a, b, c, d) vector<vector<t>> a(b, vector<t>(c, d))
#define vvi(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(ll, __VA_ARGS__)
#define vvb(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(bool, __VA_ARGS__)
#define vvs(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(string, __VA_ARGS__)
#define vvd(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(double, __VA_ARGS__)
#define vvc(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(char, __VA_ARGS__)
#define vvp(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(P, __VA_ARGS__)
#define vvt(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(T, __VA_ARGS__)
#define vv(type, ...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(type, __VA_ARGS__)
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define vn(type, name, ...) auto name = make_v<type>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<ll, ll>;
using mapp = map<P, ll>;
using mapd = map<dou, ll>;
using mapc = map<char, ll>;
using maps = map<str, ll>;
using seti = set<ll>;
using setp = set<P>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<ll>;
#define uset unordered_set
#define useti unordered_set<ll, xorshift>
#define mset multiset
#define mseti multiset<ll>
#define umap unordered_map
#define mmap multimap
// 任意のマクロサポート用 使う度に初期化する
int index_, v1_, v2_, v3_;
template <class T> struct pq {
priority_queue<T, vector<T>, greater<T>> q; /*小さい順*/
T su = 0;
void clear() {
q = priority_queue<T, vector<T>, greater<T>>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
template <class T> struct pqg {
priority_queue<T> q; /*大きい順*/
T su = 0;
void clear() {
q = priority_queue<T>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
#define pqi pq<ll>
#define pqgi pqg<ll>
// マクロ 繰り返し
// ↓@オーバーロード隔離
#define rep1(n) for (ll rep1i = 0, rep1lim = n; rep1i < rep1lim; ++rep1i)
#define rep2(i, n) for (ll i = 0, rep2lim = n; i < rep2lim; ++i)
#define rep3(i, m, n) for (ll i = m, rep3lim = n; i < rep3lim; ++i)
#define rep4(i, m, n, ad) for (ll i = m, rep4lim = n; i < rep4lim; i += ad)
// 逆順 閉区間
#define rer2(i, n) for (ll i = n; i >= 0; i--)
#define rer3(i, m, n) for (ll i = m, rer3lim = n; i >= rer3lim; i--)
#define rer4(i, m, n, dec) for (ll i = m, rer4lim = n; i >= rer4lim; i -= dec)
// ループを一つにまとめないとフォーマットで汚くなるため
#define nex_ind1(i) i++
#define nex_ind2(i, j, J) \
i = (j + 1 == J) ? i + 1 : i, j = (j + 1 == J ? 0 : j + 1)
#define nex_ind3(i, j, k, J, K) \
i = (j + 1 == J && k + 1 == K) ? i + 1 : i, \
j = (k + 1 == K) ? (j + 1 == J ? 0 : j + 1) : j, \
k = (k + 1 == K ? 0 : k + 1)
#define nex_ind4(i, j, k, l, J, K, L) \
i = (j + 1 == J && k + 1 == K && l + 1 == L) ? i + 1 : i, \
j = (k + 1 == K && l + 1 == L) ? (j + 1 == J ? 0 : j + 1) : j, \
k = (l + 1 == L ? (k + 1 == K ? 0 : k + 1) : k), l = l + 1 == L ? 0 : l + 1
#define nex_ind5(i, j, k, l, m, J, K, L, M) \
i = (j + 1 == J && k + 1 == K && l + 1 == L && m + 1 == M) ? i + 1 : i, \
j = (k + 1 == K && l + 1 == L && m + 1 == M) ? (j + 1 == J ? 0 : j + 1) : j, \
k = (l + 1 == L && m + 1 == M ? (k + 1 == K ? 0 : k + 1) : k), \
l = m + 1 == M ? l + 1 == L ? 0 : l + 1 : l, m = m + 1 == M ? 0 : m + 1
#define repss2(i, I) for (int i = 0; i < I; i++)
#define repss4(i, j, I, J) \
for (int i = (J ? 0 : I), j = 0; i < I; nex_ind2(i, j, J))
#define repss6(i, j, k, I, J, K) \
for (int i = (J && K ? 0 : I), j = 0, k = 0; i < I; nex_ind3(i, j, k, J, K))
#define repss8(i, j, k, l, I, J, K, L) \
for (int i = (J && K && L ? 0 : I), j = 0, k = 0, l = 0; i < I; \
nex_ind4(i, j, k, l, J, K, L))
#define repss10(i, j, k, l, m, I, J, K, L, M) \
for (int i = (J && K && L && M ? 0 : I), j = 0, k = 0, l = 0, m = 0; i < I; \
nex_ind5(i, j, k, l, m, J, K, L, M))
// i,j,k...をnまで見る
#define reps2(i, n) repss2(i, n)
#define reps3(i, j, n) repss4(i, j, n, n)
#define reps4(i, j, k, n) repss6(i, j, k, n, n, n)
#define reps5(i, j, k, l, n) repss8(i, j, k, l, n, n, n, n)
template <class T>
void nex_repv2(int &i, int &j, int &I, int &J, vector<vector<T>> &s) {
while (1) {
j++;
if (j >= J) {
j = 0;
i++;
if (i < I) {
J = (int)s[i].size();
}
}
if (i >= I || J)
return;
}
}
template <class T>
void nex_repv3(int &i, int &j, int &k, int &I, int &J, int &K,
vector<vector<vector<T>>> &s) {
while (1) {
k++;
if (k >= K) {
k = 0;
j++;
if (j >= J) {
j = 0;
i++;
if (i >= I)
return;
}
}
J = (int)s[i].size();
K = (int)s[i][j].size();
if (J && K)
return;
}
}
#define repv_2(i, a) repss2(i, sz(a))
// 正方形である必要はない
// 直前を持つのとどっちが早いか
#define repv_3(i, j, a) \
for (int I = (int)a.size(), J = (int)a[0].size(), i = 0, j = 0; i < I; \
nex_repv2(i, j, I, J, a))
// 箱状になっている事が要求される つまり[i] 次元目の要素数は一定
#define repv_4(i, j, k, a) \
for (int I = (int)a.size(), J = (int)a[0].size(), K = (int)a[0][0].size(), \
i = 0, j = 0, k = 0; \
i < I; nex_repv3(i, j, k, I, J, K, a))
#define repv_5(i, j, k, l, a) \
repss8(i, j, k, l, sz(a), sz(a[0]), sz(a[0][0]), sz(a[0][0][0]))
#define repv_6(i, j, k, l, m, a) \
repss10(i, j, k, l, m, sz(a), sz(a[0]), sz(a[0][0]), sz(a[0][0][0]), \
sz(a[0][0][0][0]))
template <typename T> struct has_rbegin_rend {
private:
template <typename U>
static auto check(U &&obj)
-> decltype(std::rbegin(obj), std::rend(obj), std::true_type{});
static std::false_type check(...);
public:
static constexpr bool value = decltype(check(std::declval<T>()))::value;
};
template <typename T>
constexpr bool has_rbegin_rend_v = has_rbegin_rend<T>::value;
template <typename Iterator> class Range {
public:
Range(Iterator &&begin, Iterator &&end) noexcept
: m_begin(std::forward<Iterator>(begin)),
m_end(std::forward<Iterator>(end)) {}
Iterator begin() const noexcept { return m_begin; }
Iterator end() const noexcept { return m_end; }
private:
const Iterator m_begin;
const Iterator m_end;
};
template <typename Iterator>
static inline Range<Iterator> makeRange(Iterator &&begin,
Iterator &&end) noexcept {
return Range<Iterator>{std::forward<Iterator>(begin),
std::forward<Iterator>(end)};
}
template <typename T>
static inline decltype(auto)
makeReversedRange(const std::initializer_list<T> &iniList) noexcept {
return makeRange(std::rbegin(iniList), std::rend(iniList));
}
template <typename T, typename std::enable_if_t<has_rbegin_rend_v<T>,
std::nullptr_t> = nullptr>
static inline decltype(auto) makeReversedRange(T &&c) noexcept {
return makeRange(std::rbegin(c), std::rend(c));
} /* rbegin(),
rend()を持たないものはこっちに分岐させて，エラーメッセージを少なくする*/
template <typename T, typename std::enable_if<!has_rbegin_rend<T>::value,
std::nullptr_t>::type = nullptr>
static inline void makeReversedRange(T &&) noexcept {
static_assert(has_rbegin_rend<T>::value,
"Specified argument doesn't have reverse iterator.");
}
#define form1(st) \
for (auto &&form_it = st.begin(); form_it != st.end(); ++form_it)
#define form3(k, v, st) \
for (auto &&form_it = st.begin(); form_it != st.end(); ++form_it)
#define form4(k, v, st, r) \
for (auto &&form_it = st.begin(); form_it != st.end() && (*form_it).fi < r; \
++form_it)
#define form5(k, v, st, l, r) \
for (auto &&form_it = st.lower_bound(l); \
form_it != st.end() && (*form_it).fi < r; ++form_it)
#define forrm1(st) \
for (auto &&forrm_it = st.rbegin(); forrm_it != st.rend(); ++forrm_it)
#define forrm3(k, v, st) \
for (auto &&forrm_it = st.rbegin(); forrm_it != st.rend(); ++forrm_it)
#define fors1(st) \
for (auto &&fors_it = st.begin(); fors_it != st.end(); ++fors_it)
#define fors2(v, st) \
for (auto &&fors_it = st.begin(); fors_it != st.end(); ++fors_it)
#define fors3(v, st, r) \
for (auto &&fors_it = st.begin(); fors_it != st.end() && (*fors_it) < r; \
++fors_it)
#define fors4(v, st, l, r) \
for (auto &&fors_it = st.lower_bound(l); \
fors_it != st.end() && (*fors_it) < r; ++fors_it)
#define forslr3(st, a, b) \
for (auto &&forslr_it = st.begin(); forslr_it != st.end(); ++forslr_it)
#define forslr4(v, st, a, b) \
for (auto &&forslr_it = st.begin(); forslr_it != st.end(); ++forslr_it)
#define forslr5(v, st, r, a, b) \
for (auto &&forslr_it = st.begin(); \
forslr_it != st.end() && (*forslr_it) < r; ++forslr_it)
#define forslr6(v, st, l, r, a, b) \
for (auto &&forslr_it = st.lower_bound(l); \
forslr_it != st.end() && (*forslr_it) < r; ++forslr_it)
template <class U> vector<U> to1d(vector<U> &a) { return a; }
template <class U> vector<U> to1d(vector<vector<U>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
res.push_back(a2);
return res;
}
template <class U> vector<U> to1d(vector<vector<vector<U>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
res.push_back(a3);
return res;
}
template <class U> vector<U> to1d(vector<vector<vector<vector<U>>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
for (auto &&a4 : a3)
res.push_back(a4);
return res;
}
template <class U>
vector<U> to1d(vector<vector<vector<vector<vector<U>>>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
for (auto &&a4 : a3)
for (auto &&a5 : a4)
res.push_back(a5);
return res;
}
template <class U>
vector<U> to1d(vector<vector<vector<vector<vector<vector<U>>>>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
for (auto &&a4 : a3)
for (auto &&a5 : a4)
for (auto &&a6 : a5)
res.push_back(a6);
return res;
}
#define fora_init_2(a, A) ;
#define fora_init_3(fora_i, a, A) auto &&a = A[fora_i];
#define fora_init_4(a, b, A, B) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i];
#define fora_init_5(fora_i, a, b, A, B) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i];
#define fora_init_6(a, b, c, A, B, C) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i];
#define fora_init_7(fora_i, a, b, c, A, B, C) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i];
#define fora_init_8(a, b, c, d, A, B, C, D) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i]; \
auto &&d = D[fora_i];
#define fora_init_9(fora_i, a, b, c, d, A, B, C, D) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i]; \
auto &&d = D[fora_i];
#define fora_init(...) \
over9(__VA_ARGS__, fora_init_9, fora_init_8, fora_init_7, fora_init_6, \
fora_init_5, fora_init_4, fora_init_3, fora_init_2)(__VA_ARGS__)
#define forr_init_2(a, A) auto &&a = A[forr_i];
#define forr_init_3(forr_i, a, A) auto &&a = A[forr_i];
#define forr_init_4(a, b, A, B) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i];
#define forr_init_5(forr_i, a, b, A, B) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i];
#define forr_init_6(a, b, c, A, B, C) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i];
#define forr_init_7(forr_i, a, b, c, A, B, C) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i];
#define forr_init_8(a, b, c, d, A, B, C, D) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i]; \
auto &&d = D[forr_i];
#define forr_init_9(forr_i, a, b, c, d, A, B, C, D) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i]; \
auto &&d = D[forr_i];
#define forr_init(...) \
over9(__VA_ARGS__, forr_init_9, forr_init_8, forr_init_7, forr_init_6, \
forr_init_5, forr_init_4, forr_init_3, forr_init_2)(__VA_ARGS__)
#define forp_init(k, v, ...) \
auto &&k = (*forp_it).fi; \
auto &&v = (*forp_it).se;
#define form_init(k, v, ...) \
auto &&k = (*form_it).fi; \
auto &&v = (*form_it).se;
#define forrm_init(k, v, ...) \
auto &&k = (*forrm_it).fi; \
auto &&v = (*forrm_it).se;
#define fors_init(v, ...) auto &&v = (*fors_it);
#define forlr_init(a, A, ngl, ngr) \
auto a = A[forlr_i]; \
auto prev = forlr_i ? A[forlr_i - 1] : ngl; \
auto next = forlr_i + 1 < rep2lim ? A[forlr_i + 1] : ngr;
#define forslr_init4(a, A, ngl, ngr) \
auto a = (*forslr_it); \
auto prev = (forslr_it != A.begin()) ? (*std::prev(forslr_it)) : ngl; \
auto next = (forslr_it != std::prev(A.end())) ? (*std::next(forslr_it)) : ngr;
#define forslr_init5(a, A, r, ngl, ngr) \
auto a = (*forslr_it); \
auto prev = (forslr_it != A.begin()) ? (*std::prev(forslr_it)) : ngl; \
auto next = (forslr_it != std::prev(A.end())) ? (*std::next(forslr_it)) : ngr;
#define forslr_init6(a, A, l, r, ngl, ngr) \
auto a = (*forslr_it); \
auto prev = (forslr_it != A.begin()) ? (*std::prev(forslr_it)) : ngl; \
auto next = (forslr_it != std::prev(A.end())) ? (*std::next(forslr_it)) : ngr;
#define forslr_init(...) \
over6(__VA_ARGS__, forslr_init6, forslr_init5, forslr_init4)(__VA_ARGS__);
#define fora_2(a, A) for (auto &&a : A)
#define fora_3(fora_i, a, A) rep(fora_i, sz(A))
#define fora_4(a, b, A, B) rep(fora_i, sz(A))
#define fora_5(fora_i, a, b, A, B) rep(fora_i, sz(A))
#define fora_6(a, b, c, A, B, C) rep(fora_i, sz(A))
#define fora_7(fora_i, a, b, c, A, B, C) rep(fora_i, sz(A))
#define fora_8(a, b, c, d, A, B, C, D) rep(fora_i, sz(A))
#define fora_9(fora_i, a, b, c, d, A, B, C, D) rep(fora_i, sz(A))
#define forr_2(a, A) rer(forr_i, sz(A) - 1)
#define forr_3(forr_i, a, A) rer(forr_i, sz(A) - 1)
#define forr_4(a, b, A, B) rer(forr_i, sz(A) - 1)
#define forr_5(forr_i, a, b, A, B) rer(forr_i, sz(A) - 1)
#define forr_6(a, b, c, A, B, C) rer(forr_i, sz(A) - 1)
#define forr_7(forr_i, a, b, c, A, B, C) rer(forr_i, sz(A) - 1)
#define forr_8(a, b, c, d, A, B, C, D) rer(forr_i, sz(A) - 1)
#define forr_9(forr_i, a, b, c, d, A, B, C, D) rer(forr_i, sz(A) - 1)
// ↑@オーバーロード隔離
// rep系はインデックス、for系は中身
#define rep(...) over4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rer(...) over4(__VA_ARGS__, rer4, rer3, rer2, )(__VA_ARGS__)
// char用のrep
#define repc(i, m, n) for (char i = m, repc3lim = n; i < repc3lim; ++i)
// i,j,k...をnまで見る
#define reps(...) over5(__VA_ARGS__, reps5, reps4, reps3, reps2, )(__VA_ARGS__)
#define repss(...) \
over10(__VA_ARGS__, repss10, a, repss8, a, repss6, a, repss4, a, \
repss2)(__VA_ARGS__)
// vectorのindexを走査する
// repv(i,j,vvi)
#define repv(...) \
over6(__VA_ARGS__, repv_6, repv_5, repv_4, repv_3, repv_2, )(__VA_ARGS__)
#define rerv(i, A) for (int i = sz(A) - 1; i >= 0; i--)
// repvn(dp) nは次元
#define repv1(a) repv(i, a)
#define repv2(a) repv(i, j, a)
#define repv3(a) repv(i, j, k, a)
#define repv4(a) repv(i, j, k, l, a)
#define fora(...) \
over9(__VA_ARGS__, fora_9, fora_8, fora_7, fora_6, fora_5, fora_4, fora_3, \
fora_2)(__VA_ARGS__)
#define forr(...) \
over9(__VA_ARGS__, forr_9, forr_8, forr_7, forr_6, forr_5, forr_4, forr_3, \
forr_2)(__VA_ARGS__)
// #define forr(v, a) for(auto&& v : makeReversedRange(a))
// 参照を取らない
#define forv(a, b) for (auto a : to1d(b))
// インデックスを前後含めて走査
#define ring(i, s, len) \
for (int i = s, prev = (s == 0) ? len - 1 : s - 1, \
next = (s == len - 1) ? 0 : s + 1, cou = 0; \
cou < len; \
cou++, prev = i, i = next, next = (next == len - 1) ? 0 : next + 1)
// 値と前後を見る
#define ringv(v, d) \
index_ = 0; \
for (auto prev = d[sz(d) - 1], next = (int)d.size() > 1 ? d[1] : d[0], \
v = d[0]; \
index_ < sz(d); index_++, prev = v, v = next, \
next = (index_ >= sz(d) - 1 ? d[0] : d[index_ + 1]))
// 左右をnext prevで見る 0の左と nの右
#define forlr(v, d, banpei_l, banpei_r) rep(forlr_i, sz(d))
#define form(...) \
over5(__VA_ARGS__, form5, form4, form3, form2, form1)(__VA_ARGS__)
#define forrm(...) \
over5(__VA_ARGS__, forrm5, forrm4, forrm3, forrm2, forrm1)(__VA_ARGS__)
#define fors(...) over4(__VA_ARGS__, fors4, fors3, fors2, fors1)(__VA_ARGS__)
#define forslr(...) \
over6(__VA_ARGS__, forslr6, forslr5, forslr4, forslr3)(__VA_ARGS__)
#define forp(k, v, st) \
for (auto &&forp_it = st.begin(); forp_it != st.end(); ++forp_it)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const ll inf = (ll)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const dou dinf = (dou)linf * linf;
const char infc = '{';
const string infs = "{";
const double PI = 3.1415926535897932384626433832795029L;
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((ll)(a).size())
#define mp make_pair
#define pb pop_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr bool ev(ll a) { return !(a & 1); }
constexpr bool od(ll a) { return (a & 1); }
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public
: /*大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断*/
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
} // namespace std
// stream まとめ
/*@formatter:on*/
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {
os << p.fi << " " << p.se;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (ll i = 0; i < vec.size(); ++i)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (ll i = 0; i < vec.size(); ++i) {
for (ll j = 0; j < vec[i].size(); ++j) {
os << vec[i][j] << " ";
}
os << endl;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
os << endl;
for (auto &&v : m)
os << v << endl;
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, mset<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> a) {
fora(v, a) os << v << " ";
return os;
}
ostream &operator<<(ostream &os, vector<vector<char>> &vec) {
rep(h, sz(vec)) {
rep(w, sz(vec[0])) { os << vec[h][w]; }
os << endl;
}
return os;
}
// template<class T,class U>ostream &operator<<(ostream &os, vector<pair<T,U>>&
// a) {fora(v,a)os<<v<<endl;return os;}
/*@formatter:off*/
template <typename W, typename H> void resize(W &vec, const H head) {
vec.resize(head);
}
template <typename W, typename H, typename... T>
void resize(W &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
// template<typename W, typename H> void resize(vector<W> &vec, const H head) {
// vec.resize(head); } template<typename W, typename H, typename ... T> void
// resize(vector<W> &vec, const H &head, const T ... tail) {vec.resize(head);for
// (auto &v: vec)resize(v, tail...);}
template <typename T, typename F> bool all_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool all_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (!all_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool any_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool any_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (any_of2(v[i], f))
return true;
}
return false;
}
template <typename T, typename F> bool none_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool none_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (none_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool find_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll find_if2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (find_if2(v[i], f))
return i;
}
return sz(v);
}
template <typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll rfind_if2(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (rfind_if2(v[i], f))
return i;
}
return -1;
}
template <class T> bool contains(string &s, const T &v) {
return s.find(v) != string::npos;
}
template <typename T> bool contains(vector<T> &v, const T &val) {
return std::find(v.begin(), v.end(), val) != v.end();
}
template <typename T, typename F> bool contains_if2(vector<T> &v, F f) {
return find_if(v.begin(), v.end(), f) != v.end();
}
template <typename T, typename F> ll count_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll count_if2(vector<T> &vec, F f) {
ll ret = 0;
fora(v, vec) ret += count_if2(v, f);
return ret;
}
template <typename T, typename F> void for_each2(T &v, F f) { f(v); }
template <typename T, typename F> void for_each2(vector<T> &vec, F f) {
fora(v, vec) for_each2(v, f);
}
template <typename W> ll count_od(vector<W> &a) {
return count_if2(a, [](ll v) { return v & 1; });
}
template <typename W> ll count_ev(vector<W> &a) {
return count_if2(a, [](ll v) { return !(v & 1); });
}
// 削除した後のvectorを返す
template <typename T, typename F> vector<T> erase_if2(vector<T> &v, F f) {
vector<T> nv;
rep(i, sz(v)) {
if (!f(v[i])) {
nv.push_back(v[i]);
}
}
return nv;
}
template <typename T, typename F>
vector<vector<T>> erase_if2(vector<vector<T>> &v, F f) {
vector<vector<T>> res;
rep(i, sz(v)) { res[i] = erase_if2(v[i], f); }
return res;
}
template <typename T, typename F> vector<T> l_erase_if2(vector<T> &v, F f) {
vector<T> nv;
rep(i, sz(v)) {
if (!f(v[i])) {
nv.push_back(v[i]);
}
}
return nv;
}
template <typename T, typename F> ll l_rfind_if(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (f(v[i]))
return i;
}
return -1;
}
template <typename T, typename F> bool l_contains_if(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (f(v[i]))
return true;
}
return false;
}
template <class A, class B, class C> auto t_all_of(A a, B b, C c) {
return std::all_of(a, b, c);
}
template <class A, class B, class C> auto t_any_of(A a, B b, C c) {
return std::any_of(a, b, c);
}
template <class A, class B, class C> auto t_none_of(A a, B b, C c) {
return std::none_of(a, b, c);
}
template <class A, class B, class C> auto t_find_if(A a, B b, C c) {
return std::find_if(a, b, c);
}
template <class A, class B, class C> auto t_count_if(A a, B b, C c) {
return std::count_if(a, b, c);
}
#define all_of_s__2(a, right) (t_all_of(all(a), lamr(right)))
#define all_of_s__3(a, v, siki) (t_all_of(all(a), [&](auto v) { return siki; }))
#define all_of_s(...) over3(__VA_ARGS__, all_of_s__3, all_of_s__2)(__VA_ARGS__)
// all_of(A, %2);
// all_of(A, a, a%2);
#define all_of__2(a, right) all_of2(a, lamr(right))
#define all_of__3(a, v, siki) all_of2(a, [&](auto v) { return siki; })
#define all_of(...) over3(__VA_ARGS__, all_of__3, all_of__2)(__VA_ARGS__)
#define all_of_f(a, f) all_of2(a, f)
#define any_of_s__2(a, right) (t_any_of(all(a), lamr(right)))
#define any_of_s__3(a, v, siki) (t_any_of(all(a), [&](auto v) { return siki; }))
#define any_of_s(...) over3(__VA_ARGS__, any_of_s__3, any_of_s__2)(__VA_ARGS__)
#define any_of__2(a, right) any_of2(a, lamr(right))
#define any_of__3(a, v, siki) any_of2(a, [&](auto v) { return siki; })
#define any_of(...) over3(__VA_ARGS__, any_of__3, any_of__2)(__VA_ARGS__)
#define any_of_f(a, f) any_of2(a, f)
#define none_of_s__2(a, right) (t_none_of(all(a), lamr(right)))
#define none_of_s__3(a, v, siki) \
(t_none_of(all(a), [&](auto v) { return siki; }))
#define none_of_s(...) \
over3(__VA_ARGS__, none_of_s__3, none_of_s__2)(__VA_ARGS__)
#define none_of__2(a, right) none_of2(a, lamr(right))
#define none_of__3(a, v, siki) none_of2(a, [&](auto v) { return siki; })
#define none_of(...) over3(__VA_ARGS__, none_of__3, none_of__2)(__VA_ARGS__)
#define none_of_f(a, f) none_of2(a, f)
#define find_if_s__2(a, right) (t_find_if(all(a), lamr(right)) - a.begin())
#define find_if_s__3(a, v, siki) \
(t_find_if(all(a), [&](auto v) { return siki; }) - a.begin())
#define find_if_s(...) \
over3(__VA_ARGS__, find_if_s__3, find_if_s__2)(__VA_ARGS__)
#define find_if__2(a, right) find_if2(a, lamr(right))
#define find_if__3(a, v, siki) find_if2(a, [&](auto v) { return siki; })
#define find_if(...) over3(__VA_ARGS__, find_if__3, find_if__2)(__VA_ARGS__)
#define find_if_f(a, f) find_if2(a, f)
#define rfind_if_s__2(a, right) l_rfind_if(a, lamr(right))
#define rfind_if_s__3(a, v, siki) l_rfind_if(a, [&](auto v) { return siki; })
#define rfind_if_s(...) \
over3(__VA_ARGS__, rfind_if_s__3, rfind_if_s__2)(__VA_ARGS__)
#define rfind_if__2(a, right) rfind_if2(a, lamr(right))
#define rfind_if__3(a, v, siki) rfind_if2(a, [&](auto v) { return siki; })
#define rfind_if(...) over3(__VA_ARGS__, rfind_if__3, rfind_if__2)(__VA_ARGS__)
#define rfind_if_f(a, f) rfind_if2(a, f)
#define contains_if_s__2(a, right) l_contains_if(a, lamr(right))
#define contains_if_s__3(a, v, siki) \
l_contains_if(a, [&](auto v) { return siki; })
#define contains_if_s(...) \
over3(__VA_ARGS__, contains_if_s__3, contains_if_s__2)(__VA_ARGS__)
#define contains_if__2(a, right) contains_if2(a, lamr(right))
#define contains_if__3(a, v, siki) contains_if2(a, [&](auto v) { return siki; })
#define contains_if(...) \
over3(__VA_ARGS__, contains_if__3, contains_if__2)(__VA_ARGS__)
#define contains_if_f(a, f) contains_if2(a, f)
#define count_if_s__2(a, right) (t_count_if(all(a), lamr(right)))
#define count_if_s__3(a, v, siki) \
(t_count_if(all(a), [&](auto v) { return siki; }))
#define count_if_s(...) \
over3(__VA_ARGS__, count_if_s__3, count_if_s__2)(__VA_ARGS__)
#define count_if__2(a, right) count_if2(a, lamr(right))
#define count_if__3(a, v, siki) count_if2(a, [&](auto v) { return siki; })
#define count_if(...) over3(__VA_ARGS__, count_if__3, count_if__2)(__VA_ARGS__)
#define count_if_f(a, f) count_if2(a, f)
#define for_each_s__2(a, right) \
do { \
fora(v, a) { v right; } \
} while (0)
#define for_each_s__3(a, v, siki) \
do { \
fora(v, a) { siki; } \
} while (0)
#define for_each_s(...) \
over3(__VA_ARGS__, for_each_s__3, for_each_s__2)(__VA_ARGS__)
#define for_each__2(a, right) for_each2(a, lamr(right))
#define for_each__3(a, v, siki) for_each2(a, [&](auto v) { return siki; })
#define for_each(...) over3(__VA_ARGS__, for_each__3, for_each__2)(__VA_ARGS__)
#define for_each_f(a, f) for_each2(a, f);
#define erase_if_s__2(a, right) l_erase_if2(a, lamr(right))
#define erase_if_s__3(a, v, siki) l_erase_if2(a, [&](auto v) { return siki; })
#define erase_if_s(...) \
over3(__VA_ARGS__, erase_if_s__3, erase_if_s__2)(__VA_ARGS__)
#define erase_if__2(a, right) erase_if2(a, lamr(right))
#define erase_if__3(a, v, siki) erase_if2(a, [&](auto v) { return siki; })
#define erase_if(...) over3(__VA_ARGS__, erase_if__3, erase_if__2)(__VA_ARGS__)
#define erase_if_f(a, f) erase_if2(a, f)
#define entry_if_s__2(a, right) l_entry_if2(a, lamr(right))
#define entry_if_s__3(a, v, siki) l_entry_if2(a, [&](auto v) { return siki; })
#define entry_if_s(...) \
over3(__VA_ARGS__, entry_if_s__3, entry_if_s__2)(__VA_ARGS__)
#define entry_if__2(a, right) entry_if2(a, lamr(right))
#define entry_if__3(a, v, siki) entry_if2(a, [&](auto v) { return siki; })
#define entry_if(...) over3(__VA_ARGS__, entry_if__3, entry_if__2)(__VA_ARGS__)
#define entry_if_f(a, f) entry_if2(a, f)
template <class T, class U, class W> void replace(vector<W> &a, T key, U v) {
rep(i, sz(a)) if (a[i] == key) a[i] = v;
}
template <class T, class U, class W>
void replace(vector<vector<W>> &A, T key, U v) {
rep(i, sz(A)) replace(A[i], key, v);
}
void replace(str &a, char key, str v) {
if (v == "")
a.erase(remove(all(a), key), a.end());
}
void replace(str &a, char key, char v) { replace(all(a), key, v); }
// keyと同じかどうか01で置き換える
template <class T, class U> void replace(vector<T> &a, U k) {
rep(i, sz(a)) a[i] = a[i] == k;
}
template <class T, class U> void replace(vector<vector<T>> &a, U k) {
rep(i, sz(a)) rep(j, sz(a[0])) a[i][j] = a[i][j] == k;
}
// template<class T> void replace(T &a) { replace(a, '#'); }
void replace(str &a) {
int dec = 0;
if ('a' <= a[0] && a[0] <= 'z')
dec = 'a';
if ('A' <= a[0] && a[0] <= 'Z')
dec = 'A';
fora(v, a) v -= dec;
}
void replace(str &a, str key, str v) {
stringstream t;
ll kn = sz(key);
std::string::size_type Pos(a.find(key));
ll l = 0;
while (Pos != std::string::npos) {
t << a.substr(l, Pos - l);
t << v;
l = Pos + kn;
Pos = a.find(key, Pos + kn);
}
t << a.substr(l, sz(a) - l);
a = t.str();
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
void iota(vector<ll> &ve, ll s, ll n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(ll s, ll len) {
vi ve(len);
iota(all(ve), s);
return ve;
}
template <class A, class B> auto vtop(vector<A> &a, vector<B> &b) {
assert(sz(a) == sz(b)); /*stringを0で初期化できない */
vector<pair<A, B>> res;
rep(i, sz(a)) res.eb(a[i], b[i]);
return res;
}
template <class A, class B>
void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {
a.resize(sz(p)), b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <class A, class B, class C>
auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {
assert(sz(a) == sz(b) && sz(b) == sz(c));
vector<T2<A, B, C>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i]);
return res;
}
template <class A, class B, class C, class D>
auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));
vector<F2<A, B, C, D>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i], d[i]);
return res;
}
enum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
enum tcomparator {
fisiti,
fisitd,
fisdti,
fisdtd,
fdsiti,
fdsitd,
fdsdti,
fdsdtd,
fitisi,
fitisd,
fitdsi,
fitdsd,
fdtisi,
fdtisd,
fdtdsi,
fdtdsd,
sifiti,
sifitd,
sifdti,
sifdtd,
sdfiti,
sdfitd,
sdfdti,
sdfdtd,
sitifi,
sitifd,
sitdfi,
sitdfd,
sdtifi,
sdtifd,
sdtdfi,
sdfdfd,
tifisi,
tifisd,
tifdsi,
tifdsd,
tdfisi,
tdfisd,
tdfdsi,
tdfdsd,
tisifi,
tisifd,
tisdfi,
tisdfd,
tdsifi,
tdsifd,
tdsdfi,
tdsdfd
};
template <class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {
typedef pair<A, B> U;
if (type == fisi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
else if (type == fisd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
else if (type == fdsi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
else if (type == fdsd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
else if (type == sifi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
else if (type == sifd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
else if (type == sdfi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
else if (type == sdfd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
};
template <class U> void sort(vector<U> &a, pcomparator type) {
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
};
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, pcomparator type) {
typedef F2<A, B, C, D> U;
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });
};
template <class U> void sort(vector<U> &a, tcomparator type) {
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
}
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {
typedef F2<A, B, C, D> U;
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
}
void sort(string &a) { sort(all(a)); }
void sort(int &a, int &b) {
if (a > b)
swap(a, b);
}
void sort(int &a, int &b, int &c) {
sort(a, b);
sort(a, c);
sort(b, c);
}
void rsort(int &a, int &b) {
if (a < b)
swap(a, b);
}
void rsort(int &a, int &b, int &c) {
rsort(a, b);
rsort(a, c);
rsort(b, c);
}
template <class T> void sort(vector<T> &a) { sort(all(a)); }
// P l, P rで f(P) の形で渡す
template <class U, class F> void sort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) < f(r); });
};
template <class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template <class U, class F> void rsort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) > f(r); });
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class A, class B> void sortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
sort(c);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B, class F>
void sortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
sort(c, f);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B> void rsortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
rsort(c);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class F>
void rsortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
rsort(c, f);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class C>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
sort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
sort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
rsort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
rsort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class D>
void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
sort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
template <class A, class B, class C, class D>
void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
rsort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
// sortindex 元のvectorはソートしない
template <class T> vi sorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind);
return ind;
} /*indexの分で型が変わるためpcomparatorが必要*/
template <class T> vi sorti(vector<T> &a, pcomparator f) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind, f);
return ind;
}
template <class T, class F> vi sorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });
return ind;
}
template <class T> vi rsorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
rsortp(b, ind);
return ind;
}
template <class T, class F> vi rsorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });
return ind;
}
template <class A, class B, class F>
vi sortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });
return ind;
}
template <class A, class B>
vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {
vi ind = iota(0, sz(a));
auto c = a;
auto d = b;
sortt(c, d, ind, f);
return ind;
}
template <class A, class B> vi sortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fisi);
};
template <class A, class B, class F>
vi rsortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });
return ind;
}
template <class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fdsd);
};
template <class A, class B, class C, class F>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {
vi ind = iota(0, sz(a));
auto d = vtof(a, b, c, ind);
sort(d, f);
rep(i, sz(a)) ind[i] = d[i].d;
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] < c[y];
else
return b[x] < b[y];
} else {
return a[x] < a[y];
}
});
return ind;
}
template <class A, class B, class C, class F>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] > c[y];
else
return b[x] > b[y];
} else {
return a[x] > a[y];
}
});
return ind;
}
template <class T> void sort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
sort(a[i]);
}
template <class T> void rsort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
rsort(a[i]);
}
template <class... T, class U> auto sorted(U head, T... a) {
sort(head, a...);
return head;
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }
template <typename W, typename T> void fill(vector<W> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
template <typename W, typename T> void fill(vector<W> &xx, ll len, const T v) {
rep(i, len) xx[i] = v;
}
template <typename W, typename T>
void fill(vector<vector<W>> &xx, int sh, int th, int sw, int tw, T v) {
rep(h, sh, th) rep(w, sw, tw) xx[h][w] = v;
}
template <class T, class U> void fill(vector<T> &a, vi &ind, U val) {
fora(v, ind) a[v] = val;
}
template <class W, class T> void fill(mvec<W> &xx, const T v) {
fora(x, xx) fill(x, v);
}
template <typename A, size_t N> A sum(A (&a)[N]) {
A res = 0;
rep(i, N) res += a[i];
return res;
}
template <typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {
A res = 0;
rep(i, N) rep(j, O) res += a[i][j];
return res;
}
template <typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) res += a[i][j][k];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A sum(A (&a)[N][O][P][Q]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) res += a[i][j][k][l];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A sum(A (&a)[N][O][P][Q][R]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) res += a[i][j][k][l][m];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A sum(A (&a)[N][O][P][Q][R][S]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S) res +=
a[i][j][k][l][m][n];
return res;
}
//@汎用便利関数 入力
ll in() {
ll ret;
cin >> ret;
return ret;
}
string sin() {
string ret;
cin >> ret;
return ret;
}
template <class T> void in(T &head) { cin >> head; }
template <class T, class... U> void in(T &head, U &...tail) {
cin >> head;
in(tail...);
}
#define din1(a) \
ll a; \
cin >> a
#define din2(a, b) \
ll a, b; \
cin >> a >> b
#define din3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define din5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define din6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define din(...) \
over6(__VA_ARGS__, din6, din5, din4, din3, din2, din1)(__VA_ARGS__)
#define dins1(a) \
str a; \
cin >> a
#define dins2(a, b) \
str a, b; \
cin >> a >> b
#define dins3(a, b, c) \
str a, b, c; \
cin >> a >> b >> c
#define dins4(a, b, c, d) \
str a, b, c, d; \
cin >> a >> b >> c >> d
#define dins5(a, b, c, d, e) \
str a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define dins6(a, b, c, d, e, f) \
str a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define dins(...) \
over6(__VA_ARGS__, dins6, dins5, dins4, dins3, dins2, dins1)(__VA_ARGS__)
#define din1d(a) \
din1(a); \
a--
#define din2d(a, b) \
din2(a, b); \
a--, b--
#define din3d(a, b, c) \
din3(a, b, c); \
a--, b--, c--
#define din4d(a, b, c, d) \
din4(a, b, c, d); \
a--, b--, c--, d--
#define dind(...) over4(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
template <class T> void out2(T &&head) { cout << head; }
template <class T, class... U> void out2(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
}
template <class T, class... U> void out(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
cout << "" << endl;
}
template <class T> void out(T &&head) { cout << head << endl; }
void out() { cout << "" << endl; }
#ifdef _DEBUG
template <class T> void err2(T &&head) { cerr << head; }
template <class T, class... U> void err2(T &&head, U &&...tail) {
cerr << head << " ";
err2(tail...);
}
template <class T, class... U> void err(T &&head, U &&...tail) {
cerr << head << " ";
err2(tail...);
cerr << "" << endl;
}
template <class T> void err(T &&head) { cerr << head << endl; }
void err() { cerr << "" << endl; }
template <class T> string out_m2(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) {
ss << a[i];
if (typeid(a[i]) == typeid(P)) {
ss << endl;
} else {
ss << " ";
}
}
return ss.str();
}
template <class T>
string out_m2(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (abs(a[h][w]) == linf)
ss << " e"
<< "";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
return ss.str();
}
template <class T>
string out_m2(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf,
ll U = inf) {
stringstream ss;
if (H == inf)
H = 12;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m2(a[i], W, U, i);
}
return ss.str();
}
template <class T, size_t N> string out_m2(T (&a)[N]) {
vector<T> b;
resize(b, N);
rep(i, N) { b[i] = a[i]; }
return out_m2(b);
}
template <class T, size_t N, size_t M> string out_m2(T (&a)[N][M]) {
vector<vector<T>> b;
resize(b, N, M);
rep(i, N) {
rep(j, M) { b[i][j] = a[i][j]; }
}
return out_m2(b);
}
template <class T, size_t N, size_t M, size_t O>
string out_m2(T (&a)[N][M][O]) {
vector<vector<vector<T>>> b;
resize(b, N, M, O);
rep(i, N) {
rep(j, M) {
rep(k, O) { b[i][j][k] = a[i][j][k]; }
}
}
return out_m2(b);
}
string out_m2(int a) {
stringstream ss;
ss << a;
return ss.str();
}
/*@formatter:on*/
template <class T>
string out_m2(mvec<mvec<T>> &a, ll H = inf, ll W = inf, int key = inf) {
H = min({H, sz(a), 6ll});
W = min({W, sz(a[0]), 6ll});
stringstream ss;
ss << endl;
// if (key == inf)ss << " *|"; else ss << " " << key << "|";
if (key == inf)
ss << " *|";
else {
ss << std::right << std::setw(2) << key;
ss << "|";
}
rep(w, -W, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 8 + 3) ss << "_";
ss << "" << endl;
rep(h, -H, H) {
ss << std::right << std::setw(2) << h << "|";
int NW = min(sz(a[h]), 6ll);
rep(w, -NW, NW) {
if (abs(a[h][w]) == linf)
ss << " e"
<< "";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
return ss.str();
} /*@formatter:on*/
template <class T>
string out_m2(mvec<mvec<mvec<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 6;
H = min(H, sz(a));
rep(i, -H, H) {
ss << endl;
ss << out_m2(a[i], W, U, i);
}
return ss.str();
}
/*@formatter:off*/
template <class T> string out_m2(T &a) {
stringstream ss;
ss << a;
return ss.str();
}
/*@formatter:on*/
template <class T> string out_m(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) { ss << a[i] << " "; }
ss << "" << endl;
return ss.str();
}
/*@formatter:off*/
template <class T>
string out_m(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (abs(a[h][w]) == linf)
ss << " e"
<< "";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
ss << endl;
return ss.str();
}
template <class T>
string out_m(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 5;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m(a[i], W, U, i);
}
ss << endl;
return ss.str();
}
string out_m(int a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> string out_m(T &a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> void outv(vector<T> &a, ll W = inf) {
cout << out_m(a, W) << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
cout << out_m(a, H, W, key) << endl;
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
cout << out_m(a, H, W, U) << endl;
}
#else
template <class T> void outv(vector<T> &a, ll W = inf) {
rep(i, min(W, sz(a))) { cout << a[i] << " "; }
cout << "" << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
rep(i, min(H, sz(a))) { outv(a[i], W); }
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
;
}
#define err(...) ;
#endif
template <class T> void outl(vector<T> &a, int n = inf) {
rep(i, min(n, sz(a))) cout << a[i] << endl;
}
// テーブルをスペースなしで出力
template <class T> void outt(vector<vector<T>> &a) {
rep(i, sz(a)) {
rep(j, sz(a[i])) { cout << a[i][j]; }
cout << endl;
}
}
// int型をbit表記で出力
void outb(int a) { cout << bitset<20>(a) << endl; }
template <class T> void na(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i];
}
template <class T> void na(set<T> &a, ll n) { rep(i, n) a.insert(in()); }
#define dna(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai];
#define dnad(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai], a[dnai]--;
template <class T> void nao(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1];
}
template <class T> void naod(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1], a[i + 1]--;
}
template <class T> void nad(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i], a[i]--;
}
template <class T> void nad(set<T> &a, ll n) { rep(i, n) a.insert(in() - 1); }
template <class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i];
}
template <class T, class U> void na2(set<T> &a, set<U> &b, ll n) {
rep(i, n) {
a.insert(in());
b.insert(in());
}
}
#define dna2(a, b, n) \
vi a(n), b(n); \
rep(dna2i, n) cin >> a[dna2i] >> b[dna2i];
template <class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n + 1);
b.resize(n + 1);
a[0] = b[0] = 0;
rep(i, n) cin >> a[i + 1] >> b[i + 1];
}
#define dna2d(a, b, n) \
vi a(n), b(n); \
rep(dna2di, n) { \
cin >> a[dna2di] >> b[dna2di]; \
a[dna2di]--, b[dna2di]--; \
}
template <class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
}
template <class T, class U, class W>
void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
#define dna3(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3i, n) cin >> a[dna3i] >> b[dna3i] >> c[dna3i];
template <class T, class U, class W>
void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;
}
#define dna3d(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3di, n) { \
cin >> a[dna3di] >> b[dna3di] >> c[dna3di]; \
a[dna3di]--, b[dna3di]--, c[dna3di]--; \
}
template <class T, class U, class W, class X>
void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
d.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
}
#define dna4(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i];
#define dna4d(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i], \
--a[dna4i], --b[dna4i], --c[dna4i], --d[dna4i];
#define nt(a, h, w) \
resize(a, h, w); \
rep(nthi, h) rep(ntwi, w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) \
resize(a, h, w); \
rep(ntdhi, h) rep(ntdwi, w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) \
resize(a, h + 2, w + 2); \
fill(a, '#'); \
rep(ntphi, 1, h + 1) rep(ntpwi, 1, w + 1) cin >> a[ntphi][ntpwi];
// デバッグ
#define sp << " " <<
#define deb1(x) debugName(x) << " = " << out_m2(x)
#define deb_2(x, ...) deb1(x) << ", " << deb1(__VA_ARGS__)
#define deb_3(x, ...) deb1(x) << ", " << deb_2(__VA_ARGS__)
#define deb_4(x, ...) deb1(x) << ", " << deb_3(__VA_ARGS__)
#define deb5(x, ...) deb1(x) << ", " << deb_4(__VA_ARGS__)
#define deb6(x, ...) deb1(x) << ", " << deb5(__VA_ARGS__)
#define deb7(x, ...) deb1(x) << ", " << deb6(__VA_ARGS__)
#define deb8(x, ...) deb1(x) << ", " << deb7(__VA_ARGS__)
#define deb9(x, ...) deb1(x) << ", " << deb8(__VA_ARGS__)
#define deb10(x, ...) deb1(x) << ", " << deb9(__VA_ARGS__)
#ifdef _DEBUG
#define deb(...) \
cerr << over10(__VA_ARGS__, deb10, deb9, deb8, deb7, deb6, deb5, deb_4, \
deb_3, deb_2, deb1)(__VA_ARGS__) \
<< endl
#define base_keta 8
void print_n_base(int x, int base) { cerr << bitset<base_keta>(x) << endl; }
template <class T> void print_n_base(vector<T> X, int base) {
cerr << endl;
for (auto &&x : X) {
print_n_base(x, base);
}
cerr << endl;
}
// n進数
#define deb2(x) \
cerr << debugName(x) << " = "; \
print_n_base(x, 2);
#define deb3(x) \
cerr << debugName(x) << " = "; \
print_n_base(x, 3);
#define deb4(x) \
cerr << debugName(x) << " = "; \
print_n_base(x, 4);
#else
#define deb(...) ;
#define deb2(...) ;
#define deb3(...) ;
#define deb4(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
//@formatter:off
// よく使うクラス、構造体
// graphでredefineしているため、書き換えたら向こうも書き換える
struct unionfind {
vector<ll> par;
vector<ll> siz;
vector<ll> es;
ll n, trees; // 連結グループの数(親の種類)
unionfind(ll n) : n(n), trees(n) {
par.resize(n);
siz.resize(n);
es.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
siz[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
ll operator()(ll x) { return root(x); }
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
es[x]++;
if (x == y)
return false;
if (siz[x] > siz[y])
swap(x, y);
trees--;
par[x] = y;
siz[y] += siz[x];
es[y] += es[x];
return true;
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
ll esize(ll x) { return es[root(x)]; }
vi sizes() {
vi cou(n);
vi ret;
ret.reserve(n);
rep(i, n) { cou[root(i)]++; }
rep(i, n) {
if (cou[i])
ret.push_back(cou[i]);
}
return ret;
}
// つながりを無向グラフと見なし、xが閉路に含まれるか判定
bool close(ll x) { return esize(x) >= size(x); }
vector<vi> sets() {
vi ind(n, -1);
ll i = 0;
vvi(res, trees);
rep(j, n) {
ll r = root(j);
if (ind[r] == -1)
ind[r] = i++;
res[ind[r]].push_back(j);
}
rep(i, trees) {
ll r = root(res[i][0]);
if (res[i][0] == r)
continue;
rep(j, 1, sz(res[i])) {
if (res[i][j] == r) {
swap(res[i][0], res[i][j]);
break;
}
}
}
return res;
}
}; //@formatter:off
using u32 = unsigned;
using u64 = unsigned long long;
using u128 = __uint128_t;
using bint = __int128;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
ll len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 to_bint(string &s) {
__int128 ret = 0;
for (ll i = 0; i < s.length(); ++i)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
void operator>>(istream &iss, bint &v) {
string S;
iss >> S;
v = 0;
rep(i, sz(S)) {
v *= 10;
v += S[i] - '0';
}
}
bint max(bint a, signed b) { return max(a, (bint)b); }
bint max(signed a, bint b) { return max((bint)a, b); }
bint max(bint a, ll b) { return max(a, (bint)b); }
bint max(ll a, bint b) { return max((bint)a, b); }
bint min(bint a, signed b) { return min(a, (bint)b); }
bint min(signed a, bint b) { return min((bint)a, b); }
bint min(bint a, ll b) { return min(a, (bint)b); }
bint min(ll a, bint b) { return min((bint)a, b); }
// エラー
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void re() {
assert(0 == 1);
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
// 便利関数
// テスト用
#define rand xor128_
unsigned long xor128_(void) {
static unsigned long x = 123456789, y = 362436069, z = 521288629,
w = 88675123;
unsigned long t;
t = (x ^ (x << 11));
x = y;
y = z;
z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
char ranc() { return (char)('a' + rand() % 26); }
ll rand(ll min, ll max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
if (rand() % 2) {
return rand(0, max);
} else {
return -rand(0, -min);
}
}
}
ll rand(ll max) { return rand(0, max); }
template <class T> T rand(vector<T> &A) { return A[rand(sz(A) - 1)]; }
// 重複することがある
template <class T> vector<T> ranv(vector<T> &A, int N) {
vector<T> ret(N);
rep(i, N) { ret[i] = rand(A); }
return ret;
}
template <class T> vector<T> ranv_unique(vector<T> &A, int N) {
vector<T> ret(N);
umapi was;
rep(j, N) {
int i;
while (1) {
i = rand(sz(A) - 1);
if (was.find(i) == was.end())
break;
}
ret[j] = A[i];
was[i] = 1;
}
return ret;
}
vi ranv(ll n, ll min, ll max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
str ransu(ll n) {
str s;
rep(i, n) s += (char)rand('A', 'Z');
return s;
}
str ransl(ll n) {
str s;
rep(i, n) s += (char)rand('a', 'z');
return s;
}
// 単調増加
vi ranvinc(ll n, ll min, ll max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
// 便利 汎用
void ranvlr(ll n, ll min, ll max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
template <class T> vector<pair<T, int>> run_length(vector<T> &a) {
vector<pair<T, int>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
vector<pair<char, ll>> run_length(string &a) {
vector<pair<char, ll>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
/*@formatter:on*/
template <class T, class F> T mgr(T ok, T ng, F f) {
bool han = true;
if (ok < ng)
while (ng - ok > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
while (ok - ng > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
template <class T, class F> T mgr(signed ok_, T ng, F f) {
T ok = ok_;
bool han = true;
if (ok < ng)
while (ng - ok > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
while (ok - ng > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
template <class T, class F> T mgr(T ok, signed ng_, F f) {
T ng = ng_;
bool han = true;
if (ok < ng)
while (ng - ok > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
while (ok - ng > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
/*@formatter:off*/
template <class F> dou mgrd(dou ok, dou ng, F f, int kai = 100) {
bool han = true;
if (ok < ng)
rep(i, kai) {
dou mid = (ok + ng) / 2;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
rep(i, kai) {
dou mid = (ok + ng) / 2;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else if (a < b)
return b;
else
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) > sz(b)) {
return b;
} else if (sz(a) < sz(b)) {
return a;
} else if (a > b)
return b;
else
return a;
}
// エラー-1
template <typename W, typename T> ll find(vector<W> &a, int l, const T key) {
rep(i, l, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> ll find(vector<W> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> P find(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
// getid(find())を返す 1次元にする
template <typename W, typename T> int findi(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return i * sz(a[0]) + j;
return -1;
}
template <typename W, typename U>
T find(vector<vector<vector<W>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
// stringも書く
int find(string &s, const string key) {
int klen = sz(key);
rep(i, sz(s) - klen + 1) {
if (s[i] != key[0])
continue;
if (s.substr(i, klen) == key) {
return i;
}
}
return -1;
}
int find(string &s, int l, const string key) {
int klen = sz(key);
rep(i, l, sz(s) - klen + 1) {
if (s[i] != key[0])
continue;
if (s.substr(i, klen) == key) {
return i;
}
}
return -1;
}
int find(string &s, const char key) {
rep(i, sz(s)) {
if (s[i] == key)
return i;
}
return -1;
}
int find(string &s, int l, const char key) {
rep(i, l, sz(s)) {
if (s[i] == key)
return i;
}
return -1;
}
template <typename W, typename T> ll count2(W &a, const T k) { return a == k; }
template <typename W, typename T> ll count2(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
template <typename W, typename T> ll count(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
vi count(vi &a) {
int ma = 0;
fora(v, a) {
if (ma < v)
ma = v;
}
vi res(ma + 1);
fora(v, a) { res[v]++; }
return res;
}
ll count(str &a, str k) {
ll ret = 0, len = k.length();
auto pos = a.find(k);
while (pos != string::npos)
pos = a.find(k, pos + len), ++ret;
return ret;
}
//'a' = 'A' = 0 として集計 既に-'a'されていても動く
vi count(str &a, int l, int r) {
vi cou(26);
char c = 'a';
if ('A' <= a[l] && a[l] <= 'Z')
c = 'A';
if ('a' <= a[l] && a[l] <= 'z')
c = 'a';
else
c = 0;
rep(i, l, r)++ cou[a[i] - c];
return cou;
}
vi count(str &a, int r = inf) { return count(a, 0, min(r, sz(a))); }
#define couif count_if
// algorythm
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
template <class U> void rev(vector<vector<U>> &a) {
vector<vector<U>> b(sz(a[0]), vector<U>(sz(a)));
rep(h, sz(a)) rep(w, sz(a[0])) b[w][h] = a[h][w];
a = b;
}
void rev(string &a) { reverse(all(a)); }
constexpr ll p10[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000ll,
100000000000ll,
1000000000000ll,
10000000000000ll,
100000000000000ll,
1000000000000000ll,
10000000000000000ll,
100000000000000000ll,
1000000000000000000ll};
// 0は0桁
ll keta(ll v) {
if (v < p10[9]) {
if (v < p10[4]) {
if (v < p10[2]) {
if (v < p10[1]) {
if (v < p10[0])
return 0;
else
return 1;
} else
return 2;
} else {
if (v < p10[3])
return 3;
else
return 4;
}
} else {
if (v < p10[7]) {
if (v < p10[5])
return 5;
else if (v < p10[6])
return 6;
else
return 7;
} else {
if (v < p10[8])
return 8;
else
return 9;
}
}
} else {
if (v < p10[13]) {
if (v < p10[11]) {
if (v < p10[10])
return 10;
else
return 11;
} else {
if (v < p10[12])
return 12;
else
return 13;
}
} else {
if (v < p10[15]) {
if (v < p10[14])
return 14;
else
return 15;
} else {
if (v < p10[17]) {
if (v < p10[16])
return 16;
else
return 17;
} else {
if (v < p10[18])
return 18;
else
return 19;
}
}
}
}
}
ll getr(ll a, ll keta) { return (a / (ll)pow(10, keta)) % 10; }
// 上から何桁目か
ll getl(ll a, ll ket) {
int sketa = keta(a);
return getr(a, sketa - 1 - ket);
}
ll dsum(ll v, ll sin = 10) {
ll ret = 0;
for (; v; v /= sin)
ret += v % sin;
return ret;
}
ll mask10(ll v) { return p10[v] - 1; }
// 変換系
//[v] := iとなるようなvectorを返す
// 存在しない物は-1
template <class T> auto keys(T &a) {
vector<decltype((a.begin())->fi)> res;
for (auto &&k : a)
res.push_back(k.fi);
return res;
}
template <class T> auto values(T &a) {
vector<decltype((a.begin())->se)> res;
for (auto &&k : a)
res.push_back(k.se);
return res;
}
template <class T, class U> bool chma(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> bool chmi(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> constexpr T min(T a, signed b) { return a < b ? a : b; }
template <class T> constexpr T max(T a, signed b) { return a < b ? b : a; }
template <class T> constexpr T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> constexpr T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> &a) { return *min_element(all(a)); }
template <class T> T mini(vector<T> &a) {
return min_element(all(a)) - a.begin();
}
template <class T> T min(vector<T> &a, ll n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> &a, ll s, ll n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a) { return *max_element(all(a)); }
template <class T, class U> T max(vector<T> &a, vector<U> &b) {
return max(*max_element(all(a)), *max_element(all(b)));
}
template <class T> T maxi(vector<T> &a) {
return max_element(all(a)) - a.begin();
}
template <class T> T max(vector<T> &a, ll n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a, ll s, ll n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> &v, ll s, ll t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += v[i];
return ret;
}
template <class T> T sum(vector<T> &v, ll t = inf) { return sum(v, 0, t); }
template <class T> T sum(vector<vector<T>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<T>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T> T sum(vector<vector<vector<T>>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<T>>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T>
T sum(vector<vector<vector<vector<vector<T>>>>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T>
T sum(vector<vector<vector<vector<vector<T>>>>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T> auto sum(priority_queue<T, vector<T>, greater<T>> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> auto sum(priority_queue<T> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> T mul(vector<T> &v, ll t = inf) {
T ret = v[0];
rep(i, 1, min(t, sz(v))) ret *= v[i];
return ret;
}
// template<class T, class U, class... W> auto sumn(vector<T> &v, U head, W...
// tail) { auto ret = sum(v[0], tail...); rep(i, 1, min(sz(v), head))ret
// += sum(v[i], tail...); return ret;}
vi v_i(vi &a) {
int n = max(a) + 1;
vi ret(n, -1);
rep(i, sz(a)) { ret[a[i]] = i; }
return ret;
}
void clear(PQ &q) { q = PQ(); }
void clear(priority_queue<int> &q) { q = priority_queue<int>(); }
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(ll size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(ll h, ll w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (ll i = 1; i <= 2 * h + 1; ++i) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
return a;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
// kと同じものの数
template <class T, class U> vi imo(vector<T> &a, U k) {
vector<T> ret = a;
rep(i, sz(ret)) ret[i] = a[i] == k;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imox(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] ^= ret[i];
return ret;
}
// 漸化的に最小を持つ
template <class T> vector<T> imi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmi(ret[i + 1], ret[i]);
return ret;
}
template <class T> vector<T> ima(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chma(ret[i + 1], ret[i]);
return ret;
}
template <class T> vector<T> rimi(vector<T> &v) {
vector<T> ret = v;
rer(i, sz(ret) - 1, 1) chmi(ret[i - 1], ret[i]);
return ret;
}
template <class T> vector<T> rima(vector<T> &v) {
vector<T> ret = v;
rer(i, sz(ret) - 1, 1) chma(ret[i - 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
/*先頭0*/
ruiC() : rui(1, 0) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
return rui[r] - rui[l];
}
T operator()(int r) { return operator()(0, r); }
/*ruiv[]をruic[]に変えた際意味が変わるのがまずいため()と統一*/
/*単体iを返す 累積でないことに注意(seg木との統一でこうしている)*/
// T operator[](ll i) { return rui[i + 1] - rui[i]; }
T operator[](ll i) { return rui[i]; }
/*0から順に追加される必要がある*/
void operator+=(T v) { rui.push_back(rui.back() + v); }
void add(int i, T v) {
if (sz(rui) - 1 != i)
ole();
operator+=(v);
}
T back() { return rui.back(); }
ll size() { return rui.size(); }
auto begin() { return rui.begin(); }
auto end() { return rui.end(); }
};
template <class T> struct ruimax {
template <typename Monoid> struct SegmentTree { /*pairで処理*/
int sz;
vector<Monoid> seg;
const Monoid M1 = mp(MIN(T), -1);
Monoid f(Monoid a, Monoid b) { return max(a, b); }
void build(vector<T> &a) {
int n = sz(a);
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
rep(i, n) { seg[i + sz] = mp(a[i], i); }
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[k << 1], seg[(k << 1) | 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
};
private:
vector<T> ve;
SegmentTree<pair<T, int>> seg;
vector<T> rv;
vector<T> ri;
bool build = false;
public:
int n;
ruimax(vector<T> &a) : ve(a), n(sz(a)) {
int index = -1;
int ma = MIN(T);
rv.resize(n + 1);
ri.resize(n + 1);
rv[0] = -linf;
ri[0] = -1;
rep(i, n) {
if (chma(ma, a[i])) {
index = i;
}
rv[i + 1] = ma;
ri[i + 1] = index;
}
}
T operator()(int l, int r) {
if (!(l <= r && 0 <= l && r <= n)) {
deb(l, r, n);
assert(0);
}
if (l == 0) {
return rv[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).first;
}
}
T operator()(int r = inf) { return operator()(0, min(r, n)); }
T operator[](int r) { return operator()(0, r); }
T getv(int l, int r) { return operator()(l, r); }
T geti(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
if (l == 0) {
return ri[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).second;
}
}
T geti(int r = inf) { return geti(0, min(r, n)); };
T getv(int r = inf) { return getv(0, min(r, n)); };
auto begin() { return rv.begin(); }
auto end() { return rv.end(); }
};
template <class T> struct ruimin {
template <typename Monoid> struct SegmentTree { /*pairで処理*/
int sz;
vector<Monoid> seg;
const Monoid M1 = mp(MAX(T), -1);
Monoid f(Monoid a, Monoid b) { return min(a, b); }
void build(vector<T> &a) {
int n = sz(a);
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
rep(i, n) { seg[i + sz] = mp(a[i], i); }
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[k << 1], seg[(k << 1) | 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
};
private:
vector<T> ve;
SegmentTree<pair<T, int>> seg;
vector<T> rv;
vector<T> ri;
bool build = false;
int n;
public:
ruimin(vector<T> &a) : ve(a), n(sz(a)) {
int index = -1;
int mi = MAX(T);
rv.resize(n + 1);
ri.resize(n + 1);
rv[0] = linf;
ri[0] = -1;
rep(i, n) {
if (chmi(mi, a[i])) {
index = i;
}
rv[i + 1] = mi;
ri[i + 1] = index;
}
}
T operator()(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
if (l == 0) {
return rv[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).first;
}
}
T operator()(int r = inf) { return operator()(0, min(r, n)); }
T operator[](int r) { return operator()(0, r); }
T getv(int l, int r) { return operator()(l, r); }
T geti(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
if (l == 0) {
return ri[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).second;
}
}
T geti(int r = inf) { return geti(0, min(r, n)); };
T getv(int r = inf) { return getv(0, min(r, n)); };
auto begin() { return rv.begin(); }
auto end() { return rv.end(); }
};
template <class T> ostream &operator<<(ostream &os, ruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic() { return ruiC<T>(); }
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
vvi() ruib(vi &a) {
vvi(res, 61, sz(a) + 1);
rep(k, 61) {
rep(i, sz(a)) { res[k][i + 1] = res[k][i] + ((a[i] >> k) & 1); }
}
return res;
}
vector<ruiC<int>> ruibc(vi &a) {
vector<ruiC<int>> ret(61);
vvi(res, 61, sz(a));
rep(k, 61) {
rep(i, sz(a)) { res[k][i] = (a[i] >> k) & 1; }
ret[k] = ruic(res[k]);
}
return ret;
}
vector<ll> ruiv(string &a) {
if (sz(a) == 0)
return vi(1);
ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;
vector<ll> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i] - dec;
return ret;
}
ruiC<ll> ruic(string &a) {
vector<ll> ret = ruiv(a);
return ruiC<ll>(ret);
}
// kと同じものの数
template <class T, class U> vi ruiv(T &a, U k) {
vi ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + (a[i] == k);
return ret;
}
template <class T, class U> ruiC<ll> ruic(T &a, U k) {
vi ret = ruiv(a, k);
return ruiC<ll>(ret);
}
template <class T> struct ruiC2 {
int H;
vector<ruiC<T>> rui;
ruiC2(vector<vector<T>> &ru) : rui(sz(ru)), H(sz(ru)) {
for (int h = 0; h < H; h++) {
rui[h] = ruic(ru[h]);
}
}
// WについてHを返す
vector<T> operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
vector<T> res(H);
for (int h = 0; h < H; h++)
res[h] = rui[h](l, r);
return res;
}
// HについてWを返す
ruiC<T> operator[](ll h) {
assert(h < H);
return rui[h];
}
// vector<T> operator()(int r) { return operator()(0, r); }
/*ruiv[]をruic[]に変えた際意味が変わるのがまずいため()と統一*/
/*単体iを返す 累積でないことに注意(seg木との統一でこうしている)*/
// T operator[](ll i) { return rui[i + 1] - rui[i]; }
/*0から順に追加される必要がある*/
// T back() { return rui.back(); }
// ll size() { return rui.size(); }
// auto begin(){return rui.begin();}
// auto end(){return rui.end();}
};
// a~zを0~25として
// rui(l,r)でvector(26文字について, l~rのcの個数)
// rui[h] ruic()を返す
ruiC2<ll> ruicou(str &a) {
str s = a;
replace(s);
vector<ruiC<ll>> res(26);
vvi(cou, 26, sz(s));
rep(i, sz(s)) { cou[s[i]][i] = 1; }
return ruiC2<ll>(cou);
}
ruiC2<ll> ruicou(vi &a) {
int H = max(a) + 1;
vector<ruiC<ll>> res(H);
vvi(cou, H, sz(a));
rep(i, sz(a)) { cou[a[i]][i] = 1; }
return ruiC2<ll>(cou);
}
/*@formatter:off*/
// h query
template <class T> vector<T> imoh(vector<vector<T>> &v, int w) {
vector<T> ret(sz(v));
rep(h, sz(ret)) { ret[h] = v[h][w]; }
rep(i, sz(ret) - 1) { ret[i + 1] += ret[i]; }
return ret;
}
template <class T> vector<T> ruih(vector<vector<T>> &v, int w) {
vector<T> ret(sz(v) + 1);
rep(h, sz(v)) { ret[h + 1] = v[h][w]; }
rep(i, sz(v)) { ret[i + 1] += ret[i]; }
return ret;
}
template <class T> ruiC<T> ruihc(vector<vector<T>> &a, int w) {
vector<T> ret = ruih(a, w);
return ruiC<T>(ret);
}
// xor
template <class T> struct ruixC {
vector<T> rui;
ruixC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruiXc ";
deb(l, r);
assert(0);
}
return rui[r] ^ rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> ruixC<ll> ruixc(vector<T> &a) {
vi ret = ruix(a);
return ruixC<ll>(ret);
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// 漸化的に最小を1indexで持つ
template <class T> vector<T> ruimi(vector<T> &a) {
ll n = sz(a);
vector<T> ret(n + 1);
rep(i, 1, n) {
ret[i] = a[i - 1];
chmi(ret[i + 1], ret[i]);
}
return ret;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> struct rruiC {
vector<T> rui;
int n;
rruiC(vector<T> &a) : n(sz(a)) {
rui.resize(n + 1);
rer(i, n - 1) { rui[i] = rui[i + 1] + a[i]; }
}
/*[r l)*/
T operator()(int r, int l) {
r++;
l++;
assert(l <= r && l >= 0 && r <= n);
return rui[l] - rui[r];
}
T operator()(int l) { return operator()(n - 1, l); }
T operator[](int i) { return operator()(i); }
};
template <class T> ostream &operator<<(ostream &os, rruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
#define rrui rruic
template <class T> rruiC<T> rruic(vector<T> &a) { return rruiC<T>(a); }
// 掛け算
template <class T> struct ruimulC {
vector<T> rv;
int n;
ruimulC(vector<T> &a) : rv(a), n(sz(a)) {
rv.resize(n + 1);
rv[0] = 1;
rep(i, n) { rv[i + 1] = a[i] * rv[i]; }
}
ruimulC() : n(0) {
rv.resize(n + 1);
rv[0] = 1;
}
void operator+=(T v) {
rv.push_back(rv.back() * v);
n++;
}
T operator()(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
return rv[r] / rv[l];
}
T operator()(int r = inf) { return operator()(0, min(r, n)); }
T operator[](int r) { return operator()(0, r); }
auto begin() { return rv.begin(); }
auto end() { return rv.end(); }
};
template <class T> ruimulC<T> ruimul(vector<T> &a) { return ruimulC<T>(a); }
template <class T> ruimulC<T> ruimul() {
vector<T> a;
return ruimulC<T>(a);
}
/*@formatter:off*/
template <class T> T *rruim(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(pair<T, U> &a, U v = 1) {
a.first += v, a.second += v;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U = int> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U = int> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class U> void dec(string &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, W v = 1) {
for (auto &u : a)
dec(u, v);
for (auto &u : b)
dec(u, v);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, vector<W> &c) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
for (auto &u : c)
dec(u, 1);
}
bool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }
bool ins(ll l, ll v, ll r) { return l <= v && v < r; }
template <class T> bool ins(vector<T> &a, ll i, ll j = 0) {
return ins(0, i, sz(a)) && ins(0, j, sz(a));
}
#define inside ins
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
// 添え字を返す
template <class F> ll goldd_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class F> ll goldt_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
/*loopは200にすればおそらく大丈夫 余裕なら300に*/
template <class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {
dou GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm); /*200にすればおそらく大丈夫*/ /*余裕なら300に*/
ll k = 141;
loop++;
while (--loop) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
template <class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {
double GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm);
loop++;
while (--loop) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
// l ~ rを複数の区間に分割し、極致を与えるiを返す time-20 msまで探索
template <class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll mini = 0, minv = MAX(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldd_l(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll maxi = 0, maxv = MIN(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldt_l(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class F>
dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を持つ*/
auto lim = milliseconds(time - 20);
dou mini = 0, minv = MAX(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldd_d(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F>
dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を残している*/
auto lim = milliseconds(time - 20);
dou maxi = 0, maxv = MIN(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldt_d(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, *max_element(all(a[i])));
return res;
}
template <class T> T min(vector<vector<vector<T>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<T>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
template <class T> T min(vector<vector<vector<vector<T>>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<vector<T>>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
template <class T> T min(vector<vector<vector<vector<vector<T>>>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<vector<vector<T>>>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
template <class T> T min(vector<vector<vector<vector<vector<vector<T>>>>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<vector<vector<vector<T>>>>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
// pow周りの仕様
// powiを使うと整数型
// powbを使うとbint型
// powを使うと powlに変換され long doubleが返る
#ifdef _DEBUG
auto pow(ll a, ll k) {
static bool was = 1;
if (was) {
message += "if integer use *powi* it's very fast\n";
}
was = 0;
return powl(a, k);
}
// 上のメッセージを出すための関数
auto pow(signed a, ll k) { return pow((ll)a, k); }
auto pow(signed a, signed k) { return pow((ll)a, (ll)k); }
#else
#define pow powl
#endif
// 整数型のpow
int powi(int a, int k) {
if (a == 2)
return 1ll << k;
int res = 1;
int x = a;
while (k) {
if (k & 1)
res *= x;
x *= x;
k >>= 1;
}
return res;
}
// define pow powlより上に動かすとバグる
bint pow(bint a, ll k) {
bint res = 1;
bint x = a;
while (k) {
if (k & 1)
res *= x;
x *= x;
k >>= 1;
}
return res;
}
bint pow(bint a, signed k) { return pow(a, (ll)k); }
bint powb(int a, int b) { return pow((bint)a, b); }
constexpr bool bget(ll m, ll keta) {
#ifdef _DEBUG
assert(keta <= 62); // オーバーフロー 1^62までしか扱えない
#endif
return (m >> keta) & 1;
}
// bget(n)次元
// NならN-1まで
vector<vi> bget2(vi &a, int keta_size) {
vvi(res, keta_size, sz(a));
rep(k, keta_size) {
rep(i, sz(a)) { res[k][i] = bget(a[i], k); }
}
return res;
}
vi bget1(vi &a, int keta) {
vi res(sz(a));
rep(i, sz(a)) { res[i] = bget(a[i], keta); }
return res;
}
ll bget(ll m, ll keta, ll sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
constexpr ll bit(ll n) {
#ifdef _DEBUG
assert(n <= 62); // オーバーフロー 1^62までしか扱えない
#endif
return (1LL << (n));
}
ll bit(ll n, ll sinsuu) { return (ll)pow(sinsuu, n); }
ll mask(ll n) { return (1ll << n) - 1; }
// aをbitに置きなおす
//{0, 2} -> 101
ll bit(vi &a) {
int m = 0;
for (auto &&v : a)
m |= bit(v);
return m;
}
//{1, 1, 0} -> 011
// bitsetに置き換える感覚 i が立っていたら i bit目を立てる
ll bitb(vi &a) {
int m = 0;
rep(i, sz(a)) if (a[i]) m |= bit(i);
return m;
}
#define bcou __builtin_popcountll
// 最下位ビット
ll lbit(ll n) { return n & -n; }
ll lbiti(ll n) { return log2(n & -n); }
// 最上位ビット
ll hbit(ll n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
ll hbiti(ll n) { return log2(hbit(n)); }
ll hbitk(ll n) {
ll k = 0;
rer(i, 5) {
ll a = k + (1ll << i);
ll b = 1ll << a;
if (b <= n)
k += 1ll << i;
}
return k;
}
// 初期化は0を渡す
ll nextComb(ll &mask, ll n, ll r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; /*最下位の1*/
ll y = mask + x; /*連続した下の1を繰り上がらせる*/
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vi bitCombList(ll n, ll r) {
vi res;
ll m = 0;
while (nextComb(m, n, r)) {
res.push_back(m);
}
return res;
}
// masの立ってるindexを見る
#define forbit(i, mas) \
for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; \
forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), \
i = log2(forbitj))
char itoal(ll i) { return 'a' + i; }
char itoaL(ll i) { return 'A' + i; }
ll altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
ll ctoi(char c) { return c - '0'; }
char itoc(ll i) { return i + '0'; }
ll vtoi(vi &v) {
ll res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(ll i) {
vi res;
while (i) {
res.push_back(i % 10);
i /= 10;
}
rev(res);
return res;
}
vi stov(string &a) {
ll n = sz(a);
vi ret(n);
rep(i, n) { ret[i] = a[i] - '0'; }
return ret;
}
// 基準を満たさないものは0になる
vi stov(string &a, char one) {
ll n = sz(a);
vi ret(n);
rep(i, n) ret[i] = a[i] == one;
return ret;
}
vector<vector<ll>> ctoi(vector<vector<char>> s, char c) {
ll n = sz(s), m = sz(s[0]);
vector<vector<ll>> res(n, vector<ll>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
//[i] := vを返す
// aは0~n-1で置き換えられる
vi compress(vi &a) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, umap<ll, ll> &map) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
ll v = a[i];
a[i] = lower_bound(all(b), a[i]) - b.begin();
map[v] = a[i];
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r, vi &s) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
fora(v, s) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
for (ll i = 0; i < sz(s); ++i)
r[i] = lower_bound(all(b), s[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vi> &a) {
vi b;
fora(vv, a) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vv, a) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vector<vi>> &a) {
vi b;
fora(vvv, a) fora(vv, vvv) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vvv, a) fora(vv, vvv) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
void compress(ll a[], ll len) {
vi b;
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define rlowerIndex(a, v) (upper_bound(all(a), v) - a.begin() - 1)
#define rupperIndex(a, v) (lower_bound(all(a), v) - a.begin() - 1)
template <class T, class U, class W> T lowerBound(vector<T> &a, U v, W banpei) {
auto it = lower_bound(a.begin(), a.end(), v);
if (it == a.end())
return banpei;
else
return *it;
}
template <class T, class U, class W> T lowerBound(ruiC<T> &a, U v, W banpei) {
return lowerBound(a.rui, v, banpei);
}
template <class T, class U, class W> T upperBound(vector<T> &a, U v, W banpei) {
auto it = upper_bound(a.begin(), a.end(), v);
if (it == a.end())
return banpei;
else
return *it;
}
template <class T, class U, class W> T upperBound(ruiC<T> &a, U v, W banpei) {
return upperBound(a.rui, v, banpei);
}
template <class T, class U, class W>
T rlowerBound(vector<T> &a, U v, W banpei) {
auto it = upper_bound(a.begin(), a.end(), v);
if (it == a.begin())
return banpei;
else {
return *(--it);
}
}
template <class T, class U, class W> T rlowerBound(ruiC<T> &a, U v, W banpei) {
return rlowerBound(a.rui, v, banpei);
}
template <class T, class U, class W>
T rupperBound(vector<T> &a, U v, W banpei) {
auto it = lower_bound(a.begin(), a.end(), v);
if (it == a.begin())
return banpei;
else {
return *(--it);
}
}
template <class T, class U, class W> T rupperBound(ruiC<T> &a, U v, W banpei) {
return rupperBound(a.rui, v, banpei);
}
#define next2(a) next(next(a))
#define prev2(a) prev(prev(a))
// 狭義の単調増加列 長さを返す
template <class T> int lis(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = lowerIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
template <class T> int lis_eq(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = upperIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
// iteratorを返す
// valueが1以上の物を返す 0は見つけ次第削除
// vを減らす場合 (*it).se--でいい
template <class T, class U, class V> auto lower_map(map<T, U> &m, V k) {
auto ret = m.lower_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
template <class T, class U, class V> auto upper_map(map<T, U> &m, V k) {
auto ret = m.upper_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
// 存在しなければエラー
template <class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {
auto ret = upper_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {
auto ret = lower_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class... T> void fin(T... s) {
out(s...);
exit(0);
}
// 便利 数学 math
// sub ⊂ top
bool subset(int sub, int top) { return (sub & top) == sub; }
//-180 ~ 180 degree
double atand(double h, double w) { return atan2(h, w) / PI * 180; }
//% -mの場合、最小の正の数を返す
ll mod(ll a, ll m) {
if (m < 0)
m *= -1;
return (a % m + m) % m;
}
ll pow(ll a) { return a * a; };
ll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }
dou factd(int v) {
static vd fact(2, 1);
if (sz(fact) <= v) {
rep(i, sz(fact), v + 1) { fact.push_back(fact.back() * i); }
}
return fact[v];
}
ll comi(ll n, ll r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
double comd2(ll n, ll r) {
static vvd(comb, 2020, 2020);
if (comb[0][0] == 0) {
comb[0][0] = 1;
rep(i, 2000) {
comb[i + 1][0] = 1;
rep(j, 1, i + 2) { comb[i + 1][j] = comb[i][j] + comb[i][j - 1]; }
}
}
return comb[n][r];
}
double comd(int n, int r) {
if (r < 0 || r > n)
return 0;
if (n < 2020)
return comd2(n, r);
static vd fact(2, 1);
if (sz(fact) <= n) {
rep(i, sz(fact), n + 1) { fact.push_back(fact.back() * i); }
}
return fact[n] / fact[n - r] / fact[r];
}
ll gcd(ll a, ll b) {
while (b)
a %= b, swap(a, b);
return abs(a);
}
ll gcd(vi b) {
ll res = b[0];
rep(i, 1, sz(b)) res = gcd(b[i], res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll lcm(vi a) {
ll res = a[0];
rep(i, 1, sz(a)) res = lcm(a[i], res);
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll sig0(int t) { return t <= 0 ? 0 : ((1 + t) * t) >> 1; }
bint sig0(bint t) { return t <= 0 ? 0 : ((1 + t) * t) >> 1; }
// ll sig(ll s, ll t) { return ((s + t) * (t - s + 1)) >> 1; }
ll sig(ll s, ll t) {
if (s > t)
swap(s, t);
return sig0(t - s) + s * (t - s + 1);
}
#define tousa_i tosa_i
#define lower_tousa_i lower_tosa_i
#define upper_tousa upper_tosa
#define upper_tousa_i upper_tosa_i
ll tosa_i(ll st, ll ad, ll v) {
assert(((v - st) % ad) == 0);
return (v - st) / ad;
}
ll tosa_s(ll st, ll ad, ll len) { return st * len + sig0(len - 1) * ad; }
// ax + r (x は非負整数) で表せる整数のうち、v 以上となる最小の整数
ll lower_tosa(ll st, ll ad, ll v) {
if (st >= v)
return st;
return (v - st + ad - 1) / ad * ad + st;
}
// 第何項か
ll lower_tosa_i(ll st, ll ad, ll v) {
if (st >= v)
return 0;
return (v - st + ad - 1) / ad;
}
ll upper_tosa(ll st, ll ad, ll v) { return lower_tosa(st, ad, v + 1); }
ll upper_tosa_i(ll st, ll ad, ll v) { return lower_tosa_i(st, ad, v + 1); }
// v * v >= aとなる最小のvを返す
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
++res;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
/*@formatter:off*/
// 機能拡張
#define dtie(a, b) \
int a, b; \
tie(a, b)
template <class T, class U> string to_string(T a, U b) {
string res = "";
res += a;
res += b;
return res;
}
template <class T, class U, class V> string to_string(T a, U b, V c) {
string res = "";
res += a;
res += b;
res += c;
return res;
}
template <class T, class U, class V, class W>
string to_string(T a, U b, V c, W d) {
string res = "";
res += a;
res += b;
res += c;
res += d;
return res;
}
template <class T, class U, class V, class W, class X>
string to_string(T a, U b, V c, W d, X e) {
string res = "";
res += a;
res += b;
res += c;
res += d;
res += e;
return res;
}
constexpr int bsetlen = k5 * 2;
// constexpr int bsetlen = 5050;
#define bset bitset<bsetlen>
bool operator<(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] < b[i])
return true;
if (a[i] > b[i])
return false;
}
return false;
}
bool operator>(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] > b[i])
return true;
if (a[i] < b[i])
return false;
}
return false;
}
bool operator<=(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] < b[i])
return true;
if (a[i] > b[i])
return false;
}
return true;
}
bool operator>=(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] > b[i])
return true;
if (a[i] < b[i])
return false;
}
return true;
}
string operator~(string &a) {
string res = a;
for (auto &&c : res) {
if (c == '0')
c = '1';
else if (c == '1')
c = '0';
else {
cerr << "cant ~" << a << "must bit" << endl;
exit(0);
}
}
return res;
}
ostream &operator<<(ostream &os, bset &a) {
bitset<10> b;
vi list;
rep(i, bsetlen) {
if (a[i])
list.push_back(i), b[i] = 1;
}
os << b << ", " << list;
return os;
}
int hbiti(bset &a) {
rer(i, bsetlen) {
if (a[i])
return i;
}
return -1;
}
#define hk(a, b, c) (a <= b && b < c)
// O(N/64)
bset nap(bset &a, int v) {
bset r = a | a << v;
return r;
}
bset nap(bset &a, bset &v) {
bset r = a;
rep(i, bsetlen) {
if (v[i])
r |= a << i;
}
return r;
}
template <class T> void seth(vector<vector<T>> &S, int w, vector<T> &v) {
assert(sz(S) == sz(v));
assert(w < sz(S[0]));
rep(h, sz(S)) { S[h][w] = v[h]; }
}
template <class T, class U> void operator+=(pair<T, U> &a, pair<T, U> &b) {
a.fi += b.fi;
a.se += b.se;
}
template <class T, class U> pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.fi + b.fi, a.se + b.se);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
void operator*=(basic_string<CharT, Traits, Alloc> &s, int num) {
auto bek = s;
s = "";
for (; num; num >>= 1) {
if (num & 1) {
s += bek;
}
bek += bek;
}
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, vector<T> &v) {
fora(d, v) a.push(d);
return a;
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T> set<T> &operator+=(set<T> &a, vector<T> v) {
fora(d, v) a.insert(d);
return a;
}
template <class T, class U> auto operator+=(set<T> &a, U v) {
return a.insert(v);
}
template <class T, class U> auto operator-=(set<T> &a, U v) {
return a.erase(v);
}
template <class T, class U> auto operator+=(mset<T> &a, U v) {
return a.insert(v);
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template <class T, class U> vector<T> operator+(vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> operator+(vector<T> a, vector<T> b) {
vector<T> ret;
ret = a;
fora(v, b) ret += v;
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
rep(i, sz(b)) { /*こうしないとa+=aで両辺が増え続けてバグる*/
a.push_back(b[i]);
}
return a;
}
template <class T, class U> map<T, U> &operator+=(map<T, U> &a, map<T, U> &b) {
fora(bv, b) { a[bv.first] += bv.second; }
return a;
}
template <class T> void operator+=(mset<T> &a, vector<T> &v) {
for (auto &&u : v)
a.insert(u);
}
template <class T> void operator+=(set<T> &a, vector<T> &v) {
for (auto &&u : v)
a.insert(u);
}
template <class T> void operator+=(vector<T> &a, set<T> &v) {
for (auto &&u : v)
a.emplace_back(u);
}
template <class T> void operator+=(vector<T> &a, mset<T> &v) {
for (auto &&u : v)
a.emplace_back(u);
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
exit(0);
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <class T, class U> void operator*=(vector<T> &a, U b) {
vector<T> ta = a;
rep(b - 1) { a += ta; }
}
template <typename T> void erase(vector<T> &v, unsigned ll i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <class T> void erase(set<T> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
template <class T> T poll(set<T> &S) {
T ret = *S.begin();
S.erase(S.begin());
return ret;
}
template <class T> T poll(mset<T> &S) {
T ret = *S.begin();
S.erase(S.begin());
return ret;
}
template <class T> T poll_back(set<T> &S) {
T ret = *S.rbegin();
S.erase(S.rbegin());
return ret;
}
template <class T> T poll_back(mset<T> &S) {
T ret = *S.rbegin();
S.erase(S.rbegin());
return ret;
}
template <class T> T peek(set<T> &S) {
T ret = *S.begin();
return ret;
}
template <class T> T peek(mset<T> &S) {
T ret = *S.begin();
return ret;
}
template <class T> T peek_back(set<T> &S) {
T ret = *S.rbegin();
return ret;
}
template <class T> T peek_back(mset<T> &S) {
T ret = *S.rbegin();
return ret;
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
ll l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
vector<string> res;
ll kn = sz(deli);
std::string::size_type Pos(a.find(deli));
ll l = 0;
while (Pos != std::string::npos) {
if (Pos - l)
res.push_back(a.substr(l, Pos - l));
l = Pos + kn;
Pos = a.find(deli, Pos + kn);
}
if (sz(a) - l)
res.push_back(a.substr(l, sz(a) - l));
return res;
}
ll stoi(string &s) { return stol(s); }
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void fAb(bool a) {
if (a)
cout << "Alice" << endl;
else
cout << "Bob";
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
exit(0);
}
void fPossible(bool a) {
Possible(a);
exit(0);
}
void fPOSSIBLE(bool a) {
POSSIBLE(a);
exit(0);
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
// 未分類
// 0,2,1 1番目と2番目の次元を入れ替える
template <class T>
auto irekae(vector<vector<vector<T>>> &A, int x, int y, int z) {
#define irekae_resize_loop(a, b, c) \
resize(res, a, b, c); \
rep(i, a) rep(j, b) rep(k, c)
vector<vector<vector<T>>> res;
if (x == 0 && y == 1 && z == 2) {
res = A;
} else if (x == 0 && y == 2 && z == 1) {
irekae_resize_loop(sz(A), sz(A[0][0]), sz(A[0])) {
res[i][j][k] = A[i][k][j];
}
} else if (x == 1 && y == 0 && z == 2) {
irekae_resize_loop(sz(A[0]), sz(A), sz(A[0][0])) {
res[i][j][k] = A[j][i][k];
}
} else if (x == 1 && y == 2 && z == 0) {
irekae_resize_loop(sz(A[0]), sz(A[0][0]), sz(A)) {
res[i][j][k] = A[k][i][j];
}
} else if (x == 2 && y == 0 && z == 1) {
irekae_resize_loop(sz(A[0][0]), sz(A), sz(A[0])) {
res[i][j][k] = A[j][k][i];
}
} else if (x == 2 && y == 1 && z == 0) {
irekae_resize_loop(sz(A[0][0]), sz(A[0]), sz(A)) {
res[i][j][k] = A[k][j][i];
}
}
return res;
#undef irekae_resize_loop
}
template <class T> auto irekae(vector<vector<T>> &A, int i = 1, int j = 0) {
vvt(res, sz(A[0]), sz(A));
rep(i, sz(A)) {
rep(j, sz(A[0])) { res[j][i] = A[i][j]; }
}
return res;
}
// tou分割する
template <typename T> vector<vector<T>> cut(vector<T> &a, int tou = 2) {
int N = sz(a);
vector<vector<T>> res(tou);
int hab = N / tou;
vi lens(tou, hab);
rep(i, N % tou) { lens[tou - 1 - i]++; }
int l = 0;
rep(i, tou) {
int len = lens[i];
int r = l + len;
res[i].resize(len);
std::copy(a.begin() + l, a.begin() + r, res[i].begin());
l = r;
}
return res;
}
// 長さn毎に分割する
template <typename T> vector<vector<T>> cutn(vector<T> &a, int len) {
int N = sz(a);
vector<vector<T>> res(ceil(N, len));
vi lens(N / len, len);
if (N % len)
lens.push_back(N % len);
int l = 0;
rep(i, sz(lens)) {
int len = lens[i];
int r = l + len;
res[i].resize(len);
std::copy(a.begin() + l, a.begin() + r, res[i].begin());
l = r;
}
return res;
}
vi inds_(vi &a) {
int n = sz(a);
vb was(n);
vi res(n);
rep(i, n) {
assert(!was[a[i]]);
res[a[i]] = i;
was[a[i]] = true;
}
return res;
}
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} initonv;
#define pre prev
#define nex next
// gra mll pr
// 上下左右
const string udlr = "udlr";
string UDLR = "UDLR"; // x4と連動 UDLR.find('U') := x4[0]
// 右、上が正
constexpr ll h4[] = {1, -1, 0, 0};
constexpr ll w4[] = {0, 0, -1, 1};
constexpr ll h8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll w8[] = {1, 0, -1, 0, 1, -1, 1, -1};
int mei_inc(int h, int w, int H, int W, int i) {
while (++i < 4) {
if (inside(h + h4[i], w + w4[i], H, W))
return i;
}
return i;
}
#define mei(nh, nw, h, w) \
for (int i = mei_inc(h, w, H, W, -1), nh = i < 4 ? h + h4[i] : 0, \
nw = i < 4 ? w + w4[i] : 0; \
i < 4; i = mei_inc(h, w, H, W, i), nh = h + h4[i], nw = w + w4[i])
// グラフ内で #undef getid
// #define getidとしているため、ここを書き直したらgraphも書き直す
#define getid_2(h, w) (h * W + w)
#define getid_1(p) (p.first * W + p.second)
#define getid(...) over2(__VA_ARGS__, getid_2, getid_1)(__VA_ARGS__)
#define getp(id) mp(id / W, id % W)
// #define set_shuffle() std::random_device seed_gen;std::mt19937
// engine(seed_gen()) #define shuffle(a) std::shuffle((a).begin(), (a).end(),
// engine); 1980 開始からtime ms経っていたらtrue
bool timeup(int time) {
auto end_time = system_clock::now();
auto part = duration_cast<milliseconds>(end_time - start_time);
auto lim = milliseconds(time);
return part >= lim;
}
void set_time() { past_time = system_clock::now(); }
// MS型(millisecqnds)で返る
// set_timeをしてからの時間
auto calc_time_milli() {
auto now = system_clock::now();
auto part = duration_cast<milliseconds>(now - past_time);
return part;
}
auto calc_time_micro() {
auto now = system_clock::now();
auto part = duration_cast<microseconds>(now - past_time);
return part;
}
auto calc_time_nano() {
auto now = system_clock::now();
auto part = duration_cast<nanoseconds>(now - past_time);
return part;
}
bool calc_time(int zikan) { return calc_time_micro() >= microseconds(zikan); }
using MS = std::chrono::microseconds;
int div(microseconds a, microseconds b) { return a / b; }
int div(nanoseconds a, nanoseconds b) {
if (b < nanoseconds(1)) {
return a / nanoseconds(1);
}
int v = a / b;
return v;
}
// set_time();
// rep(i,lim)shori
// lim*=time_nanbai();
// rep(i,lim)shoriと使う
// 全体でmilliかかっていいときにlimを何倍してもう一回できるかを返す
int time_nanbai(int milli) {
auto dec = duration_cast<nanoseconds>(past_time - start_time);
auto part = calc_time_nano();
auto can_time = nanoseconds(milli * 1000 * 1000);
can_time -= part;
can_time -= dec;
return div(can_time, part);
}
/*@formatter:on*/
// vectorで取れる要素数
// bool=> 1e9 * 8.32
// int => 1e8 * 2.6
// ll => 1e8 * 1.3
// 3次元以上取るとメモリがヤバい
// static配列を使う
vvc(ba);
ll N, M, H, W;
vi A, B, C;
constexpr int NUM_ = 1e6 + 100;
constexpr int mo = 1e9 + 7;
ll fac[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
void init() {
int i;
inv[1] = fac[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mo % i] * (mo - mo / i) % mo;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % mo, factr[i] = factr[i - 1] * inv[i] % mo;
}
ll com(ll N_, ll C_) {
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fac[N_] % mo * factr[N_ - C_] % mo;
}
int yoko(int N, int B) {
return (((N + 1) * com(N, B)) % mo * inv[B + 1]) % mo;
;
}
void solve() {
din(H1, W1, H2, W2);
init();
auto calc = [&](int H, int W) {
int res = 0;
rep(h, H + 1) {
if (h)
res += yoko(W + h, h) - yoko(h - 1, h);
else {
res += yoko(W + h, h);
}
res %= mo;
}
return res;
};
int res = calc(H2, W2);
deb(res);
res -= calc(H1 - 1, W2);
res %= mo;
res += mo;
res %= mo;
deb(res);
res -= calc(H2, W1 - 1);
res %= mo;
res += mo;
res %= mo;
deb(res);
res += calc(H1 - 1, W1 - 1);
res %= mo;
out(res);
}
auto my(ll n, vi &a) { return 0; }
auto sister(ll n, vi &a) {
ll ret = 0;
return ret;
}
signed main() {
solve();
#define arg n, a
#ifdef _DEBUG
bool bad = 0;
for (ll i = 0, ok = 1; i < k5 && ok; ++i) {
ll n = rand(1, 8);
vi a = ranv(n, 1, 10);
auto myres = my(arg);
auto res = sister(arg);
ok = myres == res;
if (!ok) {
out(arg);
cerr << "AC : " << res << endl;
cerr << "MY : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧 : solveを書き直そう" << endl;
// cout << " : そして、solve()を呼び出すのだ" << endl;
// cout << " : cin>>n; na(a,n);も忘れるな" << endl;
}
if (sz(message)) {
cerr << "****************************" << endl;
cerr << message << endl;
cerr << "****************************" << endl;
}
#endif
return 0;
};
| // #undef _DEBUG
// #pragma GCC optimize("Ofast")
// 不動小数点の計算高速化
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace std::chrono;
#define int long long // todo 消したら動かない intの代わりにsignedを使う
#define ll long long
auto start_time = system_clock::now();
auto past_time = system_clock::now();
#define debugName(VariableName) #VariableName
// 最大引数がN
#define over2(o1, o2, name, ...) name
#define over3(o1, o2, o3, name, ...) name
#define over4(o1, o2, o3, o4, name, ...) name
#define over5(o1, o2, o3, o4, o5, name, ...) name
#define over6(o1, o2, o3, o4, o5, o6, name, ...) name
#define over7(o1, o2, o3, o4, o5, o6, o7, name, ...) name
#define over8(o1, o2, o3, o4, o5, o6, o7, o8, name, ...) name
#define over9(o1, o2, o3, o4, o5, o6, o7, o8, o9, name, ...) name
#define over10(o1, o2, o3, o4, o5, o6, o7, o8, o9, o10, name, ...) name
/*@formatter:off*/
//[-n, n)にアクセスできる
// また、外部関数resizeに渡せる
// sizeは[-n, n)でnを返す
template <class T> class mvec {
vector<T> v;
int n;
public:
mvec() : n(0), v(0) {}
mvec(int n) : n(n), v(n * 2) {}
mvec(int n, T val) : n(n), v(n * 2, val) {}
auto &operator[](int i) { return v[i + n]; }
auto size() { return n; }
void resize(int sn) {
assert(n == 0);
n = sn;
v.resize(sn * 2);
}
auto begin() { return v.begin(); }
auto rbegin() { return v.rbegin(); }
auto end() { return v.end(); }
auto rend() { return v.rend(); }
};
//[]でboolは参照を返さないため特殊化が必要
template <> struct mvec<bool> {
vector<bool> v;
int n;
mvec() : n(0), v(0) {}
mvec(int n) : n(n), v(n * 2) {}
mvec(int n, bool val) : n(n), v(n * 2, val) {}
auto operator[](int i) { return v[i + n]; }
auto size() { return v.size(); }
void resize(int sn) {
assert(n == 0);
n = sn;
v.resize(sn * 2);
}
auto begin() { return v.begin(); }
auto rbegin() { return v.rbegin(); }
auto end() { return v.end(); }
auto rend() { return v.rend(); }
};
template <class T> ostream &operator<<(ostream &os, mvec<T> &a) {
int spa = 3;
for (auto &&v : a) {
spa = max(spa, (int)(to_string(v).size()) + 1);
}
int n = (int)a.size();
os << endl;
for (int i = -n; i < n; i++) {
int need = spa - ((int)to_string(i).size());
if (i == -n) {
need -= min(need, spa - ((int)to_string(a[i]).size()));
}
while (need--) {
os << " ";
}
os << i;
}
os << endl;
int i = -n;
for (auto &&v : a) {
int need = spa - ((int)to_string(v).size());
if (i == -n) {
need -= min(need, spa - ((int)to_string(i).size()));
}
while (need--) {
os << " ";
}
os << v;
i++;
}
return os;
}
#define mv mvec
#define MV mvec
using mvi = mvec<ll>;
using mvb = mvec<bool>;
using mvs = mvec<string>;
using mvd = mvec<double>;
using mvc = mvec<char>;
#define mvvt0(t) mvec<mvec<t>>
#define mvvt1(t, a) mvec<mvec<t>> a
#define mvvt2(t, a, b) mvec<mvec<t>> a(b)
#define mvvt3(t, a, b, c) mvec<mvec<t>> a(b, mvec<t>(c))
#define mvvt4(t, a, b, c, d) mvec<mvec<t>> a(b, mvec<t>(c, d))
#define mvvi(...) \
over4(__VA_ARGS__, mvvt4, mvvt3, mvvt2, mvvt1, mvvt0)(ll, __VA_ARGS__)
template <typename T> mvec<T> make_mv(size_t a) { return mvec<T>(a); }
template <typename T, typename... Ts> auto make_mv(size_t a, Ts... ts) {
return mvec<decltype(make_mv<T>(ts...))>(a, make_mv<T>(ts...));
}
#define mvni(name, ...) auto name = make_mv<ll>(__VA_ARGS__)
#ifdef _DEBUG
string message;
// https://marycore.jp/prog/cpp/class-extension-methods/ 違うかも
template <class T, class A = std::allocator<T>>
struct debtor : std::vector<T, A> {
using std::vector<T, A>::vector;
template <class U> int deb_v(U a, int v) { return v; }
template <class U> int deb_v(debtor<U> &a, int v = 0) {
cerr << a.size() << " ";
return deb_v(a.at(0), v + 1);
}
template <class U> void deb_o(U a) { cerr << a << " "; }
template <class U> void deb_o(debtor<U> &a) {
for (int i = 0; i < min((int)a.size(), 15ll); i++) {
deb_o(a[i]);
}
if ((int)a.size() > 15) {
cerr << "...";
}
cerr << endl;
}
typename std::vector<T>::reference
operator[](typename std::vector<T>::size_type n) {
if (n < 0 || n >= (int)this->size()) {
int siz = (int)this->size();
cerr << "vector size = ";
int dim = deb_v((*this));
cerr << endl;
cerr << "out index at " << n << endl;
cerr << endl;
if (dim <= 2) {
deb_o((*this));
}
exit(0);
}
return this->at(n);
}
};
// #define vector debtor
// 区間削除は出来ない
template <class T> struct my_pbds_tree {
set<T> s;
auto begin() { return s.begin(); }
auto end() { return s.end(); }
auto rbegin() { return s.rbegin(); }
auto rend() { return s.rend(); }
auto empty() { return s.empty(); }
auto size() { return s.size(); }
void clear() { s.clear(); }
template <class U> void insert(U v) { s.insert(v); }
template <class U> void operator+=(U v) { insert(v); }
template <class F> auto erase(F v) { return s.erase(v); }
template <class U> auto find(U v) { return s.find(v); }
template <class U> auto lower_bound(U v) { return s.lower_bound(v); }
template <class U> auto upper_bound(U v) { return s.upper_bound(v); }
auto find_by_order(ll k) {
auto it = s.begin();
for (ll i = 0; i < k; i++)
it++;
return it;
}
auto order_of_key(ll v) {
auto it = s.begin();
ll i = 0;
for (; it != s.end() && *it < v; i++)
it++;
return i;
}
};
#define pbds(T) my_pbds_tree<T>
// gp_hash_tableでcountを使えないようにするため
template <class T, class U> struct my_unordered_map {
unordered_map<T, U> m;
my_unordered_map(){};
auto begin() { return m.begin(); }
auto end() { return m.end(); }
auto cbegin() { return m.cbegin(); }
auto cend() { return m.cend(); }
template <class V> auto erase(V v) { return m.erase(v); }
void clear() {
m.clear();
} /*countは gp_hash_tableに存在しない*/ /*!= m.end()*/
template <class V> auto find(V v) { return m.find(v); }
template <class V> auto &operator[](V n) { return m[n]; }
};
#define unordered_map my_unordered_map
#define umapi unordered_map<ll, ll>
#define umapp unordered_map<P, ll>
#define umapu unordered_map<uint64_t, ll>
#define umapip unordered_map<ll, P>
#else
#define endl '\n'
// umapはunorderd_mapになる
// umapiはgp_hash_table
// find_by_order(k) k番目のイテレーター
// order_of_key(k) k以上が前から何番目か
#define pbds(U) \
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag, \
__gnu_pbds::tree_order_statistics_node_update>
#define umapi __gnu_pbds::gp_hash_table<ll, ll, xorshift>
#define umapp __gnu_pbds::gp_hash_table<P, ll, xorshift>
#define umapu __gnu_pbds::gp_hash_table<uint64_t, ll, xorshift>
#define umapip __gnu_pbds::gp_hash_table<ll, P, xorshift>
#endif
/*@formatter:on*/
struct xorshift {
static uint64_t splitmix64(uint64_t x) {
x += 0x9e3779b97f4a7c15;
x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
return x ^ (x >> 31);
}
size_t operator()(uint64_t x) const {
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(x + FIXED_RANDOM);
}
size_t operator()(std::pair<ll, ll> x) const {
ll v = ((x.first) << 32) | x.second;
static const uint64_t FIXED_RANDOM =
chrono::steady_clock::now().time_since_epoch().count();
return splitmix64(v + FIXED_RANDOM);
}
};
/*@formatter:off*/
template <class U, class L>
void operator+=(
__gnu_pbds::tree<U, __gnu_pbds::null_type, less<U>, __gnu_pbds::rb_tree_tag,
__gnu_pbds::tree_order_statistics_node_update> &s,
L v) {
s.insert(v);
}
// 衝突対策
#define ws ws_
template <class A, class B, class C> struct T2 {
A f;
B s;
C t;
T2() { f = 0, s = 0, t = 0; }
T2(A f, B s, C t) : f(f), s(s), t(t) {}
bool operator<(const T2 &r) const {
return f != r.f ? f < r.f
: s != r.s ? s < r.s
: t < r.t; /*return f != r.f ? f > r.f : s != r.s ?n s >
r.s : t > r.t; 大きい順 */
}
bool operator>(const T2 &r) const {
return f != r.f ? f > r.f
: s != r.s ? s > r.s
: t > r.t; /*return f != r.f ? f > r.f : s != r.s ? s >
r.s : t > r.t; 小さい順 */
}
bool operator==(const T2 &r) const {
return f == r.f && s == r.s && t == r.t;
}
bool operator!=(const T2 &r) const {
return f != r.f || s != r.s || t != r.t;
}
};
template <class A, class B, class C, class D> struct F2 {
A a;
B b;
C c;
D d;
F2() { a = 0, b = 0, c = 0, d = 0; }
F2(A a, B b, C c, D d) : a(a), b(b), c(c), d(d) {}
bool operator<(const F2 &r) const {
return a != r.a ? a < r.a
: b != r.b ? b < r.b
: c != r.c ? c < r.c
: d < r.d; /* return a != r.a ? a > r.a : b != r.b ? b
> r.b : c != r.c ? c > r.c : d > r.d;*/
}
bool operator>(const F2 &r) const {
return a != r.a ? a > r.a
: b != r.b ? b > r.b
: c != r.c ? c > r.c
: d > r.d; /* return a != r.a ? a < r.a : b != r.b
? b < r.b : c != r.c ? c < r.c : d < r.d;*/
}
bool operator==(const F2 &r) const {
return a == r.a && b == r.b && c == r.c && d == r.d;
}
bool operator!=(const F2 &r) const {
return a != r.a || b != r.b || c != r.c || d != r.d;
}
ll operator[](ll i) {
assert(i < 4);
return i == 0 ? a : i == 1 ? b : i == 2 ? c : d;
}
};
typedef T2<ll, ll, ll> T;
typedef F2<ll, ll, ll, ll> F;
T mt(ll a, ll b, ll c) { return T(a, b, c); }
F mf(ll a, ll b, ll c, ll d) { return F(a, b, c, d); }
//@マクロ省略系 型,構造
#define double long double
using dou = double;
const double eps = 1e-9;
// 基本コメントアウト
/*
struct epsdou { double v; epsdou(double v = 0) : v(v) {} template<class
T> epsdou &operator+=(T b) { v += (double) b; return (*this); }
template<class T> epsdou &operator-=(T b) { v -= (double) b; return
(*this); } template<class T> epsdou &operator*=(T b) { v *=
(double) b; return (*this); } template<class T> epsdou
&operator/=(T b) { v /= (double) b; return (*this); } epsdou
operator+(epsdou b) { return v + (double) b; } epsdou operator-(epsdou b) {
return v - (double) b; } epsdou operator*(epsdou b) { return v * (double) b;
} epsdou operator/(epsdou b) { return v / (double) b; } epsdou operator-()
const { return epsdou(-v); } template<class T> bool operator<(T b) { return v
< (double) b; } template<class T> bool operator>(T b) { return v > (double)
b; } template<class T> bool operator==(T b) { return fabs(v - (double) b) <=
eps; } template<class T> bool operator<=(T b) { return v < (double) b ||
fabs(v - b) <= eps; } template<class T> bool operator>=(T b) { return v >
(double) b || fabs(v - b) <= eps; } operator double() { return v; }};istream
&operator>>(istream &iss, epsdou &a) { iss >> a.v; return iss;}ostream
&operator<<(ostream &os, epsdou &a) { os << a.v; return os;} #define
eps_conr_t(o) template<class T> epsdou operator o(T b, epsdou a){return a.v o
(dou)b;} #define eps_conl_t(o) template<class T> epsdou operator o(epsdou a, T
b){return a.v o (dou)b;}
eps_conl_t(+)eps_conl_t(-)eps_conl_t(*)eps_conl_t(/)eps_conr_t(+)eps_conr_t(-)eps_conr_t(*)eps_conr_t(/)
#undef double
#define double epsdou
*/
#define ull unsigned long long
using itn = int;
using str = string;
using bo = bool;
#define au auto
using P = pair<ll, ll>;
using mvp = mvec<P>;
using mvt = mvec<T>;
#define MIN(a) numeric_limits<a>::min()
#define MAX(a) numeric_limits<a>::max()
#define fi first
#define se second
#define beg begin
#define rbeg rbegin
#define con continue
#define bre break
#define brk break
#define is ==
#define el else
#define elf else if
#define upd update
#define sstream stringstream
#define maxq 1
#define minq -1
#define ZERO(a) memset(a, 0, sizeof(a))
#define MINUS(a) memset(a, 0xff, sizeof(a))
#define MALLOC(type, len) (type *)malloc((len) * sizeof(type))
#define lam1(ret) [&](auto &v) { return ret; }
#define lam2(v, ret) [&](auto &v) { return ret; }
#define lam(...) over2(__VA_ARGS__, lam2, lam1)(__VA_ARGS__)
#define lamr(right) [&](auto &p) { return p right; }
// マクロ省略系 コンテナ
using vi = vector<ll>;
using vb = vector<bool>;
using vs = vector<string>;
using vd = vector<double>;
using vc = vector<char>;
using vp = vector<P>;
using vt = vector<T>;
// #define V vector
#define vvt0(t) vector<vector<t>>
#define vvt1(t, a) vector<vector<t>> a
#define vvt2(t, a, b) vector<vector<t>> a(b)
#define vvt3(t, a, b, c) vector<vector<t>> a(b, vector<t>(c))
#define vvt4(t, a, b, c, d) vector<vector<t>> a(b, vector<t>(c, d))
#define vvi(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(ll, __VA_ARGS__)
#define vvb(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(bool, __VA_ARGS__)
#define vvs(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(string, __VA_ARGS__)
#define vvd(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(double, __VA_ARGS__)
#define vvc(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(char, __VA_ARGS__)
#define vvp(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(P, __VA_ARGS__)
#define vvt(...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(T, __VA_ARGS__)
#define vv(type, ...) \
over4(__VA_ARGS__, vvt4, vvt3, vvt2, vvt1, vvt0)(type, __VA_ARGS__)
template <typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
}
#define vni(name, ...) auto name = make_v<ll>(__VA_ARGS__)
#define vnb(name, ...) auto name = make_v<bool>(__VA_ARGS__)
#define vns(name, ...) auto name = make_v<string>(__VA_ARGS__)
#define vnd(name, ...) auto name = make_v<double>(__VA_ARGS__)
#define vnc(name, ...) auto name = make_v<char>(__VA_ARGS__)
#define vnp(name, ...) auto name = make_v<P>(__VA_ARGS__)
#define vn(type, name, ...) auto name = make_v<type>(__VA_ARGS__)
#define PQ priority_queue<ll, vector<ll>, greater<ll>>
#define tos to_string
using mapi = map<ll, ll>;
using mapp = map<P, ll>;
using mapd = map<dou, ll>;
using mapc = map<char, ll>;
using maps = map<str, ll>;
using seti = set<ll>;
using setp = set<P>;
using setd = set<dou>;
using setc = set<char>;
using sets = set<str>;
using qui = queue<ll>;
#define uset unordered_set
#define useti unordered_set<ll, xorshift>
#define mset multiset
#define mseti multiset<ll>
#define umap unordered_map
#define mmap multimap
// 任意のマクロサポート用 使う度に初期化する
int index_, v1_, v2_, v3_;
template <class T> struct pq {
priority_queue<T, vector<T>, greater<T>> q; /*小さい順*/
T su = 0;
void clear() {
q = priority_queue<T, vector<T>, greater<T>>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
template <class T> struct pqg {
priority_queue<T> q; /*大きい順*/
T su = 0;
void clear() {
q = priority_queue<T>();
su = 0;
}
void operator+=(T v) {
su += v;
q.push(v);
}
T sum() { return su; }
T top() { return q.top(); }
void pop() {
su -= q.top();
q.pop();
}
T poll() {
T ret = q.top();
su -= ret;
q.pop();
return ret;
}
ll size() { return q.size(); }
};
#define pqi pq<ll>
#define pqgi pqg<ll>
// マクロ 繰り返し
// ↓@オーバーロード隔離
#define rep1(n) for (ll rep1i = 0, rep1lim = n; rep1i < rep1lim; ++rep1i)
#define rep2(i, n) for (ll i = 0, rep2lim = n; i < rep2lim; ++i)
#define rep3(i, m, n) for (ll i = m, rep3lim = n; i < rep3lim; ++i)
#define rep4(i, m, n, ad) for (ll i = m, rep4lim = n; i < rep4lim; i += ad)
// 逆順 閉区間
#define rer2(i, n) for (ll i = n; i >= 0; i--)
#define rer3(i, m, n) for (ll i = m, rer3lim = n; i >= rer3lim; i--)
#define rer4(i, m, n, dec) for (ll i = m, rer4lim = n; i >= rer4lim; i -= dec)
// ループを一つにまとめないとフォーマットで汚くなるため
#define nex_ind1(i) i++
#define nex_ind2(i, j, J) \
i = (j + 1 == J) ? i + 1 : i, j = (j + 1 == J ? 0 : j + 1)
#define nex_ind3(i, j, k, J, K) \
i = (j + 1 == J && k + 1 == K) ? i + 1 : i, \
j = (k + 1 == K) ? (j + 1 == J ? 0 : j + 1) : j, \
k = (k + 1 == K ? 0 : k + 1)
#define nex_ind4(i, j, k, l, J, K, L) \
i = (j + 1 == J && k + 1 == K && l + 1 == L) ? i + 1 : i, \
j = (k + 1 == K && l + 1 == L) ? (j + 1 == J ? 0 : j + 1) : j, \
k = (l + 1 == L ? (k + 1 == K ? 0 : k + 1) : k), l = l + 1 == L ? 0 : l + 1
#define nex_ind5(i, j, k, l, m, J, K, L, M) \
i = (j + 1 == J && k + 1 == K && l + 1 == L && m + 1 == M) ? i + 1 : i, \
j = (k + 1 == K && l + 1 == L && m + 1 == M) ? (j + 1 == J ? 0 : j + 1) : j, \
k = (l + 1 == L && m + 1 == M ? (k + 1 == K ? 0 : k + 1) : k), \
l = m + 1 == M ? l + 1 == L ? 0 : l + 1 : l, m = m + 1 == M ? 0 : m + 1
#define repss2(i, I) for (int i = 0; i < I; i++)
#define repss4(i, j, I, J) \
for (int i = (J ? 0 : I), j = 0; i < I; nex_ind2(i, j, J))
#define repss6(i, j, k, I, J, K) \
for (int i = (J && K ? 0 : I), j = 0, k = 0; i < I; nex_ind3(i, j, k, J, K))
#define repss8(i, j, k, l, I, J, K, L) \
for (int i = (J && K && L ? 0 : I), j = 0, k = 0, l = 0; i < I; \
nex_ind4(i, j, k, l, J, K, L))
#define repss10(i, j, k, l, m, I, J, K, L, M) \
for (int i = (J && K && L && M ? 0 : I), j = 0, k = 0, l = 0, m = 0; i < I; \
nex_ind5(i, j, k, l, m, J, K, L, M))
// i,j,k...をnまで見る
#define reps2(i, n) repss2(i, n)
#define reps3(i, j, n) repss4(i, j, n, n)
#define reps4(i, j, k, n) repss6(i, j, k, n, n, n)
#define reps5(i, j, k, l, n) repss8(i, j, k, l, n, n, n, n)
template <class T>
void nex_repv2(int &i, int &j, int &I, int &J, vector<vector<T>> &s) {
while (1) {
j++;
if (j >= J) {
j = 0;
i++;
if (i < I) {
J = (int)s[i].size();
}
}
if (i >= I || J)
return;
}
}
template <class T>
void nex_repv3(int &i, int &j, int &k, int &I, int &J, int &K,
vector<vector<vector<T>>> &s) {
while (1) {
k++;
if (k >= K) {
k = 0;
j++;
if (j >= J) {
j = 0;
i++;
if (i >= I)
return;
}
}
J = (int)s[i].size();
K = (int)s[i][j].size();
if (J && K)
return;
}
}
#define repv_2(i, a) repss2(i, sz(a))
// 正方形である必要はない
// 直前を持つのとどっちが早いか
#define repv_3(i, j, a) \
for (int I = (int)a.size(), J = (int)a[0].size(), i = 0, j = 0; i < I; \
nex_repv2(i, j, I, J, a))
// 箱状になっている事が要求される つまり[i] 次元目の要素数は一定
#define repv_4(i, j, k, a) \
for (int I = (int)a.size(), J = (int)a[0].size(), K = (int)a[0][0].size(), \
i = 0, j = 0, k = 0; \
i < I; nex_repv3(i, j, k, I, J, K, a))
#define repv_5(i, j, k, l, a) \
repss8(i, j, k, l, sz(a), sz(a[0]), sz(a[0][0]), sz(a[0][0][0]))
#define repv_6(i, j, k, l, m, a) \
repss10(i, j, k, l, m, sz(a), sz(a[0]), sz(a[0][0]), sz(a[0][0][0]), \
sz(a[0][0][0][0]))
template <typename T> struct has_rbegin_rend {
private:
template <typename U>
static auto check(U &&obj)
-> decltype(std::rbegin(obj), std::rend(obj), std::true_type{});
static std::false_type check(...);
public:
static constexpr bool value = decltype(check(std::declval<T>()))::value;
};
template <typename T>
constexpr bool has_rbegin_rend_v = has_rbegin_rend<T>::value;
template <typename Iterator> class Range {
public:
Range(Iterator &&begin, Iterator &&end) noexcept
: m_begin(std::forward<Iterator>(begin)),
m_end(std::forward<Iterator>(end)) {}
Iterator begin() const noexcept { return m_begin; }
Iterator end() const noexcept { return m_end; }
private:
const Iterator m_begin;
const Iterator m_end;
};
template <typename Iterator>
static inline Range<Iterator> makeRange(Iterator &&begin,
Iterator &&end) noexcept {
return Range<Iterator>{std::forward<Iterator>(begin),
std::forward<Iterator>(end)};
}
template <typename T>
static inline decltype(auto)
makeReversedRange(const std::initializer_list<T> &iniList) noexcept {
return makeRange(std::rbegin(iniList), std::rend(iniList));
}
template <typename T, typename std::enable_if_t<has_rbegin_rend_v<T>,
std::nullptr_t> = nullptr>
static inline decltype(auto) makeReversedRange(T &&c) noexcept {
return makeRange(std::rbegin(c), std::rend(c));
} /* rbegin(),
rend()を持たないものはこっちに分岐させて，エラーメッセージを少なくする*/
template <typename T, typename std::enable_if<!has_rbegin_rend<T>::value,
std::nullptr_t>::type = nullptr>
static inline void makeReversedRange(T &&) noexcept {
static_assert(has_rbegin_rend<T>::value,
"Specified argument doesn't have reverse iterator.");
}
#define form1(st) \
for (auto &&form_it = st.begin(); form_it != st.end(); ++form_it)
#define form3(k, v, st) \
for (auto &&form_it = st.begin(); form_it != st.end(); ++form_it)
#define form4(k, v, st, r) \
for (auto &&form_it = st.begin(); form_it != st.end() && (*form_it).fi < r; \
++form_it)
#define form5(k, v, st, l, r) \
for (auto &&form_it = st.lower_bound(l); \
form_it != st.end() && (*form_it).fi < r; ++form_it)
#define forrm1(st) \
for (auto &&forrm_it = st.rbegin(); forrm_it != st.rend(); ++forrm_it)
#define forrm3(k, v, st) \
for (auto &&forrm_it = st.rbegin(); forrm_it != st.rend(); ++forrm_it)
#define fors1(st) \
for (auto &&fors_it = st.begin(); fors_it != st.end(); ++fors_it)
#define fors2(v, st) \
for (auto &&fors_it = st.begin(); fors_it != st.end(); ++fors_it)
#define fors3(v, st, r) \
for (auto &&fors_it = st.begin(); fors_it != st.end() && (*fors_it) < r; \
++fors_it)
#define fors4(v, st, l, r) \
for (auto &&fors_it = st.lower_bound(l); \
fors_it != st.end() && (*fors_it) < r; ++fors_it)
#define forslr3(st, a, b) \
for (auto &&forslr_it = st.begin(); forslr_it != st.end(); ++forslr_it)
#define forslr4(v, st, a, b) \
for (auto &&forslr_it = st.begin(); forslr_it != st.end(); ++forslr_it)
#define forslr5(v, st, r, a, b) \
for (auto &&forslr_it = st.begin(); \
forslr_it != st.end() && (*forslr_it) < r; ++forslr_it)
#define forslr6(v, st, l, r, a, b) \
for (auto &&forslr_it = st.lower_bound(l); \
forslr_it != st.end() && (*forslr_it) < r; ++forslr_it)
template <class U> vector<U> to1d(vector<U> &a) { return a; }
template <class U> vector<U> to1d(vector<vector<U>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
res.push_back(a2);
return res;
}
template <class U> vector<U> to1d(vector<vector<vector<U>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
res.push_back(a3);
return res;
}
template <class U> vector<U> to1d(vector<vector<vector<vector<U>>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
for (auto &&a4 : a3)
res.push_back(a4);
return res;
}
template <class U>
vector<U> to1d(vector<vector<vector<vector<vector<U>>>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
for (auto &&a4 : a3)
for (auto &&a5 : a4)
res.push_back(a5);
return res;
}
template <class U>
vector<U> to1d(vector<vector<vector<vector<vector<vector<U>>>>>> &a) {
vector<U> res;
for (auto &&a1 : a)
for (auto &&a2 : a1)
for (auto &&a3 : a2)
for (auto &&a4 : a3)
for (auto &&a5 : a4)
for (auto &&a6 : a5)
res.push_back(a6);
return res;
}
#define fora_init_2(a, A) ;
#define fora_init_3(fora_i, a, A) auto &&a = A[fora_i];
#define fora_init_4(a, b, A, B) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i];
#define fora_init_5(fora_i, a, b, A, B) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i];
#define fora_init_6(a, b, c, A, B, C) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i];
#define fora_init_7(fora_i, a, b, c, A, B, C) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i];
#define fora_init_8(a, b, c, d, A, B, C, D) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i]; \
auto &&d = D[fora_i];
#define fora_init_9(fora_i, a, b, c, d, A, B, C, D) \
auto &&a = A[fora_i]; \
auto &&b = B[fora_i]; \
auto &&c = C[fora_i]; \
auto &&d = D[fora_i];
#define fora_init(...) \
over9(__VA_ARGS__, fora_init_9, fora_init_8, fora_init_7, fora_init_6, \
fora_init_5, fora_init_4, fora_init_3, fora_init_2)(__VA_ARGS__)
#define forr_init_2(a, A) auto &&a = A[forr_i];
#define forr_init_3(forr_i, a, A) auto &&a = A[forr_i];
#define forr_init_4(a, b, A, B) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i];
#define forr_init_5(forr_i, a, b, A, B) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i];
#define forr_init_6(a, b, c, A, B, C) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i];
#define forr_init_7(forr_i, a, b, c, A, B, C) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i];
#define forr_init_8(a, b, c, d, A, B, C, D) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i]; \
auto &&d = D[forr_i];
#define forr_init_9(forr_i, a, b, c, d, A, B, C, D) \
auto &&a = A[forr_i]; \
auto &&b = B[forr_i]; \
auto &&c = C[forr_i]; \
auto &&d = D[forr_i];
#define forr_init(...) \
over9(__VA_ARGS__, forr_init_9, forr_init_8, forr_init_7, forr_init_6, \
forr_init_5, forr_init_4, forr_init_3, forr_init_2)(__VA_ARGS__)
#define forp_init(k, v, ...) \
auto &&k = (*forp_it).fi; \
auto &&v = (*forp_it).se;
#define form_init(k, v, ...) \
auto &&k = (*form_it).fi; \
auto &&v = (*form_it).se;
#define forrm_init(k, v, ...) \
auto &&k = (*forrm_it).fi; \
auto &&v = (*forrm_it).se;
#define fors_init(v, ...) auto &&v = (*fors_it);
#define forlr_init(a, A, ngl, ngr) \
auto a = A[forlr_i]; \
auto prev = forlr_i ? A[forlr_i - 1] : ngl; \
auto next = forlr_i + 1 < rep2lim ? A[forlr_i + 1] : ngr;
#define forslr_init4(a, A, ngl, ngr) \
auto a = (*forslr_it); \
auto prev = (forslr_it != A.begin()) ? (*std::prev(forslr_it)) : ngl; \
auto next = (forslr_it != std::prev(A.end())) ? (*std::next(forslr_it)) : ngr;
#define forslr_init5(a, A, r, ngl, ngr) \
auto a = (*forslr_it); \
auto prev = (forslr_it != A.begin()) ? (*std::prev(forslr_it)) : ngl; \
auto next = (forslr_it != std::prev(A.end())) ? (*std::next(forslr_it)) : ngr;
#define forslr_init6(a, A, l, r, ngl, ngr) \
auto a = (*forslr_it); \
auto prev = (forslr_it != A.begin()) ? (*std::prev(forslr_it)) : ngl; \
auto next = (forslr_it != std::prev(A.end())) ? (*std::next(forslr_it)) : ngr;
#define forslr_init(...) \
over6(__VA_ARGS__, forslr_init6, forslr_init5, forslr_init4)(__VA_ARGS__);
#define fora_2(a, A) for (auto &&a : A)
#define fora_3(fora_i, a, A) rep(fora_i, sz(A))
#define fora_4(a, b, A, B) rep(fora_i, sz(A))
#define fora_5(fora_i, a, b, A, B) rep(fora_i, sz(A))
#define fora_6(a, b, c, A, B, C) rep(fora_i, sz(A))
#define fora_7(fora_i, a, b, c, A, B, C) rep(fora_i, sz(A))
#define fora_8(a, b, c, d, A, B, C, D) rep(fora_i, sz(A))
#define fora_9(fora_i, a, b, c, d, A, B, C, D) rep(fora_i, sz(A))
#define forr_2(a, A) rer(forr_i, sz(A) - 1)
#define forr_3(forr_i, a, A) rer(forr_i, sz(A) - 1)
#define forr_4(a, b, A, B) rer(forr_i, sz(A) - 1)
#define forr_5(forr_i, a, b, A, B) rer(forr_i, sz(A) - 1)
#define forr_6(a, b, c, A, B, C) rer(forr_i, sz(A) - 1)
#define forr_7(forr_i, a, b, c, A, B, C) rer(forr_i, sz(A) - 1)
#define forr_8(a, b, c, d, A, B, C, D) rer(forr_i, sz(A) - 1)
#define forr_9(forr_i, a, b, c, d, A, B, C, D) rer(forr_i, sz(A) - 1)
// ↑@オーバーロード隔離
// rep系はインデックス、for系は中身
#define rep(...) over4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rer(...) over4(__VA_ARGS__, rer4, rer3, rer2, )(__VA_ARGS__)
// char用のrep
#define repc(i, m, n) for (char i = m, repc3lim = n; i < repc3lim; ++i)
// i,j,k...をnまで見る
#define reps(...) over5(__VA_ARGS__, reps5, reps4, reps3, reps2, )(__VA_ARGS__)
#define repss(...) \
over10(__VA_ARGS__, repss10, a, repss8, a, repss6, a, repss4, a, \
repss2)(__VA_ARGS__)
// vectorのindexを走査する
// repv(i,j,vvi)
#define repv(...) \
over6(__VA_ARGS__, repv_6, repv_5, repv_4, repv_3, repv_2, )(__VA_ARGS__)
#define rerv(i, A) for (int i = sz(A) - 1; i >= 0; i--)
// repvn(dp) nは次元
#define repv1(a) repv(i, a)
#define repv2(a) repv(i, j, a)
#define repv3(a) repv(i, j, k, a)
#define repv4(a) repv(i, j, k, l, a)
#define fora(...) \
over9(__VA_ARGS__, fora_9, fora_8, fora_7, fora_6, fora_5, fora_4, fora_3, \
fora_2)(__VA_ARGS__)
#define forr(...) \
over9(__VA_ARGS__, forr_9, forr_8, forr_7, forr_6, forr_5, forr_4, forr_3, \
forr_2)(__VA_ARGS__)
// #define forr(v, a) for(auto&& v : makeReversedRange(a))
// 参照を取らない
#define forv(a, b) for (auto a : to1d(b))
// インデックスを前後含めて走査
#define ring(i, s, len) \
for (int i = s, prev = (s == 0) ? len - 1 : s - 1, \
next = (s == len - 1) ? 0 : s + 1, cou = 0; \
cou < len; \
cou++, prev = i, i = next, next = (next == len - 1) ? 0 : next + 1)
// 値と前後を見る
#define ringv(v, d) \
index_ = 0; \
for (auto prev = d[sz(d) - 1], next = (int)d.size() > 1 ? d[1] : d[0], \
v = d[0]; \
index_ < sz(d); index_++, prev = v, v = next, \
next = (index_ >= sz(d) - 1 ? d[0] : d[index_ + 1]))
// 左右をnext prevで見る 0の左と nの右
#define forlr(v, d, banpei_l, banpei_r) rep(forlr_i, sz(d))
#define form(...) \
over5(__VA_ARGS__, form5, form4, form3, form2, form1)(__VA_ARGS__)
#define forrm(...) \
over5(__VA_ARGS__, forrm5, forrm4, forrm3, forrm2, forrm1)(__VA_ARGS__)
#define fors(...) over4(__VA_ARGS__, fors4, fors3, fors2, fors1)(__VA_ARGS__)
#define forslr(...) \
over6(__VA_ARGS__, forslr6, forslr5, forslr4, forslr3)(__VA_ARGS__)
#define forp(k, v, st) \
for (auto &&forp_it = st.begin(); forp_it != st.end(); ++forp_it)
// マクロ 定数
#define k3 1010
#define k4 10101
#define k5 101010
#define k6 1010101
#define k7 10101010
const ll inf = (ll)1e9 + 100;
const ll linf = (ll)1e18 + 100;
const dou dinf = (dou)linf * linf;
const char infc = '{';
const string infs = "{";
const double PI = 3.1415926535897932384626433832795029L;
// マクロ省略形 関数等
#define arsz(a) (sizeof(a) / sizeof(a[0]))
#define sz(a) ((ll)(a).size())
#define mp make_pair
#define pb pop_back
#define pf push_front
#define eb emplace_back
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
constexpr bool ev(ll a) { return !(a & 1); }
constexpr bool od(ll a) { return (a & 1); }
//@拡張系 こう出来るべきというもの
// 埋め込み 存在を意識せずに機能を増やされているもの
namespace std {
template <> class hash<std::pair<signed, signed>> {
public:
size_t operator()(const std::pair<signed, signed> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
template <> class hash<std::pair<ll, ll>> {
public
: /*大きいllが渡されると、<<32でオーバーフローするがとりあえず問題ないと判断*/
size_t operator()(const std::pair<ll, ll> &x) const {
return hash<ll>()(((ll)x.first << 32) | x.second);
}
};
} // namespace std
// stream まとめ
/*@formatter:on*/
istream &operator>>(istream &iss, P &a) {
iss >> a.first >> a.second;
return iss;
}
template <typename T> istream &operator>>(istream &iss, vector<T> &vec) {
for (T &x : vec)
iss >> x;
return iss;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> p) {
os << p.fi << " " << p.se;
return os;
}
ostream &operator<<(ostream &os, T p) {
os << p.f << " " << p.s << " " << p.t;
return os;
}
ostream &operator<<(ostream &os, F p) {
os << p.a << " " << p.b << " " << p.c << " " << p.d;
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &vec) {
for (ll i = 0; i < vec.size(); ++i)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
return os;
}
template <typename T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
for (ll i = 0; i < vec.size(); ++i) {
for (ll j = 0; j < vec[i].size(); ++j) {
os << vec[i][j] << " ";
}
os << endl;
}
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &m) {
os << endl;
for (auto &&v : m)
os << v << endl;
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, mset<T> s) {
fora(v, s) { os << v << " "; }
return os;
}
template <class T> ostream &operator<<(ostream &os, deque<T> a) {
fora(v, a) os << v << " ";
return os;
}
ostream &operator<<(ostream &os, vector<vector<char>> &vec) {
rep(h, sz(vec)) {
rep(w, sz(vec[0])) { os << vec[h][w]; }
os << endl;
}
return os;
}
// template<class T,class U>ostream &operator<<(ostream &os, vector<pair<T,U>>&
// a) {fora(v,a)os<<v<<endl;return os;}
/*@formatter:off*/
template <typename W, typename H> void resize(W &vec, const H head) {
vec.resize(head);
}
template <typename W, typename H, typename... T>
void resize(W &vec, const H &head, const T... tail) {
vec.resize(head);
for (auto &v : vec)
resize(v, tail...);
}
// template<typename W, typename H> void resize(vector<W> &vec, const H head) {
// vec.resize(head); } template<typename W, typename H, typename ... T> void
// resize(vector<W> &vec, const H &head, const T ... tail) {vec.resize(head);for
// (auto &v: vec)resize(v, tail...);}
template <typename T, typename F> bool all_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool all_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (!all_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool any_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool any_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (any_of2(v[i], f))
return true;
}
return false;
}
template <typename T, typename F> bool none_of2(T &v, F f) { return f(v); }
template <typename T, typename F> bool none_of2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (none_of2(v[i], f))
return false;
}
return true;
}
template <typename T, typename F> bool find_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll find_if2(vector<T> &v, F f) {
rep(i, sz(v)) {
if (find_if2(v[i], f))
return i;
}
return sz(v);
}
template <typename T, typename F> bool rfind_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll rfind_if2(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (rfind_if2(v[i], f))
return i;
}
return -1;
}
template <class T> bool contains(string &s, const T &v) {
return s.find(v) != string::npos;
}
template <typename T> bool contains(vector<T> &v, const T &val) {
return std::find(v.begin(), v.end(), val) != v.end();
}
template <typename T, typename F> bool contains_if2(vector<T> &v, F f) {
return find_if(v.begin(), v.end(), f) != v.end();
}
template <typename T, typename F> ll count_if2(T &v, F f) { return f(v); }
template <typename T, typename F> ll count_if2(vector<T> &vec, F f) {
ll ret = 0;
fora(v, vec) ret += count_if2(v, f);
return ret;
}
template <typename T, typename F> void for_each2(T &v, F f) { f(v); }
template <typename T, typename F> void for_each2(vector<T> &vec, F f) {
fora(v, vec) for_each2(v, f);
}
template <typename W> ll count_od(vector<W> &a) {
return count_if2(a, [](ll v) { return v & 1; });
}
template <typename W> ll count_ev(vector<W> &a) {
return count_if2(a, [](ll v) { return !(v & 1); });
}
// 削除した後のvectorを返す
template <typename T, typename F> vector<T> erase_if2(vector<T> &v, F f) {
vector<T> nv;
rep(i, sz(v)) {
if (!f(v[i])) {
nv.push_back(v[i]);
}
}
return nv;
}
template <typename T, typename F>
vector<vector<T>> erase_if2(vector<vector<T>> &v, F f) {
vector<vector<T>> res;
rep(i, sz(v)) { res[i] = erase_if2(v[i], f); }
return res;
}
template <typename T, typename F> vector<T> l_erase_if2(vector<T> &v, F f) {
vector<T> nv;
rep(i, sz(v)) {
if (!f(v[i])) {
nv.push_back(v[i]);
}
}
return nv;
}
template <typename T, typename F> ll l_rfind_if(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (f(v[i]))
return i;
}
return -1;
}
template <typename T, typename F> bool l_contains_if(vector<T> &v, F f) {
rer(i, sz(v) - 1) {
if (f(v[i]))
return true;
}
return false;
}
template <class A, class B, class C> auto t_all_of(A a, B b, C c) {
return std::all_of(a, b, c);
}
template <class A, class B, class C> auto t_any_of(A a, B b, C c) {
return std::any_of(a, b, c);
}
template <class A, class B, class C> auto t_none_of(A a, B b, C c) {
return std::none_of(a, b, c);
}
template <class A, class B, class C> auto t_find_if(A a, B b, C c) {
return std::find_if(a, b, c);
}
template <class A, class B, class C> auto t_count_if(A a, B b, C c) {
return std::count_if(a, b, c);
}
#define all_of_s__2(a, right) (t_all_of(all(a), lamr(right)))
#define all_of_s__3(a, v, siki) (t_all_of(all(a), [&](auto v) { return siki; }))
#define all_of_s(...) over3(__VA_ARGS__, all_of_s__3, all_of_s__2)(__VA_ARGS__)
// all_of(A, %2);
// all_of(A, a, a%2);
#define all_of__2(a, right) all_of2(a, lamr(right))
#define all_of__3(a, v, siki) all_of2(a, [&](auto v) { return siki; })
#define all_of(...) over3(__VA_ARGS__, all_of__3, all_of__2)(__VA_ARGS__)
#define all_of_f(a, f) all_of2(a, f)
#define any_of_s__2(a, right) (t_any_of(all(a), lamr(right)))
#define any_of_s__3(a, v, siki) (t_any_of(all(a), [&](auto v) { return siki; }))
#define any_of_s(...) over3(__VA_ARGS__, any_of_s__3, any_of_s__2)(__VA_ARGS__)
#define any_of__2(a, right) any_of2(a, lamr(right))
#define any_of__3(a, v, siki) any_of2(a, [&](auto v) { return siki; })
#define any_of(...) over3(__VA_ARGS__, any_of__3, any_of__2)(__VA_ARGS__)
#define any_of_f(a, f) any_of2(a, f)
#define none_of_s__2(a, right) (t_none_of(all(a), lamr(right)))
#define none_of_s__3(a, v, siki) \
(t_none_of(all(a), [&](auto v) { return siki; }))
#define none_of_s(...) \
over3(__VA_ARGS__, none_of_s__3, none_of_s__2)(__VA_ARGS__)
#define none_of__2(a, right) none_of2(a, lamr(right))
#define none_of__3(a, v, siki) none_of2(a, [&](auto v) { return siki; })
#define none_of(...) over3(__VA_ARGS__, none_of__3, none_of__2)(__VA_ARGS__)
#define none_of_f(a, f) none_of2(a, f)
#define find_if_s__2(a, right) (t_find_if(all(a), lamr(right)) - a.begin())
#define find_if_s__3(a, v, siki) \
(t_find_if(all(a), [&](auto v) { return siki; }) - a.begin())
#define find_if_s(...) \
over3(__VA_ARGS__, find_if_s__3, find_if_s__2)(__VA_ARGS__)
#define find_if__2(a, right) find_if2(a, lamr(right))
#define find_if__3(a, v, siki) find_if2(a, [&](auto v) { return siki; })
#define find_if(...) over3(__VA_ARGS__, find_if__3, find_if__2)(__VA_ARGS__)
#define find_if_f(a, f) find_if2(a, f)
#define rfind_if_s__2(a, right) l_rfind_if(a, lamr(right))
#define rfind_if_s__3(a, v, siki) l_rfind_if(a, [&](auto v) { return siki; })
#define rfind_if_s(...) \
over3(__VA_ARGS__, rfind_if_s__3, rfind_if_s__2)(__VA_ARGS__)
#define rfind_if__2(a, right) rfind_if2(a, lamr(right))
#define rfind_if__3(a, v, siki) rfind_if2(a, [&](auto v) { return siki; })
#define rfind_if(...) over3(__VA_ARGS__, rfind_if__3, rfind_if__2)(__VA_ARGS__)
#define rfind_if_f(a, f) rfind_if2(a, f)
#define contains_if_s__2(a, right) l_contains_if(a, lamr(right))
#define contains_if_s__3(a, v, siki) \
l_contains_if(a, [&](auto v) { return siki; })
#define contains_if_s(...) \
over3(__VA_ARGS__, contains_if_s__3, contains_if_s__2)(__VA_ARGS__)
#define contains_if__2(a, right) contains_if2(a, lamr(right))
#define contains_if__3(a, v, siki) contains_if2(a, [&](auto v) { return siki; })
#define contains_if(...) \
over3(__VA_ARGS__, contains_if__3, contains_if__2)(__VA_ARGS__)
#define contains_if_f(a, f) contains_if2(a, f)
#define count_if_s__2(a, right) (t_count_if(all(a), lamr(right)))
#define count_if_s__3(a, v, siki) \
(t_count_if(all(a), [&](auto v) { return siki; }))
#define count_if_s(...) \
over3(__VA_ARGS__, count_if_s__3, count_if_s__2)(__VA_ARGS__)
#define count_if__2(a, right) count_if2(a, lamr(right))
#define count_if__3(a, v, siki) count_if2(a, [&](auto v) { return siki; })
#define count_if(...) over3(__VA_ARGS__, count_if__3, count_if__2)(__VA_ARGS__)
#define count_if_f(a, f) count_if2(a, f)
#define for_each_s__2(a, right) \
do { \
fora(v, a) { v right; } \
} while (0)
#define for_each_s__3(a, v, siki) \
do { \
fora(v, a) { siki; } \
} while (0)
#define for_each_s(...) \
over3(__VA_ARGS__, for_each_s__3, for_each_s__2)(__VA_ARGS__)
#define for_each__2(a, right) for_each2(a, lamr(right))
#define for_each__3(a, v, siki) for_each2(a, [&](auto v) { return siki; })
#define for_each(...) over3(__VA_ARGS__, for_each__3, for_each__2)(__VA_ARGS__)
#define for_each_f(a, f) for_each2(a, f);
#define erase_if_s__2(a, right) l_erase_if2(a, lamr(right))
#define erase_if_s__3(a, v, siki) l_erase_if2(a, [&](auto v) { return siki; })
#define erase_if_s(...) \
over3(__VA_ARGS__, erase_if_s__3, erase_if_s__2)(__VA_ARGS__)
#define erase_if__2(a, right) erase_if2(a, lamr(right))
#define erase_if__3(a, v, siki) erase_if2(a, [&](auto v) { return siki; })
#define erase_if(...) over3(__VA_ARGS__, erase_if__3, erase_if__2)(__VA_ARGS__)
#define erase_if_f(a, f) erase_if2(a, f)
#define entry_if_s__2(a, right) l_entry_if2(a, lamr(right))
#define entry_if_s__3(a, v, siki) l_entry_if2(a, [&](auto v) { return siki; })
#define entry_if_s(...) \
over3(__VA_ARGS__, entry_if_s__3, entry_if_s__2)(__VA_ARGS__)
#define entry_if__2(a, right) entry_if2(a, lamr(right))
#define entry_if__3(a, v, siki) entry_if2(a, [&](auto v) { return siki; })
#define entry_if(...) over3(__VA_ARGS__, entry_if__3, entry_if__2)(__VA_ARGS__)
#define entry_if_f(a, f) entry_if2(a, f)
template <class T, class U, class W> void replace(vector<W> &a, T key, U v) {
rep(i, sz(a)) if (a[i] == key) a[i] = v;
}
template <class T, class U, class W>
void replace(vector<vector<W>> &A, T key, U v) {
rep(i, sz(A)) replace(A[i], key, v);
}
void replace(str &a, char key, str v) {
if (v == "")
a.erase(remove(all(a), key), a.end());
}
void replace(str &a, char key, char v) { replace(all(a), key, v); }
// keyと同じかどうか01で置き換える
template <class T, class U> void replace(vector<T> &a, U k) {
rep(i, sz(a)) a[i] = a[i] == k;
}
template <class T, class U> void replace(vector<vector<T>> &a, U k) {
rep(i, sz(a)) rep(j, sz(a[0])) a[i][j] = a[i][j] == k;
}
// template<class T> void replace(T &a) { replace(a, '#'); }
void replace(str &a) {
int dec = 0;
if ('a' <= a[0] && a[0] <= 'z')
dec = 'a';
if ('A' <= a[0] && a[0] <= 'Z')
dec = 'A';
fora(v, a) v -= dec;
}
void replace(str &a, str key, str v) {
stringstream t;
ll kn = sz(key);
std::string::size_type Pos(a.find(key));
ll l = 0;
while (Pos != std::string::npos) {
t << a.substr(l, Pos - l);
t << v;
l = Pos + kn;
Pos = a.find(key, Pos + kn);
}
t << a.substr(l, sz(a) - l);
a = t.str();
}
template <class T> bool includes(vector<T> &a, vector<T> &b) {
vi c = a;
vi d = b;
sort(all(c));
sort(all(d));
return includes(all(c), all(d));
}
template <class T> bool is_permutation(vector<T> &a, vector<T> &b) {
return is_permutation(all(a), all(b));
}
template <class T> bool next_permutation(vector<T> &a) {
return next_permutation(all(a));
}
void iota(vector<ll> &ve, ll s, ll n) {
ve.resize(n);
iota(all(ve), s);
}
vi iota(ll s, ll len) {
vi ve(len);
iota(all(ve), s);
return ve;
}
template <class A, class B> auto vtop(vector<A> &a, vector<B> &b) {
assert(sz(a) == sz(b)); /*stringを0で初期化できない */
vector<pair<A, B>> res;
rep(i, sz(a)) res.eb(a[i], b[i]);
return res;
}
template <class A, class B>
void ptov(vector<pair<A, B>> &p, vector<A> &a, vector<B> &b) {
a.resize(sz(p)), b.resize(sz(p));
rep(i, sz(p)) a[i] = p[i].fi, b[i] = p[i].se;
}
template <class A, class B, class C>
auto vtot(vector<A> &a, vector<B> &b, vector<C> &c) {
assert(sz(a) == sz(b) && sz(b) == sz(c));
vector<T2<A, B, C>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i]);
return res;
}
template <class A, class B, class C, class D>
auto vtof(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
assert(sz(a) == sz(b) && sz(b) == sz(c) && sz(c) == sz(d));
vector<F2<A, B, C, D>> res;
rep(i, sz(a)) res.eb(a[i], b[i], c[i], d[i]);
return res;
}
enum pcomparator { fisi, fisd, fdsi, fdsd, sifi, sifd, sdfi, sdfd };
enum tcomparator {
fisiti,
fisitd,
fisdti,
fisdtd,
fdsiti,
fdsitd,
fdsdti,
fdsdtd,
fitisi,
fitisd,
fitdsi,
fitdsd,
fdtisi,
fdtisd,
fdtdsi,
fdtdsd,
sifiti,
sifitd,
sifdti,
sifdtd,
sdfiti,
sdfitd,
sdfdti,
sdfdtd,
sitifi,
sitifd,
sitdfi,
sitdfd,
sdtifi,
sdtifd,
sdtdfi,
sdfdfd,
tifisi,
tifisd,
tifdsi,
tifdsd,
tdfisi,
tdfisd,
tdfdsi,
tdfdsd,
tisifi,
tisifd,
tisdfi,
tisdfd,
tdsifi,
tdsifd,
tdsdfi,
tdsdfd
};
template <class A, class B> void sort(vector<pair<A, B>> &a, pcomparator type) {
typedef pair<A, B> U;
if (type == fisi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se < r.se; });
else if (type == fisd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi < r.fi : l.se > r.se; });
else if (type == fdsi)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se < r.se; });
else if (type == fdsd)
sort(all(a),
[&](U l, U r) { return l.fi != r.fi ? l.fi > r.fi : l.se > r.se; });
else if (type == sifi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi < r.fi; });
else if (type == sifd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se < r.se : l.fi > r.fi; });
else if (type == sdfi)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi < r.fi; });
else if (type == sdfd)
sort(all(a),
[&](U l, U r) { return l.se != r.se ? l.se > r.se : l.fi > r.fi; });
};
template <class U> void sort(vector<U> &a, pcomparator type) {
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s < r.s; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f < r.f : l.s > r.s; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s < r.s; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.f != r.f ? l.f > r.f : l.s > r.s; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f < r.f; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s < r.s : l.f > r.f; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f < r.f; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.s != r.s ? l.s > r.s : l.f > r.f; });
};
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, pcomparator type) {
typedef F2<A, B, C, D> U;
if (type == fisi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b < r.b; });
else if (type == fisd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a < r.a : l.b > r.b; });
else if (type == fdsi)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b < r.b; });
else if (type == fdsd)
sort(all(a), [&](U l, U r) { return l.a != r.a ? l.a > r.a : l.b > r.b; });
else if (type == sifi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a < r.a; });
else if (type == sifd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b < r.b : l.a > r.a; });
else if (type == sdfi)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a < r.a; });
else if (type == sdfd)
sort(all(a), [&](U l, U r) { return l.b != r.b ? l.b > r.b : l.a > r.a; });
};
template <class U> void sort(vector<U> &a, tcomparator type) {
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t < r.t;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s < r.s : l.t > r.t;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t < r.t;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.s != r.s ? l.s > r.s : l.t > r.t;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f < r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s < r.s;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t < r.t : l.s > r.s;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s < r.s;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.f != r.f ? l.f > r.f : l.t != r.t ? l.t > r.t : l.s > r.s;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t < r.t;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f < r.f : l.t > r.t;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t < r.t;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.f != r.f ? l.f > r.f : l.t > r.t;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s < r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f < r.f;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t < r.t : l.f > r.f;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f < r.f;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.s != r.s ? l.s > r.s : l.t != r.t ? l.t > r.t : l.f > r.f;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s < r.s;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f < r.f : l.s > r.s;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s < r.s;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.f != r.f ? l.f > r.f : l.s > r.s;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t < r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f < r.f;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s < r.s : l.f > r.f;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f < r.f;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.t != r.t ? l.t > r.t : l.s != r.s ? l.s > r.s : l.f > r.f;
});
}
template <class A, class B, class C, class D>
void sort(vector<F2<A, B, C, D>> &a, tcomparator type) {
typedef F2<A, B, C, D> U;
if (type == 0)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 1)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 2)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 3)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 4)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c < r.c;
});
else if (type == 5)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b < r.b : l.c > r.c;
});
else if (type == 6)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c < r.c;
});
else if (type == 7)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.b != r.b ? l.b > r.b : l.c > r.c;
});
else if (type == 8)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 9)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 10)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 11)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a < r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 12)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b < r.b;
});
else if (type == 13)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c < r.c : l.b > r.b;
});
else if (type == 14)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b < r.b;
});
else if (type == 15)
sort(all(a), [&](U l, U r) {
return l.a != r.a ? l.a > r.a : l.c != r.c ? l.c > r.c : l.b > r.b;
});
else if (type == 16)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 17)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 18)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 19)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 20)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c < r.c;
});
else if (type == 21)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a < r.a : l.c > r.c;
});
else if (type == 22)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c < r.c;
});
else if (type == 23)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.a != r.a ? l.a > r.a : l.c > r.c;
});
else if (type == 24)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 25)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 26)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 27)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b < r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 28)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a < r.a;
});
else if (type == 29)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c < r.c : l.a > r.a;
});
else if (type == 30)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a < r.a;
});
else if (type == 31)
sort(all(a), [&](U l, U r) {
return l.b != r.b ? l.b > r.b : l.c != r.c ? l.c > r.c : l.a > r.a;
});
else if (type == 32)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 33)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 34)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 35)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 36)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b < r.b;
});
else if (type == 37)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a < r.a : l.b > r.b;
});
else if (type == 38)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b < r.b;
});
else if (type == 39)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.a != r.a ? l.a > r.a : l.b > r.b;
});
else if (type == 40)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 41)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 42)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 43)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c < r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
else if (type == 44)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a < r.a;
});
else if (type == 45)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b < r.b : l.a > r.a;
});
else if (type == 46)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a < r.a;
});
else if (type == 47)
sort(all(a), [&](U l, U r) {
return l.c != r.c ? l.c > r.c : l.b != r.b ? l.b > r.b : l.a > r.a;
});
}
void sort(string &a) { sort(all(a)); }
void sort(int &a, int &b) {
if (a > b)
swap(a, b);
}
void sort(int &a, int &b, int &c) {
sort(a, b);
sort(a, c);
sort(b, c);
}
void rsort(int &a, int &b) {
if (a < b)
swap(a, b);
}
void rsort(int &a, int &b, int &c) {
rsort(a, b);
rsort(a, c);
rsort(b, c);
}
template <class T> void sort(vector<T> &a) { sort(all(a)); }
// P l, P rで f(P) の形で渡す
template <class U, class F> void sort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) < f(r); });
};
template <class T> void rsort(vector<T> &a) { sort(all(a), greater<T>()); };
template <class U, class F> void rsort(vector<U> &a, F f) {
sort(all(a), [&](U l, U r) { return f(l) > f(r); });
};
// F = T<T>
// 例えばreturn p.fi + p.se;
template <class A, class B> void sortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
sort(c);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B, class F>
void sortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
sort(c, f);
rep(i, sz(a)) a[i] = c[i].fi, b[i] = c[i].se;
}
template <class A, class B> void rsortp(vector<A> &a, vector<B> &b) {
auto c = vtop(a, b);
rsort(c);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class F>
void rsortp(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
rsort(c, f);
rep(i, sz(a)) a[i] = c[i].first, b[i] = c[i].second;
}
template <class A, class B, class C>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
sort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void sortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
sort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c) {
auto d = vtot(a, b, c);
rsort(d);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class F>
void rsortt(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
rsort(d, f);
rep(i, sz(a)) a[i] = d[i].f, b[i] = d[i].s, c[i] = d[i].t;
}
template <class A, class B, class C, class D>
void sortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
sort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
template <class A, class B, class C, class D>
void rsortf(vector<A> &a, vector<B> &b, vector<C> &c, vector<D> &d) {
auto e = vtof(a, b, c, d);
rsort(e);
rep(i, sz(a)) a[i] = e[i].a, b[i] = e[i].b, c[i] = e[i].c, d[i] = e[i].d;
}
// sortindex 元のvectorはソートしない
template <class T> vi sorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind);
return ind;
} /*indexの分で型が変わるためpcomparatorが必要*/
template <class T> vi sorti(vector<T> &a, pcomparator f) {
auto b = a;
vi ind = iota(0, sz(a));
sortp(b, ind, f);
return ind;
}
template <class T, class F> vi sorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) < f(a[y]); });
return ind;
}
template <class T> vi rsorti(vector<T> &a) {
auto b = a;
vi ind = iota(0, sz(a));
rsortp(b, ind);
return ind;
}
template <class T, class F> vi rsorti(vector<T> &a, F f) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(a[x]) > f(a[y]); });
return ind;
}
template <class A, class B, class F>
vi sortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) < f(c[y]); });
return ind;
}
template <class A, class B>
vi sortpi(vector<A> &a, vector<B> &b, pcomparator f) {
vi ind = iota(0, sz(a));
auto c = a;
auto d = b;
sortt(c, d, ind, f);
return ind;
}
template <class A, class B> vi sortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fisi);
};
template <class A, class B, class F>
vi rsortpi(vector<A> &a, vector<B> &b, F f) {
auto c = vtop(a, b);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(c[x]) > f(c[y]); });
return ind;
}
template <class A, class B> vi rsortpi(vector<A> &a, vector<B> &b) {
return sortpi(a, b, fdsd);
};
template <class A, class B, class C, class F>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) < f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c, pcomparator f) {
vi ind = iota(0, sz(a));
auto d = vtof(a, b, c, ind);
sort(d, f);
rep(i, sz(a)) ind[i] = d[i].d;
return ind;
}
template <class A, class B, class C>
vi sortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] < c[y];
else
return b[x] < b[y];
} else {
return a[x] < a[y];
}
});
return ind;
}
template <class A, class B, class C, class F>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c, F f) {
auto d = vtot(a, b, c);
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) { return f(d[x]) > f(d[y]); });
return ind;
}
template <class A, class B, class C>
vi rsortti(vector<A> &a, vector<B> &b, vector<C> &c) {
vi ind = iota(0, sz(a));
sort(all(ind), [&](ll x, ll y) {
if (a[x] == a[y]) {
if (b[x] == b[y])
return c[x] > c[y];
else
return b[x] > b[y];
} else {
return a[x] > a[y];
}
});
return ind;
}
template <class T> void sort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
sort(a[i]);
}
template <class T> void rsort2(vector<vector<T>> &a) {
for (ll i = 0, n = a.size(); i < n; ++i)
rsort(a[i]);
}
template <class... T, class U> auto sorted(U head, T... a) {
sort(head, a...);
return head;
}
template <typename A, size_t N, typename T> void fill(A (&a)[N], const T &v) {
rep(i, N) a[i] = v;
}
template <typename A, size_t N, size_t O, typename T>
void fill(A (&a)[N][O], const T &v) {
rep(i, N) rep(j, O) a[i][j] = v;
}
template <typename A, size_t N, size_t O, size_t P, typename T>
void fill(A (&a)[N][O][P], const T &v) {
rep(i, N) rep(j, O) rep(k, P) a[i][j][k] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, typename T>
void fill(A (&a)[N][O][P][Q], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) a[i][j][k][l] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
typename T>
void fill(A (&a)[N][O][P][Q][R], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) a[i][j][k][l][m] = v;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S, typename T>
void fill(A (&a)[N][O][P][Q][R][S], const T &v) {
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S)
a[i][j][k][l][m][n] = v;
}
template <typename W, typename T> void fill(W &xx, const T vall) { xx = vall; }
template <typename W, typename T> void fill(vector<W> &vecc, const T vall) {
for (auto &&vx : vecc)
fill(vx, vall);
}
template <typename W, typename T> void fill(vector<W> &xx, ll len, const T v) {
rep(i, len) xx[i] = v;
}
template <typename W, typename T>
void fill(vector<vector<W>> &xx, int sh, int th, int sw, int tw, T v) {
rep(h, sh, th) rep(w, sw, tw) xx[h][w] = v;
}
template <class T, class U> void fill(vector<T> &a, vi &ind, U val) {
fora(v, ind) a[v] = val;
}
template <class W, class T> void fill(mvec<W> &xx, const T v) {
fora(x, xx) fill(x, v);
}
template <typename A, size_t N> A sum(A (&a)[N]) {
A res = 0;
rep(i, N) res += a[i];
return res;
}
template <typename A, size_t N, size_t O> A sum(A (&a)[N][O]) {
A res = 0;
rep(i, N) rep(j, O) res += a[i][j];
return res;
}
template <typename A, size_t N, size_t O, size_t P> A sum(A (&a)[N][O][P]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) res += a[i][j][k];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A sum(A (&a)[N][O][P][Q]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) res += a[i][j][k][l];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A sum(A (&a)[N][O][P][Q][R]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) res += a[i][j][k][l][m];
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A sum(A (&a)[N][O][P][Q][R][S]) {
A res = 0;
rep(i, N) rep(j, O) rep(k, P) rep(l, Q) rep(m, R) rep(n, S) res +=
a[i][j][k][l][m][n];
return res;
}
//@汎用便利関数 入力
ll in() {
ll ret;
cin >> ret;
return ret;
}
string sin() {
string ret;
cin >> ret;
return ret;
}
template <class T> void in(T &head) { cin >> head; }
template <class T, class... U> void in(T &head, U &...tail) {
cin >> head;
in(tail...);
}
#define din1(a) \
ll a; \
cin >> a
#define din2(a, b) \
ll a, b; \
cin >> a >> b
#define din3(a, b, c) \
ll a, b, c; \
cin >> a >> b >> c
#define din4(a, b, c, d) \
ll a, b, c, d; \
cin >> a >> b >> c >> d
#define din5(a, b, c, d, e) \
ll a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define din6(a, b, c, d, e, f) \
ll a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define din(...) \
over6(__VA_ARGS__, din6, din5, din4, din3, din2, din1)(__VA_ARGS__)
#define dins1(a) \
str a; \
cin >> a
#define dins2(a, b) \
str a, b; \
cin >> a >> b
#define dins3(a, b, c) \
str a, b, c; \
cin >> a >> b >> c
#define dins4(a, b, c, d) \
str a, b, c, d; \
cin >> a >> b >> c >> d
#define dins5(a, b, c, d, e) \
str a, b, c, d, e; \
cin >> a >> b >> c >> d >> e
#define dins6(a, b, c, d, e, f) \
str a, b, c, d, e, f; \
cin >> a >> b >> c >> d >> e >> f
#define dins(...) \
over6(__VA_ARGS__, dins6, dins5, dins4, dins3, dins2, dins1)(__VA_ARGS__)
#define din1d(a) \
din1(a); \
a--
#define din2d(a, b) \
din2(a, b); \
a--, b--
#define din3d(a, b, c) \
din3(a, b, c); \
a--, b--, c--
#define din4d(a, b, c, d) \
din4(a, b, c, d); \
a--, b--, c--, d--
#define dind(...) over4(__VA_ARGS__, din4d, din3d, din2d, din1d)(__VA_ARGS__)
template <class T> void out2(T &&head) { cout << head; }
template <class T, class... U> void out2(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
}
template <class T, class... U> void out(T &&head, U &&...tail) {
cout << head << " ";
out2(tail...);
cout << "" << endl;
}
template <class T> void out(T &&head) { cout << head << endl; }
void out() { cout << "" << endl; }
#ifdef _DEBUG
template <class T> void err2(T &&head) { cerr << head; }
template <class T, class... U> void err2(T &&head, U &&...tail) {
cerr << head << " ";
err2(tail...);
}
template <class T, class... U> void err(T &&head, U &&...tail) {
cerr << head << " ";
err2(tail...);
cerr << "" << endl;
}
template <class T> void err(T &&head) { cerr << head << endl; }
void err() { cerr << "" << endl; }
template <class T> string out_m2(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) {
ss << a[i];
if (typeid(a[i]) == typeid(P)) {
ss << endl;
} else {
ss << " ";
}
}
return ss.str();
}
template <class T>
string out_m2(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (abs(a[h][w]) == linf)
ss << " e"
<< "";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
return ss.str();
}
template <class T>
string out_m2(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf,
ll U = inf) {
stringstream ss;
if (H == inf)
H = 12;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m2(a[i], W, U, i);
}
return ss.str();
}
template <class T, size_t N> string out_m2(T (&a)[N]) {
vector<T> b;
resize(b, N);
rep(i, N) { b[i] = a[i]; }
return out_m2(b);
}
template <class T, size_t N, size_t M> string out_m2(T (&a)[N][M]) {
vector<vector<T>> b;
resize(b, N, M);
rep(i, N) {
rep(j, M) { b[i][j] = a[i][j]; }
}
return out_m2(b);
}
template <class T, size_t N, size_t M, size_t O>
string out_m2(T (&a)[N][M][O]) {
vector<vector<vector<T>>> b;
resize(b, N, M, O);
rep(i, N) {
rep(j, M) {
rep(k, O) { b[i][j][k] = a[i][j][k]; }
}
}
return out_m2(b);
}
string out_m2(int a) {
stringstream ss;
ss << a;
return ss.str();
}
/*@formatter:on*/
template <class T>
string out_m2(mvec<mvec<T>> &a, ll H = inf, ll W = inf, int key = inf) {
H = min({H, sz(a), 6ll});
W = min({W, sz(a[0]), 6ll});
stringstream ss;
ss << endl;
// if (key == inf)ss << " *|"; else ss << " " << key << "|";
if (key == inf)
ss << " *|";
else {
ss << std::right << std::setw(2) << key;
ss << "|";
}
rep(w, -W, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 8 + 3) ss << "_";
ss << "" << endl;
rep(h, -H, H) {
ss << std::right << std::setw(2) << h << "|";
int NW = min(sz(a[h]), 6ll);
rep(w, -NW, NW) {
if (abs(a[h][w]) == linf)
ss << " e"
<< "";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
return ss.str();
} /*@formatter:on*/
template <class T>
string out_m2(mvec<mvec<mvec<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 6;
H = min(H, sz(a));
rep(i, -H, H) {
ss << endl;
ss << out_m2(a[i], W, U, i);
}
return ss.str();
}
/*@formatter:off*/
template <class T> string out_m2(T &a) {
stringstream ss;
ss << a;
return ss.str();
}
/*@formatter:on*/
template <class T> string out_m(vector<T> &a, ll W = inf) {
stringstream ss;
if (W == inf)
W = min(sz(a), 12ll);
if (sz(a) == 0)
return ss.str();
rep(i, W) { ss << a[i] << " "; }
ss << "" << endl;
return ss.str();
}
/*@formatter:off*/
template <class T>
string out_m(vector<vector<T>> &a, ll H = inf, ll W = inf, int key = -1) {
H = min({H, sz(a), 12ll});
W = min({W, sz(a[0]), 12ll});
stringstream ss;
ss << endl;
if (key == -1)
ss << " *|";
else
ss << " " << key << "|";
rep(w, W) ss << std::right << std::setw(4) << w;
ss << "" << endl;
rep(w, W * 4 + 3) ss << "_";
ss << "" << endl;
rep(h, H) {
ss << std::right << std::setw(2) << h << "|";
rep(w, min(sz(a[h]), 12ll)) {
if (abs(a[h][w]) == linf)
ss << " e"
<< "";
else
ss << std::right << std::setw(4) << a[h][w];
}
ss << "" << endl;
}
ss << endl;
return ss.str();
}
template <class T>
string out_m(vector<vector<vector<T>>> &a, ll H = inf, ll W = inf, ll U = inf) {
stringstream ss;
if (H == inf)
H = 5;
H = min(H, sz(a));
rep(i, H) {
ss << endl;
ss << out_m(a[i], W, U, i);
}
ss << endl;
return ss.str();
}
string out_m(int a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> string out_m(T &a) {
stringstream ss;
ss << a << endl;
return ss.str();
}
template <class T> void outv(vector<T> &a, ll W = inf) {
cout << out_m(a, W) << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
cout << out_m(a, H, W, key) << endl;
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
cout << out_m(a, H, W, U) << endl;
}
#else
template <class T> void outv(vector<T> &a, ll W = inf) {
rep(i, min(W, sz(a))) { cout << a[i] << " "; }
cout << "" << endl;
}
template <class T>
void outv(vector<vector<T>> &a, ll H = linf, ll W = linf, int key = -1) {
rep(i, min(H, sz(a))) { outv(a[i], W); }
}
template <class T>
void outv(vector<vector<vector<T>>> &a, ll H = linf, ll W = linf, ll U = linf) {
;
}
#define err(...) ;
#endif
template <class T> void outl(vector<T> &a, int n = inf) {
rep(i, min(n, sz(a))) cout << a[i] << endl;
}
// テーブルをスペースなしで出力
template <class T> void outt(vector<vector<T>> &a) {
rep(i, sz(a)) {
rep(j, sz(a[i])) { cout << a[i][j]; }
cout << endl;
}
}
// int型をbit表記で出力
void outb(int a) { cout << bitset<20>(a) << endl; }
template <class T> void na(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i];
}
template <class T> void na(set<T> &a, ll n) { rep(i, n) a.insert(in()); }
#define dna(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai];
#define dnad(a, n) \
vi a(n); \
rep(dnai, n) cin >> a[dnai], a[dnai]--;
template <class T> void nao(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1];
}
template <class T> void naod(vector<T> &a, ll n) {
a.resize(n + 1);
a[0] = 0;
rep(i, n) cin >> a[i + 1], a[i + 1]--;
}
template <class T> void nad(vector<T> &a, ll n) {
a.resize(n);
rep(i, n) cin >> a[i], a[i]--;
}
template <class T> void nad(set<T> &a, ll n) { rep(i, n) a.insert(in() - 1); }
template <class T, class U> void na2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i];
}
template <class T, class U> void na2(set<T> &a, set<U> &b, ll n) {
rep(i, n) {
a.insert(in());
b.insert(in());
}
}
#define dna2(a, b, n) \
vi a(n), b(n); \
rep(dna2i, n) cin >> a[dna2i] >> b[dna2i];
template <class T, class U> void nao2(vector<T> &a, vector<U> &b, ll n) {
a.resize(n + 1);
b.resize(n + 1);
a[0] = b[0] = 0;
rep(i, n) cin >> a[i + 1] >> b[i + 1];
}
#define dna2d(a, b, n) \
vi a(n), b(n); \
rep(dna2di, n) { \
cin >> a[dna2di] >> b[dna2di]; \
a[dna2di]--, b[dna2di]--; \
}
template <class T, class U> void na2d(vector<T> &a, vector<U> &b, ll n) {
a.resize(n);
b.resize(n);
rep(i, n) cin >> a[i] >> b[i], a[i]--, b[i]--;
}
template <class T, class U, class W>
void na3(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i];
}
#define dna3(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3i, n) cin >> a[dna3i] >> b[dna3i] >> c[dna3i];
template <class T, class U, class W>
void na3d(vector<T> &a, vector<U> &b, vector<W> &c, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i], a[i]--, b[i]--, c[i]--;
}
#define dna3d(a, b, c, n) \
vi a(n), b(n), c(n); \
rep(dna3di, n) { \
cin >> a[dna3di] >> b[dna3di] >> c[dna3di]; \
a[dna3di]--, b[dna3di]--, c[dna3di]--; \
}
template <class T, class U, class W, class X>
void na4(vector<T> &a, vector<U> &b, vector<W> &c, vector<X> &d, ll n) {
a.resize(n);
b.resize(n);
c.resize(n);
d.resize(n);
rep(i, n) cin >> a[i] >> b[i] >> c[i] >> d[i];
}
#define dna4(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i];
#define dna4d(a, b, c, d, n) \
vi a(n), b(n), c(n), d(n); \
rep(dna4i, n) cin >> a[dna4i] >> b[dna4i] >> c[dna4i] >> d[dna4i], \
--a[dna4i], --b[dna4i], --c[dna4i], --d[dna4i];
#define nt(a, h, w) \
resize(a, h, w); \
rep(nthi, h) rep(ntwi, w) cin >> a[nthi][ntwi];
#define ntd(a, h, w) \
resize(a, h, w); \
rep(ntdhi, h) rep(ntdwi, w) cin >> a[ntdhi][ntdwi], a[ntdhi][ntdwi]--;
#define ntp(a, h, w) \
resize(a, h + 2, w + 2); \
fill(a, '#'); \
rep(ntphi, 1, h + 1) rep(ntpwi, 1, w + 1) cin >> a[ntphi][ntpwi];
// デバッグ
#define sp << " " <<
#define deb1(x) debugName(x) << " = " << out_m2(x)
#define deb_2(x, ...) deb1(x) << ", " << deb1(__VA_ARGS__)
#define deb_3(x, ...) deb1(x) << ", " << deb_2(__VA_ARGS__)
#define deb_4(x, ...) deb1(x) << ", " << deb_3(__VA_ARGS__)
#define deb5(x, ...) deb1(x) << ", " << deb_4(__VA_ARGS__)
#define deb6(x, ...) deb1(x) << ", " << deb5(__VA_ARGS__)
#define deb7(x, ...) deb1(x) << ", " << deb6(__VA_ARGS__)
#define deb8(x, ...) deb1(x) << ", " << deb7(__VA_ARGS__)
#define deb9(x, ...) deb1(x) << ", " << deb8(__VA_ARGS__)
#define deb10(x, ...) deb1(x) << ", " << deb9(__VA_ARGS__)
#ifdef _DEBUG
#define deb(...) \
cerr << over10(__VA_ARGS__, deb10, deb9, deb8, deb7, deb6, deb5, deb_4, \
deb_3, deb_2, deb1)(__VA_ARGS__) \
<< endl
#define base_keta 8
void print_n_base(int x, int base) { cerr << bitset<base_keta>(x) << endl; }
template <class T> void print_n_base(vector<T> X, int base) {
cerr << endl;
for (auto &&x : X) {
print_n_base(x, base);
}
cerr << endl;
}
// n進数
#define deb2(x) \
cerr << debugName(x) << " = "; \
print_n_base(x, 2);
#define deb3(x) \
cerr << debugName(x) << " = "; \
print_n_base(x, 3);
#define deb4(x) \
cerr << debugName(x) << " = "; \
print_n_base(x, 4);
#else
#define deb(...) ;
#define deb2(...) ;
#define deb3(...) ;
#define deb4(...) ;
#endif
#define debugline(x) \
cerr << x << " " \
<< "(L:" << __LINE__ << ")" << '\n'
//@formatter:off
// よく使うクラス、構造体
// graphでredefineしているため、書き換えたら向こうも書き換える
struct unionfind {
vector<ll> par;
vector<ll> siz;
vector<ll> es;
ll n, trees; // 連結グループの数(親の種類)
unionfind(ll n) : n(n), trees(n) {
par.resize(n);
siz.resize(n);
es.resize(n);
for (ll i = 0; i < n; i++) {
par[i] = i;
siz[i] = 1;
}
}
ll root(ll x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
ll operator()(ll x) { return root(x); }
bool unite(ll x, ll y) {
x = root(x);
y = root(y);
es[x]++;
if (x == y)
return false;
if (siz[x] > siz[y])
swap(x, y);
trees--;
par[x] = y;
siz[y] += siz[x];
es[y] += es[x];
return true;
}
bool same(ll x, ll y) { return root(x) == root(y); }
ll size(ll x) { return siz[root(x)]; }
ll esize(ll x) { return es[root(x)]; }
vi sizes() {
vi cou(n);
vi ret;
ret.reserve(n);
rep(i, n) { cou[root(i)]++; }
rep(i, n) {
if (cou[i])
ret.push_back(cou[i]);
}
return ret;
}
// つながりを無向グラフと見なし、xが閉路に含まれるか判定
bool close(ll x) { return esize(x) >= size(x); }
vector<vi> sets() {
vi ind(n, -1);
ll i = 0;
vvi(res, trees);
rep(j, n) {
ll r = root(j);
if (ind[r] == -1)
ind[r] = i++;
res[ind[r]].push_back(j);
}
rep(i, trees) {
ll r = root(res[i][0]);
if (res[i][0] == r)
continue;
rep(j, 1, sz(res[i])) {
if (res[i][j] == r) {
swap(res[i][0], res[i][j]);
break;
}
}
}
return res;
}
}; //@formatter:off
using u32 = unsigned;
using u64 = unsigned long long;
using u128 = __uint128_t;
using bint = __int128;
std::ostream &operator<<(std::ostream &dest, __int128_t value) {
std::ostream::sentry s(dest);
if (s) {
__uint128_t tmp = value < 0 ? -value : value;
char buffer[128];
char *d = std::end(buffer);
do {
--d;
*d = "0123456789"[tmp % 10];
tmp /= 10;
} while (tmp != 0);
if (value < 0) {
--d;
*d = '-';
}
ll len = std::end(buffer) - d;
if (dest.rdbuf()->sputn(d, len) != len) {
dest.setstate(std::ios_base::badbit);
}
}
return dest;
}
__int128 to_bint(string &s) {
__int128 ret = 0;
for (ll i = 0; i < s.length(); ++i)
if ('0' <= s[i] && s[i] <= '9')
ret = 10 * ret + s[i] - '0';
return ret;
}
void operator>>(istream &iss, bint &v) {
string S;
iss >> S;
v = 0;
rep(i, sz(S)) {
v *= 10;
v += S[i] - '0';
}
}
bint max(bint a, signed b) { return max(a, (bint)b); }
bint max(signed a, bint b) { return max((bint)a, b); }
bint max(bint a, ll b) { return max(a, (bint)b); }
bint max(ll a, bint b) { return max((bint)a, b); }
bint min(bint a, signed b) { return min(a, (bint)b); }
bint min(signed a, bint b) { return min((bint)a, b); }
bint min(bint a, ll b) { return min(a, (bint)b); }
bint min(ll a, bint b) { return min((bint)a, b); }
// エラー
void ole() {
#ifdef _DEBUG
debugline("ole");
exit(0);
#endif
string a = "a";
rep(i, 30) a += a;
rep(i, 1 << 17) cout << a << endl;
cout << "OLE 出力長制限超過" << endl;
exit(0);
}
void re() {
assert(0 == 1);
exit(0);
}
void tle() {
while (inf)
cout << inf << endl;
}
// 便利関数
// テスト用
#define rand xor128_
unsigned long xor128_(void) {
static unsigned long x = 123456789, y = 362436069, z = 521288629,
w = 88675123;
unsigned long t;
t = (x ^ (x << 11));
x = y;
y = z;
z = w;
return (w = (w ^ (w >> 19)) ^ (t ^ (t >> 8)));
}
char ranc() { return (char)('a' + rand() % 26); }
ll rand(ll min, ll max) {
assert(min <= max);
if (min >= 0 && max >= 0) {
return rand() % (max + 1 - min) + min;
} else if (max < 0) {
return -rand(-max, -min);
} else {
if (rand() % 2) {
return rand(0, max);
} else {
return -rand(0, -min);
}
}
}
ll rand(ll max) { return rand(0, max); }
template <class T> T rand(vector<T> &A) { return A[rand(sz(A) - 1)]; }
// 重複することがある
template <class T> vector<T> ranv(vector<T> &A, int N) {
vector<T> ret(N);
rep(i, N) { ret[i] = rand(A); }
return ret;
}
template <class T> vector<T> ranv_unique(vector<T> &A, int N) {
vector<T> ret(N);
umapi was;
rep(j, N) {
int i;
while (1) {
i = rand(sz(A) - 1);
if (was.find(i) == was.end())
break;
}
ret[j] = A[i];
was[i] = 1;
}
return ret;
}
vi ranv(ll n, ll min, ll max) {
vi v(n);
rep(i, n) v[i] = rand(min, max);
return v;
}
str ransu(ll n) {
str s;
rep(i, n) s += (char)rand('A', 'Z');
return s;
}
str ransl(ll n) {
str s;
rep(i, n) s += (char)rand('a', 'z');
return s;
}
// 単調増加
vi ranvinc(ll n, ll min, ll max) {
vi v(n);
bool bad = 1;
while (bad) {
bad = 0;
v.resize(n);
rep(i, n) {
if (i && min > max - v[i - 1]) {
bad = 1;
break;
}
if (i)
v[i] = v[i - 1] + rand(min, max - v[i - 1]);
else
v[i] = rand(min, max);
}
}
return v;
}
// 便利 汎用
void ranvlr(ll n, ll min, ll max, vi &l, vi &r) {
l.resize(n);
r.resize(n);
rep(i, n) {
l[i] = rand(min, max);
r[i] = l[i] + rand(0, max - l[i]);
}
}
template <class T> vector<pair<T, int>> run_length(vector<T> &a) {
vector<pair<T, int>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
vector<pair<char, ll>> run_length(string &a) {
vector<pair<char, ll>> ret;
ret.eb(a[0], 1);
rep(i, 1, sz(a)) {
if (ret.back().fi == a[i]) {
ret.back().se++;
} else {
ret.eb(a[i], 1);
}
}
return ret;
}
/*@formatter:on*/
template <class T, class F> T mgr(T ok, T ng, F f) {
bool han = true;
if (ok < ng)
while (ng - ok > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
while (ok - ng > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
template <class T, class F> T mgr(signed ok_, T ng, F f) {
T ok = ok_;
bool han = true;
if (ok < ng)
while (ng - ok > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
while (ok - ng > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
template <class T, class F> T mgr(T ok, signed ng_, F f) {
T ng = ng_;
bool han = true;
if (ok < ng)
while (ng - ok > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
while (ok - ng > 1) {
T mid = (ok + ng) >> 1;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
/*@formatter:off*/
template <class F> dou mgrd(dou ok, dou ng, F f, int kai = 100) {
bool han = true;
if (ok < ng)
rep(i, kai) {
dou mid = (ok + ng) / 2;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
else
rep(i, kai) {
dou mid = (ok + ng) / 2;
if (f(mid))
ok = mid, han = true;
else
ng = mid, han = false;
deb(mid, han);
}
return ok;
}
// strを整数として比較
string smax(str &a, str b) {
if (sz(a) < sz(b)) {
return b;
} else if (sz(a) > sz(b)) {
return a;
} else if (a < b)
return b;
else
return a;
}
// strを整数として比較
string smin(str &a, str b) {
if (sz(a) > sz(b)) {
return b;
} else if (sz(a) < sz(b)) {
return a;
} else if (a > b)
return b;
else
return a;
}
// エラー-1
template <typename W, typename T> ll find(vector<W> &a, int l, const T key) {
rep(i, l, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> ll find(vector<W> &a, const T key) {
rep(i, sz(a)) if (a[i] == key) return i;
return -1;
}
template <typename W, typename T> P find(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return mp(i, j);
return mp(-1, -1);
}
// getid(find())を返す 1次元にする
template <typename W, typename T> int findi(vector<vector<W>> &a, const T key) {
rep(i, sz(a)) rep(j, sz(a[0])) if (a[i][j] == key) return i * sz(a[0]) + j;
return -1;
}
template <typename W, typename U>
T find(vector<vector<vector<W>>> &a, const U key) {
rep(i, sz(a)) rep(j, sz(a[0]))
rep(k, sz(a[0][0])) if (a[i][j][k] == key) return mt(i, j, k);
return mt(-1, -1, -1);
}
// stringも書く
int find(string &s, const string key) {
int klen = sz(key);
rep(i, sz(s) - klen + 1) {
if (s[i] != key[0])
continue;
if (s.substr(i, klen) == key) {
return i;
}
}
return -1;
}
int find(string &s, int l, const string key) {
int klen = sz(key);
rep(i, l, sz(s) - klen + 1) {
if (s[i] != key[0])
continue;
if (s.substr(i, klen) == key) {
return i;
}
}
return -1;
}
int find(string &s, const char key) {
rep(i, sz(s)) {
if (s[i] == key)
return i;
}
return -1;
}
int find(string &s, int l, const char key) {
rep(i, l, sz(s)) {
if (s[i] == key)
return i;
}
return -1;
}
template <typename W, typename T> ll count2(W &a, const T k) { return a == k; }
template <typename W, typename T> ll count2(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
template <typename W, typename T> ll count(vector<W> &a, const T k) {
ll ret = 0;
fora(v, a) ret += count2(v, k);
return ret;
}
vi count(vi &a) {
int ma = 0;
fora(v, a) {
if (ma < v)
ma = v;
}
vi res(ma + 1);
fora(v, a) { res[v]++; }
return res;
}
ll count(str &a, str k) {
ll ret = 0, len = k.length();
auto pos = a.find(k);
while (pos != string::npos)
pos = a.find(k, pos + len), ++ret;
return ret;
}
//'a' = 'A' = 0 として集計 既に-'a'されていても動く
vi count(str &a, int l, int r) {
vi cou(26);
char c = 'a';
if ('A' <= a[l] && a[l] <= 'Z')
c = 'A';
if ('a' <= a[l] && a[l] <= 'z')
c = 'a';
else
c = 0;
rep(i, l, r)++ cou[a[i] - c];
return cou;
}
vi count(str &a, int r = inf) { return count(a, 0, min(r, sz(a))); }
#define couif count_if
// algorythm
ll rev(ll a) {
ll res = 0;
while (a) {
res *= 10;
res += a % 10;
a /= 10;
}
return res;
}
template <class T> void rev(vector<T> &a) { reverse(all(a)); }
template <class U> void rev(vector<vector<U>> &a) {
vector<vector<U>> b(sz(a[0]), vector<U>(sz(a)));
rep(h, sz(a)) rep(w, sz(a[0])) b[w][h] = a[h][w];
a = b;
}
void rev(string &a) { reverse(all(a)); }
constexpr ll p10[] = {1,
10,
100,
1000,
10000,
100000,
1000000,
10000000,
100000000,
1000000000,
10000000000ll,
100000000000ll,
1000000000000ll,
10000000000000ll,
100000000000000ll,
1000000000000000ll,
10000000000000000ll,
100000000000000000ll,
1000000000000000000ll};
// 0は0桁
ll keta(ll v) {
if (v < p10[9]) {
if (v < p10[4]) {
if (v < p10[2]) {
if (v < p10[1]) {
if (v < p10[0])
return 0;
else
return 1;
} else
return 2;
} else {
if (v < p10[3])
return 3;
else
return 4;
}
} else {
if (v < p10[7]) {
if (v < p10[5])
return 5;
else if (v < p10[6])
return 6;
else
return 7;
} else {
if (v < p10[8])
return 8;
else
return 9;
}
}
} else {
if (v < p10[13]) {
if (v < p10[11]) {
if (v < p10[10])
return 10;
else
return 11;
} else {
if (v < p10[12])
return 12;
else
return 13;
}
} else {
if (v < p10[15]) {
if (v < p10[14])
return 14;
else
return 15;
} else {
if (v < p10[17]) {
if (v < p10[16])
return 16;
else
return 17;
} else {
if (v < p10[18])
return 18;
else
return 19;
}
}
}
}
}
ll getr(ll a, ll keta) { return (a / (ll)pow(10, keta)) % 10; }
// 上から何桁目か
ll getl(ll a, ll ket) {
int sketa = keta(a);
return getr(a, sketa - 1 - ket);
}
ll dsum(ll v, ll sin = 10) {
ll ret = 0;
for (; v; v /= sin)
ret += v % sin;
return ret;
}
ll mask10(ll v) { return p10[v] - 1; }
// 変換系
//[v] := iとなるようなvectorを返す
// 存在しない物は-1
template <class T> auto keys(T &a) {
vector<decltype((a.begin())->fi)> res;
for (auto &&k : a)
res.push_back(k.fi);
return res;
}
template <class T> auto values(T &a) {
vector<decltype((a.begin())->se)> res;
for (auto &&k : a)
res.push_back(k.se);
return res;
}
template <class T, class U> bool chma(T &a, const U &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T, class U> bool chmi(T &a, const U &b) {
if (b < a) {
a = b;
return true;
}
return false;
}
template <class T> constexpr T min(T a, signed b) { return a < b ? a : b; }
template <class T> constexpr T max(T a, signed b) { return a < b ? b : a; }
template <class T> constexpr T min(T a, T b, T c) {
return a >= b ? b >= c ? c : b : a >= c ? c : a;
}
template <class T> constexpr T max(T a, T b, T c) {
return a <= b ? b <= c ? c : b : a <= c ? c : a;
}
template <class T> T min(vector<T> &a) { return *min_element(all(a)); }
template <class T> T mini(vector<T> &a) {
return min_element(all(a)) - a.begin();
}
template <class T> T min(vector<T> &a, ll n) {
return *min_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T min(vector<T> &a, ll s, ll n) {
return *min_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a) { return *max_element(all(a)); }
template <class T, class U> T max(vector<T> &a, vector<U> &b) {
return max(*max_element(all(a)), *max_element(all(b)));
}
template <class T> T maxi(vector<T> &a) {
return max_element(all(a)) - a.begin();
}
template <class T> T max(vector<T> &a, ll n) {
return *max_element(a.begin(), a.begin() + min(n, sz(a)));
}
template <class T> T max(vector<T> &a, ll s, ll n) {
return *max_element(a.begin() + s, a.begin() + min(n, sz(a)));
}
template <typename A, size_t N> A max(A (&a)[N]) {
A res = a[0];
rep(i, N) res = max(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A max(A (&a)[N][O]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A max(A (&a)[N][O][P]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A max(A (&a)[N][O][P][Q], const T &v) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A max(A (&a)[N][O][P][Q][R]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A max(A (&a)[N][O][P][Q][R][S]) {
A res = max(a[0]);
rep(i, N) res = max(res, max(a[i]));
return res;
}
template <typename A, size_t N> A min(A (&a)[N]) {
A res = a[0];
rep(i, N) res = min(res, a[i]);
return res;
}
template <typename A, size_t N, size_t O> A min(A (&a)[N][O]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P> A min(A (&a)[N][O][P]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q>
A min(A (&a)[N][O][P][Q], const T &v) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R>
A min(A (&a)[N][O][P][Q][R]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <typename A, size_t N, size_t O, size_t P, size_t Q, size_t R,
size_t S>
A min(A (&a)[N][O][P][Q][R][S]) {
A res = min(a[0]);
rep(i, N) res = min(res, min(a[i]));
return res;
}
template <class T> T sum(vector<T> &v, ll s, ll t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += v[i];
return ret;
}
template <class T> T sum(vector<T> &v, ll t = inf) { return sum(v, 0, t); }
template <class T> T sum(vector<vector<T>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<T>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T> T sum(vector<vector<vector<T>>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<T>>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T> T sum(vector<vector<vector<vector<T>>>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T>
T sum(vector<vector<vector<vector<vector<T>>>>> &v, int s, int t) {
T ret = 0;
rep(i, s, min(sz(v), t)) ret += sum(v[i]);
return ret;
}
template <class T>
T sum(vector<vector<vector<vector<vector<T>>>>> &v, int t = inf) {
return sum(v, 0, t);
}
template <class T> auto sum(priority_queue<T, vector<T>, greater<T>> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> auto sum(priority_queue<T> &r) {
auto q = r;
T ret = 0;
while (sz(q)) {
ret += q.top();
q.pop();
}
return ret;
}
template <class T> T mul(vector<T> &v, ll t = inf) {
T ret = v[0];
rep(i, 1, min(t, sz(v))) ret *= v[i];
return ret;
}
// template<class T, class U, class... W> auto sumn(vector<T> &v, U head, W...
// tail) { auto ret = sum(v[0], tail...); rep(i, 1, min(sz(v), head))ret
// += sum(v[i], tail...); return ret;}
vi v_i(vi &a) {
int n = max(a) + 1;
vi ret(n, -1);
rep(i, sz(a)) { ret[a[i]] = i; }
return ret;
}
void clear(PQ &q) { q = PQ(); }
void clear(priority_queue<int> &q) { q = priority_queue<int>(); }
template <class T> void clear(queue<T> &q) {
while (q.size())
q.pop();
}
template <class T> T *negarr(ll size) {
T *body = (T *)malloc((size * 2 + 1) * sizeof(T));
return body + size;
}
template <class T> T *negarr2(ll h, ll w) {
double **dummy1 = new double *[2 * h + 1];
double *dummy2 = new double[(2 * h + 1) * (2 * w + 1)];
dummy1[0] = dummy2 + w;
for (ll i = 1; i <= 2 * h + 1; ++i) {
dummy1[i] = dummy1[i - 1] + 2 * w + 1;
}
double **a = dummy1 + h;
return a;
}
// imoは0-indexed
// ruiは1-indexed
template <class T> vector<T> imo(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
// kと同じものの数
template <class T, class U> vi imo(vector<T> &a, U k) {
vector<T> ret = a;
rep(i, sz(ret)) ret[i] = a[i] == k;
rep(i, sz(ret) - 1) ret[i + 1] += ret[i];
return ret;
}
template <class T> vector<T> imox(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) ret[i + 1] ^= ret[i];
return ret;
}
// 漸化的に最小を持つ
template <class T> vector<T> imi(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chmi(ret[i + 1], ret[i]);
return ret;
}
template <class T> vector<T> ima(vector<T> &v) {
vector<T> ret = v;
rep(i, sz(ret) - 1) chma(ret[i + 1], ret[i]);
return ret;
}
template <class T> vector<T> rimi(vector<T> &v) {
vector<T> ret = v;
rer(i, sz(ret) - 1, 1) chmi(ret[i - 1], ret[i]);
return ret;
}
template <class T> vector<T> rima(vector<T> &v) {
vector<T> ret = v;
rer(i, sz(ret) - 1, 1) chma(ret[i - 1], ret[i]);
return ret;
}
template <class T> struct ruiC {
vector<T> rui;
ruiC(vector<T> &ru) : rui(ru) {}
/*先頭0*/
ruiC() : rui(1, 0) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
return rui[r] - rui[l];
}
T operator()(int r) { return operator()(0, r); }
/*ruiv[]をruic[]に変えた際意味が変わるのがまずいため()と統一*/
/*単体iを返す 累積でないことに注意(seg木との統一でこうしている)*/
// T operator[](ll i) { return rui[i + 1] - rui[i]; }
T operator[](ll i) { return rui[i]; }
/*0から順に追加される必要がある*/
void operator+=(T v) { rui.push_back(rui.back() + v); }
void add(int i, T v) {
if (sz(rui) - 1 != i)
ole();
operator+=(v);
}
T back() { return rui.back(); }
ll size() { return rui.size(); }
auto begin() { return rui.begin(); }
auto end() { return rui.end(); }
};
template <class T> struct ruimax {
template <typename Monoid> struct SegmentTree { /*pairで処理*/
int sz;
vector<Monoid> seg;
const Monoid M1 = mp(MIN(T), -1);
Monoid f(Monoid a, Monoid b) { return max(a, b); }
void build(vector<T> &a) {
int n = sz(a);
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
rep(i, n) { seg[i + sz] = mp(a[i], i); }
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[k << 1], seg[(k << 1) | 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
};
private:
vector<T> ve;
SegmentTree<pair<T, int>> seg;
vector<T> rv;
vector<T> ri;
bool build = false;
public:
int n;
ruimax(vector<T> &a) : ve(a), n(sz(a)) {
int index = -1;
int ma = MIN(T);
rv.resize(n + 1);
ri.resize(n + 1);
rv[0] = -linf;
ri[0] = -1;
rep(i, n) {
if (chma(ma, a[i])) {
index = i;
}
rv[i + 1] = ma;
ri[i + 1] = index;
}
}
T operator()(int l, int r) {
if (!(l <= r && 0 <= l && r <= n)) {
deb(l, r, n);
assert(0);
}
if (l == 0) {
return rv[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).first;
}
}
T operator()(int r = inf) { return operator()(0, min(r, n)); }
T operator[](int r) { return operator()(0, r); }
T getv(int l, int r) { return operator()(l, r); }
T geti(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
if (l == 0) {
return ri[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).second;
}
}
T geti(int r = inf) { return geti(0, min(r, n)); };
T getv(int r = inf) { return getv(0, min(r, n)); };
auto begin() { return rv.begin(); }
auto end() { return rv.end(); }
};
template <class T> struct ruimin {
template <typename Monoid> struct SegmentTree { /*pairで処理*/
int sz;
vector<Monoid> seg;
const Monoid M1 = mp(MAX(T), -1);
Monoid f(Monoid a, Monoid b) { return min(a, b); }
void build(vector<T> &a) {
int n = sz(a);
sz = 1;
while (sz < n)
sz <<= 1;
seg.assign(2 * sz, M1);
rep(i, n) { seg[i + sz] = mp(a[i], i); }
for (int k = sz - 1; k > 0; k--) {
seg[k] = f(seg[k << 1], seg[(k << 1) | 1]);
}
}
Monoid query(int a, int b) {
Monoid L = M1, R = M1;
for (a += sz, b += sz; a < b; a >>= 1, b >>= 1) {
if (a & 1)
L = f(L, seg[a++]);
if (b & 1)
R = f(seg[--b], R);
}
return f(L, R);
}
Monoid operator[](const int &k) const { return seg[k + sz]; }
};
private:
vector<T> ve;
SegmentTree<pair<T, int>> seg;
vector<T> rv;
vector<T> ri;
bool build = false;
int n;
public:
ruimin(vector<T> &a) : ve(a), n(sz(a)) {
int index = -1;
int mi = MAX(T);
rv.resize(n + 1);
ri.resize(n + 1);
rv[0] = linf;
ri[0] = -1;
rep(i, n) {
if (chmi(mi, a[i])) {
index = i;
}
rv[i + 1] = mi;
ri[i + 1] = index;
}
}
T operator()(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
if (l == 0) {
return rv[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).first;
}
}
T operator()(int r = inf) { return operator()(0, min(r, n)); }
T operator[](int r) { return operator()(0, r); }
T getv(int l, int r) { return operator()(l, r); }
T geti(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
if (l == 0) {
return ri[r];
} else {
if (!build)
seg.build(ve), build = true;
return seg.query(l, r).second;
}
}
T geti(int r = inf) { return geti(0, min(r, n)); };
T getv(int r = inf) { return getv(0, min(r, n)); };
auto begin() { return rv.begin(); }
auto end() { return rv.end(); }
};
template <class T> ostream &operator<<(ostream &os, ruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
template <class T> vector<T> ruiv(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i];
return ret;
}
template <class T> ruiC<T> ruic() { return ruiC<T>(); }
template <class T> ruiC<T> ruic(vector<T> &a) {
vector<T> ret = ruiv(a);
return ruiC<T>(ret);
}
vvi() ruib(vi &a) {
vvi(res, 61, sz(a) + 1);
rep(k, 61) {
rep(i, sz(a)) { res[k][i + 1] = res[k][i] + ((a[i] >> k) & 1); }
}
return res;
}
vector<ruiC<int>> ruibc(vi &a) {
vector<ruiC<int>> ret(61);
vvi(res, 61, sz(a));
rep(k, 61) {
rep(i, sz(a)) { res[k][i] = (a[i] >> k) & 1; }
ret[k] = ruic(res[k]);
}
return ret;
}
vector<ll> ruiv(string &a) {
if (sz(a) == 0)
return vi(1);
ll dec = ('0' <= a[0] && a[0] <= '9') ? '0' : 0;
vector<ll> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + a[i] - dec;
return ret;
}
ruiC<ll> ruic(string &a) {
vector<ll> ret = ruiv(a);
return ruiC<ll>(ret);
}
// kと同じものの数
template <class T, class U> vi ruiv(T &a, U k) {
vi ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] + (a[i] == k);
return ret;
}
template <class T, class U> ruiC<ll> ruic(T &a, U k) {
vi ret = ruiv(a, k);
return ruiC<ll>(ret);
}
template <class T> struct ruiC2 {
int H;
vector<ruiC<T>> rui;
ruiC2(vector<vector<T>> &ru) : rui(sz(ru)), H(sz(ru)) {
for (int h = 0; h < H; h++) {
rui[h] = ruic(ru[h]);
}
}
// WについてHを返す
vector<T> operator()(ll l, ll r) {
if (l > r) {
cerr << "ruic ";
deb(l, r);
assert(0);
}
vector<T> res(H);
for (int h = 0; h < H; h++)
res[h] = rui[h](l, r);
return res;
}
// HについてWを返す
ruiC<T> operator[](ll h) {
assert(h < H);
return rui[h];
}
// vector<T> operator()(int r) { return operator()(0, r); }
/*ruiv[]をruic[]に変えた際意味が変わるのがまずいため()と統一*/
/*単体iを返す 累積でないことに注意(seg木との統一でこうしている)*/
// T operator[](ll i) { return rui[i + 1] - rui[i]; }
/*0から順に追加される必要がある*/
// T back() { return rui.back(); }
// ll size() { return rui.size(); }
// auto begin(){return rui.begin();}
// auto end(){return rui.end();}
};
// a~zを0~25として
// rui(l,r)でvector(26文字について, l~rのcの個数)
// rui[h] ruic()を返す
ruiC2<ll> ruicou(str &a) {
str s = a;
replace(s);
vector<ruiC<ll>> res(26);
vvi(cou, 26, sz(s));
rep(i, sz(s)) { cou[s[i]][i] = 1; }
return ruiC2<ll>(cou);
}
ruiC2<ll> ruicou(vi &a) {
int H = max(a) + 1;
vector<ruiC<ll>> res(H);
vvi(cou, H, sz(a));
rep(i, sz(a)) { cou[a[i]][i] = 1; }
return ruiC2<ll>(cou);
}
/*@formatter:off*/
// h query
template <class T> vector<T> imoh(vector<vector<T>> &v, int w) {
vector<T> ret(sz(v));
rep(h, sz(ret)) { ret[h] = v[h][w]; }
rep(i, sz(ret) - 1) { ret[i + 1] += ret[i]; }
return ret;
}
template <class T> vector<T> ruih(vector<vector<T>> &v, int w) {
vector<T> ret(sz(v) + 1);
rep(h, sz(v)) { ret[h + 1] = v[h][w]; }
rep(i, sz(v)) { ret[i + 1] += ret[i]; }
return ret;
}
template <class T> ruiC<T> ruihc(vector<vector<T>> &a, int w) {
vector<T> ret = ruih(a, w);
return ruiC<T>(ret);
}
// xor
template <class T> struct ruixC {
vector<T> rui;
ruixC(vector<T> &ru) : rui(ru) {}
T operator()(ll l, ll r) {
if (l > r) {
cerr << "ruiXc ";
deb(l, r);
assert(0);
}
return rui[r] ^ rui[l];
}
T operator[](ll i) { return rui[i]; }
T back() { return rui.back(); }
ll size() { return rui.size(); }
};
template <class T> vector<T> ruix(vector<T> &a) {
vector<T> ret(a.size() + 1);
rep(i, a.size()) ret[i + 1] = ret[i] ^ a[i];
return ret;
}
template <class T> ruixC<ll> ruixc(vector<T> &a) {
vi ret = ruix(a);
return ruixC<ll>(ret);
}
template <class T> vector<T> ruim(vector<T> &a) {
vector<T> res(a.size() + 1, 1);
rep(i, a.size()) res[i + 1] = res[i] * a[i];
return res;
}
// 漸化的に最小を1indexで持つ
template <class T> vector<T> ruimi(vector<T> &a) {
ll n = sz(a);
vector<T> ret(n + 1);
rep(i, 1, n) {
ret[i] = a[i - 1];
chmi(ret[i + 1], ret[i]);
}
return ret;
}
// template<class T> T *rrui(vector<T> &a) {
// 右から左にかけての半開区間 (-1 n-1]
template <class T> struct rruiC {
vector<T> rui;
int n;
rruiC(vector<T> &a) : n(sz(a)) {
rui.resize(n + 1);
rer(i, n - 1) { rui[i] = rui[i + 1] + a[i]; }
}
/*[r l)*/
T operator()(int r, int l) {
r++;
l++;
assert(l <= r && l >= 0 && r <= n);
return rui[l] - rui[r];
}
T operator()(int l) { return operator()(n - 1, l); }
T operator[](int i) { return operator()(i); }
};
template <class T> ostream &operator<<(ostream &os, rruiC<T> a) {
fora(v, a.rui) os << v << " ";
return os;
}
#define rrui rruic
template <class T> rruiC<T> rruic(vector<T> &a) { return rruiC<T>(a); }
// 掛け算
template <class T> struct ruimulC {
vector<T> rv;
int n;
ruimulC(vector<T> &a) : rv(a), n(sz(a)) {
rv.resize(n + 1);
rv[0] = 1;
rep(i, n) { rv[i + 1] = a[i] * rv[i]; }
}
ruimulC() : n(0) {
rv.resize(n + 1);
rv[0] = 1;
}
void operator+=(T v) {
rv.push_back(rv.back() * v);
n++;
}
T operator()(int l, int r) {
assert(l <= r && 0 <= l && r <= n);
return rv[r] / rv[l];
}
T operator()(int r = inf) { return operator()(0, min(r, n)); }
T operator[](int r) { return operator()(0, r); }
auto begin() { return rv.begin(); }
auto end() { return rv.end(); }
};
template <class T> ruimulC<T> ruimul(vector<T> &a) { return ruimulC<T>(a); }
template <class T> ruimulC<T> ruimul() {
vector<T> a;
return ruimulC<T>(a);
}
/*@formatter:off*/
template <class T> T *rruim(vector<T> &a) {
ll len = a.size();
T *body = (T *)malloc((len + 1) * sizeof(T));
T *res = body + 1;
res[len - 1] = 1;
rer(i, len - 1) res[i - 1] = res[i] * a[i];
return res;
}
template <class T, class U> void inc(pair<T, U> &a, U v = 1) {
a.first += v, a.second += v;
}
template <class T, class U> void inc(T &a, U v = 1) { a += v; }
template <class T, class U = int> void inc(vector<T> &a, U v = 1) {
for (auto &u : a)
inc(u, v);
}
template <class T, class U> void dec(T &a, U v = 1) { a -= v; }
template <class T, class U = int> void dec(vector<T> &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class U> void dec(string &a, U v = 1) {
for (auto &u : a)
dec(u, v);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, W v = 1) {
for (auto &u : a)
dec(u, v);
for (auto &u : b)
dec(u, v);
}
template <class T, class U, class W>
void dec(vector<T> &a, vector<U> &b, vector<W> &c) {
for (auto &u : a)
dec(u, 1);
for (auto &u : b)
dec(u, 1);
for (auto &u : c)
dec(u, 1);
}
bool ins(ll h, ll w, ll H, ll W) { return h >= 0 && w >= 0 && h < H && w < W; }
bool ins(ll l, ll v, ll r) { return l <= v && v < r; }
template <class T> bool ins(vector<T> &a, ll i, ll j = 0) {
return ins(0, i, sz(a)) && ins(0, j, sz(a));
}
#define inside ins
ll u(ll a) { return a < 0 ? 0 : a; }
template <class T> vector<T> u(vector<T> &a) {
vector<T> ret = a;
fora(v, ret) v = u(v);
return ret;
}
// 添え字を返す
template <class F> ll goldd_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
ll minScore = MAX(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (minScore > score) {
minScore = score;
resIndex = i;
}
}
return resIndex;
}
template <class F> ll goldt_l(ll left, ll right, F calc) {
double GRATIO = 1.6180339887498948482045868343656;
ll lm = left + (ll)((right - left) / (GRATIO + 1.0));
ll rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
ll fl = calc(lm);
ll fr = calc(rm);
while (right - left > 10) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + (ll)((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + (ll)((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
if (left > right) {
ll l = left;
left = right;
right = l;
}
ll maxScore = MIN(ll);
ll resIndex = left;
for (ll i = left; i < right + 1; ++i) {
ll score = calc(i);
if (maxScore < score) {
maxScore = score;
resIndex = i;
}
}
return resIndex;
}
/*loopは200にすればおそらく大丈夫 余裕なら300に*/
template <class F> dou goldd_d(dou left, dou right, F calc, ll loop = 200) {
dou GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm); /*200にすればおそらく大丈夫*/ /*余裕なら300に*/
ll k = 141;
loop++;
while (--loop) {
if (fl < fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
template <class F> dou goldt_d(dou left, dou right, F calc, ll loop = 200) {
double GRATIO = 1.6180339887498948482045868343656;
dou lm = left + ((right - left) / (GRATIO + 1.0));
dou rm = lm + ((right - lm) / (GRATIO + 1.0));
dou fl = calc(lm);
dou fr = calc(rm);
loop++;
while (--loop) {
if (fl > fr) {
right = rm;
rm = lm;
fr = fl;
lm = left + ((right - left) / (GRATIO + 1.0));
fl = calc(lm);
} else {
left = lm;
lm = rm;
fl = fr;
rm = lm + ((right - lm) / (GRATIO + 1.0));
fr = calc(rm);
}
}
return left;
}
// l ~ rを複数の区間に分割し、極致を与えるiを返す time-20 msまで探索
template <class F> ll goldd_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll mini = 0, minv = MAX(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldd_l(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F> ll goldt_ls(ll l, ll r, F calc, ll time = 2000) {
auto lim = milliseconds(time - 20);
ll maxi = 0, maxv = MIN(ll); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
ll haba = (r - l + k) / k; /*((r-l+1) + k-1) /k*/
ll nl = l;
ll nr = l + haba;
rep(i, k) {
ll ni = goldt_l(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class F>
dou goldd_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を持つ*/
auto lim = milliseconds(time - 20);
dou mini = 0, minv = MAX(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldd_d(nl, nr, calc);
if (chmi(minv, calc(ni)))
mini = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return mini;
}
template <class F>
dou goldt_d_s(dou l, dou r, F calc, ll time = 2000) { /*20ms余裕を残している*/
auto lim = milliseconds(time - 20);
dou maxi = 0, maxv = MIN(dou); /*区間をk分割する*/
rep(k, 1, inf) {
auto s = system_clock::now();
dou haba = (r - l) / k;
dou nl = l;
dou nr = l + haba;
rep(i, k) {
dou ni = goldt_d(nl, nr, calc);
if (chma(maxv, calc(ni)))
maxi = ni;
nl = nr;
nr = nl + haba;
}
auto end = system_clock::now();
auto part = duration_cast<milliseconds>(end - s);
auto elapsed = duration_cast<milliseconds>(end - start_time);
if (elapsed + part * 2 >= lim) {
break;
}
}
return maxi;
}
template <class T> T min(vector<vector<T>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, *min_element(all(a[i])));
return res;
}
template <class T> T max(vector<vector<T>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, *max_element(all(a[i])));
return res;
}
template <class T> T min(vector<vector<vector<T>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<T>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
template <class T> T min(vector<vector<vector<vector<T>>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<vector<T>>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
template <class T> T min(vector<vector<vector<vector<vector<T>>>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<vector<vector<T>>>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
template <class T> T min(vector<vector<vector<vector<vector<vector<T>>>>>> &a) {
T res = MAX(T);
rep(i, a.size()) chmi(res, min(a[i]));
return res;
}
template <class T> T max(vector<vector<vector<vector<vector<vector<T>>>>>> &a) {
T res = MIN(T);
rep(i, a.size()) chma(res, max(a[i]));
return res;
}
// pow周りの仕様
// powiを使うと整数型
// powbを使うとbint型
// powを使うと powlに変換され long doubleが返る
#ifdef _DEBUG
auto pow(ll a, ll k) {
static bool was = 1;
if (was) {
message += "if integer use *powi* it's very fast\n";
}
was = 0;
return powl(a, k);
}
// 上のメッセージを出すための関数
auto pow(signed a, ll k) { return pow((ll)a, k); }
auto pow(signed a, signed k) { return pow((ll)a, (ll)k); }
#else
#define pow powl
#endif
// 整数型のpow
int powi(int a, int k) {
if (a == 2)
return 1ll << k;
int res = 1;
int x = a;
while (k) {
if (k & 1)
res *= x;
x *= x;
k >>= 1;
}
return res;
}
// define pow powlより上に動かすとバグる
bint pow(bint a, ll k) {
bint res = 1;
bint x = a;
while (k) {
if (k & 1)
res *= x;
x *= x;
k >>= 1;
}
return res;
}
bint pow(bint a, signed k) { return pow(a, (ll)k); }
bint powb(int a, int b) { return pow((bint)a, b); }
constexpr bool bget(ll m, ll keta) {
#ifdef _DEBUG
assert(keta <= 62); // オーバーフロー 1^62までしか扱えない
#endif
return (m >> keta) & 1;
}
// bget(n)次元
// NならN-1まで
vector<vi> bget2(vi &a, int keta_size) {
vvi(res, keta_size, sz(a));
rep(k, keta_size) {
rep(i, sz(a)) { res[k][i] = bget(a[i], k); }
}
return res;
}
vi bget1(vi &a, int keta) {
vi res(sz(a));
rep(i, sz(a)) { res[i] = bget(a[i], keta); }
return res;
}
ll bget(ll m, ll keta, ll sinsuu) {
m /= (ll)pow(sinsuu, keta);
return m % sinsuu;
}
constexpr ll bit(ll n) {
#ifdef _DEBUG
assert(n <= 62); // オーバーフロー 1^62までしか扱えない
#endif
return (1LL << (n));
}
ll bit(ll n, ll sinsuu) { return (ll)pow(sinsuu, n); }
ll mask(ll n) { return (1ll << n) - 1; }
// aをbitに置きなおす
//{0, 2} -> 101
ll bit(vi &a) {
int m = 0;
for (auto &&v : a)
m |= bit(v);
return m;
}
//{1, 1, 0} -> 011
// bitsetに置き換える感覚 i が立っていたら i bit目を立てる
ll bitb(vi &a) {
int m = 0;
rep(i, sz(a)) if (a[i]) m |= bit(i);
return m;
}
#define bcou __builtin_popcountll
// 最下位ビット
ll lbit(ll n) { return n & -n; }
ll lbiti(ll n) { return log2(n & -n); }
// 最上位ビット
ll hbit(ll n) {
n |= (n >> 1);
n |= (n >> 2);
n |= (n >> 4);
n |= (n >> 8);
n |= (n >> 16);
n |= (n >> 32);
return n - (n >> 1);
}
ll hbiti(ll n) { return log2(hbit(n)); }
ll hbitk(ll n) {
ll k = 0;
rer(i, 5) {
ll a = k + (1ll << i);
ll b = 1ll << a;
if (b <= n)
k += 1ll << i;
}
return k;
}
// 初期化は0を渡す
ll nextComb(ll &mask, ll n, ll r) {
if (!mask)
return mask = (1LL << r) - 1;
ll x = mask & -mask; /*最下位の1*/
ll y = mask + x; /*連続した下の1を繰り上がらせる*/
ll res = ((mask & ~y) / x >> 1) | y;
if (bget(res, n))
return mask = 0;
else
return mask = res;
}
// n桁以下でビットがr個立っているもののvectorを返す
vi bitCombList(ll n, ll r) {
vi res;
ll m = 0;
while (nextComb(m, n, r)) {
res.push_back(m);
}
return res;
}
// masの立ってるindexを見る
#define forbit(i, mas) \
for (int forbitj = lbit(mas), forbitm = mas, i = log2(forbitj); forbitm; \
forbitm = forbitj ? forbitm ^ forbitj : 0, forbitj = lbit(forbitm), \
i = log2(forbitj))
char itoal(ll i) { return 'a' + i; }
char itoaL(ll i) { return 'A' + i; }
ll altoi(char c) {
if ('A' <= c && c <= 'Z')
return c - 'A';
return c - 'a';
}
ll ctoi(char c) { return c - '0'; }
char itoc(ll i) { return i + '0'; }
ll vtoi(vi &v) {
ll res = 0;
if (sz(v) > 18) {
debugline("vtoi");
deb(sz(v));
ole();
}
rep(i, sz(v)) {
res *= 10;
res += v[i];
}
return res;
}
vi itov(ll i) {
vi res;
while (i) {
res.push_back(i % 10);
i /= 10;
}
rev(res);
return res;
}
vi stov(string &a) {
ll n = sz(a);
vi ret(n);
rep(i, n) { ret[i] = a[i] - '0'; }
return ret;
}
// 基準を満たさないものは0になる
vi stov(string &a, char one) {
ll n = sz(a);
vi ret(n);
rep(i, n) ret[i] = a[i] == one;
return ret;
}
vector<vector<ll>> ctoi(vector<vector<char>> s, char c) {
ll n = sz(s), m = sz(s[0]);
vector<vector<ll>> res(n, vector<ll>(m));
rep(i, n) rep(j, m) res[i][j] = s[i][j] == c;
return res;
}
#define unique(v) v.erase(unique(v.begin(), v.end()), v.end());
//[i] := vを返す
// aは0~n-1で置き換えられる
vi compress(vi &a) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, umap<ll, ll> &map) {
vi b;
ll len = a.size();
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
ll v = a[i];
a[i] = lower_bound(all(b), a[i]) - b.begin();
map[v] = a[i];
}
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vi &a, vi &r, vi &s) {
vi b;
ll len = a.size();
fora(v, a) b.push_back(v);
fora(v, r) b.push_back(v);
fora(v, s) b.push_back(v);
sort(b);
unique(b);
for (ll i = 0; i < len; ++i)
a[i] = lower_bound(all(b), a[i]) - b.begin();
for (ll i = 0; i < sz(r); ++i)
r[i] = lower_bound(all(b), r[i]) - b.begin();
for (ll i = 0; i < sz(s); ++i)
r[i] = lower_bound(all(b), s[i]) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vi> &a) {
vi b;
fora(vv, a) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vv, a) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
vi compress(vector<vector<vi>> &a) {
vi b;
fora(vvv, a) fora(vv, vvv) fora(v, vv) b.push_back(v);
sort(b);
unique(b);
fora(vvv, a) fora(vv, vvv) fora(v, vv) v = lower_bound(all(b), v) - b.begin();
ll blen = sz(b);
vi ret(blen);
rep(i, blen) { ret[i] = b[i]; }
return ret;
}
void compress(ll a[], ll len) {
vi b;
for (ll i = 0; i < len; ++i) {
b.push_back(a[i]);
}
sort(b);
unique(b);
for (ll i = 0; i < len; ++i) {
a[i] = lower_bound(all(b), a[i]) - b.begin();
}
}
// 要素が見つからなかったときに困る
#define binarySearch(a, v) (binary_search(all(a), v))
#define lowerIndex(a, v) (lower_bound(all(a), v) - a.begin())
#define upperIndex(a, v) (upper_bound(all(a), v) - a.begin())
#define rlowerIndex(a, v) (upper_bound(all(a), v) - a.begin() - 1)
#define rupperIndex(a, v) (lower_bound(all(a), v) - a.begin() - 1)
template <class T, class U, class W> T lowerBound(vector<T> &a, U v, W banpei) {
auto it = lower_bound(a.begin(), a.end(), v);
if (it == a.end())
return banpei;
else
return *it;
}
template <class T, class U, class W> T lowerBound(ruiC<T> &a, U v, W banpei) {
return lowerBound(a.rui, v, banpei);
}
template <class T, class U, class W> T upperBound(vector<T> &a, U v, W banpei) {
auto it = upper_bound(a.begin(), a.end(), v);
if (it == a.end())
return banpei;
else
return *it;
}
template <class T, class U, class W> T upperBound(ruiC<T> &a, U v, W banpei) {
return upperBound(a.rui, v, banpei);
}
template <class T, class U, class W>
T rlowerBound(vector<T> &a, U v, W banpei) {
auto it = upper_bound(a.begin(), a.end(), v);
if (it == a.begin())
return banpei;
else {
return *(--it);
}
}
template <class T, class U, class W> T rlowerBound(ruiC<T> &a, U v, W banpei) {
return rlowerBound(a.rui, v, banpei);
}
template <class T, class U, class W>
T rupperBound(vector<T> &a, U v, W banpei) {
auto it = lower_bound(a.begin(), a.end(), v);
if (it == a.begin())
return banpei;
else {
return *(--it);
}
}
template <class T, class U, class W> T rupperBound(ruiC<T> &a, U v, W banpei) {
return rupperBound(a.rui, v, banpei);
}
#define next2(a) next(next(a))
#define prev2(a) prev(prev(a))
// 狭義の単調増加列 長さを返す
template <class T> int lis(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = lowerIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
template <class T> int lis_eq(vector<T> &a) {
int n = sz(a);
vi tail(n + 1, MAX(T));
rep(i, n) {
int id = upperIndex(tail, a[i]); /**/
tail[id] = a[i];
}
return lowerIndex(tail, MAX(T));
}
// iteratorを返す
// valueが1以上の物を返す 0は見つけ次第削除
// vを減らす場合 (*it).se--でいい
template <class T, class U, class V> auto lower_map(map<T, U> &m, V k) {
auto ret = m.lower_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
template <class T, class U, class V> auto upper_map(map<T, U> &m, V k) {
auto ret = m.upper_bound(k);
while (ret != m.end() && (*ret).second == 0) {
ret = m.erase(ret);
}
return ret;
}
// 存在しなければエラー
template <class T, class U, class V> auto rlower_map(map<T, U> &m, V k) {
auto ret = upper_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class T, class U, class V> auto rupper_map(map<T, U> &m, V k) {
auto ret = lower_map(m, k);
assert(ret != m.begin());
ret--;
while (1) {
if ((*ret).second != 0)
break;
assert(ret != m.begin());
auto next = ret;
--next;
m.erase(ret);
ret = next;
}
return ret;
}
template <class... T> void fin(T... s) {
out(s...);
exit(0);
}
// 便利 数学 math
// sub ⊂ top
bool subset(int sub, int top) { return (sub & top) == sub; }
//-180 ~ 180 degree
double atand(double h, double w) { return atan2(h, w) / PI * 180; }
//% -mの場合、最小の正の数を返す
ll mod(ll a, ll m) {
if (m < 0)
m *= -1;
return (a % m + m) % m;
}
ll pow(ll a) { return a * a; };
ll fact(ll v) { return v <= 1 ? 1 : v * fact(v - 1); }
dou factd(int v) {
static vd fact(2, 1);
if (sz(fact) <= v) {
rep(i, sz(fact), v + 1) { fact.push_back(fact.back() * i); }
}
return fact[v];
}
ll comi(ll n, ll r) {
assert(n < 100);
static vvi(pas, 100, 100);
if (pas[0][0])
return pas[n][r];
pas[0][0] = 1;
rep(i, 1, 100) {
pas[i][0] = 1;
rep(j, 1, i + 1) pas[i][j] = pas[i - 1][j - 1] + pas[i - 1][j];
}
return pas[n][r];
}
double comd2(ll n, ll r) {
static vvd(comb, 2020, 2020);
if (comb[0][0] == 0) {
comb[0][0] = 1;
rep(i, 2000) {
comb[i + 1][0] = 1;
rep(j, 1, i + 2) { comb[i + 1][j] = comb[i][j] + comb[i][j - 1]; }
}
}
return comb[n][r];
}
double comd(int n, int r) {
if (r < 0 || r > n)
return 0;
if (n < 2020)
return comd2(n, r);
static vd fact(2, 1);
if (sz(fact) <= n) {
rep(i, sz(fact), n + 1) { fact.push_back(fact.back() * i); }
}
return fact[n] / fact[n - r] / fact[r];
}
ll gcd(ll a, ll b) {
while (b)
a %= b, swap(a, b);
return abs(a);
}
ll gcd(vi b) {
ll res = b[0];
rep(i, 1, sz(b)) res = gcd(b[i], res);
return res;
}
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
ll lcm(vi a) {
ll res = a[0];
rep(i, 1, sz(a)) res = lcm(a[i], res);
return res;
}
ll ceil(ll a, ll b) {
if (b == 0) {
debugline("ceil");
deb(a, b);
ole();
return -1;
} else if (a < 0) {
return 0;
} else {
return (a + b - 1) / b;
}
}
ll sig0(int t) { return t <= 0 ? 0 : ((1 + t) * t) >> 1; }
bint sig0(bint t) { return t <= 0 ? 0 : ((1 + t) * t) >> 1; }
// ll sig(ll s, ll t) { return ((s + t) * (t - s + 1)) >> 1; }
ll sig(ll s, ll t) {
if (s > t)
swap(s, t);
return sig0(t - s) + s * (t - s + 1);
}
#define tousa_i tosa_i
#define lower_tousa_i lower_tosa_i
#define upper_tousa upper_tosa
#define upper_tousa_i upper_tosa_i
ll tosa_i(ll st, ll ad, ll v) {
assert(((v - st) % ad) == 0);
return (v - st) / ad;
}
ll tosa_s(ll st, ll ad, ll len) { return st * len + sig0(len - 1) * ad; }
// ax + r (x は非負整数) で表せる整数のうち、v 以上となる最小の整数
ll lower_tosa(ll st, ll ad, ll v) {
if (st >= v)
return st;
return (v - st + ad - 1) / ad * ad + st;
}
// 第何項か
ll lower_tosa_i(ll st, ll ad, ll v) {
if (st >= v)
return 0;
return (v - st + ad - 1) / ad;
}
ll upper_tosa(ll st, ll ad, ll v) { return lower_tosa(st, ad, v + 1); }
ll upper_tosa_i(ll st, ll ad, ll v) { return lower_tosa_i(st, ad, v + 1); }
// v * v >= aとなる最小のvを返す
ll sqrt(ll a) {
if (a < 0) {
debugline("sqrt");
deb(a);
ole();
}
ll res = (ll)std::sqrt(a);
while (res * res < a)
++res;
return res;
}
double log(double e, double x) { return log(x) / log(e); }
/*@formatter:off*/
// 機能拡張
#define dtie(a, b) \
int a, b; \
tie(a, b)
template <class T, class U> string to_string(T a, U b) {
string res = "";
res += a;
res += b;
return res;
}
template <class T, class U, class V> string to_string(T a, U b, V c) {
string res = "";
res += a;
res += b;
res += c;
return res;
}
template <class T, class U, class V, class W>
string to_string(T a, U b, V c, W d) {
string res = "";
res += a;
res += b;
res += c;
res += d;
return res;
}
template <class T, class U, class V, class W, class X>
string to_string(T a, U b, V c, W d, X e) {
string res = "";
res += a;
res += b;
res += c;
res += d;
res += e;
return res;
}
constexpr int bsetlen = k5 * 2;
// constexpr int bsetlen = 5050;
#define bset bitset<bsetlen>
bool operator<(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] < b[i])
return true;
if (a[i] > b[i])
return false;
}
return false;
}
bool operator>(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] > b[i])
return true;
if (a[i] < b[i])
return false;
}
return false;
}
bool operator<=(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] < b[i])
return true;
if (a[i] > b[i])
return false;
}
return true;
}
bool operator>=(bitset<bsetlen> &a, bitset<bsetlen> &b) {
rer(i, bsetlen - 1) {
if (a[i] > b[i])
return true;
if (a[i] < b[i])
return false;
}
return true;
}
string operator~(string &a) {
string res = a;
for (auto &&c : res) {
if (c == '0')
c = '1';
else if (c == '1')
c = '0';
else {
cerr << "cant ~" << a << "must bit" << endl;
exit(0);
}
}
return res;
}
ostream &operator<<(ostream &os, bset &a) {
bitset<10> b;
vi list;
rep(i, bsetlen) {
if (a[i])
list.push_back(i), b[i] = 1;
}
os << b << ", " << list;
return os;
}
int hbiti(bset &a) {
rer(i, bsetlen) {
if (a[i])
return i;
}
return -1;
}
#define hk(a, b, c) (a <= b && b < c)
// O(N/64)
bset nap(bset &a, int v) {
bset r = a | a << v;
return r;
}
bset nap(bset &a, bset &v) {
bset r = a;
rep(i, bsetlen) {
if (v[i])
r |= a << i;
}
return r;
}
template <class T> void seth(vector<vector<T>> &S, int w, vector<T> &v) {
assert(sz(S) == sz(v));
assert(w < sz(S[0]));
rep(h, sz(S)) { S[h][w] = v[h]; }
}
template <class T, class U> void operator+=(pair<T, U> &a, pair<T, U> &b) {
a.fi += b.fi;
a.se += b.se;
}
template <class T, class U> pair<T, U> operator+(pair<T, U> &a, pair<T, U> &b) {
return pair<T, U>(a.fi + b.fi, a.se + b.se);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const int rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
basic_string<CharT, Traits, Alloc>
operator+(const basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
basic_string<CharT, Traits, Alloc> str(lhs);
str.append(to_string(rv));
return str;
}
template <typename CharT, typename Traits, typename Alloc>
void operator+=(basic_string<CharT, Traits, Alloc> &lhs, const signed rv) {
lhs += to_string(rv);
}
template <typename CharT, typename Traits, typename Alloc>
void operator*=(basic_string<CharT, Traits, Alloc> &s, int num) {
auto bek = s;
s = "";
for (; num; num >>= 1) {
if (num & 1) {
s += bek;
}
bek += bek;
}
}
template <class T, class U> void operator+=(queue<T> &a, U v) { a.push(v); }
template <class T, class U> void operator+=(deque<T> &a, U v) {
a.push_back(v);
}
template <class T>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, vector<T> &v) {
fora(d, v) a.push(d);
return a;
}
template <class T, class U>
priority_queue<T, vector<T>, greater<T>> &
operator+=(priority_queue<T, vector<T>, greater<T>> &a, U v) {
a.push(v);
return a;
}
template <class T, class U>
priority_queue<T> &operator+=(priority_queue<T> &a, U v) {
a.push(v);
return a;
}
template <class T> set<T> &operator+=(set<T> &a, vector<T> v) {
fora(d, v) a.insert(d);
return a;
}
template <class T, class U> auto operator+=(set<T> &a, U v) {
return a.insert(v);
}
template <class T, class U> auto operator-=(set<T> &a, U v) {
return a.erase(v);
}
template <class T, class U> auto operator+=(mset<T> &a, U v) {
return a.insert(v);
}
template <class T, class U>
set<T, greater<T>> &operator+=(set<T, greater<T>> &a, U v) {
a.insert(v);
return a;
}
template <class T, class U> vector<T> &operator+=(vector<T> &a, U v) {
a.push_back(v);
return a;
}
template <class T, class U> vector<T> operator+(vector<T> &a, U v) {
vector<T> ret = a;
ret += v;
return ret;
}
template <class T, class U> vector<T> operator+(U v, vector<T> &a) {
vector<T> ret = a;
ret.insert(ret.begin(), v);
return ret;
}
template <class T> vector<T> operator+(vector<T> a, vector<T> b) {
vector<T> ret;
ret = a;
fora(v, b) ret += v;
return ret;
}
template <class T> vector<T> &operator+=(vector<T> &a, vector<T> &b) {
rep(i, sz(b)) { /*こうしないとa+=aで両辺が増え続けてバグる*/
a.push_back(b[i]);
}
return a;
}
template <class T, class U> map<T, U> &operator+=(map<T, U> &a, map<T, U> &b) {
fora(bv, b) { a[bv.first] += bv.second; }
return a;
}
template <class T> void operator+=(mset<T> &a, vector<T> &v) {
for (auto &&u : v)
a.insert(u);
}
template <class T> void operator+=(set<T> &a, vector<T> &v) {
for (auto &&u : v)
a.insert(u);
}
template <class T> void operator+=(vector<T> &a, set<T> &v) {
for (auto &&u : v)
a.emplace_back(u);
}
template <class T> void operator+=(vector<T> &a, mset<T> &v) {
for (auto &&u : v)
a.emplace_back(u);
}
template <class T> vector<T> &operator-=(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-=");
deb(a);
deb(b);
exit(0);
}
rep(i, sz(a)) a[i] -= b[i];
return a;
}
template <class T> vector<T> operator-(vector<T> &a, vector<T> &b) {
if (sz(a) != sz(b)) {
debugline("vector<T> operator-");
deb(a);
deb(b);
ole();
}
vector<T> res(sz(a));
rep(i, sz(a)) res[i] = a[i] - b[i];
return res;
}
template <class T, class U> void operator*=(vector<T> &a, U b) {
vector<T> ta = a;
rep(b - 1) { a += ta; }
}
template <typename T> void erase(vector<T> &v, unsigned ll i) {
v.erase(v.begin() + i);
}
template <typename T> void erase(vector<T> &v, unsigned ll s, unsigned ll e) {
v.erase(v.begin() + s, v.begin() + e);
}
template <class T, class U> void erase(map<T, U> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <class T> void erase(set<T> &m, ll okl, ll ngr) {
m.erase(m.lower_bound(okl), m.lower_bound(ngr));
}
template <typename T> void erasen(vector<T> &v, unsigned ll s, unsigned ll n) {
v.erase(v.begin() + s, v.begin() + s + n);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, U t) {
v.insert(v.begin() + i, t);
}
template <typename T, typename U> void push_front(vector<T> &v, U t) {
v.insert(v.begin(), t);
}
template <typename T, typename U>
void insert(vector<T> &v, unsigned ll i, vector<T> list) {
for (auto &&va : list)
v.insert(v.begin() + i++, va);
}
template <typename T> void insert(set<T> &v, vector<T> list) {
for (auto &&va : list)
v.insert(va);
}
template <class T> T poll(set<T> &S) {
T ret = *S.begin();
S.erase(S.begin());
return ret;
}
template <class T> T poll(mset<T> &S) {
T ret = *S.begin();
S.erase(S.begin());
return ret;
}
template <class T> T poll_back(set<T> &S) {
T ret = *S.rbegin();
S.erase(S.rbegin());
return ret;
}
template <class T> T poll_back(mset<T> &S) {
T ret = *S.rbegin();
S.erase(S.rbegin());
return ret;
}
template <class T> T peek(set<T> &S) {
T ret = *S.begin();
return ret;
}
template <class T> T peek(mset<T> &S) {
T ret = *S.begin();
return ret;
}
template <class T> T peek_back(set<T> &S) {
T ret = *S.rbegin();
return ret;
}
template <class T> T peek_back(mset<T> &S) {
T ret = *S.rbegin();
return ret;
}
vector<string> split(const string a, const char deli) {
string b = a + deli;
ll l = 0, r = 0, n = b.size();
vector<string> res;
rep(i, n) {
if (b[i] == deli) {
r = i;
if (l < r)
res.push_back(b.substr(l, r - l));
l = i + 1;
}
}
return res;
}
vector<string> split(const string a, const string deli) {
vector<string> res;
ll kn = sz(deli);
std::string::size_type Pos(a.find(deli));
ll l = 0;
while (Pos != std::string::npos) {
if (Pos - l)
res.push_back(a.substr(l, Pos - l));
l = Pos + kn;
Pos = a.find(deli, Pos + kn);
}
if (sz(a) - l)
res.push_back(a.substr(l, sz(a) - l));
return res;
}
ll stoi(string &s) { return stol(s); }
void yn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
}
void Yn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
}
void YN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
void fyn(bool a) {
if (a)
cout << "yes" << endl;
else
cout << "no" << endl;
exit(0);
}
void fYn(bool a) {
if (a)
cout << "Yes" << endl;
else
cout << "No" << endl;
exit(0);
}
void fYN(bool a) {
if (a)
cout << "YES" << endl;
else
cout << "NO" << endl;
exit(0);
}
void fAb(bool a) {
if (a)
cout << "Alice" << endl;
else
cout << "Bob";
}
void Possible(bool a) {
if (a)
cout << "Possible" << endl;
else
cout << "Impossible" << endl;
exit(0);
}
void POSSIBLE(bool a) {
if (a)
cout << "POSSIBLE" << endl;
else
cout << "IMPOSSIBLE" << endl;
exit(0);
}
void fPossible(bool a) {
Possible(a);
exit(0);
}
void fPOSSIBLE(bool a) {
POSSIBLE(a);
exit(0);
}
template <typename T> class fixed_point : T {
public:
explicit constexpr fixed_point(T &&t) noexcept : T(std::forward<T>(t)) {}
template <typename... Args>
constexpr decltype(auto) operator()(Args &&...args) const {
return T::operator()(*this, std::forward<Args>(args)...);
}
};
template <typename T>
static inline constexpr decltype(auto) fix(T &&t) noexcept {
return fixed_point<T>{std::forward<T>(t)};
}
// 未分類
// 0,2,1 1番目と2番目の次元を入れ替える
template <class T>
auto irekae(vector<vector<vector<T>>> &A, int x, int y, int z) {
#define irekae_resize_loop(a, b, c) \
resize(res, a, b, c); \
rep(i, a) rep(j, b) rep(k, c)
vector<vector<vector<T>>> res;
if (x == 0 && y == 1 && z == 2) {
res = A;
} else if (x == 0 && y == 2 && z == 1) {
irekae_resize_loop(sz(A), sz(A[0][0]), sz(A[0])) {
res[i][j][k] = A[i][k][j];
}
} else if (x == 1 && y == 0 && z == 2) {
irekae_resize_loop(sz(A[0]), sz(A), sz(A[0][0])) {
res[i][j][k] = A[j][i][k];
}
} else if (x == 1 && y == 2 && z == 0) {
irekae_resize_loop(sz(A[0]), sz(A[0][0]), sz(A)) {
res[i][j][k] = A[k][i][j];
}
} else if (x == 2 && y == 0 && z == 1) {
irekae_resize_loop(sz(A[0][0]), sz(A), sz(A[0])) {
res[i][j][k] = A[j][k][i];
}
} else if (x == 2 && y == 1 && z == 0) {
irekae_resize_loop(sz(A[0][0]), sz(A[0]), sz(A)) {
res[i][j][k] = A[k][j][i];
}
}
return res;
#undef irekae_resize_loop
}
template <class T> auto irekae(vector<vector<T>> &A, int i = 1, int j = 0) {
vvt(res, sz(A[0]), sz(A));
rep(i, sz(A)) {
rep(j, sz(A[0])) { res[j][i] = A[i][j]; }
}
return res;
}
// tou分割する
template <typename T> vector<vector<T>> cut(vector<T> &a, int tou = 2) {
int N = sz(a);
vector<vector<T>> res(tou);
int hab = N / tou;
vi lens(tou, hab);
rep(i, N % tou) { lens[tou - 1 - i]++; }
int l = 0;
rep(i, tou) {
int len = lens[i];
int r = l + len;
res[i].resize(len);
std::copy(a.begin() + l, a.begin() + r, res[i].begin());
l = r;
}
return res;
}
// 長さn毎に分割する
template <typename T> vector<vector<T>> cutn(vector<T> &a, int len) {
int N = sz(a);
vector<vector<T>> res(ceil(N, len));
vi lens(N / len, len);
if (N % len)
lens.push_back(N % len);
int l = 0;
rep(i, sz(lens)) {
int len = lens[i];
int r = l + len;
res[i].resize(len);
std::copy(a.begin() + l, a.begin() + r, res[i].begin());
l = r;
}
return res;
}
vi inds_(vi &a) {
int n = sz(a);
vb was(n);
vi res(n);
rep(i, n) {
assert(!was[a[i]]);
res[a[i]] = i;
was[a[i]] = true;
}
return res;
}
//@起動時
struct initon {
initon() {
cin.tie(0);
ios::sync_with_stdio(false);
cout.setf(ios::fixed);
cout.precision(16);
srand((unsigned)clock() + (unsigned)time(NULL));
};
} initonv;
#define pre prev
#define nex next
// gra mll pr
// 上下左右
const string udlr = "udlr";
string UDLR = "UDLR"; // x4と連動 UDLR.find('U') := x4[0]
// 右、上が正
constexpr ll h4[] = {1, -1, 0, 0};
constexpr ll w4[] = {0, 0, -1, 1};
constexpr ll h8[] = {0, 1, 0, -1, -1, 1, 1, -1};
constexpr ll w8[] = {1, 0, -1, 0, 1, -1, 1, -1};
int mei_inc(int h, int w, int H, int W, int i) {
while (++i < 4) {
if (inside(h + h4[i], w + w4[i], H, W))
return i;
}
return i;
}
#define mei(nh, nw, h, w) \
for (int i = mei_inc(h, w, H, W, -1), nh = i < 4 ? h + h4[i] : 0, \
nw = i < 4 ? w + w4[i] : 0; \
i < 4; i = mei_inc(h, w, H, W, i), nh = h + h4[i], nw = w + w4[i])
// グラフ内で #undef getid
// #define getidとしているため、ここを書き直したらgraphも書き直す
#define getid_2(h, w) (h * W + w)
#define getid_1(p) (p.first * W + p.second)
#define getid(...) over2(__VA_ARGS__, getid_2, getid_1)(__VA_ARGS__)
#define getp(id) mp(id / W, id % W)
// #define set_shuffle() std::random_device seed_gen;std::mt19937
// engine(seed_gen()) #define shuffle(a) std::shuffle((a).begin(), (a).end(),
// engine); 1980 開始からtime ms経っていたらtrue
bool timeup(int time) {
auto end_time = system_clock::now();
auto part = duration_cast<milliseconds>(end_time - start_time);
auto lim = milliseconds(time);
return part >= lim;
}
void set_time() { past_time = system_clock::now(); }
// MS型(millisecqnds)で返る
// set_timeをしてからの時間
auto calc_time_milli() {
auto now = system_clock::now();
auto part = duration_cast<milliseconds>(now - past_time);
return part;
}
auto calc_time_micro() {
auto now = system_clock::now();
auto part = duration_cast<microseconds>(now - past_time);
return part;
}
auto calc_time_nano() {
auto now = system_clock::now();
auto part = duration_cast<nanoseconds>(now - past_time);
return part;
}
bool calc_time(int zikan) { return calc_time_micro() >= microseconds(zikan); }
using MS = std::chrono::microseconds;
int div(microseconds a, microseconds b) { return a / b; }
int div(nanoseconds a, nanoseconds b) {
if (b < nanoseconds(1)) {
return a / nanoseconds(1);
}
int v = a / b;
return v;
}
// set_time();
// rep(i,lim)shori
// lim*=time_nanbai();
// rep(i,lim)shoriと使う
// 全体でmilliかかっていいときにlimを何倍してもう一回できるかを返す
int time_nanbai(int milli) {
auto dec = duration_cast<nanoseconds>(past_time - start_time);
auto part = calc_time_nano();
auto can_time = nanoseconds(milli * 1000 * 1000);
can_time -= part;
can_time -= dec;
return div(can_time, part);
}
/*@formatter:on*/
// vectorで取れる要素数
// bool=> 1e9 * 8.32
// int => 1e8 * 2.6
// ll => 1e8 * 1.3
// 3次元以上取るとメモリがヤバい
// static配列を使う
vvc(ba);
ll N, M, H, W;
vi A, B, C;
constexpr int NUM_ = 2e6 + 100;
constexpr int mo = 1e9 + 7;
ll fac[NUM_ + 1], factr[NUM_ + 1], inv[NUM_ + 1];
void init() {
int i;
inv[1] = fac[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mo % i] * (mo - mo / i) % mo;
for (int i = 1; i <= NUM_; ++i)
fac[i] = fac[i - 1] * i % mo, factr[i] = factr[i - 1] * inv[i] % mo;
}
ll com(ll N_, ll C_) {
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fac[N_] % mo * factr[N_ - C_] % mo;
}
int yoko(int N, int B) {
return (((N + 1) * com(N, B)) % mo * inv[B + 1]) % mo;
;
}
void solve() {
din(H1, W1, H2, W2);
init();
auto calc = [&](int H, int W) {
int res = 0;
rep(h, H + 1) {
if (h)
res += yoko(W + h, h) - yoko(h - 1, h);
else {
res += yoko(W + h, h);
}
res %= mo;
}
return res;
};
int res = calc(H2, W2);
deb(res);
res -= calc(H1 - 1, W2);
res %= mo;
res += mo;
res %= mo;
deb(res);
res -= calc(H2, W1 - 1);
res %= mo;
res += mo;
res %= mo;
deb(res);
res += calc(H1 - 1, W1 - 1);
res %= mo;
out(res);
}
auto my(ll n, vi &a) { return 0; }
auto sister(ll n, vi &a) {
ll ret = 0;
return ret;
}
signed main() {
solve();
#define arg n, a
#ifdef _DEBUG
bool bad = 0;
for (ll i = 0, ok = 1; i < k5 && ok; ++i) {
ll n = rand(1, 8);
vi a = ranv(n, 1, 10);
auto myres = my(arg);
auto res = sister(arg);
ok = myres == res;
if (!ok) {
out(arg);
cerr << "AC : " << res << endl;
cerr << "MY : " << myres << endl;
bad = 1;
break;
}
}
if (!bad) {
// cout << "完璧 : solveを書き直そう" << endl;
// cout << " : そして、solve()を呼び出すのだ" << endl;
// cout << " : cin>>n; na(a,n);も忘れるな" << endl;
}
if (sz(message)) {
cerr << "****************************" << endl;
cerr << message << endl;
cerr << "****************************" << endl;
}
#endif
return 0;
};
| replace | 5,482 | 5,483 | 5,482 | 5,483 | 0 | |
p02782 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SIZE(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP(i, n) FOR(i, 0, n)
#define PER(i, n) ROF(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int LARGE_INT = 1e9 + 100;
const int INF = 2e9 + 100;
const LL INF_LL = (LL)INF * 300 * 300;
const int MOD = 1e9 + 7;
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
LL modpow(LL a, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
LL modinv(LL a) {
LL b = MOD, u = 1, v = 0;
while (b) {
LL t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
LL moddev(LL a, LL b) { return a * modinv(b) % MOD; }
long long mod(long long val) {
long long res = val % MOD;
if (res < 0)
res += MOD;
return res;
}
const int MAX = 1e6 + 10;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
LL g(int r, int c) {
LL f = 0;
FOR(i, 1, r + 2) { f += COM(i + c, i); }
return f;
}
void Main() {
COMinit();
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
// dump(g(1,1))
// dump(g(1,2))
// dump(g(2,1))
// dump(g(2,2))
LL result = g(r2, c2) - g(r1 - 1, c2) - g(r2, c1 - 1) + g(r1 - 1, c1 - 1);
result = mod(result);
cout << result << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef priority_queue<int> PQ_DESC;
typedef priority_queue<int, vector<int>, greater<int>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
#define ALL(c) (c).begin(), (c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SIZE(a) int((a).size())
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define ROF(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define REP(i, n) FOR(i, 0, n)
#define REP(i, n) FOR(i, 0, n)
#define PER(i, n) ROF(i, 0, n)
const double EPS = 1e-10;
const double PI = acos(-1.0);
const int LARGE_INT = 1e9 + 100;
const int INF = 2e9 + 100;
const LL INF_LL = (LL)INF * 300 * 300;
const int MOD = 1e9 + 7;
// debug
#define dump(x) cerr << #x << " = " << (x) << endl;
#define debug(x) \
cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" \
<< " " << __FILE__ << endl;
LL modpow(LL a, LL n) {
LL res = 1;
while (n > 0) {
if (n & 1)
res = res * a % MOD;
a = a * a % MOD;
n >>= 1;
}
return res;
}
LL modinv(LL a) {
LL b = MOD, u = 1, v = 0;
while (b) {
LL t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= MOD;
if (u < 0)
u += MOD;
return u;
}
LL moddev(LL a, LL b) { return a * modinv(b) % MOD; }
long long mod(long long val) {
long long res = val % MOD;
if (res < 0)
res += MOD;
return res;
}
const int MAX = (1e6 + 10) * 2;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
LL g(int r, int c) {
LL f = 0;
FOR(i, 1, r + 2) { f += COM(i + c, i); }
return f;
}
void Main() {
COMinit();
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
// dump(g(1,1))
// dump(g(1,2))
// dump(g(2,1))
// dump(g(2,2))
LL result = g(r2, c2) - g(r1 - 1, c2) - g(r2, c1 - 1) + g(r1 - 1, c1 - 1);
result = mod(result);
cout << result << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | replace | 76 | 77 | 76 | 77 | 0 | |
p02782 | C++ | Runtime Error | /*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using VecVec = vector<Vec>;
using Graph = vector<VecP>;
template <typename T> using Vec1 = vector<T>;
template <typename T> using Vec2 = vector<Vec1<T>>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for (ll(i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for (ll(i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ll pow2(const T n) { return (1LL << n); }
template <typename T> void cosp(const T n) { cout << n << ' '; }
template <typename T> void co(const T n) { cout << n << endl; }
template <typename T1, typename T2> void co(pair<T1, T2> p) {
cout << p.fs << ' ' << p.sc << endl;
}
template <typename T> void co(const Vec1<T> &v) {
for (T i : v)
cosp(i);
cout << endl;
}
template <typename T> void co(initializer_list<T> v) {
for (T i : v)
cosp(i);
cout << endl;
}
template <typename T> void ce(const T n) { cerr << n << endl; }
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) { return fac[n] * finv[k] % MOD * finv[n - k] % MOD; }
void init(ll n) {
fac.resize(n + 1);
fac[0] = 1;
repn(i, n) fac[i] = (fac[i - 1] * i) % MOD;
finv.resize(n + 1);
finv[n] = PowMod(fac[n], MOD - 2);
repr(i, n) finv[i] = (finv[i + 1] * (i + 1)) % MOD;
finv[0] = 1;
}
int main(void) {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init(1e6);
ll ans = 0;
REPN(i, r1 + 1, r2 + 1) {
ans += combi(c2 + i, c2);
ans %= MOD;
}
REPN(i, r1 + 1, r2 + 1) {
ans -= combi(c1 + i - 1, c1 - 1);
ans %= MOD;
}
ans += MOD;
ans %= MOD;
co(ans);
return 0;
}
| /*
confirm 0LL and 1LL
confirm cornercases such as 0
confirm times of cin < 10^6
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using P = pair<ll, ll>;
using Pld = pair<ld, ld>;
using Vec = vector<ll>;
using VecP = vector<P>;
using VecB = vector<bool>;
using VecC = vector<char>;
using VecD = vector<ld>;
using VecS = vector<string>;
using VecVec = vector<Vec>;
using Graph = vector<VecP>;
template <typename T> using Vec1 = vector<T>;
template <typename T> using Vec2 = vector<Vec1<T>>;
#define REP(i, m, n) for (ll(i) = (m); (i) < (n); ++(i))
#define REPN(i, m, n) for (ll(i) = (m); (i) <= (n); ++(i))
#define REPR(i, m, n) for (ll(i) = (m)-1; (i) >= (n); --(i))
#define REPNR(i, m, n) for (ll(i) = (m); (i) >= (n); --(i))
#define rep(i, n) REP(i, 0, n)
#define repn(i, n) REPN(i, 1, n)
#define repr(i, n) REPR(i, n, 0)
#define repnr(i, n) REPNR(i, n, 1)
#define all(s) (s).begin(), (s).end()
#define pb push_back
#define mp make_pair
#define fs first
#define sc second
template <typename T> bool chmax(T &a, const T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <typename T> bool chmin(T &a, const T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <typename T> ll pow2(const T n) { return (1LL << n); }
template <typename T> void cosp(const T n) { cout << n << ' '; }
template <typename T> void co(const T n) { cout << n << endl; }
template <typename T1, typename T2> void co(pair<T1, T2> p) {
cout << p.fs << ' ' << p.sc << endl;
}
template <typename T> void co(const Vec1<T> &v) {
for (T i : v)
cosp(i);
cout << endl;
}
template <typename T> void co(initializer_list<T> v) {
for (T i : v)
cosp(i);
cout << endl;
}
template <typename T> void ce(const T n) { cerr << n << endl; }
void sonic() {
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}
void setp(const ll n) { cout << fixed << setprecision(n); }
const ll INF = 1e9 + 1;
const ll LINF = 1e18 + 1;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ld PI = acos(-1);
const ld EPS = 1e-11;
Vec fac, finv;
ll PowMod(ll a, ll n) {
if (n == 1)
return a;
if (n % 2 == 0)
return PowMod(a * a % MOD, n / 2);
return a * PowMod(a * a % MOD, n / 2) % MOD;
}
ll combi(ll n, ll k) { return fac[n] * finv[k] % MOD * finv[n - k] % MOD; }
void init(ll n) {
fac.resize(n + 1);
fac[0] = 1;
repn(i, n) fac[i] = (fac[i - 1] * i) % MOD;
finv.resize(n + 1);
finv[n] = PowMod(fac[n], MOD - 2);
repr(i, n) finv[i] = (finv[i + 1] * (i + 1)) % MOD;
finv[0] = 1;
}
int main(void) {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init(3e6);
ll ans = 0;
REPN(i, r1 + 1, r2 + 1) {
ans += combi(c2 + i, c2);
ans %= MOD;
}
REPN(i, r1 + 1, r2 + 1) {
ans -= combi(c1 + i - 1, c1 - 1);
ans %= MOD;
}
ans += MOD;
ans %= MOD;
co(ans);
return 0;
}
| replace | 103 | 104 | 103 | 104 | 0 | |
p02782 | Python | Runtime Error | r1, c1, r2, c2 = map(int, input().split())
MAX = 10**6 + 1
MOD = 10**9 + 7
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1
# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
def f(r, c):
return fac[r + c] * finv[r] * finv[c] % MOD
ans = 0
for i in range(c1, c2 + 1):
ans += f(r2, i + 1) - f(r1 - 1, i + 1)
ans %= MOD
print(ans)
| r1, c1, r2, c2 = map(int, input().split())
MAX = 2 * 10**6 + 1
MOD = 10**9 + 7
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
# Inverse
inv = [0] * (MAX + 1)
inv[1] = 1
# Inverse factorial
finv = [0] * (MAX + 1)
finv[0] = 1
finv[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD % i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
def f(r, c):
return fac[r + c] * finv[r] * finv[c] % MOD
ans = 0
for i in range(c1, c2 + 1):
ans += f(r2, i + 1) - f(r1 - 1, i + 1)
ans %= MOD
print(ans)
| replace | 2 | 3 | 2 | 3 | 1 | Traceback (most recent call last):
File "/home/alex/Documents/bug-detection/input/Project_CodeNet/data/p02782/Python/s077310525.py", line 22, in <module>
fac[i] = fac[i - 1] * i % MOD
MemoryError
|
p02782 | C++ | Runtime Error | #include <iostream>
constexpr int MAX = 1000001;
constexpr int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
static bool init = false;
if (init) {
return;
}
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
init = true;
}
long long COM(int n, int k) {
COMinit();
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int f(int r, int c) { return COM(r + c, r); }
long long g(int r, int c) {
long long sum = 0;
for (int j = 0; j <= r; ++j) {
sum = (sum + f(j + 1, c)) % MOD;
}
return sum;
}
int main() {
int r1, c1, r2, c2;
std::cin >> r1 >> c1 >> r2 >> c2;
long long result =
(g(r2, c2) - g(r2, c1 - 1) - g(r1 - 1, c2) + g(r1 - 1, c1 - 1)) % MOD;
if (result < 0) {
result += MOD;
}
std::cout << result << std::endl;
return 0;
}
| #include <iostream>
constexpr int MAX = 2000002;
constexpr int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
static bool init = false;
if (init) {
return;
}
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
init = true;
}
long long COM(int n, int k) {
COMinit();
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int f(int r, int c) { return COM(r + c, r); }
long long g(int r, int c) {
long long sum = 0;
for (int j = 0; j <= r; ++j) {
sum = (sum + f(j + 1, c)) % MOD;
}
return sum;
}
int main() {
int r1, c1, r2, c2;
std::cin >> r1 >> c1 >> r2 >> c2;
long long result =
(g(r2, c2) - g(r2, c1 - 1) - g(r1 - 1, c2) + g(r1 - 1, c1 - 1)) % MOD;
if (result < 0) {
result += MOD;
}
std::cout << result << std::endl;
return 0;
}
| replace | 2 | 3 | 2 | 3 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x, y) x = max(x, y)
#define gmin(x, y) x = min(x, y)
#define gadd(x, y) x = add(x, y)
#define gmul(x, y) x = mul(x, y)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1e9 + 7;
inline int add(int x, int y) {
int res = x + y;
while (res >= MOD)
res -= MOD;
return res;
}
inline int mul(int x, int y) { return (1LL * x * y) % MOD; }
int modpow(int x, int p) {
int res = 1;
while (p) {
if (p & 1)
gmul(res, x);
gmul(x, x);
p /= 2;
}
return res;
}
inline int invert(int x) { return modpow(x, MOD - 2); }
const int N = 1e6 + 5;
int fac[N], inv[N];
void init(int n) {
fac[0] = inv[0] = 1;
for (int i = 1; i < n; ++i) {
fac[i] = mul(fac[i - 1], i);
inv[i] = invert(fac[i]);
}
}
int comb(int n, int k) {
if (k > n)
return 0;
return mul(fac[n], mul(inv[k], inv[n - k]));
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
init(N);
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 > c1) {
swap(r1, c1);
swap(r2, c2);
}
int ans = 0;
rep(r, r1, r2 + 1) {
gadd(ans, add(comb(r + c2 + 1, r + 1), MOD - comb(r + c1, r + 1)));
}
cout << ans << '\n';
}
| #include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i < b; ++i)
#define all(c) c.begin(), c.end()
#define gmax(x, y) x = max(x, y)
#define gmin(x, y) x = min(x, y)
#define gadd(x, y) x = add(x, y)
#define gmul(x, y) x = mul(x, y)
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
const int MOD = 1e9 + 7;
inline int add(int x, int y) {
int res = x + y;
while (res >= MOD)
res -= MOD;
return res;
}
inline int mul(int x, int y) { return (1LL * x * y) % MOD; }
int modpow(int x, int p) {
int res = 1;
while (p) {
if (p & 1)
gmul(res, x);
gmul(x, x);
p /= 2;
}
return res;
}
inline int invert(int x) { return modpow(x, MOD - 2); }
const int N = 2e6 + 10;
int fac[N], inv[N];
void init(int n) {
fac[0] = inv[0] = 1;
for (int i = 1; i < n; ++i) {
fac[i] = mul(fac[i - 1], i);
inv[i] = invert(fac[i]);
}
}
int comb(int n, int k) {
if (k > n)
return 0;
return mul(fac[n], mul(inv[k], inv[n - k]));
}
int main() {
cin.tie(0);
cout.tie(0);
ios_base::sync_with_stdio(0);
init(N);
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (r1 > c1) {
swap(r1, c1);
swap(r2, c2);
}
int ans = 0;
rep(r, r1, r2 + 1) {
gadd(ans, add(comb(r + c2 + 1, r + 1), MOD - comb(r + c1, r + 1)));
}
cout << ans << '\n';
}
| replace | 36 | 37 | 36 | 37 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const double PI = acos(-1.0);
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
};
Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
using mint = Fp<MOD>;
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T C(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T P(int n, int k) const noexcept { return C(n, k) * fact_[k]; }
constexpr T H(int n, int k) const noexcept { return C(n + k - 1, k); }
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
BiCoef<mint> bc(1000010);
mint f(ll r, ll c) {
if (r == 0)
return (mint)(c + 1);
mint res = 1;
res *= bc.fact(c + r + 2);
res *= bc.finv_[c + 1];
res *= bc.finv_[r + 1];
res -= 1;
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(50) << setiosflags(ios::fixed);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// #include <boost/multiprecision/cpp_int.hpp>
// using multiInt = boost::multiprecision::cpp_int;
using ll = long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
template <typename Q_temp>
using smaller_queue = priority_queue<Q_temp, vector<Q_temp>, greater<Q_temp>>;
const ll MOD = (ll)(1e9 + 7);
const int INF = (int)1e9;
const ll LINF = (ll)4e18;
const double PI = acos(-1.0);
#define REP(i, m, n) for (ll i = m; i < (ll)(n); ++i)
#define rep(i, n) REP(i, 0, n)
#define MP make_pair
#define MT make_tuple
#define YES(n) cout << ((n) ? "YES" : "NO") << endl
#define Yes(n) cout << ((n) ? "Yes" : "No") << endl
#define Possible(n) cout << ((n) ? "Possible" : "Impossible") << endl
#define possible(n) cout << ((n) ? "possible" : "impossible") << endl
#define Yay(n) cout << ((n) ? "Yay!" : ":(") << endl
#define all(v) v.begin(), v.end()
#define NP(v) next_permutation(all(v))
#define dbg(x) cerr << #x << ":" << x << endl;
vector<int> Dx = {0, 0, -1, 1, -1, 1, -1, 1, 0};
vector<int> Dy = {1, -1, 0, 0, -1, -1, 1, 1, 0};
template <int MOD> struct Fp {
long long val;
constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
if (val < 0)
v += MOD;
}
constexpr int getmod() { return MOD; }
constexpr Fp operator-() const noexcept { return val ? MOD - val : 0; }
constexpr Fp operator+(const Fp &r) const noexcept { return Fp(*this) += r; }
constexpr Fp operator-(const Fp &r) const noexcept { return Fp(*this) -= r; }
constexpr Fp operator*(const Fp &r) const noexcept { return Fp(*this) *= r; }
constexpr Fp operator/(const Fp &r) const noexcept { return Fp(*this) /= r; }
constexpr Fp &operator+=(const Fp &r) noexcept {
val += r.val;
if (val >= MOD)
val -= MOD;
return *this;
}
constexpr Fp &operator-=(const Fp &r) noexcept {
val -= r.val;
if (val < 0)
val += MOD;
return *this;
}
constexpr Fp &operator*=(const Fp &r) noexcept {
val = val * r.val % MOD;
return *this;
}
constexpr Fp &operator/=(const Fp &r) noexcept {
long long a = r.val, b = MOD, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
val = val * u % MOD;
if (val < 0)
val += MOD;
return *this;
}
constexpr bool operator==(const Fp &r) const noexcept {
return this->val == r.val;
}
constexpr bool operator!=(const Fp &r) const noexcept {
return this->val != r.val;
}
friend constexpr ostream &operator<<(ostream &os, const Fp<MOD> &x) noexcept {
return os << x.val;
}
friend constexpr istream &operator>>(istream &is, Fp<MOD> &x) noexcept {
return is >> x.val;
}
};
Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
if (n == 0)
return 1;
auto t = modpow(a, n / 2);
t = t * t;
if (n & 1)
t = t * a;
return t;
}
using mint = Fp<MOD>;
template <class T> struct BiCoef {
vector<T> fact_, inv_, finv_;
constexpr BiCoef() {}
constexpr BiCoef(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1), inv_.assign(n, 1), finv_.assign(n, 1);
int MOD = fact_[0].getmod();
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = -inv_[MOD % i] * (MOD / i);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T C(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T P(int n, int k) const noexcept { return C(n, k) * fact_[k]; }
constexpr T H(int n, int k) const noexcept { return C(n + k - 1, k); }
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
BiCoef<mint> bc(2000010);
mint f(ll r, ll c) {
if (r == 0)
return (mint)(c + 1);
mint res = 1;
res *= bc.fact(c + r + 2);
res *= bc.finv_[c + 1];
res *= bc.finv_[r + 1];
res -= 1;
return res;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(50) << setiosflags(ios::fixed);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) << endl;
return 0;
}
| replace | 164 | 165 | 164 | 165 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define erFOR(i, a, n) for (int(i) = (n); (i) >= (a); --(i))
#define each(i, a) for (auto &i : a)
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
#define all(i) (i).begin(), (i).end()
#define out(y, x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n"
#define ENDL(i, n) ((i) == (n)-1 ? "\n" : " ")
#define stop system("pause") // comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10; // 1e-9?
constexpr ld pi = 3.1415926535897932;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &v) {
for (auto &elemnt : v)
is >> elemnt;
return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> inline vector<T> vec(size_t a) { return vector<T>(a); }
template <class T> inline vector<T> defvec(T def, size_t a) {
return vector<T>(a, def);
}
template <class T, class... Ts> inline auto vec(size_t a, Ts... ts) {
return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));
}
template <class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) {
return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...));
}
const int MAX = 510000;
ll fac[MAX], finv[MAX], inv[MAX];
bool Pre = true;
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (Pre) {
cominit();
Pre = false;
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll semisolve(int y, int x) { return com(y + x, x); }
ll solve(int y, int x) {
ll ret = 0;
eFOR(i, 0, y)(ret += semisolve(i + 1, x)) %= mod;
return ret;
}
int main() {
init();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = solve(r2, c2);
(ans -= solve(r1 - 1, c2) - mod) %= mod;
(ans -= solve(r2, c1 - 1) - mod) %= mod;
(ans += solve(r1 - 1, c1 - 1)) %= mod;
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
template <class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i, a, n) for (int(i) = (a); (i) < (n); ++(i))
#define eFOR(i, a, n) for (int(i) = (a); (i) <= (n); ++(i))
#define rFOR(i, a, n) for (int(i) = (n)-1; (i) >= (a); --(i))
#define erFOR(i, a, n) for (int(i) = (n); (i) >= (a); --(i))
#define each(i, a) for (auto &i : a)
#define SORT(i) sort((i).begin(), (i).end())
#define rSORT(i, a) sort((i).begin(), (i).end(), (a))
#define all(i) (i).begin(), (i).end()
#define out(y, x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))
#define line cout << "------------------------\n"
#define ENDL(i, n) ((i) == (n)-1 ? "\n" : " ")
#define stop system("pause") // comment out this on AOJ.
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
constexpr ld eps = 1e-10; // 1e-9?
constexpr ld pi = 3.1415926535897932;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
inline void init() {
cin.tie(nullptr);
cout.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
template <class T> inline istream &operator>>(istream &is, vector<T> &v) {
for (auto &elemnt : v)
is >> elemnt;
return is;
}
template <class T, class U>
inline istream &operator>>(istream &is, pair<T, U> &p) {
is >> p.first >> p.second;
return is;
}
template <class T> inline vector<T> vec(size_t a) { return vector<T>(a); }
template <class T> inline vector<T> defvec(T def, size_t a) {
return vector<T>(a, def);
}
template <class T, class... Ts> inline auto vec(size_t a, Ts... ts) {
return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));
}
template <class T, class... Ts> inline auto defvec(T def, size_t a, Ts... ts) {
return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...));
}
const int MAX = 2000010;
ll fac[MAX], finv[MAX], inv[MAX];
bool Pre = true;
void cominit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
FOR(i, 2, MAX) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (Pre) {
cominit();
Pre = false;
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll semisolve(int y, int x) { return com(y + x, x); }
ll solve(int y, int x) {
ll ret = 0;
eFOR(i, 0, y)(ret += semisolve(i + 1, x)) %= mod;
return ret;
}
int main() {
init();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = solve(r2, c2);
(ans -= solve(r1 - 1, c2) - mod) %= mod;
(ans -= solve(r2, c1 - 1) - mod) %= mod;
(ans += solve(r1 - 1, c1 - 1)) %= mod;
cout << ans << "\n";
} | replace | 66 | 67 | 66 | 67 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;
using edge = struct {
int to;
ll cost;
};
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto c = combination(1000010);
mint ans = 0;
for (int r = r1; r <= r2; ++r) {
ans += (c(r + 1 + c2, c2) - c(r + c1, c1 - 1));
}
cout << ans.x << endl;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < n; ++i)
#define ALL(a) (a).begin(), (a).end()
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ll = long long;
using ld = long double;
using P = pair<int, int>;
using DoP = pair<double, double>;
using edge = struct {
int to;
ll cost;
};
const int di[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dj[] = {1, 0, -1, 0, 1, -1, 1, -1};
const int INF = 1e9 + 100;
const ll INF64 = 7e18l;
const int mod = 1000000007;
struct Sieve {
int n;
vector<int> f, primes;
Sieve(int n = 1) : n(n), f(n + 1) {
f[0] = f[1] = -1;
for (ll i = 2; i <= n; ++i) {
if (f[i])
continue;
primes.push_back(i);
f[i] = i;
for (ll j = i * i; j <= n; j += i) {
if (!f[j])
f[j] = i;
}
}
}
bool isPrime(int x) { return f[x] == x; }
vector<int> factorList(int x) {
vector<int> res;
while (x != 1) {
res.push_back(f[x]);
x /= f[x];
}
return res;
}
vector<P> factor(int x) {
vector<int> fl = factorList(x);
if (fl.size() == 0)
return {};
vector<P> res(1, P(fl[0], 0));
for (int p : fl) {
if (res.back().first == p) {
res.back().second++;
} else {
res.emplace_back(p, 1);
}
}
return res;
}
};
struct UnionFind {
vector<int> par;
UnionFind(int N) : par(N) {
for (int i = 0; i < N; i++)
par[i] = i;
}
int root(int x) {
if (par[x] == x)
return x;
return par[x] = root(par[x]);
}
void unite(int x, int y) {
int rx = root(x);
int ry = root(y);
if (rx == ry)
return;
par[rx] = ry;
}
bool same(int x, int y) {
int rx = root(x);
int ry = root(y);
return rx == ry;
}
};
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto c = combination(2005010);
mint ans = 0;
for (int r = r1; r <= r2; ++r) {
ans += (c(r + 1 + c2, c2) - c(r + c1, c1 - 1));
}
cout << ans.x << endl;
}
| replace | 169 | 170 | 169 | 170 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef long long ll;
typedef pair<int, int> P;
#define SIZE 1000010
ll kaijo[SIZE];
void init() {
kaijo[0] = 1;
for (ll i = 1; i < SIZE; i++)
kaijo[i] = (kaijo[i - 1] * i) % N;
}
ll inv(ll x) {
ll res = 1;
ll k = N - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % N;
y = (y % N * y % N) % N;
k /= 2;
}
return res;
}
ll Comb(ll n, ll k) {
if (n < 0 || k < 0 || (n - k) < 0)
return 0;
ll b = kaijo[n];
ll c = kaijo[n - k];
ll d = kaijo[k];
ll cd = (c * d) % N;
return ((b % N) * (inv(cd)) % N) % N;
}
int main(void) {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans = 0;
for (ll i = 0; i <= r2; i++) {
ans = ans + Comb(i + c2 + 1, c2);
ans = ans % N;
}
for (ll i = 0; i < r1; i++) {
ans = ans - Comb(i + c2 + 1, c2);
ans = (ans + N) % N;
}
for (ll i = 0; i <= r2; i++) {
ans = ans - Comb(i + c1, c1 - 1);
ans = (ans + N) % N;
}
for (ll i = 0; i < r1; i++) {
ans = ans + Comb(i + c1, c1 - 1);
ans = ans % N;
}
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <functional>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <string>
#include <utility>
#include <vector>
using namespace std;
#define N (1000000000 + 7)
#define INF 1e16
typedef long long ll;
typedef pair<int, int> P;
#define SIZE 2000010
ll kaijo[SIZE];
void init() {
kaijo[0] = 1;
for (ll i = 1; i < SIZE; i++)
kaijo[i] = (kaijo[i - 1] * i) % N;
}
ll inv(ll x) {
ll res = 1;
ll k = N - 2;
ll y = x;
while (k) {
if (k & 1)
res = (res * y) % N;
y = (y % N * y % N) % N;
k /= 2;
}
return res;
}
ll Comb(ll n, ll k) {
if (n < 0 || k < 0 || (n - k) < 0)
return 0;
ll b = kaijo[n];
ll c = kaijo[n - k];
ll d = kaijo[k];
ll cd = (c * d) % N;
return ((b % N) * (inv(cd)) % N) % N;
}
int main(void) {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans = 0;
for (ll i = 0; i <= r2; i++) {
ans = ans + Comb(i + c2 + 1, c2);
ans = ans % N;
}
for (ll i = 0; i < r1; i++) {
ans = ans - Comb(i + c2 + 1, c2);
ans = (ans + N) % N;
}
for (ll i = 0; i <= r2; i++) {
ans = ans - Comb(i + c1, c1 - 1);
ans = (ans + N) % N;
}
for (ll i = 0; i < r1; i++) {
ans = ans + Comb(i + c1, c1 - 1);
ans = ans % N;
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
const int MAX = 1000001;
const int MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep(i, MAX) {
if (i == 0 || i == 1)
continue;
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll res = 0;
rep(i, r2 - r1 + 1) {
res += COM(r1 + c2 + 1 + i, r1 + 1 + i);
res -= COM(r1 + c1 + i, r1 + 1 + i);
if (res < 0)
res += MOD;
res %= MOD;
}
cout << res << endl;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;
const int MAX = 2020202;
const int MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep(i, MAX) {
if (i == 0 || i == 1)
continue;
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll res = 0;
rep(i, r2 - r1 + 1) {
res += COM(r1 + c2 + 1 + i, r1 + 1 + i);
res -= COM(r1 + c1 + i, r1 + 1 + i);
if (res < 0)
res += MOD;
res %= MOD;
}
cout << res << endl;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02782 | C++ | Runtime Error | /*
AuThOr GaRyMr
*/
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freopen("check.out", "w", stdout)
#define rep(a, b) for (int a = 0; a < b; ++a)
#define KEEP while (1)
#define SRAND \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng() % a
#define ALL(a) a.begin(), a.end()
#define POB pop_back
#define ff fflush(stdout)
#define fastio ios::sync_with_stdio(false)
using namespace std;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> mp;
typedef pair<mp, mp> superpair;
const int MAXN = 1e6, MOD = 1e9 + 7;
int r1, r2, c1, c2;
struct Combinatorics {
LL fact[MAXN + 1] = {1};
void INIT() { rb(i, 1, MAXN) fact[i] = fact[i - 1] * i, fact[i] %= MOD; }
LL quick_pow(LL A, LL B) {
if (!B)
return 1;
LL tmp = quick_pow(A, B >> 1);
tmp *= tmp;
tmp %= MOD;
if (B & 1) {
tmp *= A;
tmp %= MOD;
}
return tmp;
}
LL inv(LL A) { return quick_pow(A, MOD - 2); }
LL P(LL A, LL B) { return fact[B] * inv(fact[B - A]) % MOD; }
LL C(LL A, LL B) { return P(A, B) * inv(fact[A]) % MOD; }
} com;
LL f(int i, int j) { return com.C(j, i + j); }
LL g(int i, int j) {
// total in O(n)
LL Res = 0;
rb(I, 0, i) {
Res += f(I + 1, j);
// cout<<I+1<<" "<<j<<" "<<com.C(2,3)<<endl;
Res %= MOD;
}
// cout<<Res<<endl;
return Res;
}
int main() {
fastio;
com.INIT();
cin >> r1 >> c1 >> r2 >> c2;
// cout<<g(1,1)<<endl;
cout << (g(r2, c2) - g(r2, c1 - 1) - g(r1 - 1, c2) + g(r1 - 1, c1 - 1) + MOD +
MOD) %
MOD;
return 0;
}
| /*
AuThOr GaRyMr
*/
#include <bits/stdc++.h>
#define rb(a, b, c) for (int a = b; a <= c; ++a)
#define rl(a, b, c) for (int a = b; a >= c; --a)
#define LL long long
#define IT iterator
#define PB push_back
#define II(a, b) make_pair(a, b)
#define FIR first
#define SEC second
#define FREO freopen("check.out", "w", stdout)
#define rep(a, b) for (int a = 0; a < b; ++a)
#define KEEP while (1)
#define SRAND \
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define random(a) rng() % a
#define ALL(a) a.begin(), a.end()
#define POB pop_back
#define ff fflush(stdout)
#define fastio ios::sync_with_stdio(false)
using namespace std;
const int INF = 0x3f3f3f3f;
typedef pair<int, int> mp;
typedef pair<mp, mp> superpair;
const int MAXN = 2e6 + 10, MOD = 1e9 + 7;
int r1, r2, c1, c2;
struct Combinatorics {
LL fact[MAXN + 1] = {1};
void INIT() { rb(i, 1, MAXN) fact[i] = fact[i - 1] * i, fact[i] %= MOD; }
LL quick_pow(LL A, LL B) {
if (!B)
return 1;
LL tmp = quick_pow(A, B >> 1);
tmp *= tmp;
tmp %= MOD;
if (B & 1) {
tmp *= A;
tmp %= MOD;
}
return tmp;
}
LL inv(LL A) { return quick_pow(A, MOD - 2); }
LL P(LL A, LL B) { return fact[B] * inv(fact[B - A]) % MOD; }
LL C(LL A, LL B) { return P(A, B) * inv(fact[A]) % MOD; }
} com;
LL f(int i, int j) { return com.C(j, i + j); }
LL g(int i, int j) {
// total in O(n)
LL Res = 0;
rb(I, 0, i) {
Res += f(I + 1, j);
// cout<<I+1<<" "<<j<<" "<<com.C(2,3)<<endl;
Res %= MOD;
}
// cout<<Res<<endl;
return Res;
}
int main() {
fastio;
com.INIT();
cin >> r1 >> c1 >> r2 >> c2;
// cout<<g(1,1)<<endl;
cout << (g(r2, c2) - g(r2, c1 - 1) - g(r1 - 1, c2) + g(r1 - 1, c1 - 1) + MOD +
MOD) %
MOD;
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02782 | C++ | Runtime Error | #pragma region
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define _rep3(i, begin, end) \
for (register int i = (begin), i##_end = (end); i < i##_end; i++)
#define _irep3(i, begin, end) \
for (register int i = (end)-1, i##_begin = (begin); i >= i##_begin; i--)
#define _rep2(i, n) _rep3(i, 0, n)
#define _irep2(i, n) _irep3(i, 0, n)
#define _overload3(_1, _2, _3, name, ...) name
#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2, )(__VA_ARGS__)
#define irep(...) _overload3(__VA_ARGS__, _irep3, _irep2, )(__VA_ARGS__)
#define out(x) cout << (x) << '\n';
#define debug(x) \
cerr << #x << " = " << (x) << " (line: " << __LINE__ << ") " << endl;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &pair) {
cin >> pair.first >> pair.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[ ";
rep(i, vec.size()) i == 0 ? os << vec[i] : os << ", " << vec[i];
os << " ]";
return os;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10) << boolalpha;
}
#pragma endregion
#define MOD 1000000007
#define INF 2147483647
const int MAX = 1000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
init();
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = COM(r2 + c2 + 2, c2 + 1) - COM(r1 + c2 + 1, c2 + 1) -
COM(r2 + c1 + 1, c1) + COM(r1 + c1, c1);
out((ans + MOD) % MOD);
}
| #pragma region
#include "bits/stdc++.h"
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define _rep3(i, begin, end) \
for (register int i = (begin), i##_end = (end); i < i##_end; i++)
#define _irep3(i, begin, end) \
for (register int i = (end)-1, i##_begin = (begin); i >= i##_begin; i--)
#define _rep2(i, n) _rep3(i, 0, n)
#define _irep2(i, n) _irep3(i, 0, n)
#define _overload3(_1, _2, _3, name, ...) name
#define rep(...) _overload3(__VA_ARGS__, _rep3, _rep2, )(__VA_ARGS__)
#define irep(...) _overload3(__VA_ARGS__, _irep3, _irep2, )(__VA_ARGS__)
#define out(x) cout << (x) << '\n';
#define debug(x) \
cerr << #x << " = " << (x) << " (line: " << __LINE__ << ") " << endl;
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<long long>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<long long>>;
template <typename T> istream &operator>>(istream &is, vector<T> &vec) {
for (auto &v : vec)
is >> v;
return is;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &pair) {
cin >> pair.first >> pair.second;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "[ ";
rep(i, vec.size()) i == 0 ? os << vec[i] : os << ", " << vec[i];
os << " ]";
return os;
}
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
}
return false;
}
void init() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(10) << boolalpha;
}
#pragma endregion
#define MOD 1000000007
#define INF 2147483647
const int MAX = 2000010;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
init();
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = COM(r2 + c2 + 2, c2 + 1) - COM(r1 + c2 + 1, c2 + 1) -
COM(r2 + c1 + 1, c1) + COM(r1 + c1, c1);
out((ans + MOD) % MOD);
}
| replace | 69 | 70 | 69 | 70 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define vcout(v) \
rep(i, v.size()) cout << v[i] << " "; \
cout << endl
#define mcout(m) \
rep(j, m.size()) { vcout(m[j]); }
const ll MOD = 1e9 + 7;
const int MAX = 1e6 + 5; // 適宜
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 順列組み合わせ計算
ll PER(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
// 逆元 a^{-1} mod m
// aがmの倍数でないことが前提。O(log m)
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
void mainsolve() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
/*
vector<ll> ff(MAX),cum(MAX+1);
ff[0] = ff[1] = 1;
rep(i,MAX){
if(i!=0) ff[i] = (ff[i-1] * i) % MOD;
cum[i+1] = (cum[i] + ff[i]) % MOD;
}
*/
auto g = [&](ll r, ll c) {
ll res = 0;
if (r == 0 || c == 0)
return res;
if (r == 1) {
rep(i, c) res = (res + COM(2 + i, 1 + i)) % MOD;
return res;
} else {
rep(i, c) res = (res + COM(2 + r + i, 2 + i)) % MOD;
return (res - c + MOD) % MOD;
}
};
ll res = (g(r2, c2) + g(r1 - 1, c1 - 1)) % MOD;
res = (res - g(r1 - 1, c2) + MOD) % MOD;
res = (res - g(r2, c1 - 1) + MOD) % MOD;
cout << res << endl;
return;
}
int main() {
// ll TC;cin>>TC;rep(I,TC){cout<<"case:"<<I+1<<"---"<<endl; // comment out!
mainsolve();
//} // comment out!
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
#define rep(i, n) for (ll i = 0; i < (n); ++i)
#define vcout(v) \
rep(i, v.size()) cout << v[i] << " "; \
cout << endl
#define mcout(m) \
rep(j, m.size()) { vcout(m[j]); }
const ll MOD = 1e9 + 7;
const int MAX = 3 * 1e6; // 適宜
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
// 順列組み合わせ計算
ll PER(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * finv[n - k] % MOD;
}
// 逆元 a^{-1} mod m
// aがmの倍数でないことが前提。O(log m)
ll modinv(ll a, ll m) {
ll b = m, u = 1, v = 0;
while (b) {
ll t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
u %= m;
if (u < 0)
u += m;
return u;
}
void mainsolve() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
/*
vector<ll> ff(MAX),cum(MAX+1);
ff[0] = ff[1] = 1;
rep(i,MAX){
if(i!=0) ff[i] = (ff[i-1] * i) % MOD;
cum[i+1] = (cum[i] + ff[i]) % MOD;
}
*/
auto g = [&](ll r, ll c) {
ll res = 0;
if (r == 0 || c == 0)
return res;
if (r == 1) {
rep(i, c) res = (res + COM(2 + i, 1 + i)) % MOD;
return res;
} else {
rep(i, c) res = (res + COM(2 + r + i, 2 + i)) % MOD;
return (res - c + MOD) % MOD;
}
};
ll res = (g(r2, c2) + g(r1 - 1, c1 - 1)) % MOD;
res = (res - g(r1 - 1, c2) + MOD) % MOD;
res = (res - g(r2, c1 - 1) + MOD) % MOD;
cout << res << endl;
return;
}
int main() {
// ll TC;cin>>TC;rep(I,TC){cout<<"case:"<<I+1<<"---"<<endl; // comment out!
mainsolve();
//} // comment out!
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> std::tuple<T, T, T> extgcd(T a, T b) {
T s1 = 1, t1 = 0, s2 = 0, t2 = 1;
while (b != 0) {
std::tie(s1, t1, s2, t2) =
std::make_tuple(s2, t2, s1 - (a / b) * s2, t1 - (a / b) * t2);
std::tie(a, b) = std::make_tuple(b, a % b);
}
return std::make_tuple(s1, t1, a);
}
template <typename T> T mod_inverse(T a, T mod) {
T b;
std::tie(b, std::ignore, std::ignore) = extgcd(a, mod);
if (b < 0) {
b += mod;
}
return b;
}
template <typename T> struct Combinatorics {
T modulo;
std::vector<T> fact, inv_fact;
Combinatorics(T max, T modulo)
: modulo(modulo), fact(max + 1), inv_fact(max + 1) {
fact[0] = 1;
for (T i = 1; i <= max; ++i) {
fact[i] = i * fact[i - 1] % modulo;
}
inv_fact[max] = mod_inverse(fact[max], modulo);
for (T i = max; i > 0; --i) {
inv_fact[i - 1] = i * inv_fact[i] % modulo;
}
}
T nPk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[n - k] % modulo;
}
T nCk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[k] % modulo * inv_fact[n - k] % modulo;
}
T nHk(T n, T k) {
if (n == 0 && k == 0) {
return 1;
}
return nCk(n + k - 1, k);
}
};
constexpr ll MOD = 1'000'000'007;
Combinatorics<ll> comb(200100, MOD);
int r1, c1, r2, c2;
inline ll g(int r, int c) {
if (r > c) {
std::swap(r, c);
}
if (r == 0) {
return c + 1;
}
return (comb.nCk(r + c + 2, r + 1) + MOD - 1) % MOD;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> r1 >> c1 >> r2 >> c2;
ll res = g(r2, c2);
res = (res + MOD - g(r1 - 1, c2)) % MOD;
res = (res + MOD - g(r2, c1 - 1)) % MOD;
res = (res + g(r1 - 1, c1 - 1)) % MOD;
std::cout << res << std::endl;
}
| #include <bits/stdc++.h>
#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if (!(p))
#define until(p) while (!(p))
using ll = std::int64_t;
using P = std::tuple<int, int>;
template <typename T> std::tuple<T, T, T> extgcd(T a, T b) {
T s1 = 1, t1 = 0, s2 = 0, t2 = 1;
while (b != 0) {
std::tie(s1, t1, s2, t2) =
std::make_tuple(s2, t2, s1 - (a / b) * s2, t1 - (a / b) * t2);
std::tie(a, b) = std::make_tuple(b, a % b);
}
return std::make_tuple(s1, t1, a);
}
template <typename T> T mod_inverse(T a, T mod) {
T b;
std::tie(b, std::ignore, std::ignore) = extgcd(a, mod);
if (b < 0) {
b += mod;
}
return b;
}
template <typename T> struct Combinatorics {
T modulo;
std::vector<T> fact, inv_fact;
Combinatorics(T max, T modulo)
: modulo(modulo), fact(max + 1), inv_fact(max + 1) {
fact[0] = 1;
for (T i = 1; i <= max; ++i) {
fact[i] = i * fact[i - 1] % modulo;
}
inv_fact[max] = mod_inverse(fact[max], modulo);
for (T i = max; i > 0; --i) {
inv_fact[i - 1] = i * inv_fact[i] % modulo;
}
}
T nPk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[n - k] % modulo;
}
T nCk(T n, T k) {
if (n < k) {
return 0;
}
return fact[n] * inv_fact[k] % modulo * inv_fact[n - k] % modulo;
}
T nHk(T n, T k) {
if (n == 0 && k == 0) {
return 1;
}
return nCk(n + k - 1, k);
}
};
constexpr ll MOD = 1'000'000'007;
Combinatorics<ll> comb(2000100, MOD);
int r1, c1, r2, c2;
inline ll g(int r, int c) {
if (r > c) {
std::swap(r, c);
}
if (r == 0) {
return c + 1;
}
return (comb.nCk(r + c + 2, r + 1) + MOD - 1) % MOD;
}
int main() {
std::cin.tie(nullptr);
std::ios::sync_with_stdio(false);
std::cin >> r1 >> c1 >> r2 >> c2;
ll res = g(r2, c2);
res = (res + MOD - g(r1 - 1, c2)) % MOD;
res = (res + MOD - g(r2, c1 - 1)) % MOD;
res = (res + g(r1 - 1, c1 - 1)) % MOD;
std::cout << res << std::endl;
}
| replace | 70 | 71 | 70 | 71 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define per(i, a, b) for (ll i = b - 1LL; i >= (a); --i)
#define clr(a, b) memset((a), (b), sizeof(a))
#define ctos(c) string(1, c)
#define print(x) cout << #x << " = " << x << endl;
#define MOD 1000000007LL
#define N_MAX 1000100
long long fact[N_MAX];
long long rfact[N_MAX];
long long modpow(long long a, long long b) {
long long r = 1LL;
while (b) {
if (b & 1LL)
r *= a;
if (r >= MOD)
r %= MOD;
a *= a;
if (a >= MOD)
a %= MOD;
b >>= 1LL;
}
return r % MOD;
}
long long nCr(long long n, long long r) {
long long ret = 1LL;
ret *= fact[n];
ret %= MOD;
ret *= rfact[r];
ret %= MOD;
ret *= rfact[n - r];
ret %= MOD;
return ret;
}
ll f(ll r, ll c) {
ll ret = r + 1;
rep(i, 1, c + 1) {
ret += nCr(r + i + 1, r) % MOD;
ret %= MOD;
}
return ret;
}
int main() {
clr(fact, 0);
fact[0] = 1;
rep(i, 1, N_MAX) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
clr(rfact, 0);
rfact[0] = 1;
rep(i, 1, N_MAX) {
rfact[i] = rfact[i - 1] * modpow(i, MOD - 2);
rfact[i] %= MOD;
}
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll a1 = f(r2, c2) % MOD;
ll a2 = f(r1 - 1, c2) % MOD;
ll a3 = f(r2, c1 - 1) % MOD;
ll a4 = f(r1 - 1, c1 - 1) % MOD;
ll ans = MOD * 4 + a1 - a2 - a3 + a4;
cout << ans % MOD << endl;
return 0;
} | #include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>
using namespace std;
typedef long long ll;
#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i, a, b) for (ll i = (a); i < (b); ++i)
#define per(i, a, b) for (ll i = b - 1LL; i >= (a); --i)
#define clr(a, b) memset((a), (b), sizeof(a))
#define ctos(c) string(1, c)
#define print(x) cout << #x << " = " << x << endl;
#define MOD 1000000007LL
#define N_MAX 2000100
long long fact[N_MAX];
long long rfact[N_MAX];
long long modpow(long long a, long long b) {
long long r = 1LL;
while (b) {
if (b & 1LL)
r *= a;
if (r >= MOD)
r %= MOD;
a *= a;
if (a >= MOD)
a %= MOD;
b >>= 1LL;
}
return r % MOD;
}
long long nCr(long long n, long long r) {
long long ret = 1LL;
ret *= fact[n];
ret %= MOD;
ret *= rfact[r];
ret %= MOD;
ret *= rfact[n - r];
ret %= MOD;
return ret;
}
ll f(ll r, ll c) {
ll ret = r + 1;
rep(i, 1, c + 1) {
ret += nCr(r + i + 1, r) % MOD;
ret %= MOD;
}
return ret;
}
int main() {
clr(fact, 0);
fact[0] = 1;
rep(i, 1, N_MAX) {
fact[i] = fact[i - 1] * i;
fact[i] %= MOD;
}
clr(rfact, 0);
rfact[0] = 1;
rep(i, 1, N_MAX) {
rfact[i] = rfact[i - 1] * modpow(i, MOD - 2);
rfact[i] %= MOD;
}
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll a1 = f(r2, c2) % MOD;
ll a2 = f(r1 - 1, c2) % MOD;
ll a3 = f(r2, c1 - 1) % MOD;
ll a4 = f(r1 - 1, c1 - 1) % MOD;
ll ans = MOD * 4 + a1 - a2 - a3 + a4;
cout << ans % MOD << endl;
return 0;
} | replace | 38 | 39 | 38 | 39 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
using point = struct {
ll x;
ll y;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::pair<ll, pl> pl3;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::vector<point> points;
typedef std::vector<pl3> vpl3;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
const ll N_DIGITS = 60;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
vpl dirs = {
{1, 0}, {0, 1}, {-1, 0}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0} // self
};
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
rep(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
/*
class LCA{
public:
ll N, logN;
vl depth, len;
gr tree[200005]; // global declaration later.
vector<vl> parents;
LCA(ll n){
N = n;
logN = 0;
while (N > (1LL << logN)) logN++;
depth = vl(N); len = vl(N);
parents = vector<vl>(logN, vl(N));
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l){
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent) continue;
init(target, source, d + 1, cost + l);
}
}
void build(){
rep(k, logN - 1) rep(n, N){
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0) parents[k + 1][n] = -1;
else parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v){
if (depth[u] > depth[v]) swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v) return u;
revrep(k, logN){
if (parents[k][u] != parents[k][v]){
u = parents[k][u]; v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v){
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
*/
struct BIT {
ll n;
vl tree_dat;
BIT(ll n) : tree_dat(n + 1, 0), n(n){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll dat) {
// if maximum -> max(val, dat)
// return max(val, dat);
// if cumulative sum
return val + dat;
}
ll query(ll i) {
/*
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, tree_dat[j]);
}
return ret;
}
ll lower_bound(ll key) {
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && tree_dat[left + i - 1] < key) {
key -= tree_dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. 10101 -> 10110
itr2. 10110 -> 11000
itr3. 11000 -> 100000 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
tree_dat[j] = update_func(val, tree_dat[j]);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vector<bool> visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
static vector<type> evaluate(const vector<type> &value) {
const ll n = value.size();
vl L(n + 1, 1), R(n + 1, 1);
rep(i, n) L[i + 1] = (L[i] * value[i]) % MOD;
revrep(i, n) R[i] = (R[i + 1] * value[i]) % MOD;
vl ret(n);
/*
ret[i] = v[c0] * v[c1] * ... * v[ci-1] * v[ci+1] * ... * v[cn-1]
ci: the i-th child
Let's consider the case where the root of a given tree is 0. (0-indexed)
Here, we try to obtain the objective values for the edges from children to
parent. When we change the root of the tree into another, the parent node
here also changes the family structure. Since each node has ONLY one parent
and zero or one or multiple children, the value for edge on child i to
source is obtained using the value from source to child j. Here j is all the
integers which is not i.
In this case, child i is grandparent of child j for all j and
the computation for the value from child i to source is O(N) when we use
cumulative sum or product.
*/
rep(i, n) ret[i] = (L[i] * R[i + 1]) % MOD;
return ret;
}
static type merge(const vector<type> &value) {
ll ret;
for (auto &&v : value) {
}
return ret;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll comb_memo[55][55];
ll pascal_triangle(ll n) {
comb_memo[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb_memo[i][j] += comb_memo[i - 1][j];
if (j > 0)
comb_memo[i][j] += comb_memo[i - 1][j - 1];
}
}
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
ll combination_memo(ll n, ll r, ll pre, ll mod) {
// pre = nCr-1
// return nCr
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = ll(n - r + 1) % mod;
ll denomenator = modinv(r, mod) % mod;
ll val = (numerator * denomenator) % mod;
val *= pre;
return val % mod;
}
ll combination_no_mod(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
numerator *= n - i;
denomenator *= i + 1;
ll g = gcd(numerator, denomenator);
numerator /= g;
denomenator /= g;
}
return numerator;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
/*
ll bin_search_temp(ll left, ll right, callable judge){
while(right > left){
// when seeking lower bound
ll mid = (right + left) / 2;
if (judge(mid)) right = mid;
else left = mid + 1;
// when seeking upper bound
ll mid = (right + left + 1) / 2;
if (judge(mid)) left = mid;
else right = mid - 1;
}
return right;
}
trinary_search
// Care the value EPS!!! Compare to the condition
ld left = 0; ld right = p;
while(abs(right - left) > EPS){
ld left2 = (2 * left + right) / 3.0;
ld right2 = (left + 2 * right) / 3.0;
ld f1 = tak_func(left2);
ld f2 = tak_func(right2);
if (f1 <= f2) right = right2;
else if (f2 <= f1) left = left2;
}
*/
str bin_expression(ll n, ll dig) {
str s = "";
rep(i, dig) {
s += ltos(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
ll lower_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll bin_search_vector(ll key, vl v, ll left, ll right) {
// return the index idx where v[idx] = key.
// v[left] is start and v[right] is end..
// In other words, v[right], not v[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (v[mid] == key)
return mid;
else if (v[mid] > key)
right = mid - 1;
else if (v[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] < key <= v[N]
// N == -1 if all the elements < key
return lower_bound(all(v), key) - v.begin();
}
ll inf_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] <= key < v[N] <= key + 1
// N == -1 if all the elements <= key
return lower_bound(all(v), key + 1) - v.begin();
}
ll upper_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key < v[N + 1]
// N == -1 if all the elements > key
return upper_bound(all(v), key) - v.begin(); // (- 1)
}
ll sup_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key - 1 < key <= v[N + 1]
// N == -1 if all the elements >= key
return upper_bound(all(v), key - 1) - v.begin() - 1;
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
ll fact_mod(ll n, ll mod) {
if (n == 0)
return 1;
return n * fact_mod(n - 1, mod);
}
/*
void fact_memo(ll n, ll mod){
memo[0] = 1; memoinv[0] = modinv(memo[0], mod);
rep(i, n + 1){
memo[i + 1] = ((i + 1) * memo[i]) % mod;
memo[i + 1] = modinv(memo[i + 1], mod);
}
}
ll nCk(ll n, ll r){
if (n == r && n == 0) return 1;
else if (n <= 0 || r < 0 || r > n) return 0;
ll val = (memo[n] * memoinv[n - r]) % MOD;
val *= memoinv[r];
return val % MOD;
}
*/
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_factorization(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
ll next_combination(ll sub) {
/*
### Attention ###
if k is 0 or 1 and n is 0, it does not work well.
ll n, k; ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
vl z_algorithm(str s) {
ll n = s.length();
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
i1 += i3, i2 -= i3;
}
return res;
}
ll big_number_mod(str s, ll mod) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth) % mod;
val %= mod;
tenth *= 10;
tenth %= mod;
idx++;
}
return val;
}
ll string_to_ll(str s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
str reflected_string(str s) {
str t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> center_2det_of_3points(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll c2x_2 = x2 + x1, c2y_2 = y2 + y1;
ll c3x_2 = x3 + x1, c3y_2 = y3 + y1;
ll b2y = x2 - x1, b2x = -y2 + y1;
ll b3y = x3 - x1, b3x = -y3 + y1;
ll x1_2 = c3x_2 * b3y - c3y_2 * b3x, y1_2 = c2x_2 * b2y - c2y_2 * b2x;
ll det = -b3y * b2x + b3x * b2y;
if (det == 0)
return {{INF, INF}, det};
ll cx_2det = -b2x * x1_2 + b3x * y1_2, cy_2det = -b2y * x1_2 + b3y * y1_2;
return {{cx_2det, cy_2det}, det};
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BIT bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = rank + 1; j < n; j++)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
ll dist[1005], vertex_pre[1005];
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF); // fill(vertex_pre, vertex_pre + n, -1);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, graph[idx].size()){
edge e = graph[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
// vertex_pre[e.to] = idx;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g){
vl path;
for (; g != -1; g = vertex_pre[g]) path.pb(g);
reverse(all(path));
return path;
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
# ABC061D
bool find_negative_cycle(ll goal){
rep(i, n) rep(v, n) rep(k, graph[v].size()){
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost){
dist[e.to] = -INF;
if (goal == -1) return true;
else if (goal == e.to) return true;
}
}
return false;
}
bool bellman_ford(ll start, ll n, ll goal){
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal
!= -1) fill(dist, dist + n, INF); dist[start] = 0; rep(i, n) rep(v, n) rep(k,
graph[v].size()){ edge e = graph[v][k]; if (dist[v] != INF && dist[e.to] >
dist[v] + e.cost) dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(goal)) return false;
return true;
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
sort(a, a + 8);
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 3. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = power_normal(base, n);
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 4. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#5. shakutori method (syakutori)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
r = max(r, l);
if (l == r) r++;
while(r < n && cond) r++;
answer += r - l; l++;
}
prl(answer);
#6. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#7. The shortest path (distance) between the k-th edge and another edge
(Tree) ll depth[MAX_N]; gr tree[MAX_N];
void dfs(ll source, ll parent, ll all_cost){
depth[source] = all_cost;
items(e, tree[source]){
if (e.to == parent) continue;
dfs(e.to, source, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
rep(i, m){ll res = n % match[i].e1;}
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D, ABC007C
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = G[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = G[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
#12. grid to distance matrix (dx, dy)
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
pl idx_to_pos(ll idx){
return mp(idx % w, idx / w);
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) dist[i1][i2] = INF * (i1 != i2);
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
// if warshall floyd
dist[idx1][idx2] = 1;
// if dijkstra
// graph[idx1].pb({idx2, 1});
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
}
}
*/
/*
# the operators regarding bit
& (AND), | (OR), ^ (XOR)
- (REVERSE), >> (SMALLER SHIFT)
<< (BIGGER SHIFT)
x1: 0000 0001 0010 0101 0110 0111 0111
x2: xxxx 0001 0011 0100 0101 1000 0110
x1 & x2: 0000 0001 0010 0100 0100 0000 0110
x: 1001 1010 1100 1011 1101 1111
x & - x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
x << y is x * 2 ** y
x >> y is rep(i, y) x = x // 2
####### Attention #######
1 << i and 1LL << i is different. If programs show WA, try switch to this one.
Let S be a bit sequence and i be a non-negative integer
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & -(1 << i) -> S - {i}
__builtin_popcount(S) -> the number of elements in S
S = 0 -> S is an empty set
__builtin_popcountl(i) -> the number of 1 in binary
S = (1 << n) - 1 -> S includes all the elements up to the n-th
#Conditional Operator
condition ? true : false;
#iterator
type declaration: auto
value reference: *itr
increment: itr++
decrement: itr--
substitution of value: *itr = smt
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
bool okay = false;
ll answer = 0;
ll r1, r2, c1, c2;
vl a;
ll memo[MAX_N], memoinv[MAX_N];
void fact_memo(ll n, ll mod) {
memo[0] = 1;
memoinv[0] = modinv(memo[0], mod);
rep(i, n + 1) {
memo[i + 1] = ((i + 1) * memo[i]) % mod;
memoinv[i + 1] = modinv(memo[i + 1], mod);
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (memo[n] * memoinv[n - r]) % MOD;
val *= memoinv[r];
return val % MOD;
}
ll func(ll r, ll c) {
ll val = 0;
For(i, 1, r + 1) {
val += nCk(i + c + 1, c);
val %= MOD;
}
return val;
}
void solve() {
/*
[i + j]C[i] for r1 <= i <= r2, c1 <= j <= c2
*/
fact_memo(r2 + c2 + 1, MOD);
answer = func(r2, c2);
answer %= MOD;
answer += MOD - func(r2, c1 - 1);
answer %= MOD;
answer += MOD - func(r1 - 1, c2);
answer %= MOD;
answer += func(r1 - 1, c1 - 1);
answer %= MOD;
prl(answer);
// check negative MOD
// check index flow
// check overwrite of the input variables
}
int main(void) {
in4(r1, c1, r2, c2);
// assert(n <= 400);
solve();
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
using point = struct {
ll x;
ll y;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::pair<ll, pl> pl3;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::vector<point> points;
typedef std::vector<pl3> vpl3;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
const ll N_DIGITS = 60;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
vpl dirs = {
{1, 0}, {0, 1}, {-1, 0}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0} // self
};
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
rep(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
/*
class LCA{
public:
ll N, logN;
vl depth, len;
gr tree[200005]; // global declaration later.
vector<vl> parents;
LCA(ll n){
N = n;
logN = 0;
while (N > (1LL << logN)) logN++;
depth = vl(N); len = vl(N);
parents = vector<vl>(logN, vl(N));
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l){
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent) continue;
init(target, source, d + 1, cost + l);
}
}
void build(){
rep(k, logN - 1) rep(n, N){
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0) parents[k + 1][n] = -1;
else parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v){
if (depth[u] > depth[v]) swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v) return u;
revrep(k, logN){
if (parents[k][u] != parents[k][v]){
u = parents[k][u]; v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v){
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
*/
struct BIT {
ll n;
vl tree_dat;
BIT(ll n) : tree_dat(n + 1, 0), n(n){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll dat) {
// if maximum -> max(val, dat)
// return max(val, dat);
// if cumulative sum
return val + dat;
}
ll query(ll i) {
/*
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, tree_dat[j]);
}
return ret;
}
ll lower_bound(ll key) {
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && tree_dat[left + i - 1] < key) {
key -= tree_dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. 10101 -> 10110
itr2. 10110 -> 11000
itr3. 11000 -> 100000 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
tree_dat[j] = update_func(val, tree_dat[j]);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vector<bool> visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
static vector<type> evaluate(const vector<type> &value) {
const ll n = value.size();
vl L(n + 1, 1), R(n + 1, 1);
rep(i, n) L[i + 1] = (L[i] * value[i]) % MOD;
revrep(i, n) R[i] = (R[i + 1] * value[i]) % MOD;
vl ret(n);
/*
ret[i] = v[c0] * v[c1] * ... * v[ci-1] * v[ci+1] * ... * v[cn-1]
ci: the i-th child
Let's consider the case where the root of a given tree is 0. (0-indexed)
Here, we try to obtain the objective values for the edges from children to
parent. When we change the root of the tree into another, the parent node
here also changes the family structure. Since each node has ONLY one parent
and zero or one or multiple children, the value for edge on child i to
source is obtained using the value from source to child j. Here j is all the
integers which is not i.
In this case, child i is grandparent of child j for all j and
the computation for the value from child i to source is O(N) when we use
cumulative sum or product.
*/
rep(i, n) ret[i] = (L[i] * R[i + 1]) % MOD;
return ret;
}
static type merge(const vector<type> &value) {
ll ret;
for (auto &&v : value) {
}
return ret;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll comb_memo[55][55];
ll pascal_triangle(ll n) {
comb_memo[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb_memo[i][j] += comb_memo[i - 1][j];
if (j > 0)
comb_memo[i][j] += comb_memo[i - 1][j - 1];
}
}
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
ll combination_memo(ll n, ll r, ll pre, ll mod) {
// pre = nCr-1
// return nCr
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = ll(n - r + 1) % mod;
ll denomenator = modinv(r, mod) % mod;
ll val = (numerator * denomenator) % mod;
val *= pre;
return val % mod;
}
ll combination_no_mod(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
numerator *= n - i;
denomenator *= i + 1;
ll g = gcd(numerator, denomenator);
numerator /= g;
denomenator /= g;
}
return numerator;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
/*
ll bin_search_temp(ll left, ll right, callable judge){
while(right > left){
// when seeking lower bound
ll mid = (right + left) / 2;
if (judge(mid)) right = mid;
else left = mid + 1;
// when seeking upper bound
ll mid = (right + left + 1) / 2;
if (judge(mid)) left = mid;
else right = mid - 1;
}
return right;
}
trinary_search
// Care the value EPS!!! Compare to the condition
ld left = 0; ld right = p;
while(abs(right - left) > EPS){
ld left2 = (2 * left + right) / 3.0;
ld right2 = (left + 2 * right) / 3.0;
ld f1 = tak_func(left2);
ld f2 = tak_func(right2);
if (f1 <= f2) right = right2;
else if (f2 <= f1) left = left2;
}
*/
str bin_expression(ll n, ll dig) {
str s = "";
rep(i, dig) {
s += ltos(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
ll lower_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll bin_search_vector(ll key, vl v, ll left, ll right) {
// return the index idx where v[idx] = key.
// v[left] is start and v[right] is end..
// In other words, v[right], not v[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (v[mid] == key)
return mid;
else if (v[mid] > key)
right = mid - 1;
else if (v[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] < key <= v[N]
// N == -1 if all the elements < key
return lower_bound(all(v), key) - v.begin();
}
ll inf_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] <= key < v[N] <= key + 1
// N == -1 if all the elements <= key
return lower_bound(all(v), key + 1) - v.begin();
}
ll upper_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key < v[N + 1]
// N == -1 if all the elements > key
return upper_bound(all(v), key) - v.begin(); // (- 1)
}
ll sup_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key - 1 < key <= v[N + 1]
// N == -1 if all the elements >= key
return upper_bound(all(v), key - 1) - v.begin() - 1;
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
ll fact_mod(ll n, ll mod) {
if (n == 0)
return 1;
return n * fact_mod(n - 1, mod);
}
/*
void fact_memo(ll n, ll mod){
memo[0] = 1; memoinv[0] = modinv(memo[0], mod);
rep(i, n + 1){
memo[i + 1] = ((i + 1) * memo[i]) % mod;
memo[i + 1] = modinv(memo[i + 1], mod);
}
}
ll nCk(ll n, ll r){
if (n == r && n == 0) return 1;
else if (n <= 0 || r < 0 || r > n) return 0;
ll val = (memo[n] * memoinv[n - r]) % MOD;
val *= memoinv[r];
return val % MOD;
}
*/
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_factorization(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
ll next_combination(ll sub) {
/*
### Attention ###
if k is 0 or 1 and n is 0, it does not work well.
ll n, k; ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
vl z_algorithm(str s) {
ll n = s.length();
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
i1 += i3, i2 -= i3;
}
return res;
}
ll big_number_mod(str s, ll mod) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth) % mod;
val %= mod;
tenth *= 10;
tenth %= mod;
idx++;
}
return val;
}
ll string_to_ll(str s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
str reflected_string(str s) {
str t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> center_2det_of_3points(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll c2x_2 = x2 + x1, c2y_2 = y2 + y1;
ll c3x_2 = x3 + x1, c3y_2 = y3 + y1;
ll b2y = x2 - x1, b2x = -y2 + y1;
ll b3y = x3 - x1, b3x = -y3 + y1;
ll x1_2 = c3x_2 * b3y - c3y_2 * b3x, y1_2 = c2x_2 * b2y - c2y_2 * b2x;
ll det = -b3y * b2x + b3x * b2y;
if (det == 0)
return {{INF, INF}, det};
ll cx_2det = -b2x * x1_2 + b3x * y1_2, cy_2det = -b2y * x1_2 + b3y * y1_2;
return {{cx_2det, cy_2det}, det};
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BIT bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = rank + 1; j < n; j++)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
ll dist[1005], vertex_pre[1005];
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF); // fill(vertex_pre, vertex_pre + n, -1);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, graph[idx].size()){
edge e = graph[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
// vertex_pre[e.to] = idx;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g){
vl path;
for (; g != -1; g = vertex_pre[g]) path.pb(g);
reverse(all(path));
return path;
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
# ABC061D
bool find_negative_cycle(ll goal){
rep(i, n) rep(v, n) rep(k, graph[v].size()){
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost){
dist[e.to] = -INF;
if (goal == -1) return true;
else if (goal == e.to) return true;
}
}
return false;
}
bool bellman_ford(ll start, ll n, ll goal){
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal
!= -1) fill(dist, dist + n, INF); dist[start] = 0; rep(i, n) rep(v, n) rep(k,
graph[v].size()){ edge e = graph[v][k]; if (dist[v] != INF && dist[e.to] >
dist[v] + e.cost) dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(goal)) return false;
return true;
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
sort(a, a + 8);
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 3. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = power_normal(base, n);
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 4. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#5. shakutori method (syakutori)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
r = max(r, l);
if (l == r) r++;
while(r < n && cond) r++;
answer += r - l; l++;
}
prl(answer);
#6. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#7. The shortest path (distance) between the k-th edge and another edge
(Tree) ll depth[MAX_N]; gr tree[MAX_N];
void dfs(ll source, ll parent, ll all_cost){
depth[source] = all_cost;
items(e, tree[source]){
if (e.to == parent) continue;
dfs(e.to, source, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
rep(i, m){ll res = n % match[i].e1;}
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D, ABC007C
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = G[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = G[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
#12. grid to distance matrix (dx, dy)
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
pl idx_to_pos(ll idx){
return mp(idx % w, idx / w);
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) dist[i1][i2] = INF * (i1 != i2);
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
// if warshall floyd
dist[idx1][idx2] = 1;
// if dijkstra
// graph[idx1].pb({idx2, 1});
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
}
}
*/
/*
# the operators regarding bit
& (AND), | (OR), ^ (XOR)
- (REVERSE), >> (SMALLER SHIFT)
<< (BIGGER SHIFT)
x1: 0000 0001 0010 0101 0110 0111 0111
x2: xxxx 0001 0011 0100 0101 1000 0110
x1 & x2: 0000 0001 0010 0100 0100 0000 0110
x: 1001 1010 1100 1011 1101 1111
x & - x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
x << y is x * 2 ** y
x >> y is rep(i, y) x = x // 2
####### Attention #######
1 << i and 1LL << i is different. If programs show WA, try switch to this one.
Let S be a bit sequence and i be a non-negative integer
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & -(1 << i) -> S - {i}
__builtin_popcount(S) -> the number of elements in S
S = 0 -> S is an empty set
__builtin_popcountl(i) -> the number of 1 in binary
S = (1 << n) - 1 -> S includes all the elements up to the n-th
#Conditional Operator
condition ? true : false;
#iterator
type declaration: auto
value reference: *itr
increment: itr++
decrement: itr--
substitution of value: *itr = smt
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
bool okay = false;
ll answer = 0;
ll r1, r2, c1, c2;
vl a;
ll memo[MAX_N * 10], memoinv[MAX_N * 10];
void fact_memo(ll n, ll mod) {
memo[0] = 1;
memoinv[0] = modinv(memo[0], mod);
rep(i, n + 1) {
memo[i + 1] = ((i + 1) * memo[i]) % mod;
memoinv[i + 1] = modinv(memo[i + 1], mod);
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (memo[n] * memoinv[n - r]) % MOD;
val *= memoinv[r];
return val % MOD;
}
ll func(ll r, ll c) {
ll val = 0;
For(i, 1, r + 1) {
val += nCk(i + c + 1, c);
val %= MOD;
}
return val;
}
void solve() {
/*
[i + j]C[i] for r1 <= i <= r2, c1 <= j <= c2
*/
fact_memo(r2 + c2 + 1, MOD);
answer = func(r2, c2);
answer %= MOD;
answer += MOD - func(r2, c1 - 1);
answer %= MOD;
answer += MOD - func(r1 - 1, c2);
answer %= MOD;
answer += func(r1 - 1, c1 - 1);
answer %= MOD;
prl(answer);
// check negative MOD
// check index flow
// check overwrite of the input variables
}
int main(void) {
in4(r1, c1, r2, c2);
// assert(n <= 400);
solve();
return 0;
}
| replace | 1,435 | 1,436 | 1,435 | 1,436 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
using point = struct {
ll x;
ll y;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::pair<ll, pl> pl3;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::vector<point> points;
typedef std::vector<pl3> vpl3;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
const ll N_DIGITS = 60;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
vpl dirs = {
{1, 0}, {0, 1}, {-1, 0}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0} // self
};
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
rep(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
/*
class LCA{
public:
ll N, logN;
vl depth, len;
gr tree[200005]; // global declaration later.
vector<vl> parents;
LCA(ll n){
N = n;
logN = 0;
while (N > (1LL << logN)) logN++;
depth = vl(N); len = vl(N);
parents = vector<vl>(logN, vl(N));
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l){
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent) continue;
init(target, source, d + 1, cost + l);
}
}
void build(){
rep(k, logN - 1) rep(n, N){
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0) parents[k + 1][n] = -1;
else parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v){
if (depth[u] > depth[v]) swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v) return u;
revrep(k, logN){
if (parents[k][u] != parents[k][v]){
u = parents[k][u]; v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v){
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
*/
struct BIT {
ll n;
vl tree_dat;
BIT(ll n) : tree_dat(n + 1, 0), n(n){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll dat) {
// if maximum -> max(val, dat)
// return max(val, dat);
// if cumulative sum
return val + dat;
}
ll query(ll i) {
/*
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, tree_dat[j]);
}
return ret;
}
ll lower_bound(ll key) {
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && tree_dat[left + i - 1] < key) {
key -= tree_dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. 10101 -> 10110
itr2. 10110 -> 11000
itr3. 11000 -> 100000 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
tree_dat[j] = update_func(val, tree_dat[j]);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vector<bool> visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
static vector<type> evaluate(const vector<type> &value) {
const ll n = value.size();
vl L(n + 1, 1), R(n + 1, 1);
rep(i, n) L[i + 1] = (L[i] * value[i]) % MOD;
revrep(i, n) R[i] = (R[i + 1] * value[i]) % MOD;
vl ret(n);
/*
ret[i] = v[c0] * v[c1] * ... * v[ci-1] * v[ci+1] * ... * v[cn-1]
ci: the i-th child
Let's consider the case where the root of a given tree is 0. (0-indexed)
Here, we try to obtain the objective values for the edges from children to
parent. When we change the root of the tree into another, the parent node
here also changes the family structure. Since each node has ONLY one parent
and zero or one or multiple children, the value for edge on child i to
source is obtained using the value from source to child j. Here j is all the
integers which is not i.
In this case, child i is grandparent of child j for all j and
the computation for the value from child i to source is O(N) when we use
cumulative sum or product.
*/
rep(i, n) ret[i] = (L[i] * R[i + 1]) % MOD;
return ret;
}
static type merge(const vector<type> &value) {
ll ret;
for (auto &&v : value) {
}
return ret;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll comb_memo[55][55];
ll pascal_triangle(ll n) {
comb_memo[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb_memo[i][j] += comb_memo[i - 1][j];
if (j > 0)
comb_memo[i][j] += comb_memo[i - 1][j - 1];
}
}
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
ll combination_memo(ll n, ll r, ll pre, ll mod) {
// pre = nCr-1
// return nCr
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = ll(n - r + 1) % mod;
ll denomenator = modinv(r, mod) % mod;
ll val = (numerator * denomenator) % mod;
val *= pre;
return val % mod;
}
ll combination_no_mod(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
numerator *= n - i;
denomenator *= i + 1;
ll g = gcd(numerator, denomenator);
numerator /= g;
denomenator /= g;
}
return numerator;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
/*
ll bin_search_temp(ll left, ll right, callable judge){
while(right > left){
// when seeking lower bound
ll mid = (right + left) / 2;
if (judge(mid)) right = mid;
else left = mid + 1;
// when seeking upper bound
ll mid = (right + left + 1) / 2;
if (judge(mid)) left = mid;
else right = mid - 1;
}
return right;
}
trinary_search
// Care the value EPS!!! Compare to the condition
ld left = 0; ld right = p;
while(abs(right - left) > EPS){
ld left2 = (2 * left + right) / 3.0;
ld right2 = (left + 2 * right) / 3.0;
ld f1 = tak_func(left2);
ld f2 = tak_func(right2);
if (f1 <= f2) right = right2;
else if (f2 <= f1) left = left2;
}
*/
str bin_expression(ll n, ll dig) {
str s = "";
rep(i, dig) {
s += ltos(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
ll lower_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll bin_search_vector(ll key, vl v, ll left, ll right) {
// return the index idx where v[idx] = key.
// v[left] is start and v[right] is end..
// In other words, v[right], not v[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (v[mid] == key)
return mid;
else if (v[mid] > key)
right = mid - 1;
else if (v[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] < key <= v[N]
// N == -1 if all the elements < key
return lower_bound(all(v), key) - v.begin();
}
ll inf_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] <= key < v[N] <= key + 1
// N == -1 if all the elements <= key
return lower_bound(all(v), key + 1) - v.begin();
}
ll upper_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key < v[N + 1]
// N == -1 if all the elements > key
return upper_bound(all(v), key) - v.begin(); // (- 1)
}
ll sup_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key - 1 < key <= v[N + 1]
// N == -1 if all the elements >= key
return upper_bound(all(v), key - 1) - v.begin() - 1;
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
ll fact_mod(ll n, ll mod) {
if (n == 0)
return 1;
return n * fact_mod(n - 1, mod);
}
/*
void fact_memo(ll n, ll mod){
memo[0] = 1; memoinv[0] = modinv(memo[0], mod);
rep(i, n + 1){
memo[i + 1] = ((i + 1) * memo[i]) % mod;
memo[i + 1] = modinv(memo[i + 1], mod);
}
}
ll nCk(ll n, ll r){
if (n == r && n == 0) return 1;
else if (n <= 0 || r < 0 || r > n) return 0;
ll val = (memo[n] * memoinv[n - r]) % MOD;
val *= memoinv[r];
return val % MOD;
}
*/
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_factorization(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
ll next_combination(ll sub) {
/*
### Attention ###
if k is 0 or 1 and n is 0, it does not work well.
ll n, k; ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
vl z_algorithm(str s) {
ll n = s.length();
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
i1 += i3, i2 -= i3;
}
return res;
}
ll big_number_mod(str s, ll mod) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth) % mod;
val %= mod;
tenth *= 10;
tenth %= mod;
idx++;
}
return val;
}
ll string_to_ll(str s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
str reflected_string(str s) {
str t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> center_2det_of_3points(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll c2x_2 = x2 + x1, c2y_2 = y2 + y1;
ll c3x_2 = x3 + x1, c3y_2 = y3 + y1;
ll b2y = x2 - x1, b2x = -y2 + y1;
ll b3y = x3 - x1, b3x = -y3 + y1;
ll x1_2 = c3x_2 * b3y - c3y_2 * b3x, y1_2 = c2x_2 * b2y - c2y_2 * b2x;
ll det = -b3y * b2x + b3x * b2y;
if (det == 0)
return {{INF, INF}, det};
ll cx_2det = -b2x * x1_2 + b3x * y1_2, cy_2det = -b2y * x1_2 + b3y * y1_2;
return {{cx_2det, cy_2det}, det};
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BIT bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = rank + 1; j < n; j++)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
ll dist[1005], vertex_pre[1005];
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF); // fill(vertex_pre, vertex_pre + n, -1);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, graph[idx].size()){
edge e = graph[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
// vertex_pre[e.to] = idx;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g){
vl path;
for (; g != -1; g = vertex_pre[g]) path.pb(g);
reverse(all(path));
return path;
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
# ABC061D
bool find_negative_cycle(ll goal){
rep(i, n) rep(v, n) rep(k, graph[v].size()){
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost){
dist[e.to] = -INF;
if (goal == -1) return true;
else if (goal == e.to) return true;
}
}
return false;
}
bool bellman_ford(ll start, ll n, ll goal){
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal
!= -1) fill(dist, dist + n, INF); dist[start] = 0; rep(i, n) rep(v, n) rep(k,
graph[v].size()){ edge e = graph[v][k]; if (dist[v] != INF && dist[e.to] >
dist[v] + e.cost) dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(goal)) return false;
return true;
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
sort(a, a + 8);
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 3. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = power_normal(base, n);
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 4. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#5. shakutori method (syakutori)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
r = max(r, l);
if (l == r) r++;
while(r < n && cond) r++;
answer += r - l; l++;
}
prl(answer);
#6. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#7. The shortest path (distance) between the k-th edge and another edge
(Tree) ll depth[MAX_N]; gr tree[MAX_N];
void dfs(ll source, ll parent, ll all_cost){
depth[source] = all_cost;
items(e, tree[source]){
if (e.to == parent) continue;
dfs(e.to, source, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
rep(i, m){ll res = n % match[i].e1;}
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D, ABC007C
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = G[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = G[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
#12. grid to distance matrix (dx, dy)
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
pl idx_to_pos(ll idx){
return mp(idx % w, idx / w);
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) dist[i1][i2] = INF * (i1 != i2);
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
// if warshall floyd
dist[idx1][idx2] = 1;
// if dijkstra
// graph[idx1].pb({idx2, 1});
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
}
}
*/
/*
# the operators regarding bit
& (AND), | (OR), ^ (XOR)
- (REVERSE), >> (SMALLER SHIFT)
<< (BIGGER SHIFT)
x1: 0000 0001 0010 0101 0110 0111 0111
x2: xxxx 0001 0011 0100 0101 1000 0110
x1 & x2: 0000 0001 0010 0100 0100 0000 0110
x: 1001 1010 1100 1011 1101 1111
x & - x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
x << y is x * 2 ** y
x >> y is rep(i, y) x = x // 2
####### Attention #######
1 << i and 1LL << i is different. If programs show WA, try switch to this one.
Let S be a bit sequence and i be a non-negative integer
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & -(1 << i) -> S - {i}
__builtin_popcount(S) -> the number of elements in S
S = 0 -> S is an empty set
__builtin_popcountl(i) -> the number of 1 in binary
S = (1 << n) - 1 -> S includes all the elements up to the n-th
#Conditional Operator
condition ? true : false;
#iterator
type declaration: auto
value reference: *itr
increment: itr++
decrement: itr--
substitution of value: *itr = smt
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
bool okay = false;
ll answer = 0;
ll r1, r2, c1, c2;
vl a;
ll facts[MAX_N * 10], inv[MAX_N * 10], facts_inv[MAX_N * 10];
void fact_memo(ll n, ll mod) {
facts[0] = facts[1] = 1;
facts_inv[0] = facts_inv[1] = 1;
inv[1] = 1;
For(i, 2, n + 1) {
facts[i] = (i * facts[i - 1]) % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
facts_inv[i] = facts_inv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % MOD;
val *= facts_inv[r];
return val % MOD;
}
ll func(ll r, ll c) {
ll val = 0;
val += nCk(r + c + 2, c + 1);
val %= MOD;
return val;
}
void solve() {
/*
[i + j]C[i] for r1 <= i <= r2, c1 <= j <= c2
*/
fact_memo(10 * MAX_N, MOD);
answer = func(r2, c2);
answer %= MOD;
answer += MOD - func(r2, c1 - 1);
answer %= MOD;
answer += MOD - func(r1 - 1, c2);
answer %= MOD;
answer += func(r1 - 1, c1 - 1);
answer %= MOD;
prl(answer);
// check negative MOD
// check index flow
// check overwrite of the input variables
}
int main(void) {
in4(r1, c1, r2, c2);
// assert(n <= 400);
solve();
return 0;
}
| #include <algorithm>
#include <bits/stdc++.h>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <iostream>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef long double ld;
using edge = struct {
ll to;
ll cost;
};
using point = struct {
ll x;
ll y;
};
typedef string str;
typedef std::pair<ll, ll> pl;
typedef std::pair<ll, pl> pl3;
typedef std::map<string, ll> msl;
typedef std::map<char, ll> mcl;
typedef std::map<ll, ll> mll;
typedef std::vector<ll> vl;
typedef std::vector<pl> vpl;
typedef std::vector<point> points;
typedef std::vector<pl3> vpl3;
typedef std::priority_queue<ll> pq;
typedef std::priority_queue<ll, vl, greater<ll>>
pql; // priority queue taking from the lower value.
typedef std::vector<edge> gr;
const ll MOD = 1e9 + 7;
const ll N_DIGITS = 60;
// const ll MOD = 998244353;
const ll INF = MOD * MOD;
const long double EPS = 1e-9;
const long double PI = 3.14159265358979323846;
vpl dirs = {
{1, 0}, {0, 1}, {-1, 0}, {0, -1}, // four directions
{1, 1}, {-1, 1}, {-1, -1}, {1, -1}, // diagonal
{0, 0} // self
};
#define rep(i, n) for (ll(i) = 0; (i) < (n); (i)++)
#define revrep(i, n) for (ll(i) = n - 1; (i) >= 0; (i)--)
#define For(i, a, b) for (ll(i) = (a); (i) < (b); (i)++)
#define revFor(i, b, a) for (ll(i) = (b)-1; (i) >= (a); (i)--)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define isUpper(c) ('a' - c > 0)
#define isNum(c) (0 <= (c) - '0' && (c) - '0' <= 9)
#define toLower(c) char((c) + 0x20)
#define toUpper(c) char((c)-0x20)
#define pb push_back
#define mp make_pair
#define pr(a) cout << (a)
#define prl(a) cout << (a) << endl
#define prl2(a, b) cout << (a) << " " << (b) << endl
#define prl3(a, b, c) cout << (a) << " " << (b) << " " << (c) << endl
#define prl4(a, b, c, d) \
cout << (a) << " " << (b) << " " << (c) << " " << (d) << endl
#define prs(a) cout << (a) << " "
#define yn(condition) \
if ((condition)) \
prl("Yes"); \
else \
prl("No");
#define YN(condition) \
if ((condition)) \
prl("YES"); \
else \
prl("NO");
#define in1(a) cin >> (a)
#define in2(a, b) cin >> (a) >> (b)
#define in3(a, b, c) cin >> (a) >> (b) >> (c)
#define in4(a, b, c, d) cin >> (a) >> (b) >> (c) >> (d)
#define e1 first
#define e2 second
#define ctol(c) ll((c)) - ll('0')
#define ltos(n) to_string((n))
#define items(kv, v) for (auto &(kv) : (v))
#define ndig(N, n) ctol(ll(ltos((N))[ll(ltos((N)).length()) - (n)]))
#define rsort(a, n) sort(a, a + n, greater<>())
#define Forchar(c, a, z) for (char(c) = (a); (c) <= (z); (c)++)
#define cntchar(s, c) count(all((s)), c)
#define substring(s, start, end) s.substr((start), (end) - (start) + 1)
#define prl_nd(num, digits) \
cout << fixed << setprecision(digits) << (num) << endl;
#define XOR(a, b) (a) ^ (b)
#define prl_time(s) \
prl3("Elapsed Time:", 1000.0 * (clock() - s) / CLOCKS_PER_SEC, "[ms]");
#define char_to_str(c) string(1, (c))
#define DEBUG(x) cerr << #x << ": " << (x) << endl
#define DEBUG_VEC(v) \
cerr << #v << ": "; \
rep(__i, (v).size()) cerr << ((v)[__i]) << ", "; \
cerr << endl
struct MaxFlow {
struct F_edge {
ll to, rev, capacity;
F_edge(ll to, ll rev, ll capacity) : to(to), rev(rev), capacity(capacity) {}
};
typedef vector<F_edge> F_edges;
vector<F_edges> graph;
ll n_vertex;
// level is the shortest path to get a given node from the source node.
vl level, iter;
MaxFlow(ll n_vertex) : n_vertex(n_vertex) { graph.resize(n_vertex); }
void add_edge(ll from, ll to, ll capacity) {
graph[from].pb({to, ll(graph[to].size()), capacity});
graph[to].pb({from, ll(graph[from].size()) - 1, 0});
}
void bfs(ll source) {
level = vl(n_vertex, -1);
level[source] = 0;
queue<ll> q;
q.push(source);
while (!q.empty()) {
ll vertex = q.front();
q.pop();
rep(i, graph[vertex].size()) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
// if the flow can be into the target node, implement below.
if (cap_target > 0 && level[target] < 0) {
level[target] = level[vertex] + 1;
q.push(target);
}
}
}
}
ll dfs(ll vertex, ll sink, ll flow) {
if (vertex == sink)
return flow;
for (ll &i = iter[vertex]; i < graph[vertex].size(); i++) {
ll target = graph[vertex][i].to;
ll cap_target = graph[vertex][i].capacity;
ll rev_target = graph[vertex][i].rev;
// if capasitiy is not full yet and target is farther,
// then assign current flow
if (cap_target > 0 && level[vertex] < level[target]) {
ll d = dfs(target, sink, min(cap_target, flow));
if (d > 0) { // if the flow successfully reaches the sink, reduce the
// flow from the capacity
graph[vertex][i].capacity -= d;
graph[target][rev_target].capacity += d;
return d;
}
}
}
return 0;
}
ll dinic(ll source, ll sink) {
ll flow = 0;
while (true) {
bfs(source);
// if there is no path leading to the sink, the maximum flow is 0.
if (level[sink] < 0)
return flow;
iter = vl(n_vertex, 0);
ll f;
while ((f = dfs(source, sink, INF)) > 0)
flow += f;
}
}
};
class UnionFind {
vl parents, set_size;
public:
UnionFind() {}
UnionFind(ll n) {
parents = set_size = vl(n);
rep(i, n) {
parents[i] = i;
set_size[i] = 1LL;
}
}
ll root_find(ll x) {
if (parents[x] == x)
return x;
return parents[x] = root_find(parents[x]);
}
void unite(ll x, ll y) {
x = root_find(x);
y = root_find(y);
if (x == y)
return;
if (set_size[x] < set_size[y]) {
parents[y] = x;
set_size[x] += set_size[y];
} else {
parents[x] = y;
set_size[y] += set_size[x];
}
}
bool is_same(ll x, ll y) { // connected or not
return root_find(x) == root_find(y);
}
ll size(ll x) { return set_size[root_find(x)]; }
};
/*
class LCA{
public:
ll N, logN;
vl depth, len;
gr tree[200005]; // global declaration later.
vector<vl> parents;
LCA(ll n){
N = n;
logN = 0;
while (N > (1LL << logN)) logN++;
depth = vl(N); len = vl(N);
parents = vector<vl>(logN, vl(N));
init(0, -1, 0, 0);
build();
}
void init(ll source, ll parent, ll d, ll l){
depth[source] = d;
parents[0][source] = parent;
len[source] = l;
rep(i, tree[source].size()){
ll target = tree[source][i].to;
ll cost = tree[source][i].cost;
if (target == parent) continue;
init(target, source, d + 1, cost + l);
}
}
void build(){
rep(k, logN - 1) rep(n, N){
// if there is no parent, -1.
// otherwise, the parent of the parent is the parent.
if (parents[k][n] < 0) parents[k + 1][n] = -1;
else parents[k + 1][n] = parents[k][parents[k][n]];
}
}
ll query(ll u, ll v){
if (depth[u] > depth[v]) swap(u, v);
rep(k, logN) if ((depth[v] - depth[u]) >> k & 1) v = parents[k][v];
if (u == v) return u;
revrep(k, logN){
if (parents[k][u] != parents[k][v]){
u = parents[k][u]; v = parents[k][v];
}
}
return parents[0][u];
}
ll distance(ll u, ll v){
ll w = query(u, v);
return len[u] + len[v] - 2 * len[w];
}
};
*/
struct BIT {
ll n;
vl tree_dat;
BIT(ll n) : tree_dat(n + 1, 0), n(n){};
// x: 1001 1010 1100 1011 1101 1111
// x & - x: 0001 0010 0100 0001 0001 0001
// ->: 1010 1100 10000 1100 1100 10000
ll update_func(ll val, ll dat) {
// if maximum -> max(val, dat)
// return max(val, dat);
// if cumulative sum
return val + dat;
}
ll query(ll i) {
/*
e.g.) i = 10101
itr1. 10101 -> 10100
itr2. 10100 -> 10000
itr3. 10000 -> 00000 (break)
*/
ll ret = 0;
for (ll j = i; j >= 0; j = (j & (j + 1)) - 1) {
ret = update_func(ret, tree_dat[j]);
}
return ret;
}
ll lower_bound(ll key) {
if (key <= 0)
return 0;
ll left = 0, right = 1;
while (right <= n)
right *= 2;
for (ll i = right; i > 0; i /= 2) {
if (left + i <= n && tree_dat[left + i - 1] < key) {
key -= tree_dat[left + i - 1];
left += i;
}
}
return left;
}
void update(ll i, ll val) {
/*
e.g.) i = 10101, n = 11111
itr1. 10101 -> 10110
itr2. 10110 -> 11000
itr3. 11000 -> 100000 (break)
*/
if (i < 0)
return;
for (ll j = i; j < n; j |= j + 1) {
tree_dat[j] = update_func(val, tree_dat[j]);
}
}
};
template <class Target> class RerootingTreeDP {
public:
using T = typename Target::type;
struct DP_edge {
ll to, rev; // rev is the index to trace the source node.
T value; // objective value
};
private:
ll n;
void dfs_fwd(ll source, ll parent) {
ll par_idx = -1;
vector<T> values;
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent) {
par_idx = i;
continue;
}
dfs_fwd(e.to, source);
values.pb(e.value);
}
// If the parent != -1, update the value on edge from parent to source
if (par_idx != -1) {
ll src_idx = tree[source][par_idx].rev;
// update values on the edge from parent to source
tree[parent][src_idx].value = Target::merge(values);
}
}
void dfs_bwd(ll source, ll parent) {
vector<T> values;
for (auto &&e : tree[source])
values.pb(e.value);
values = Target::evaluate(values);
rep(i, tree[source].size()) {
const DP_edge &e = tree[source][i];
if (e.to == parent)
continue;
// tree[e.to][e.rev]: e.to -> source
tree[e.to][e.rev].value = values[i];
dfs_bwd(e.to, source);
}
}
public:
UnionFind uf;
vector<vector<DP_edge>> tree;
RerootingTreeDP(ll n) : n(n), uf(n), tree(n) {}
void add_edge(ll u, ll v, T val) {
assert(!uf.is_same(u, v));
tree[u].pb({v, ll(tree[v].size()), val});
tree[v].pb({u, ll(tree[u].size()) - 1, val});
uf.unite(u, v);
}
void dp() {
vector<bool> visited(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_fwd(i, -1);
visited[uf.root_find(i)] = true;
}
visited.assign(n, false);
rep(i, n) {
if (visited[uf.root_find(i)])
continue;
dfs_bwd(i, -1);
visited[uf.root_find(i)] = true;
}
}
ll size() const { return tree.size(); }
};
// ABC160F is one example
// Modify the functions evaluate and merge based on given problems
struct Merger {
using type = ll;
static vector<type> evaluate(const vector<type> &value) {
const ll n = value.size();
vl L(n + 1, 1), R(n + 1, 1);
rep(i, n) L[i + 1] = (L[i] * value[i]) % MOD;
revrep(i, n) R[i] = (R[i + 1] * value[i]) % MOD;
vl ret(n);
/*
ret[i] = v[c0] * v[c1] * ... * v[ci-1] * v[ci+1] * ... * v[cn-1]
ci: the i-th child
Let's consider the case where the root of a given tree is 0. (0-indexed)
Here, we try to obtain the objective values for the edges from children to
parent. When we change the root of the tree into another, the parent node
here also changes the family structure. Since each node has ONLY one parent
and zero or one or multiple children, the value for edge on child i to
source is obtained using the value from source to child j. Here j is all the
integers which is not i.
In this case, child i is grandparent of child j for all j and
the computation for the value from child i to source is O(N) when we use
cumulative sum or product.
*/
rep(i, n) ret[i] = (L[i] * R[i + 1]) % MOD;
return ret;
}
static type merge(const vector<type> &value) {
ll ret;
for (auto &&v : value) {
}
return ret;
}
};
ll gcd(ll m, ll n) {
ll a = max(m, n);
ll b = min(m, n);
while (b != 1 && b != 0) {
a %= b;
swap(a, b);
}
return b == 1 ? 1 : a;
}
ll lcm(ll m, ll n) { return m / gcd(m, n) * n; }
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
ll power_mod(ll a, ll power, ll mod) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = (value * a) % mod;
a = (a * a) % mod;
power = power >> 1;
}
return value % mod;
}
ll modinv(ll a, ll mod) { return power_mod(a, mod - 2, mod); }
ll power_normal(ll a, ll power) {
ll value = 1;
while (power != 0) {
if (power & 1)
value = value * a;
a = a * a;
power = power >> 1;
}
return value;
}
ll comb_memo[55][55];
ll pascal_triangle(ll n) {
comb_memo[0][0] = 1;
For(i, 1, n + 1) rep(j, i + 1) {
comb_memo[i][j] += comb_memo[i - 1][j];
if (j > 0)
comb_memo[i][j] += comb_memo[i - 1][j - 1];
}
}
ll combination(ll n, ll r, ll mod) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
ll num = (n - i) % mod, den = (i + 1) % mod;
(numerator *= num) %= mod;
(denomenator *= modinv(den, mod)) %= mod;
}
return (numerator * denomenator) % mod;
}
ll combination_memo(ll n, ll r, ll pre, ll mod) {
// pre = nCr-1
// return nCr
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = ll(n - r + 1) % mod;
ll denomenator = modinv(r, mod) % mod;
ll val = (numerator * denomenator) % mod;
val *= pre;
return val % mod;
}
ll combination_no_mod(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll numerator = 1;
ll denomenator = 1;
for (ll i = 0; i < r; i++) {
numerator *= n - i;
denomenator *= i + 1;
ll g = gcd(numerator, denomenator);
numerator /= g;
denomenator /= g;
}
return numerator;
}
ld log_combination(ll n, ll r) {
if (n == r && n == 0)
return 0;
else if (n <= 0 || r < 0 || r > n)
return -INF;
ld val = 0;
for (ll i = 0; i < r; i++) {
val += log(n - i);
val -= log(i + 1);
}
return val;
}
ll bin_search(ll key, ll A[], ll left, ll right) {
// return the index idx where A[idx] = key.
// A[left] is start and A[right] is end..
// In other words, A[right], not A[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (A[mid] == key)
return mid;
else if (A[mid] > key)
right = mid - 1;
else if (A[mid] < key)
left = mid + 1;
}
return -1;
}
/*
ll bin_search_temp(ll left, ll right, callable judge){
while(right > left){
// when seeking lower bound
ll mid = (right + left) / 2;
if (judge(mid)) right = mid;
else left = mid + 1;
// when seeking upper bound
ll mid = (right + left + 1) / 2;
if (judge(mid)) left = mid;
else right = mid - 1;
}
return right;
}
trinary_search
// Care the value EPS!!! Compare to the condition
ld left = 0; ld right = p;
while(abs(right - left) > EPS){
ld left2 = (2 * left + right) / 3.0;
ld right2 = (left + 2 * right) / 3.0;
ld f1 = tak_func(left2);
ld f2 = tak_func(right2);
if (f1 <= f2) right = right2;
else if (f2 <= f1) left = left2;
}
*/
str bin_expression(ll n, ll dig) {
str s = "";
rep(i, dig) {
s += ltos(n % 2);
n /= 2;
}
reverse(all(s));
return s;
}
ll lower_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] >= key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] < key && key <= A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] < key && key <= A[mid])
return mid;
else if (A[mid - 1] >= key)
right = mid - 1;
else if (A[mid] < key)
left = mid;
}
return -1; // all the elements < key
}
ll inf_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value right instead of -1.
if (A[left] > key)
return left;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == left) {
if (A[left] <= key && key < A[left + 1])
return left + 1;
else
return -1;
}
if (A[mid - 1] <= key && key < A[mid])
return mid;
else if (A[mid - 1] > key)
right = mid - 1;
else if (A[mid] <= key)
left = mid;
}
return -1; // all the elements <= key
}
ll upper_bound_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] <= key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] <= key && key < A[right])
return right - 1;
else
return -1;
}
if (A[mid] <= key && key < A[mid + 1])
return mid;
else if (A[mid] > key)
right = mid;
else if (A[mid + 1] <= key)
left = mid + 1;
}
return -1; // all the elements > key
}
ll sup_bin_search_temp(ll key, ll A[], ll left, ll right) {
// Pay attention to the return value -1.
// For example, sometimes you may want the value left instead of -1.
if (A[right] < key)
return right;
ll mid = left + (right - left) / 2;
while (right >= left) {
mid = left + (right - left) / 2;
if (mid == right) {
if (A[right - 1] < key && key <= A[right])
return right - 1;
else
return -1;
}
if (A[mid] < key && key <= A[mid + 1])
return mid;
else if (A[mid] >= key)
right = mid;
else if (A[mid + 1] < key)
left = mid + 1;
}
return -1; // all the elements >= key
}
ll bin_search_vector(ll key, vl v, ll left, ll right) {
// return the index idx where v[idx] = key.
// v[left] is start and v[right] is end..
// In other words, v[right], not v[right - 1], must be defined.
while (right >= left) {
ll mid = left + (right - left) / 2;
if (v[mid] == key)
return mid;
else if (v[mid] > key)
right = mid - 1;
else if (v[mid] < key)
left = mid + 1;
}
return -1;
}
ll lower_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] < key <= v[N]
// N == -1 if all the elements < key
return lower_bound(all(v), key) - v.begin();
}
ll inf_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N - 1] <= key < v[N] <= key + 1
// N == -1 if all the elements <= key
return lower_bound(all(v), key + 1) - v.begin();
}
ll upper_bound_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key < v[N + 1]
// N == -1 if all the elements > key
return upper_bound(all(v), key) - v.begin(); // (- 1)
}
ll sup_bin_search_vector(ll key, vl v) {
// the return value N satisfies
// v[N] <= key - 1 < key <= v[N + 1]
// N == -1 if all the elements >= key
return upper_bound(all(v), key - 1) - v.begin() - 1;
}
ll fact(ll n) {
if (n == 0)
return 1;
return n * fact(n - 1);
}
ll fact_mod(ll n, ll mod) {
if (n == 0)
return 1;
return n * fact_mod(n - 1, mod);
}
/*
void fact_memo(ll n, ll mod){
memo[0] = 1; memoinv[0] = modinv(memo[0], mod);
rep(i, n + 1){
memo[i + 1] = ((i + 1) * memo[i]) % mod;
memo[i + 1] = modinv(memo[i + 1], mod);
}
}
ll nCk(ll n, ll r){
if (n == r && n == 0) return 1;
else if (n <= 0 || r < 0 || r > n) return 0;
ll val = (memo[n] * memoinv[n - r]) % MOD;
val *= memoinv[r];
return val % MOD;
}
*/
bool is_prime(ll n) {
if (n <= 1)
return false;
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0)
return false;
}
return true;
}
ll bool_sum(ll a1, ll a2) {
if (a1 == 1 || a2 == 1)
return 1;
return 0;
}
mll prime_factorization(ll n) {
ll i = 2;
mll table;
while (i * i <= n) {
while (n % i == 0) {
table[i]++;
n /= i;
}
i++;
}
if (n > 1)
table[n] = 1;
return table;
}
vl divisor_table(ll n) {
vl table;
ll i = 1;
while (i * i <= n) {
if (n % i == 0) {
table.pb(i);
if (i * i != n)
table.pb(n / i);
}
i++;
}
sort(all(table));
return table;
}
ll char_to_idx(char c) {
ll idx = 0;
Forchar(cc, 'a', 'z') {
if (c == cc)
return idx;
else
idx++;
}
}
ll next_combination(ll sub) {
/*
### Attention ###
if k is 0 or 1 and n is 0, it does not work well.
ll n, k; ll bit = (1 << k) - 1;
for (; bit < (1 << n); bit = next_combination(bit)){
bool ith = bit & (1 << i);
procedures...
}
sub & -sub: the binary which shares the last digit whose value is 1 in sub
sub + x : carry up the last digit
~y : the binary whose digits are 1 if y's digit is 0.
(sub & ~y) / x: reduce the same number of 0s after first 1 in x from (sub &
~y).
*/
ll x = sub & -sub, y = sub + x;
return (((sub & ~y) / x) >> 1) | y;
}
vl z_algorithm(str s) {
ll n = s.length();
vl res(n);
res[0] = n;
ll i1 = 1, i2 = 0;
while (i1 < n) {
while (i1 + i2 < n && s[i2] == s[i1 + i2])
++i2;
res[i1] = i2;
if (i2 == 0) {
++i1;
continue;
}
ll i3 = 1;
while (i1 + i3 < n && i3 + res[i3] < i2) {
res[i1 + i3] = res[i3];
++i3;
}
i1 += i3, i2 -= i3;
}
return res;
}
ll big_number_mod(str s, ll mod) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth) % mod;
val %= mod;
tenth *= 10;
tenth %= mod;
idx++;
}
return val;
}
ll string_to_ll(str s) {
ll l = s.length();
ll idx = 0;
ll val = 0;
ll tenth = 1;
while (idx < l) {
ll m = ctol(s[l - 1 - idx]);
val += (m * tenth);
tenth *= 10;
idx++;
}
return val;
}
str reflected_string(str s) {
str t, u;
ll n = s.length();
t = s;
reverse(all(t));
u = substring(t, 0, n - 2) + s + substring(t, 1, n - 1);
return u;
}
ld distance_between_point_line(point l_begin, point l_end, point p) {
ll xl1 = l_begin.x, yl1 = l_begin.y;
ll xl2 = l_end.x, yl2 = l_end.y;
ll xp = p.x, yp = p.y;
ll a = yl2 - yl1;
ll b = -xl2 + xl1;
ll c = -a * xl2 - b * yl2;
return abs(ld(a * xp + b * yp + c)) / ld(sqrt(a * a + b * b));
}
bool is_cross(point l1_begin, point l1_end, point l2_begin, point l2_end) {
ll x1 = l1_begin.x, y1 = l1_begin.y;
ll x2 = l1_end.x, y2 = l1_end.y;
ll x3 = l2_begin.x, y3 = l2_begin.y;
ll x4 = l2_end.x, y4 = l2_end.y;
ll val1 = (x1 - x2) * (y3 - y1) + (y1 - y2) * (x1 - x3);
ll val2 = (x1 - x2) * (y4 - y1) + (y1 - y2) * (x1 - x4);
ll val3 = (x3 - x4) * (y1 - y3) + (y3 - y4) * (x3 - x1);
ll val4 = (x3 - x4) * (y2 - y3) + (y3 - y4) * (x3 - x2);
return val1 * val2 < 0 && val3 * val4 < 0;
}
ld space_of_triangle(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll v1 = x2 - x1;
ll u1 = y2 - y1;
ll v2 = x3 - x1;
ll u2 = y3 - y1;
ld s = ld(v1 * u2 - u1 * v2) / ld(2);
return abs(s);
}
pair<point, ll> center_2det_of_3points(point p1, point p2, point p3) {
ll x1 = p1.x, y1 = p1.y;
ll x2 = p2.x, y2 = p2.y;
ll x3 = p3.x, y3 = p3.y;
ll c2x_2 = x2 + x1, c2y_2 = y2 + y1;
ll c3x_2 = x3 + x1, c3y_2 = y3 + y1;
ll b2y = x2 - x1, b2x = -y2 + y1;
ll b3y = x3 - x1, b3x = -y3 + y1;
ll x1_2 = c3x_2 * b3y - c3y_2 * b3x, y1_2 = c2x_2 * b2y - c2y_2 * b2x;
ll det = -b3y * b2x + b3x * b2y;
if (det == 0)
return {{INF, INF}, det};
ll cx_2det = -b2x * x1_2 + b3x * y1_2, cy_2det = -b2y * x1_2 + b3y * y1_2;
return {{cx_2det, cy_2det}, det};
}
ll inversion_number(vl a, ll a_max) {
/*
Paramters
---------
a: vector<ll>
All the elements must be non-negative.
Prefably the elements are compressed to reduce the computational cost.
a_max: ll
The maximum value of the vector a or the value bigger than the value
stated previously.
*/
BIT bit(a_max + 1);
ll val = 0;
rep(i, a.size()) {
// i is the number of elements that have lower index than a[i].
// call the number of elements that have lower value than a[i]
// by subtracting these two, the residual number is the number of elements
// that have larger value
val += i - bit.query(a[i] - 1); // cumulative sum from 0 to a[i] - 1
bit.update(a[i], 1);
}
return val;
}
template <typename T> vector<T> compress(vector<T> v) {
// sort and remove all the duplicated values
sort(all(v));
v.erase(unique(all(v)), v.end());
return v;
}
template <typename T> map<T, ll> dict(const vector<T> &v) {
map<T, ll> d;
rep(i, v.size()) d[v[i]] = i;
return d;
}
void GaussJordanBitVector(vl &bs) {
ll n = bs.size();
ll rank = 0;
ll j = 0;
revrep(i, N_DIGITS) {
for (j = rank; j < n; j++)
if (bs[j] & (1LL << i))
break;
if (j == n)
continue;
if (j > rank)
bs[rank] ^= bs[j];
for (j = rank + 1; j < n; j++)
bs[j] = min(bs[j], bs[j] ^ bs[rank]);
rank++;
}
}
/*
const ll N_VERTEX = 310;
ll a, b, t;
ll dist[N_VERTEX][N_VERTEX];
void warshall_floyd(ll n){
// rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(k, n) rep(i, n) rep(j, n) dist[i][j] = min(dist[i][j], dist[i][k] +
dist[k][j]);
}
int main(void){
in2(n, m);
rep(i, n) rep(j, n) dist[i][j] = INF * (i != j);
rep(i, m){
in3(a, b, t);
a--; b--;
dist[a][b] = t;
dist[b][a] = t;
}
warshall_floyd(n);
}
ll dist[1005], vertex_pre[1005];
void dijkstra(ll start, ll n) {
priority_queue<pl, vector<pl>, greater<pl>> edge_costs;
fill(dist, dist + n, INF); // fill(vertex_pre, vertex_pre + n, -1);
dist[start] = 0;
edge_costs.push(pl(0, start));
while (!edge_costs.empty()) {
pl edge_cost = edge_costs.top();
edge_costs.pop();
ll idx = edge_cost.second;
ll cost = edge_cost.first;
if (dist[idx] < cost) continue;
rep(i, graph[idx].size()){
edge e = graph[idx][i];
if (dist[e.to] > dist[idx] + e.cost){
dist[e.to] = dist[idx] + e.cost;
// vertex_pre[e.to] = idx;
edge_costs.push(pl(dist[e.to], e.to));
}
}
}
}
vl get_predecessor(ll g){
vl path;
for (; g != -1; g = vertex_pre[g]) path.pb(g);
reverse(all(path));
return path;
}
int main(void){
in2(n, m);
rep(i, m){
in3(a, b, t);
a--; b--;
G[a].pb({b, t});
G[b].pb({a, t});
}
dijkstra(0, n);
}
# ABC061D
bool find_negative_cycle(ll goal){
rep(i, n) rep(v, n) rep(k, graph[v].size()){
edge e = graph[v][k];
if (dist[e.to] != INF && dist[e.to] > dist[v] + e.cost){
dist[e.to] = -INF;
if (goal == -1) return true;
else if (goal == e.to) return true;
}
}
return false;
}
bool bellman_ford(ll start, ll n, ll goal){
// if there is a closed circuit, it returns false. (when goal == -1)
// if the distance to goal cannot be obtained, it returns false (when goal
!= -1) fill(dist, dist + n, INF); dist[start] = 0; rep(i, n) rep(v, n) rep(k,
graph[v].size()){ edge e = graph[v][k]; if (dist[v] != INF && dist[e.to] >
dist[v] + e.cost) dist[e.to] = dist[v] + e.cost;
}
if (find_negative_cycle(goal)) return false;
return true;
}
*/
/*
# 1. The usage of map pair
map<pl, ll> cnt;
cnt[{i, j}] = 0;
items(kv, cnt){
prl2(kv.first, kv.second);
}
# 2. The usage of next_permutation and combination (factorial search)
ll a[8];
rep(i, 8) a[i] = i;
sort(a, a + 8);
do{
}while(next_permutation(a, a+n));
// here, combination
ll n, r;
ll i1, i2, ..., ir;
For(i1, n - r, n) For(i2, n - r - 1, i1) ... For(ir, n - 2 * r + 1, irr){
process;}
# 3. bit search
ll n;
in1(n);
const ll base = 3;
ll upper = power_normal(base, n);
rep(i, upper){
ll tmp = i;
rep(j, n){
rep(k, base) if (tmp % base == k) prl(k);
tmp /= base;
}
}
# 4. imos method
// used when we would like to count the number which
// shows how many times the numbers between l and r belongs to smt.
// This method is composed of three process.
ll n, m, s[MAX_M], l, r;
in2(n, m);
rep(i, m) s[i] = 0;
// 1st step
rep(i, n){
in3(l, r, c);
l--; r--; // if l starts from 1.
s[l] += c; s[r + 1] -= c;
}
// 2nd step
rep(i, m - 1) s[i + 1] += s[i];
// 3rd step: judgement...
#5. shakutori method (syakutori)
// 1. strech right side while the condition is met.
// 2. renew the answer
// 3. increments left side
// 4. Back to 1. (l <= r must be satisfied all the time.)
ll l = 0; ll r = 0;
while (l < n){
r = max(r, l);
if (l == r) r++;
while(r < n && cond) r++;
answer += r - l; l++;
}
prl(answer);
#6. priority queue
pq q;
ll answer = 0;
ll v;
rep(i, n) q.push(a[i]);
rep(i, m){
v = q.top(); q.pop(); // get the top value and dump the value from queue
v /= 2; q.push(v); // add the new value
}
while(!q.empty()){
answer += q.top();
q.pop();
}
#7. The shortest path (distance) between the k-th edge and another edge
(Tree) ll depth[MAX_N]; gr tree[MAX_N];
void dfs(ll source, ll parent, ll all_cost){
depth[source] = all_cost;
items(e, tree[source]){
if (e.to == parent) continue;
dfs(e.to, source, all_cost + e.cost);
}
}
ll n, k, a, b, c;
in2(n, k);
rep(i, n - 1){
in3(a, b, c);
a--; b--;
tree[a].pb({b, c});
tree[b].pb({a, c});
}
k--;
dfs(k, -1, 0);
#10. Visiting Subtree using recurrent function (ABC138D)
gr tree[MAX_N];
ll c[MAX_N];
bool visited[MAX_N];
void dfs(ll source, ll parent, ll val){
visited[source] = true;
c[source] += val;
rep(i, tree[source].size()){
rep(i, m){ll res = n % match[i].e1;}
ll vertex = tree[source][i].to;
if (vertex == parent) continue;
dfs(vertex, source, c[source]);
}
}
#11. bfs ABC146D, ABC007C
1. first create a tree.
2. start searching from a node.
3. do some processes and push nodes connected with a given target node in
BFS.
4. repeat a series of procedure until queue is empty.
queue<pl> q;
void bfs(ll source, ll parents){
ll n_edge = G[source].size();
if (parents != -1) dist[source] = min(dist[source], dist[parents] + 1);
if (visited[source]) return;
visited[source] = true;
rep(idx, n_edge){
ll target = G[source][idx].to;
if (target == parents) continue;
q.push(mp(target, source));
}
}
q.push(mp(sg.e1, -1));
while(!q.empty()){
pl source = q.front(); q.pop();
bfs(source.e1, source.e2);
}
#12. grid to distance matrix (dx, dy)
ll w, h;
ll pos_to_idx(ll x, ll y){
return y * w + x;
}
pl idx_to_pos(ll idx){
return mp(idx % w, idx / w);
}
int main(void){
in2(h, w);
rep(y, h){
in1(s);
rep(x, w){
if (s[x] == '#') wall[x][y] = true;
else wall[x][y] = false;
}
}
rep(i1, h * w)rep(i2, h * w) dist[i1][i2] = INF * (i1 != i2);
rep(x, w)rep(y, h){
ll idx1 = pos_to_idx(x, y); ll idx2;
if (wall[x][y]) continue;
if (x != 0 && !wall[x - 1][y]){
idx2 = pos_to_idx(x - 1, y);
// if warshall floyd
dist[idx1][idx2] = 1;
// if dijkstra
// graph[idx1].pb({idx2, 1});
}
if (x != w - 1 && !wall[x + 1][y]){
idx2 = pos_to_idx(x + 1, y);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != 0 && !wall[x][y - 1]){
idx2 = pos_to_idx(x, y - 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
if (y != h - 1 && !wall[x][y + 1]){
idx2 = pos_to_idx(x, y + 1);
dist[idx1][idx2] = 1;
// graph[idx1].pb({idx2, 1});
}
}
}
*/
/*
# the operators regarding bit
& (AND), | (OR), ^ (XOR)
- (REVERSE), >> (SMALLER SHIFT)
<< (BIGGER SHIFT)
x1: 0000 0001 0010 0101 0110 0111 0111
x2: xxxx 0001 0011 0100 0101 1000 0110
x1 & x2: 0000 0001 0010 0100 0100 0000 0110
x: 1001 1010 1100 1011 1101 1111
x & - x: 0001 0010 0100 0001 0001 0001
sum: 1010 1100 10000 1100 1100 10000
x << y is x * 2 ** y
x >> y is rep(i, y) x = x // 2
####### Attention #######
1 << i and 1LL << i is different. If programs show WA, try switch to this one.
Let S be a bit sequence and i be a non-negative integer
S & (1 << i) -> if true, i in S
S | (1 << i) -> S union {i}
S & -(1 << i) -> S - {i}
__builtin_popcount(S) -> the number of elements in S
S = 0 -> S is an empty set
__builtin_popcountl(i) -> the number of 1 in binary
S = (1 << n) - 1 -> S includes all the elements up to the n-th
#Conditional Operator
condition ? true : false;
#iterator
type declaration: auto
value reference: *itr
increment: itr++
decrement: itr--
substitution of value: *itr = smt
# inclusion-exclusion principle
|U[i = 1 to n] Ai| = sum[i = 1 to n] |Ai| - sum[i < j]|Ai ^ Aj| + ... + (-1)^(n
- 1) |^[i = 1 to n]Ai|
*/
const ll MAX_N = 200005;
bool okay = false;
ll answer = 0;
ll r1, r2, c1, c2;
vl a;
ll facts[MAX_N * 10], inv[MAX_N * 10], facts_inv[MAX_N * 10];
void fact_memo(ll n, ll mod) {
facts[0] = facts[1] = 1;
facts_inv[0] = facts_inv[1] = 1;
inv[1] = 1;
For(i, 2, n + 1) {
facts[i] = (i * facts[i - 1]) % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
facts_inv[i] = facts_inv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll r) {
if (n == r && n == 0)
return 1;
else if (n <= 0 || r < 0 || r > n)
return 0;
ll val = (facts[n] * facts_inv[n - r]) % MOD;
val *= facts_inv[r];
return val % MOD;
}
ll func(ll r, ll c) {
ll val = 0;
val += nCk(r + c + 2, c + 1);
val %= MOD;
return val;
}
void solve() {
/*
[i + j]C[i] for r1 <= i <= r2, c1 <= j <= c2
*/
fact_memo(r2 + c2 + 2, MOD);
answer = func(r2, c2);
answer %= MOD;
answer += MOD - func(r2, c1 - 1);
answer %= MOD;
answer += MOD - func(r1 - 1, c2);
answer %= MOD;
answer += func(r1 - 1, c1 - 1);
answer %= MOD;
prl(answer);
// check negative MOD
// check index flow
// check overwrite of the input variables
}
int main(void) {
in4(r1, c1, r2, c2);
// assert(n <= 400);
solve();
return 0;
}
| replace | 1,470 | 1,471 | 1,470 | 1,471 | 0 | |
p02782 | C++ | Runtime Error | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef vector<vector<P>> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<ll> vec;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
#include <cstdint>
template <long long Modulus> class modint {
long long a;
public:
constexpr modint(const long long x = 0) noexcept
: a((x % Modulus + Modulus) % Modulus) {}
constexpr long long val() 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 {
long long exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
constexpr bool operator==(const modint rhs) const noexcept {
return modint(*this).val() == rhs.val();
}
constexpr bool operator!=(const modint rhs) const noexcept {
return modint(*this).val() != rhs.val();
}
};
using mint = modint<MOD>;
typedef vector<mint> mvec;
typedef vector<vector<mint>> mvvec;
// 二項係数ライブラリ
template <class T> struct BC {
vector<T> fact_, inv_, finv_;
constexpr BC() {}
constexpr BC(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1);
inv_.assign(n, 1);
finv_.assign(n, 1);
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = inv_[MOD % i] * (MOD / i) * (-1);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T nCr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T nPr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[n - k];
}
constexpr T nHr(int n, int k) const noexcept { return nCr(n + k - 1, k); }
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
//---------------------------------------------
int a, b, c, d;
BC<mint> bc(1000000 + 10);
cin >> a >> b >> c >> d;
mint ans = 0;
for (int i = a + 1; i <= c; i++) {
ans += bc.fact(i + d) * bc.finv(i) * bc.finv(d);
}
for (int i = b + 1; i <= d; i++) {
ans += bc.fact(i + c) * bc.finv(i) * bc.finv(c);
}
ans += bc.fact(a + b) * bc.finv(a) * bc.finv(b);
cout << ans.val() << endl;
} | // #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define range(i, a, b) ((a) <= (i) && (i) < (b))
#define debug(x) cout << #x << ' ' << '=' << ' ' << (x) << endl;
#define fs first
#define sc second
#define pb push_back
typedef long long ll;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef priority_queue<ll> PQI;
typedef priority_queue<P> PQP;
typedef vector<vector<P>> pvec;
typedef vector<vector<ll>> vvec;
typedef vector<ll> vec;
const vector<int> dx = {0, -1, 0, 1, 1, 1, -1, -1};
const vector<int> dy = {1, 0, -1, 0, 1, -1, 1, -1};
const int MOD = (1000000007);
// const int MOD = (998244353);
// const int INF = (1 << 30);
const int INF = (1LL << 60);
const double EPS = (1 >> 30);
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
#include <cstdint>
template <long long Modulus> class modint {
long long a;
public:
constexpr modint(const long long x = 0) noexcept
: a((x % Modulus + Modulus) % Modulus) {}
constexpr long long val() 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 {
long long exp = Modulus - 2;
while (exp) {
if (exp % 2) {
*this *= rhs;
}
rhs *= rhs;
exp /= 2;
}
return *this;
}
constexpr bool operator==(const modint rhs) const noexcept {
return modint(*this).val() == rhs.val();
}
constexpr bool operator!=(const modint rhs) const noexcept {
return modint(*this).val() != rhs.val();
}
};
using mint = modint<MOD>;
typedef vector<mint> mvec;
typedef vector<vector<mint>> mvvec;
// 二項係数ライブラリ
template <class T> struct BC {
vector<T> fact_, inv_, finv_;
constexpr BC() {}
constexpr BC(int n) noexcept : fact_(n, 1), inv_(n, 1), finv_(n, 1) {
init(n);
}
constexpr void init(int n) noexcept {
fact_.assign(n, 1);
inv_.assign(n, 1);
finv_.assign(n, 1);
for (int i = 2; i < n; i++) {
fact_[i] = fact_[i - 1] * i;
inv_[i] = inv_[MOD % i] * (MOD / i) * (-1);
finv_[i] = finv_[i - 1] * inv_[i];
}
}
constexpr T nCr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[k] * finv_[n - k];
}
constexpr T nPr(int n, int k) const noexcept {
if (n < k || n < 0 || k < 0)
return 0;
return fact_[n] * finv_[n - k];
}
constexpr T nHr(int n, int k) const noexcept { return nCr(n + k - 1, k); }
constexpr T fact(int n) const noexcept {
if (n < 0)
return 0;
return fact_[n];
}
constexpr T inv(int n) const noexcept {
if (n < 0)
return 0;
return inv_[n];
}
constexpr T finv(int n) const noexcept {
if (n < 0)
return 0;
return finv_[n];
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
cout << fixed << setprecision(15);
//---------------------------------------------
int a, b, c, d;
BC<mint> bc(2000000 + 10);
cin >> a >> b >> c >> d;
mint ans = 0;
for (int i = a + 1; i <= c; i++) {
ans += bc.fact(i + d) * bc.finv(i) * bc.finv(d);
}
for (int i = b + 1; i <= d; i++) {
ans += bc.fact(i + c) * bc.finv(i) * bc.finv(c);
}
ans += bc.fact(a + b) * bc.finv(a) * bc.finv(b);
cout << ans.val() << endl;
} | replace | 157 | 158 | 157 | 158 | 0 | |
p02782 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 2e6 + 5;
const ll mod = 1e9 + 7;
ll fac[maxn], ifac[maxn];
ll modpow(ll, ll);
ll inv(ll);
ll nck(ll, ll);
void build();
void testlib();
int r1, r2, c1, c2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
build();
testlib();
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (int i = r1; i <= r2; i++) {
for (int j = c1; j <= c2; j++) {
ans += nck(i + j, i);
ans %= mod;
ans += mod;
ans %= mod;
}
}
cout << ans << endl;
return 0;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
ll modpow(ll x, ll y) {
x %= mod;
ll res = 1;
while (y > 0) {
if (y % 2 == 1) {
res *= x;
res %= mod;
}
x = x * x;
x %= mod;
y = y / 2;
}
return res;
}
ll inv(ll x) {
assert(x != 0);
return modpow(x, mod - 2);
}
void build() {
fac[0] = ifac[0] = 1;
for (int i = 1; i < maxn; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
ifac[i] = inv(fac[i]);
ifac[i] %= mod;
}
}
ll nck(ll n, ll k) {
assert(n >= 0 && k >= 0);
if (k > n)
return 0;
return (((fac[n] * ifac[k]) % mod) * ifac[n - k]) % mod;
}
void testlib() {
assert(modpow(1, 1) == 1);
assert(modpow(4, 2) == 16);
assert(modpow(2, 5) == 32);
assert(fac[3] == 6);
assert(nck(4, 2) == 6);
assert(nck(10, 2) == 45);
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
template <typename T> void out(T x) {
cout << x << endl;
exit(0);
}
#define watch(x) cout << (#x) << " is " << (x) << endl
const int maxn = 2e6 + 5;
const ll mod = 1e9 + 7;
ll fac[maxn], ifac[maxn];
ll modpow(ll, ll);
ll inv(ll);
ll nck(ll, ll);
void build();
void testlib();
int r1, r2, c1, c2;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
build();
testlib();
cin >> r1 >> c1 >> r2 >> c2;
ll ans = 0;
for (int i = r1; i <= r2; i++) {
ans += nck(i + c2 + 1, i + 1);
ans %= mod;
ans += mod;
ans %= mod;
ans -= nck(i + c1, i + 1);
ans %= mod;
ans += mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
///////////////////////////////////////////////////////////////////////////////////////////////////
ll modpow(ll x, ll y) {
x %= mod;
ll res = 1;
while (y > 0) {
if (y % 2 == 1) {
res *= x;
res %= mod;
}
x = x * x;
x %= mod;
y = y / 2;
}
return res;
}
ll inv(ll x) {
assert(x != 0);
return modpow(x, mod - 2);
}
void build() {
fac[0] = ifac[0] = 1;
for (int i = 1; i < maxn; i++) {
fac[i] = fac[i - 1] * i;
fac[i] %= mod;
ifac[i] = inv(fac[i]);
ifac[i] %= mod;
}
}
ll nck(ll n, ll k) {
assert(n >= 0 && k >= 0);
if (k > n)
return 0;
return (((fac[n] * ifac[k]) % mod) * ifac[n - k]) % mod;
}
void testlib() {
assert(modpow(1, 1) == 1);
assert(modpow(4, 2) == 16);
assert(modpow(2, 5) == 32);
assert(fac[3] == 6);
assert(nck(4, 2) == 6);
assert(nck(10, 2) == 45);
}
| replace | 36 | 42 | 36 | 44 | TLE | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
template <typename T> T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
u -= t * v;
std::swap(a, m);
std::swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> class Modular {
public:
using Type = typename std::decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) : value(normalize(x)) {}
template <typename U> Type normalize(const U &x) {
Type v;
if (-mod <= x && x < mod) {
v = static_cast<Type>(x);
} else {
v = static_cast<Type>(x % mod);
}
if (v < 0)
v += mod;
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod = T::value;
Modular &operator+=(const Modular &rhs) {
if ((value += rhs.value) >= mod)
value -= mod;
return *this;
}
Modular &operator-=(const Modular &rhs) {
if ((value -= rhs.value) < 0)
value += mod;
return *this;
}
template <typename U> Modular &operator+=(const U &rhs) {
return *this += Modular(rhs);
}
template <typename U> Modular &operator-=(const U &rhs) {
return *this -= Modular(rhs);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(int) {
Modular res(*this);
*this += 1;
return res;
}
Modular operator--(int) {
Modular res(*this);
*this -= 1;
return res;
}
template <typename U = T>
std::enable_if_t<std::is_same<typename Modular<U>::Type, int>::value, Modular>
&operator*=(const Modular &rhs) {
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
return *this;
}
template <typename U = T>
std::enable_if_t<std::is_same<typename Modular<U>::Type, int64_t>::value,
Modular> &
operator*=(const Modular &rhs) {
value = normalize(static_cast<__int128>(value) *
static_cast<__int128>(rhs.value));
return *this;
}
Modular &operator/=(const Modular &rhs) {
return *this *= Modular(inverse(rhs.value, mod));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator>(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &rhs);
template <typename U>
friend std::ostream &operator<<(std::ostream &stream, const Modular<U> &rhs);
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
bool operator>(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value > rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> power(const Modular<T> &a, const U &b) {
assert(b >= 0);
Modular<T> x = a, res = 1;
U n = b;
while (n > 0) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &rhs) {
typename std::common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
rhs = Modular<T>(x);
return stream;
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &rhs) {
stream << rhs.value;
return stream;
}
constexpr int mod = 1000000007;
using mint =
Modular<std::integral_constant<std::decay<decltype(mod)>::type, mod>>;
template <typename T> class Combination {
public:
vector<T> f, invf;
Combination(int n) : f(n + 1, 1), invf(n + 1, 1) {
for (int i = 1; i < n + 1; i++) {
f[i] = f[i - 1] * i;
}
invf[n] /= f[n];
for (int i = n; i > 0; i--) {
invf[i - 1] = invf[i] * i;
}
}
// nCr
const T operator()(int n, int r) const {
if (r < 0 || n < r)
return 0;
return f[n] * invf[r] * invf[n - r];
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint res = 0;
Combination<mint> comb(1000000);
for (int i = c1 + 1; i <= c2 + 1; i++) {
res += comb(r2 + i, i) - comb(r1 + i - 1, i);
}
cout << res << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
template <typename T> T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
u -= t * v;
std::swap(a, m);
std::swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> class Modular {
public:
using Type = typename std::decay<decltype(T::value)>::type;
constexpr Modular() : value() {}
template <typename U> Modular(const U &x) : value(normalize(x)) {}
template <typename U> Type normalize(const U &x) {
Type v;
if (-mod <= x && x < mod) {
v = static_cast<Type>(x);
} else {
v = static_cast<Type>(x % mod);
}
if (v < 0)
v += mod;
return v;
}
const Type &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static Type mod = T::value;
Modular &operator+=(const Modular &rhs) {
if ((value += rhs.value) >= mod)
value -= mod;
return *this;
}
Modular &operator-=(const Modular &rhs) {
if ((value -= rhs.value) < 0)
value += mod;
return *this;
}
template <typename U> Modular &operator+=(const U &rhs) {
return *this += Modular(rhs);
}
template <typename U> Modular &operator-=(const U &rhs) {
return *this -= Modular(rhs);
}
Modular &operator++() { return *this += 1; }
Modular &operator--() { return *this -= 1; }
Modular operator++(int) {
Modular res(*this);
*this += 1;
return res;
}
Modular operator--(int) {
Modular res(*this);
*this -= 1;
return res;
}
template <typename U = T>
std::enable_if_t<std::is_same<typename Modular<U>::Type, int>::value, Modular>
&operator*=(const Modular &rhs) {
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
return *this;
}
template <typename U = T>
std::enable_if_t<std::is_same<typename Modular<U>::Type, int64_t>::value,
Modular> &
operator*=(const Modular &rhs) {
value = normalize(static_cast<__int128>(value) *
static_cast<__int128>(rhs.value));
return *this;
}
Modular &operator/=(const Modular &rhs) {
return *this *= Modular(inverse(rhs.value, mod));
}
template <typename U>
friend bool operator==(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator<(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend bool operator>(const Modular<U> &lhs, const Modular<U> &rhs);
template <typename U>
friend std::istream &operator>>(std::istream &stream, Modular<U> &rhs);
template <typename U>
friend std::ostream &operator<<(std::ostream &stream, const Modular<U> &rhs);
private:
Type value;
};
template <typename T>
bool operator==(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value == rhs.value;
}
template <typename T, typename U>
bool operator==(const Modular<T> &lhs, U rhs) {
return lhs == Modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const Modular<T> &lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const Modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const Modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
bool operator<(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value < rhs.value;
}
template <typename T>
bool operator>(const Modular<T> &lhs, const Modular<T> &rhs) {
return lhs.value > rhs.value;
}
template <typename T>
Modular<T> operator+(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T, typename U>
Modular<T> operator+(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) += rhs;
}
template <typename T>
Modular<T> operator-(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
Modular<T> operator-(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) -= rhs;
}
template <typename T>
Modular<T> operator*(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
Modular<T> operator*(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) *= rhs;
}
template <typename T>
Modular<T> operator/(const Modular<T> &lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(const Modular<T> &lhs, U rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> operator/(U lhs, const Modular<T> &rhs) {
return Modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
Modular<T> power(const Modular<T> &a, const U &b) {
assert(b >= 0);
Modular<T> x = a, res = 1;
U n = b;
while (n > 0) {
if (n & 1)
res *= x;
x *= x;
n >>= 1;
}
return res;
}
template <typename T>
std::istream &operator>>(std::istream &stream, Modular<T> &rhs) {
typename std::common_type<typename Modular<T>::Type, int64_t>::type x;
stream >> x;
rhs = Modular<T>(x);
return stream;
}
template <typename T>
std::ostream &operator<<(std::ostream &stream, const Modular<T> &rhs) {
stream << rhs.value;
return stream;
}
constexpr int mod = 1000000007;
using mint =
Modular<std::integral_constant<std::decay<decltype(mod)>::type, mod>>;
template <typename T> class Combination {
public:
vector<T> f, invf;
Combination(int n) : f(n + 1, 1), invf(n + 1, 1) {
for (int i = 1; i < n + 1; i++) {
f[i] = f[i - 1] * i;
}
invf[n] /= f[n];
for (int i = n; i > 0; i--) {
invf[i - 1] = invf[i] * i;
}
}
// nCr
const T operator()(int n, int r) const {
if (r < 0 || n < r)
return 0;
return f[n] * invf[r] * invf[n - r];
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint res = 0;
Combination<mint> comb(10000000);
for (int i = c1 + 1; i <= c2 + 1; i++) {
res += comb(r2 + i, i) - comb(r1 + i - 1, i);
}
cout << res << '\n';
return 0;
}
| replace | 259 | 260 | 259 | 260 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (int i = a; i <= b; i++)
#define rfor(i, a, b) for (int i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define pi pair<int, int>
#define X first
#define Y second
#define N 1014159
#define vi vector<int>
#define v vector
#define die exit(0)
#define alln(arr) arr + 1, arr + 1 + n
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
inline int mul(int a, int b) { return (a * 1ll * b) % MOD; }
inline int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline int power(int a, int b) {
int rt = 1;
while (b > 0) {
if (b & 1)
rt = mul(rt, a);
a = mul(a, a);
b >>= 1;
}
return rt;
}
inline int inv(int a) { return power(a, MOD - 2); }
int fac[N];
int invfac[N];
void pre() {
fac[0] = 1;
invfac[0] = inv(1);
forn(i, 1, N - 10) {
fac[i] = fac[i - 1] * i;
fac[i] %= MOD;
invfac[i] = inv(fac[i]);
}
}
int ncr(int n, int r) {
if (r > n)
return 0;
return mul(fac[n], mul(invfac[r], invfac[n - r]));
}
int n, m, k, arr[N];
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = 0;
forn(i, a, c) {
int x = ncr(i + d + 1, i + 1) - ncr(i + b, i + 1);
x += MOD;
x %= MOD;
ans = add(ans, x);
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
pre();
forn(i, 1, t) {
solve();
nl;
}
return 0;
}
// clang++ c.cpp ; ./a.out < a.txt ; | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp> // Common file
#include <ext/pb_ds/tree_policy.hpp>
#include <functional> // for less
using namespace std;
#define int long long
#define double long double
#define pb push_back
#define mp make_pair
#define st(arr, a) memset(arr, a, sizeof arr)
#define nl cout << '\n'
#define bitcount(x) __builtin_popcountll(x)
const int MOD = 1000000007ll;
#define forn(i, a, b) for (int i = a; i <= b; i++)
#define rfor(i, a, b) for (int i = a; i >= b; i--)
#define all(x) x.begin(), x.end()
#define pi pair<int, int>
#define X first
#define Y second
#define N 2014159
#define vi vector<int>
#define v vector
#define die exit(0)
#define alln(arr) arr + 1, arr + 1 + n
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag,
tree_order_statistics_node_update>
oset;
inline int mul(int a, int b) { return (a * 1ll * b) % MOD; }
inline int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
inline int power(int a, int b) {
int rt = 1;
while (b > 0) {
if (b & 1)
rt = mul(rt, a);
a = mul(a, a);
b >>= 1;
}
return rt;
}
inline int inv(int a) { return power(a, MOD - 2); }
int fac[N];
int invfac[N];
void pre() {
fac[0] = 1;
invfac[0] = inv(1);
forn(i, 1, N - 10) {
fac[i] = fac[i - 1] * i;
fac[i] %= MOD;
invfac[i] = inv(fac[i]);
}
}
int ncr(int n, int r) {
if (r > n)
return 0;
return mul(fac[n], mul(invfac[r], invfac[n - r]));
}
int n, m, k, arr[N];
void solve() {
int a, b, c, d;
cin >> a >> b >> c >> d;
int ans = 0;
forn(i, a, c) {
int x = ncr(i + d + 1, i + 1) - ncr(i + b, i + 1);
x += MOD;
x %= MOD;
ans = add(ans, x);
}
cout << ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
int t = 1;
// cin>>t;
pre();
forn(i, 1, t) {
solve();
nl;
}
return 0;
}
// clang++ c.cpp ; ./a.out < a.txt ; | replace | 19 | 20 | 19 | 20 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define int long long
using namespace std;
const int INF = 2e18;
const int MOD = 1e9 + 7;
const int MB = 20;
const int maxN = 1e6 + 1;
int fact[maxN], rev[maxN];
int mod_pow(int a, int b) {
if (!b)
return 1;
if (b % 2)
return a * mod_pow(a, b - 1) % MOD;
int q = mod_pow(a, b / 2);
return q * q % MOD;
}
int C(int n, int k) { return (fact[n] * rev[k] % MOD) * rev[n - k] % MOD; }
int f(int r, int c) {
int ans = 0;
for (int i = r + 1; i > 1; i--) {
ans = (ans + C(i + c, c)) % MOD;
}
return ans;
}
void solve() {
fact[0] = 1;
for (int i = 1; i < maxN; i++)
fact[i] = fact[i - 1] * i % MOD;
for (int i = 0; i < maxN; i++)
rev[i] = mod_pow(fact[i], MOD - 2);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << (f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) +
5 * MOD) %
MOD;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed;
cout.precision(12);
solve();
} | #include <bits/stdc++.h>
#define ll long long
#define ld long double
#define eb emplace_back
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define int long long
using namespace std;
const int INF = 2e18;
const int MOD = 1e9 + 7;
const int MB = 20;
const int maxN = 4e6 + 1;
int fact[maxN], rev[maxN];
int mod_pow(int a, int b) {
if (!b)
return 1;
if (b % 2)
return a * mod_pow(a, b - 1) % MOD;
int q = mod_pow(a, b / 2);
return q * q % MOD;
}
int C(int n, int k) { return (fact[n] * rev[k] % MOD) * rev[n - k] % MOD; }
int f(int r, int c) {
int ans = 0;
for (int i = r + 1; i > 1; i--) {
ans = (ans + C(i + c, c)) % MOD;
}
return ans;
}
void solve() {
fact[0] = 1;
for (int i = 1; i < maxN; i++)
fact[i] = fact[i - 1] * i % MOD;
for (int i = 0; i < maxN; i++)
rev[i] = mod_pow(fact[i], MOD - 2);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << (f(r2, c2) - f(r2, c1 - 1) - f(r1 - 1, c2) + f(r1 - 1, c1 - 1) +
5 * MOD) %
MOD;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
cout << fixed;
cout.precision(12);
solve();
} | replace | 13 | 14 | 13 | 14 | 0 | |
p02782 | C++ | Runtime Error | /*
∫ ∫ ∫
ノヽ
（＿ ）
（＿ ）
（＿＿＿＿＿＿ ）
ヽ(´･ω･)ﾉ
| /
UU
*/
#pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
using P = pair<int64, int64>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1 << 30;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end() // コンテナじゃないと使えない!!
#define debug(x) cerr << #x << ": " << x << "\n";
#define mp make_pair
#define bn '\n'
template <typename T> ostream &operator<<(ostream &os, vector<T> &V) {
int N = V.size();
REP(i, N) {
os << V[i];
if (i != N - 1)
os << " ";
}
os << "\n";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> const &P) {
os << "(";
os << P.first;
os << " , ";
os << P.second;
os << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &S) {
auto it = S.begin();
while (it != S.end()) {
os << *it;
os << " ";
it++;
}
os << "\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, deque<T> &q) {
for (auto it = q.begin(); it < q.end(); it++) {
os << *it;
os << " ";
}
os << endl;
return os;
}
vector<pair<int, int>> dxdy = {mp(0, 1), mp(1, 0), mp(-1, 0), mp(0, -1)};
#pragma endregion
// fixed<<setprecision(10)<<ans<<endl;
int64 pow(int a, int b, int mod) {
vector<bool> bit;
for (b = b; b > 0; b >>= 1) {
bit.push_back(b & 1);
}
vector<int64> fac(bit.size());
fac[0] = a;
int64 res = 1;
for (int i = 1; i < bit.size(); i++) {
fac[i] = (fac[i - 1] * fac[i - 1]) % mod;
}
for (int i = 0; i < bit.size(); i++) {
if (bit[i])
res *= fac[i];
res %= mod;
}
return res;
}
// mint
struct mint {
int64 x;
mint(int64 x = 0) : x((x + 2 * MOD) % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(int64 t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &os, mint a) {
os << a.x;
return os;
}
class BigCombination {
private:
const int MAX = 210000;
mint fac[210000], inv[210000];
public:
BigCombination() {
fac[0] = fac[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i;
}
inv[MAX - 1] = fac[MAX - 1].inv();
for (int i = MAX - 1; i > 0; i--) {
inv[i - 1] = inv[i] * i;
}
}
mint combination(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
if (n == r)
return 1;
return fac[n] * inv[r] * inv[n - r];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
BigCombination B;
mint ans = 0;
for (int c = c1; c <= c2; c++) {
ans += B.combination(c + r2 + 1, c + 1) - B.combination(c + r1, c + 1);
// ans += B.combination(c+r2,c) - B.combination(c+r1-1,c);
}
cout << ans << endl;
} | /*
∫ ∫ ∫
ノヽ
（＿ ）
（＿ ）
（＿＿＿＿＿＿ ）
ヽ(´･ω･)ﾉ
| /
UU
*/
#pragma region macro
#include <bits/stdc++.h>
typedef long long int64;
using namespace std;
using P = pair<int64, int64>;
typedef vector<int> vi;
const int MOD = (int)1e9 + 7;
const int64 INF = 1LL << 62;
const int inf = 1 << 30;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define REP(i, n) for (int i = 0; i < (n); i++)
#define FOR(i, s, n) for (int i = s; i < (n); i++)
#define ALL(obj) (obj).begin(), (obj).end() // コンテナじゃないと使えない!!
#define debug(x) cerr << #x << ": " << x << "\n";
#define mp make_pair
#define bn '\n'
template <typename T> ostream &operator<<(ostream &os, vector<T> &V) {
int N = V.size();
REP(i, N) {
os << V[i];
if (i != N - 1)
os << " ";
}
os << "\n";
return os;
}
template <typename T, typename S>
ostream &operator<<(ostream &os, pair<T, S> const &P) {
os << "(";
os << P.first;
os << " , ";
os << P.second;
os << ")";
return os;
}
template <typename T> ostream &operator<<(ostream &os, set<T> &S) {
auto it = S.begin();
while (it != S.end()) {
os << *it;
os << " ";
it++;
}
os << "\n";
return os;
}
template <typename T> ostream &operator<<(ostream &os, deque<T> &q) {
for (auto it = q.begin(); it < q.end(); it++) {
os << *it;
os << " ";
}
os << endl;
return os;
}
vector<pair<int, int>> dxdy = {mp(0, 1), mp(1, 0), mp(-1, 0), mp(0, -1)};
#pragma endregion
// fixed<<setprecision(10)<<ans<<endl;
int64 pow(int a, int b, int mod) {
vector<bool> bit;
for (b = b; b > 0; b >>= 1) {
bit.push_back(b & 1);
}
vector<int64> fac(bit.size());
fac[0] = a;
int64 res = 1;
for (int i = 1; i < bit.size(); i++) {
fac[i] = (fac[i - 1] * fac[i - 1]) % mod;
}
for (int i = 0; i < bit.size(); i++) {
if (bit[i])
res *= fac[i];
res %= mod;
}
return res;
}
// mint
struct mint {
int64 x;
mint(int64 x = 0) : x((x + 2 * MOD) % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(int64 t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
ostream &operator<<(ostream &os, mint a) {
os << a.x;
return os;
}
class BigCombination {
private:
const int MAX = 2100000;
mint fac[2100000], inv[2100000];
public:
BigCombination() {
fac[0] = fac[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i;
}
inv[MAX - 1] = fac[MAX - 1].inv();
for (int i = MAX - 1; i > 0; i--) {
inv[i - 1] = inv[i] * i;
}
}
mint combination(int n, int r) {
if (n < r)
return 0;
if (n < 0 || r < 0)
return 0;
if (n == r)
return 1;
return fac[n] * inv[r] * inv[n - r];
}
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
BigCombination B;
mint ans = 0;
for (int c = c1; c <= c2; c++) {
ans += B.combination(c + r2 + 1, c + 1) - B.combination(c + r1, c + 1);
// ans += B.combination(c+r2,c) - B.combination(c+r1-1,c);
}
cout << ans << endl;
} | replace | 154 | 156 | 154 | 156 | 0 | |
p02782 | C++ | Runtime Error | #include <iostream>
using namespace std;
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
// 前処理
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long ans = 0;
ans += COM(r1 + c1, r1);
ans %= MOD;
for (int i = r2 + c2; i > r1 + c2; --i) {
ans += COM(i, c2) % MOD;
ans %= MOD;
}
for (int i = r2 + c2; i > c1 + r2; --i) {
ans += COM(i, r2) % MOD;
ans %= MOD;
}
cout << ans << endl;
} | #include <iostream>
using namespace std;
const int MAX = 2000005;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
// 前処理
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long ans = 0;
ans += COM(r1 + c1, r1);
ans %= MOD;
for (int i = r2 + c2; i > r1 + c2; --i) {
ans += COM(i, c2) % MOD;
ans %= MOD;
}
for (int i = r2 + c2; i > c1 + r2; --i) {
ans += COM(i, r2) % MOD;
ans %= MOD;
}
cout << ans << endl;
}
| replace | 3 | 4 | 3 | 4 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int mul(int a, int b) { return int(1LL * a * b % mod); }
int fexp(int b, int e = mod - 2) {
int ans = 1;
while (e) {
if (e & 1)
ans = mul(ans, b);
b = mul(b, b);
e /= 2;
}
return ans;
}
const int N = 1000006;
int fat[N], ifat[N];
int C(int n, int k) {
if (n < k)
return 0;
return mul(mul(fat[n], ifat[k]), ifat[n - k]);
}
int solve(int n, int m) {
if (n < 0 or m < 0)
return 0;
int ans = 0;
for (int j = 0; j <= m; j++) {
ans = add(ans, C(j + n + 1, j + 1));
}
return ans;
}
int main() {
fat[0] = ifat[0] = 1;
for (int i = 1; i < N; i++) {
fat[i] = mul(i, fat[i - 1]);
ifat[i] = fexp(fat[i]);
}
int r1, c1, r2, c2;
scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
int ans = 0;
ans = add(ans, solve(r2, c2));
ans = add(ans, mod - solve(r1 - 1, c2));
ans = add(ans, mod - solve(r2, c1 - 1));
ans = add(ans, solve(r1 - 1, c1 - 1));
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
int add(int a, int b) { return a + b >= mod ? a + b - mod : a + b; }
int mul(int a, int b) { return int(1LL * a * b % mod); }
int fexp(int b, int e = mod - 2) {
int ans = 1;
while (e) {
if (e & 1)
ans = mul(ans, b);
b = mul(b, b);
e /= 2;
}
return ans;
}
const int N = 2000006;
int fat[N], ifat[N];
int C(int n, int k) {
if (n < k)
return 0;
return mul(mul(fat[n], ifat[k]), ifat[n - k]);
}
int solve(int n, int m) {
if (n < 0 or m < 0)
return 0;
int ans = 0;
for (int j = 0; j <= m; j++) {
ans = add(ans, C(j + n + 1, j + 1));
}
return ans;
}
int main() {
fat[0] = ifat[0] = 1;
for (int i = 1; i < N; i++) {
fat[i] = mul(i, fat[i - 1]);
ifat[i] = fexp(fat[i]);
}
int r1, c1, r2, c2;
scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
int ans = 0;
ans = add(ans, solve(r2, c2));
ans = add(ans, mod - solve(r1 - 1, c2));
ans = add(ans, mod - solve(r2, c1 - 1));
ans = add(ans, solve(r1 - 1, c1 - 1));
printf("%d\n", ans);
}
| replace | 18 | 19 | 18 | 19 | 0 | |
p02782 | C++ | Runtime Error | #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
const int INF = 1e9;
const int MXN = 1e6 + 5;
const int MXV = 0;
const int MOD = 1e9 + 7;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, L, R) for (int i = L; i != (int)R; ++i)
#define FORD(i, L, R) for (int i = L; i != (int)R; --i)
#define IOS \
cin.tie(nullptr); \
cout.tie(nullptr); \
ios_base::sync_with_stdio(false);
LL comb[MXN], invcomb[MXN];
LL extgcd(LL a, LL b, LL &x, LL &y) {
LL d = a;
if (b) {
d = extgcd(b, a % b, y, x), y -= (a / b) * x;
} else
x = 1, y = 0;
return d;
} // ax+by=1 ax同餘 1 mod b
LL inv(LL a) {
LL x, y, b = MOD;
extgcd(a, b, x, y);
while (x >= MOD) {
x -= MOD;
}
while (x < 0) {
x += MOD;
}
return x;
}
void pre() {
comb[0] = 1;
invcomb[0] = 1;
for (int i = 1; i < MXN; ++i) {
comb[i] = (comb[i - 1] * i) % MOD;
invcomb[i] = inv(comb[i]);
}
}
LL choose(int m, int n) {
LL ans = comb[m];
ans = (ans * invcomb[m - n]) % MOD;
ans = (ans * invcomb[n]) % MOD;
return ans;
}
LL G(int m, int n) { return choose((m + 1) + (n + 1), n + 1) - 1; }
int main() {
IOS;
pre();
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
--r1;
--c1;
LL ans = G(r2, c2) - G(r2, c1) - G(r1, c2) + G(r1, c1);
while (ans <= 0) {
ans += MOD;
}
ans %= MOD;
cout << ans << '\n';
}
| #pragma GCC optimize(2)
#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using PII = pair<int, int>;
using PLL = pair<LL, LL>;
const int INF = 1e9;
const int MXN = 2e6 + 5;
const int MXV = 0;
const int MOD = 1e9 + 7;
#define MP make_pair
#define PB push_back
#define F first
#define S second
#define FOR(i, L, R) for (int i = L; i != (int)R; ++i)
#define FORD(i, L, R) for (int i = L; i != (int)R; --i)
#define IOS \
cin.tie(nullptr); \
cout.tie(nullptr); \
ios_base::sync_with_stdio(false);
LL comb[MXN], invcomb[MXN];
LL extgcd(LL a, LL b, LL &x, LL &y) {
LL d = a;
if (b) {
d = extgcd(b, a % b, y, x), y -= (a / b) * x;
} else
x = 1, y = 0;
return d;
} // ax+by=1 ax同餘 1 mod b
LL inv(LL a) {
LL x, y, b = MOD;
extgcd(a, b, x, y);
while (x >= MOD) {
x -= MOD;
}
while (x < 0) {
x += MOD;
}
return x;
}
void pre() {
comb[0] = 1;
invcomb[0] = 1;
for (int i = 1; i < MXN; ++i) {
comb[i] = (comb[i - 1] * i) % MOD;
invcomb[i] = inv(comb[i]);
}
}
LL choose(int m, int n) {
LL ans = comb[m];
ans = (ans * invcomb[m - n]) % MOD;
ans = (ans * invcomb[n]) % MOD;
return ans;
}
LL G(int m, int n) { return choose((m + 1) + (n + 1), n + 1) - 1; }
int main() {
IOS;
pre();
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
--r1;
--c1;
LL ans = G(r2, c2) - G(r2, c1) - G(r1, c2) + G(r1, c1);
while (ans <= 0) {
ans += MOD;
}
ans %= MOD;
cout << ans << '\n';
}
| replace | 7 | 8 | 7 | 8 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
ll myctoi(char C) { return C - '0'; }
char myitoc(ll N) { return '0' + N; }
#define FINALANS(A) \
do { \
cout << (A) << '\n'; \
exit(0); \
} while (false)
class combination {
public:
vector<ll> fac, finv, inv;
combination(ll M) {
fac.resize(M + 1);
finv.resize(M + 1);
inv.resize(M + 1);
fac.at(0) = 1, finv.at(0) = 1, inv.at(0) = 1;
fac.at(1) = 1, finv.at(1) = 1, inv.at(1) = 1;
for (ll i = 2; i <= M; i++) {
fac.at(i) = fac.at(i - 1) * i % MOD;
inv.at(i) = MOD - inv.at(MOD % i) * (MOD / i) % MOD;
finv.at(i) = finv.at(i - 1) * inv.at(i) % MOD;
}
}
ll P(ll N, ll K) {
if (N < K)
return 0;
if (N < 0 || K < 0)
return 0;
return fac.at(N) * finv.at(N - K) % MOD;
}
ll C(ll N, ll K) {
if (N < K)
return 0;
if (N < 0 || K < 0)
return 0;
return fac.at(N) * (finv.at(K) * finv.at(N - K) % MOD) % MOD;
}
ll H(ll N, ll K) { return C(N + K - 1, K); }
};
combination com(1e6 + 10);
ll s(ll r, ll c) {
if (r == 0 || c == 0)
return 0;
ll ret = 0;
for (ll i = 0; i < c; i++) {
ret += com.C(r + 2 + i, 2 + i) + MOD - 1;
ret %= MOD;
}
return ret;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = ((s(r2, c2) + s(r1 - 1, c1 - 1)) % MOD) + MOD -
((s(r1 - 1, c2) + s(r2, c1 - 1)) % MOD);
ans %= MOD;
cout << ans << endl;
// cerr << s(r2, c2) << " " << s(r1 - 1, c1 - 1) << endl;
// cerr << s(r1 - 1, c2) << " " << s(r2, c1 - 1) << endl;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
// const ll MOD = ;
ll mod(ll A, ll M) { return (A % M + M) % M; }
const ll INF = 1LL << 60;
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
ll divceil(ll A, ll B) { return (A + (B - 1)) / B; }
ll myctoi(char C) { return C - '0'; }
char myitoc(ll N) { return '0' + N; }
#define FINALANS(A) \
do { \
cout << (A) << '\n'; \
exit(0); \
} while (false)
class combination {
public:
vector<ll> fac, finv, inv;
combination(ll M) {
fac.resize(M + 1);
finv.resize(M + 1);
inv.resize(M + 1);
fac.at(0) = 1, finv.at(0) = 1, inv.at(0) = 1;
fac.at(1) = 1, finv.at(1) = 1, inv.at(1) = 1;
for (ll i = 2; i <= M; i++) {
fac.at(i) = fac.at(i - 1) * i % MOD;
inv.at(i) = MOD - inv.at(MOD % i) * (MOD / i) % MOD;
finv.at(i) = finv.at(i - 1) * inv.at(i) % MOD;
}
}
ll P(ll N, ll K) {
if (N < K)
return 0;
if (N < 0 || K < 0)
return 0;
return fac.at(N) * finv.at(N - K) % MOD;
}
ll C(ll N, ll K) {
if (N < K)
return 0;
if (N < 0 || K < 0)
return 0;
return fac.at(N) * (finv.at(K) * finv.at(N - K) % MOD) % MOD;
}
ll H(ll N, ll K) { return C(N + K - 1, K); }
};
combination com(2 * (1e6 + 10));
ll s(ll r, ll c) {
if (r == 0 || c == 0)
return 0;
ll ret = 0;
for (ll i = 0; i < c; i++) {
ret += com.C(r + 2 + i, 2 + i) + MOD - 1;
ret %= MOD;
}
return ret;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = ((s(r2, c2) + s(r1 - 1, c1 - 1)) % MOD) + MOD -
((s(r1 - 1, c2) + s(r2, c1 - 1)) % MOD);
ans %= MOD;
cout << ans << endl;
// cerr << s(r2, c2) << " " << s(r1 - 1, c1 - 1) << endl;
// cerr << s(r1 - 1, c2) << " " << s(r2, c1 - 1) << endl;
} | replace | 69 | 70 | 69 | 70 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
const ll MAX = 1200000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void Main() {
COMinit();
ll r1;
cin >> r1;
r1--;
ll c1;
cin >> c1;
c1--;
ll r2;
cin >> r2;
ll c2;
cin >> c2;
ans += COM(r2 + c2 + 2, r2 + 1);
ans %= MOD;
ans -= COM(r1 + c2 + 2, r1 + 1);
ans = (ans + MOD) % MOD;
ans += COM(r1 + c1 + 2, r1 + 1);
ans %= MOD;
ans -= COM(r2 + c1 + 2, r2 + 1);
ans = (ans + MOD) % MOD;
cout << ans << endl;
}
int main() {
Main();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define For(i, n, k) for (ll i = (n); i < (k); i++)
#define ALL(a) (a).begin(), (a).end()
ll ans = 0;
const ll MAX = 2400000;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
void Main() {
COMinit();
ll r1;
cin >> r1;
r1--;
ll c1;
cin >> c1;
c1--;
ll r2;
cin >> r2;
ll c2;
cin >> c2;
ans += COM(r2 + c2 + 2, r2 + 1);
ans %= MOD;
ans -= COM(r1 + c2 + 2, r1 + 1);
ans = (ans + MOD) % MOD;
ans += COM(r1 + c1 + 2, r1 + 1);
ans %= MOD;
ans -= COM(r2 + c1 + 2, r2 + 1);
ans = (ans + MOD) % MOD;
cout << ans << endl;
}
int main() {
Main();
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pi pair<ll, ll>
using namespace std;
const ll N = 500010;
ll fac[N];
ll power(ll x, ll n) {
if (n == 0) {
return 1;
}
if (n == 1) {
return x;
}
if (n % 2 == 0) {
return power((x * x) % M, n / 2);
}
if (n % 2 == 1) {
return (power((x * x) % M, n / 2) * x) % M;
}
}
ll ncr(ll n, ll r) {
ll num = fac[n];
ll denum = (fac[r] * fac[n - r]) % M;
ll ans = (num * power(denum, M - 2)) % M;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
fac[0] = 1;
for (ll i = 1; i < N; ++i) {
fac[i] = (i * fac[i - 1]) % M;
}
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
++r1;
++c1;
++r2;
++c2;
ll ans = 0;
for (ll i = r1; i <= r2; ++i) {
ll ch = (ncr(i + c2 - 1, i) - ncr(i + c1 - 2, i) + M) % M;
ans = (ans + ch) % M;
}
cout << ans << endl;
return (0);
}
| #include <bits/stdc++.h>
#define ll long long int
#define M 1000000007
#define mod 998244353
#define mp(x, y) make_pair(x, y)
#define pb(x) push_back(x)
#define pi pair<ll, ll>
using namespace std;
const ll N = 5000010;
ll fac[N];
ll power(ll x, ll n) {
if (n == 0) {
return 1;
}
if (n == 1) {
return x;
}
if (n % 2 == 0) {
return power((x * x) % M, n / 2);
}
if (n % 2 == 1) {
return (power((x * x) % M, n / 2) * x) % M;
}
}
ll ncr(ll n, ll r) {
ll num = fac[n];
ll denum = (fac[r] * fac[n - r]) % M;
ll ans = (num * power(denum, M - 2)) % M;
return ans;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
fac[0] = 1;
for (ll i = 1; i < N; ++i) {
fac[i] = (i * fac[i - 1]) % M;
}
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
++r1;
++c1;
++r2;
++c2;
ll ans = 0;
for (ll i = r1; i <= r2; ++i) {
ll ch = (ncr(i + c2 - 1, i) - ncr(i + c1 - 2, i) + M) % M;
ans = (ans + ch) % M;
}
cout << ans << endl;
return (0);
}
| replace | 8 | 9 | 8 | 9 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
typedef complex<double> C;
#define cx real()
#define cy imag()
const ll INF = 1LL << 60;
const double DINF = 1e30;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const C I = C(0, 1);
const double EPS = 1e-10;
const ll NCK_MAX = 510000;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
template <typename T> class Zip {
vector<T> d;
bool flag;
void init() {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) {
if (flag)
init();
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag)
init();
return (ll)d.size();
}
};
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
UnionFind(ll n) : par(n, 1), rank(n, 0) {}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
template <typename T> class SegmentTree {
ll n;
vector<T> node;
function<T(T, T)> fun, fun2;
bool customChange;
T outValue, initValue;
public:
void init(ll num, function<T(T, T)> resultFunction, T init, T out,
function<T(T, T)> changeFunction = NULL) {
// changeFunction: (input, beforevalue) => newvalue
fun = resultFunction;
fun2 = changeFunction;
customChange = changeFunction != NULL;
n = 1;
while (n < num)
n *= 2;
node.resize(2 * n - 1);
fill(node.begin(), node.end(), init);
outValue = out;
initValue = init;
}
void valueChange(ll num, T value) {
num += n - 1;
if (customChange)
node[num] = fun2(value, node[num]);
else
node[num] = value;
while (num > 0)
num = (num - 1) / 2,
node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);
}
T rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)
if (r == -1)
r = n;
if (a <= l && r <= b)
return node[k];
if (b <= l || r <= a)
return outValue;
ll mid = (l + r) / 2;
return fun(rangeQuery(a, b, l, mid, 2 * k + 1),
rangeQuery(a, b, mid, r, 2 * k + 2));
}
};
template <typename T> class Graph {
struct edge {
ll to;
T cost;
};
struct edge_data {
ll from, to;
T cost;
};
ll v;
vector<vector<edge>> e, re;
vector<edge_data> ed;
vector<bool> used;
vector<ll> vs, cmp;
bool isDirected, isMinasEdge;
public:
Graph(ll _v, bool _isDirected = true, ll range_add = 0) {
// range_add 0:no / 1:in / 2:out / 3:in+out
//_v++;
v = _v, isDirected = _isDirected;
isMinasEdge = false;
e.resize(v), re.resize(v);
}
void add_edge(ll s, ll t, T cost = 1) {
e[s].push_back((edge){t, cost});
if (!isDirected)
e[t].push_back((edge){s, cost});
else
re[t].push_back((edge){s, cost});
ed.push_back((edge_data){s, t, cost});
if (cost < 0)
isMinasEdge = true;
}
vector<T> dijkstra(ll s) {
vector<T> d(v, INF);
d[s] = 0;
auto edge_cmp = [](const edge &a, const edge &b) {
return a.cost > b.cost;
};
priority_queue<edge, vector<edge>, decltype(edge_cmp)> pq(edge_cmp);
pq.push((edge){s, 0});
while (!pq.empty()) {
edge temp = pq.top();
pq.pop();
if (d[temp.to] < temp.cost)
continue;
for (const edge &next : e[temp.to]) {
T cost = temp.cost + next.cost;
if (d[next.to] > cost) {
d[next.to] = cost;
pq.push((edge){next.to, cost});
}
}
}
return d;
}
vector<T> bellmanford(ll s) {
vector<T> d(v, INF);
d[s] = 0;
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = d[temp.from] + temp.cost;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = d[temp.to] + temp.cost;
}
}
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = -INF;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = -INF;
}
}
return d;
}
vector<T> shortest_path(ll s) {
if (isMinasEdge)
return bellmanford(s);
else
return dijkstra(s);
}
T kruskal() {
// if (isDirected)
UnionFind uf(v);
auto edge_data_cmp = [](const edge_data &a, const edge_data &b) {
return a.cost < b.cost;
};
sort(ed.begin(), ed.end(), edge_data_cmp);
T ans = 0;
for (const edge_data &temp : ed) {
if (uf.isSame(temp.from, temp.to))
continue;
uf.merge(temp.from, temp.to);
ans += temp.cost;
}
return ans;
}
void scc_dfs(ll s) {
used[s] = true;
for (const edge &i : e[s])
if (!used[i.to])
scc_dfs(i.to);
vs.push_back(s);
}
void scc_rdfs(ll s, ll k) {
used[s] = true;
cmp[s] = k;
for (const edge &i : re[s])
if (!used[i.to])
scc_rdfs(i.to, k);
}
vector<ll> scc() {
used.resize(v);
fill(used.begin(), used.end(), false);
cmp.resize(v);
vs.clear();
for (ll i = 0; i < v; i++)
if (!used[i])
scc_dfs(i);
used.resize(v);
fill(used.begin(), used.end(), false);
ll k = 0;
for (ll i = vs.size() - 1; i >= 0; i--)
if (!used[vs[i]])
scc_rdfs(vs[i], k++);
return cmp;
}
};
ll r1, c1, r2, c2;
ll get(ll r, ll c) {
ll temp = nCk(r + c + 2, r + 1, mod) - 1;
if (temp < 0)
temp += mod;
return temp;
}
int main() {
scanf("%lld%lld%lld%lld", &r1, &c1, &r2, &c2);
r1--;
c1--;
ll ans =
(get(r2, c2) - get(r2, c1) - get(r1, c2) + get(r1, c1) + 2 * mod) % mod;
printf("%lld\n", ans);
}
| #include <algorithm>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<ll, P> Q;
typedef complex<double> C;
#define cx real()
#define cy imag()
const ll INF = 1LL << 60;
const double DINF = 1e30;
const ll mod = 1000000007;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, -1, 0, 1};
const C I = C(0, 1);
const double EPS = 1e-10;
const ll NCK_MAX = 2100000;
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll q = a / b, g = extgcd(b, a - q * b, x, y);
ll z = x - q * y;
x = y;
y = z;
return g;
}
ll invmod(ll a, ll m) { // a^-1 mod m
ll x, y;
extgcd(a, m, x, y);
x %= m;
if (x < 0)
x += m;
return x;
}
ll *fac, *finv, *inv;
void nCk_init(ll mod) {
fac = new ll[NCK_MAX];
finv = new ll[NCK_MAX];
inv = new ll[NCK_MAX];
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < NCK_MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll nCk(ll n, ll k, ll mod) {
if (fac == NULL)
nCk_init(mod);
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
template <typename T> class Zip {
vector<T> d;
bool flag;
void init() {
sort(d.begin(), d.end());
d.erase(unique(d.begin(), d.end()), d.end());
flag = false;
}
public:
Zip() { flag = false; }
void add(T x) {
d.push_back(x);
flag = true;
}
ll getNum(T x) {
if (flag)
init();
return lower_bound(d.begin(), d.end(), x) - d.begin();
}
ll size() {
if (flag)
init();
return (ll)d.size();
}
};
class UnionFind {
vector<ll> par, rank; // par > 0: number, par < 0: -par
public:
UnionFind(ll n) : par(n, 1), rank(n, 0) {}
ll getSize(ll x) { return par[find(x)]; }
ll find(ll x) {
if (par[x] > 0)
return x;
return -(par[x] = -find(-par[x]));
}
void merge(ll x, ll y) {
x = find(x);
y = find(y);
if (x == y)
return;
if (rank[x] < rank[y]) {
par[y] += par[x];
par[x] = -y;
} else {
par[x] += par[y];
par[y] = -x;
if (rank[x] == rank[y])
rank[x]++;
}
}
bool isSame(ll x, ll y) { return find(x) == find(y); }
};
template <typename T> class SegmentTree {
ll n;
vector<T> node;
function<T(T, T)> fun, fun2;
bool customChange;
T outValue, initValue;
public:
void init(ll num, function<T(T, T)> resultFunction, T init, T out,
function<T(T, T)> changeFunction = NULL) {
// changeFunction: (input, beforevalue) => newvalue
fun = resultFunction;
fun2 = changeFunction;
customChange = changeFunction != NULL;
n = 1;
while (n < num)
n *= 2;
node.resize(2 * n - 1);
fill(node.begin(), node.end(), init);
outValue = out;
initValue = init;
}
void valueChange(ll num, T value) {
num += n - 1;
if (customChange)
node[num] = fun2(value, node[num]);
else
node[num] = value;
while (num > 0)
num = (num - 1) / 2,
node[num] = fun(node[num * 2 + 1], node[num * 2 + 2]);
}
T rangeQuery(ll a, ll b, ll l = 0, ll r = -1, ll k = 0) { // [a, b)
if (r == -1)
r = n;
if (a <= l && r <= b)
return node[k];
if (b <= l || r <= a)
return outValue;
ll mid = (l + r) / 2;
return fun(rangeQuery(a, b, l, mid, 2 * k + 1),
rangeQuery(a, b, mid, r, 2 * k + 2));
}
};
template <typename T> class Graph {
struct edge {
ll to;
T cost;
};
struct edge_data {
ll from, to;
T cost;
};
ll v;
vector<vector<edge>> e, re;
vector<edge_data> ed;
vector<bool> used;
vector<ll> vs, cmp;
bool isDirected, isMinasEdge;
public:
Graph(ll _v, bool _isDirected = true, ll range_add = 0) {
// range_add 0:no / 1:in / 2:out / 3:in+out
//_v++;
v = _v, isDirected = _isDirected;
isMinasEdge = false;
e.resize(v), re.resize(v);
}
void add_edge(ll s, ll t, T cost = 1) {
e[s].push_back((edge){t, cost});
if (!isDirected)
e[t].push_back((edge){s, cost});
else
re[t].push_back((edge){s, cost});
ed.push_back((edge_data){s, t, cost});
if (cost < 0)
isMinasEdge = true;
}
vector<T> dijkstra(ll s) {
vector<T> d(v, INF);
d[s] = 0;
auto edge_cmp = [](const edge &a, const edge &b) {
return a.cost > b.cost;
};
priority_queue<edge, vector<edge>, decltype(edge_cmp)> pq(edge_cmp);
pq.push((edge){s, 0});
while (!pq.empty()) {
edge temp = pq.top();
pq.pop();
if (d[temp.to] < temp.cost)
continue;
for (const edge &next : e[temp.to]) {
T cost = temp.cost + next.cost;
if (d[next.to] > cost) {
d[next.to] = cost;
pq.push((edge){next.to, cost});
}
}
}
return d;
}
vector<T> bellmanford(ll s) {
vector<T> d(v, INF);
d[s] = 0;
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = d[temp.from] + temp.cost;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = d[temp.to] + temp.cost;
}
}
for (ll i = 0; i < v; i++) {
for (const edge_data &temp : ed) {
if (d[temp.from] != INF && d[temp.to] > d[temp.from] + temp.cost)
d[temp.to] = -INF;
if (!isDirected && d[temp.to] != INF &&
d[temp.from] > d[temp.to] + temp.cost)
d[temp.from] = -INF;
}
}
return d;
}
vector<T> shortest_path(ll s) {
if (isMinasEdge)
return bellmanford(s);
else
return dijkstra(s);
}
T kruskal() {
// if (isDirected)
UnionFind uf(v);
auto edge_data_cmp = [](const edge_data &a, const edge_data &b) {
return a.cost < b.cost;
};
sort(ed.begin(), ed.end(), edge_data_cmp);
T ans = 0;
for (const edge_data &temp : ed) {
if (uf.isSame(temp.from, temp.to))
continue;
uf.merge(temp.from, temp.to);
ans += temp.cost;
}
return ans;
}
void scc_dfs(ll s) {
used[s] = true;
for (const edge &i : e[s])
if (!used[i.to])
scc_dfs(i.to);
vs.push_back(s);
}
void scc_rdfs(ll s, ll k) {
used[s] = true;
cmp[s] = k;
for (const edge &i : re[s])
if (!used[i.to])
scc_rdfs(i.to, k);
}
vector<ll> scc() {
used.resize(v);
fill(used.begin(), used.end(), false);
cmp.resize(v);
vs.clear();
for (ll i = 0; i < v; i++)
if (!used[i])
scc_dfs(i);
used.resize(v);
fill(used.begin(), used.end(), false);
ll k = 0;
for (ll i = vs.size() - 1; i >= 0; i--)
if (!used[vs[i]])
scc_rdfs(vs[i], k++);
return cmp;
}
};
ll r1, c1, r2, c2;
ll get(ll r, ll c) {
ll temp = nCk(r + c + 2, r + 1, mod) - 1;
if (temp < 0)
temp += mod;
return temp;
}
int main() {
scanf("%lld%lld%lld%lld", &r1, &c1, &r2, &c2);
r1--;
c1--;
ll ans =
(get(r2, c2) - get(r2, c1) - get(r1, c2) + get(r1, c1) + 2 * mod) % mod;
printf("%lld\n", ans);
}
| replace | 30 | 31 | 30 | 31 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll MAX = 1e6 + 5;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll a, b, c, d;
a = COM(r2 + 1 + c2 + 1, c2 + 1);
b = COM(r1 + c2 + 1, c2 + 1);
c = COM(r2 + 1 + c1, c1);
d = COM(r1 + c1, c1);
ll ans = (a - b - c + d) % MOD;
if (ans < 0)
ans += MOD;
// cout<<a<<b<<c<<d<<"\n";
cout << ans << "\n";
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); i++)
typedef long long ll;
const ll MAX = 1e6 * 2 + 5;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll n, ll k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
COMinit();
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll a, b, c, d;
a = COM(r2 + 1 + c2 + 1, c2 + 1);
b = COM(r1 + c2 + 1, c2 + 1);
c = COM(r2 + 1 + c1, c1);
d = COM(r1 + c1, c1);
ll ans = (a - b - c + d) % MOD;
if (ans < 0)
ans += MOD;
// cout<<a<<b<<c<<d<<"\n";
cout << ans << "\n";
return 0;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (ll) a.size()
#define ALL(a) a.begin(), a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) \
do { \
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, \
#__VA_ARGS__); \
_do(__VA_ARGS__); \
} while (0)
template <typename T> void _do(T &&_x) { cerr << _x << endl; }
template <typename T, typename... S> void _do(T &&_x, S &&..._t) {
cerr << _x << ", ";
_do(_t...);
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, const pair<_a, _b> &_p) {
return _s << "(" << _p.X << "," << _p.Y << ")";
}
template <typename It> ostream &_OUTC(ostream &_s, It _ita, It _itb) {
_s << "{";
for (It _it = _ita; _it != _itb; _it++) {
_s << (_it == _ita ? "" : ",") << *_it;
}
_s << "}";
return _s;
}
template <typename _a> ostream &operator<<(ostream &_s, vector<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a> ostream &operator<<(ostream &_s, set<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, map<_a, _b> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _t> void pary(_t _a, _t _b) {
_OUTC(cerr, _a, _b);
cerr << endl;
}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#endif // cold66
//}
template <class T> inline bool chkmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chkmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const ll MAXn = 1e6 + 5, MAXlg = __lg(MAXn) + 2;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f;
ll fac[MAXn], inv[MAXn];
ll mul(ll a, ll b) { return a * b % MOD; }
ll add(ll a, ll b) {
ll ret = a + b;
if (ret >= MOD)
ret -= MOD;
return ret;
}
ll sub(ll a, ll b) {
ll ret = a - b;
if (ret < 0)
ret += MOD;
return ret;
}
ll fpow(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = mul(ret, a);
a = mul(a, a);
b >>= 1;
}
return ret;
}
ll C(ll n, ll m) {
ll ret = mul(fac[n], inv[m]);
ret = mul(ret, inv[n - m]);
debug(n, m, ret);
return ret;
}
int main() {
IOS();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
fac[0] = 1;
inv[0] = 1;
REP1(i, MAXn - 1) {
fac[i] = mul(fac[i - 1], i);
inv[i] = fpow(fac[i], MOD - 2);
}
ll ans = 0;
for (ll i = c1 + 1; i <= c2 + 1; i++) {
ans = add(ans, C(r2 + i, i));
ans = sub(ans, C(r1 - 1 + i, i));
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double lf;
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
#define REP(i, n) for (int i = 0; i < n; i++)
#define REP1(i, n) for (int i = 1; i <= n; i++)
#define RREP(i, n) for (int i = n - 1; i >= 0; i--)
#define RST(i, n) memset(i, n, sizeof i)
#define SZ(a) (ll) a.size()
#define ALL(a) a.begin(), a.end()
#define X first
#define Y second
#define mkp make_pair
#define pb push_back
#define eb emplace_back
#define pob pop_back
#ifdef cold66
#define debug(...) \
do { \
fprintf(stderr, "%s - %d (%s) = ", __PRETTY_FUNCTION__, __LINE__, \
#__VA_ARGS__); \
_do(__VA_ARGS__); \
} while (0)
template <typename T> void _do(T &&_x) { cerr << _x << endl; }
template <typename T, typename... S> void _do(T &&_x, S &&..._t) {
cerr << _x << ", ";
_do(_t...);
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, const pair<_a, _b> &_p) {
return _s << "(" << _p.X << "," << _p.Y << ")";
}
template <typename It> ostream &_OUTC(ostream &_s, It _ita, It _itb) {
_s << "{";
for (It _it = _ita; _it != _itb; _it++) {
_s << (_it == _ita ? "" : ",") << *_it;
}
_s << "}";
return _s;
}
template <typename _a> ostream &operator<<(ostream &_s, vector<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a> ostream &operator<<(ostream &_s, set<_a> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _a, typename _b>
ostream &operator<<(ostream &_s, map<_a, _b> &_c) {
return _OUTC(_s, ALL(_c));
}
template <typename _t> void pary(_t _a, _t _b) {
_OUTC(cerr, _a, _b);
cerr << endl;
}
#define IOS()
#else
#define debug(...)
#define pary(...)
#define endl '\n'
#define IOS() \
ios_base::sync_with_stdio(0); \
cin.tie(0);
#endif // cold66
//}
template <class T> inline bool chkmax(T &a, const T &b) {
return b > a ? a = b, true : false;
}
template <class T> inline bool chkmin(T &a, const T &b) {
return b < a ? a = b, true : false;
}
template <class T> using MaxHeap = priority_queue<T>;
template <class T> using MinHeap = priority_queue<T, vector<T>, greater<T>>;
const ll MAXn = 2e6 + 5, MAXlg = __lg(MAXn) + 2;
const ll MOD = 1000000007;
const ll INF = 0x3f3f3f3f;
ll fac[MAXn], inv[MAXn];
ll mul(ll a, ll b) { return a * b % MOD; }
ll add(ll a, ll b) {
ll ret = a + b;
if (ret >= MOD)
ret -= MOD;
return ret;
}
ll sub(ll a, ll b) {
ll ret = a - b;
if (ret < 0)
ret += MOD;
return ret;
}
ll fpow(ll a, ll b) {
ll ret = 1;
while (b) {
if (b & 1)
ret = mul(ret, a);
a = mul(a, a);
b >>= 1;
}
return ret;
}
ll C(ll n, ll m) {
ll ret = mul(fac[n], inv[m]);
ret = mul(ret, inv[n - m]);
debug(n, m, ret);
return ret;
}
int main() {
IOS();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
fac[0] = 1;
inv[0] = 1;
REP1(i, MAXn - 1) {
fac[i] = mul(fac[i - 1], i);
inv[i] = fpow(fac[i], MOD - 2);
}
ll ans = 0;
for (ll i = c1 + 1; i <= c2 + 1; i++) {
ans = add(ans, C(r2 + i, i));
ans = sub(ans, C(r1 - 1 + i, i));
}
cout << ans << endl;
}
| replace | 75 | 76 | 75 | 76 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// mod逆元を使ったnCkの計算(速)
const int64_t MAX = 510000;
const int64_t MOD = 1000000007;
int64_t fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int64_t COM(int64_t n, int64_t k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int64_t calc(int64_t x, int64_t y1, int64_t y2) {
int64_t A = COM(x + y2 + 1, y2); // 0からc2まで
int64_t B = COM(x + y1, y1 - 1); // 0からc1-1まで
A -= B;
if (A < 0) {
A += MOD;
}
return A % MOD;
}
int main() {
int64_t r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int64_t sum = 0;
COMinit();
for (int i = r1; i <= r2; i++) {
sum += calc(i, c1, c2);
sum %= MOD;
}
cout << sum << endl;
} | #include <bits/stdc++.h>
using namespace std;
// mod逆元を使ったnCkの計算(速)
const int64_t MAX = 3000000;
const int64_t MOD = 1000000007;
int64_t fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
int64_t COM(int64_t n, int64_t k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int64_t calc(int64_t x, int64_t y1, int64_t y2) {
int64_t A = COM(x + y2 + 1, y2); // 0からc2まで
int64_t B = COM(x + y1, y1 - 1); // 0からc1-1まで
A -= B;
if (A < 0) {
A += MOD;
}
return A % MOD;
}
int main() {
int64_t r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
int64_t sum = 0;
COMinit();
for (int i = r1; i <= r2; i++) {
sum += calc(i, c1, c2);
sum %= MOD;
}
cout << sum << endl;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = int64_t;
using uint = uint32_t;
using ulint = uint64_t;
template <class T> using vector2d = vector<vector<T>>;
template <class T> bool UpdateMax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> bool UpdateMin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> void OutVec(const vector<T> &vec) {
for (int i = 0; i < vec.size() - 1; ++i) {
cout << vec[i] << " ";
}
cout << vec.back() << endl;
}
template <class T> void OutVec2d(const vector2d<T> &vec) {
for (auto v : vec) {
OutVec(v);
}
}
class ModCombination {
std::vector<int64_t> fac, finv, inv;
int64_t max, mod;
public:
ModCombination(int64_t max_, int64_t mod_)
: max(max_), mod(mod_), fac(max_ + 1), finv(max_ + 1), inv(max_ + 1) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < max; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
int64_t GetCombination(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
};
int64_t EuclidMod(int64_t v, int64_t m) {
if (0 <= v && v < m) {
return v;
} else if (-m <= v && v < 0) {
return v + m;
} else {
int64_t result = v % m;
if (result < 0) {
result += m;
}
return result;
}
}
int64_t ModInv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
EuclidMod(u, m);
return u;
}
// return base^exponent (MOD. mod).
int64_t RepeatedPowMod(int64_t base, int64_t exponent, int64_t mod) {
if (exponent == 0)
return 1;
else if (exponent % 2 == 0) {
int64_t root = RepeatedPowMod(base, exponent / 2, mod);
return (root * root) % mod;
} else {
return (base * RepeatedPowMod(base, exponent - 1, mod)) % mod;
}
}
template <int64_t mod> class ModInt {
int64_t value_;
public:
explicit ModInt(const int64_t x = 0) : value_(x % mod){};
ModInt &operator=(const ModInt &another) {
value_ = another.value_;
return *this;
}
ModInt &operator^=(const ModInt &another) {
value_ = RepeatedPowMod(value_, another.value_, mod);
return *this;
}
ModInt &operator+=(const ModInt &another) {
value_ += another.value_;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator-=(const ModInt &another) {
value_ -= another.value_;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator*=(const ModInt &another) {
value_ *= another.value_;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator/=(const ModInt &another) {
value_ = value_ * ModInv(another.value_, mod);
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator++() {
value_ += 1;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt operator++(int) {
ModInt tmp = *this;
this->value_ += 1;
this->value_ = EuclidMod(this->value_, mod);
return tmp;
}
ModInt &operator--() {
value_ -= 1;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt operator--(int) {
ModInt tmp = *this;
this->value_ -= 1;
this->value_ = EuclidMod(this->value_, mod);
return tmp;
}
int64_t GetValue() const { return value_; }
};
template <int64_t mod>
ModInt<mod> operator+(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) += right;
}
template <int64_t mod>
ModInt<mod> operator-(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) -= right;
}
template <int64_t mod>
ModInt<mod> operator/(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) /= right;
}
template <int64_t mod>
ModInt<mod> operator*(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) *= right;
}
template <int64_t mod>
ModInt<mod> operator^(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) ^= right;
}
template <int64_t mod>
std::ostream &operator<<(std::ostream &stream, const ModInt<mod> &mod_int) {
stream << mod_int.GetValue();
return stream;
}
int main() {
cout << std::fixed << std::setprecision(16);
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
const int64_t MOD = 1000000007;
ModCombination cmb(1000001, MOD);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ModInt<MOD> result = ModInt<MOD>(cmb.GetCombination(r2 + c2 + 2, r2 + 1) - 1);
result -= ModInt<MOD>(cmb.GetCombination(r1 + c2 + 1, r1) - 1);
result -= ModInt<MOD>(cmb.GetCombination(r2 + c1 + 1, c1) - 1);
result += ModInt<MOD>(cmb.GetCombination(r1 + c1, r1) - 1);
cout << result << endl;
return 0;
}
| #include <algorithm>
#include <cassert>
#include <cfloat>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = int64_t;
using uint = uint32_t;
using ulint = uint64_t;
template <class T> using vector2d = vector<vector<T>>;
template <class T> bool UpdateMax(T &a, const T &b) {
if (a < b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> bool UpdateMin(T &a, const T &b) {
if (a > b) {
a = b;
return true;
} else {
return false;
}
}
template <class T> void OutVec(const vector<T> &vec) {
for (int i = 0; i < vec.size() - 1; ++i) {
cout << vec[i] << " ";
}
cout << vec.back() << endl;
}
template <class T> void OutVec2d(const vector2d<T> &vec) {
for (auto v : vec) {
OutVec(v);
}
}
class ModCombination {
std::vector<int64_t> fac, finv, inv;
int64_t max, mod;
public:
ModCombination(int64_t max_, int64_t mod_)
: max(max_), mod(mod_), fac(max_ + 1), finv(max_ + 1), inv(max_ + 1) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < max; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
int64_t GetCombination(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
};
int64_t EuclidMod(int64_t v, int64_t m) {
if (0 <= v && v < m) {
return v;
} else if (-m <= v && v < 0) {
return v + m;
} else {
int64_t result = v % m;
if (result < 0) {
result += m;
}
return result;
}
}
int64_t ModInv(int64_t a, int64_t m) {
int64_t b = m, u = 1, v = 0;
while (b) {
int64_t t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
EuclidMod(u, m);
return u;
}
// return base^exponent (MOD. mod).
int64_t RepeatedPowMod(int64_t base, int64_t exponent, int64_t mod) {
if (exponent == 0)
return 1;
else if (exponent % 2 == 0) {
int64_t root = RepeatedPowMod(base, exponent / 2, mod);
return (root * root) % mod;
} else {
return (base * RepeatedPowMod(base, exponent - 1, mod)) % mod;
}
}
template <int64_t mod> class ModInt {
int64_t value_;
public:
explicit ModInt(const int64_t x = 0) : value_(x % mod){};
ModInt &operator=(const ModInt &another) {
value_ = another.value_;
return *this;
}
ModInt &operator^=(const ModInt &another) {
value_ = RepeatedPowMod(value_, another.value_, mod);
return *this;
}
ModInt &operator+=(const ModInt &another) {
value_ += another.value_;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator-=(const ModInt &another) {
value_ -= another.value_;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator*=(const ModInt &another) {
value_ *= another.value_;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator/=(const ModInt &another) {
value_ = value_ * ModInv(another.value_, mod);
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt &operator++() {
value_ += 1;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt operator++(int) {
ModInt tmp = *this;
this->value_ += 1;
this->value_ = EuclidMod(this->value_, mod);
return tmp;
}
ModInt &operator--() {
value_ -= 1;
value_ = EuclidMod(value_, mod);
return *this;
}
ModInt operator--(int) {
ModInt tmp = *this;
this->value_ -= 1;
this->value_ = EuclidMod(this->value_, mod);
return tmp;
}
int64_t GetValue() const { return value_; }
};
template <int64_t mod>
ModInt<mod> operator+(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) += right;
}
template <int64_t mod>
ModInt<mod> operator-(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) -= right;
}
template <int64_t mod>
ModInt<mod> operator/(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) /= right;
}
template <int64_t mod>
ModInt<mod> operator*(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) *= right;
}
template <int64_t mod>
ModInt<mod> operator^(const ModInt<mod> &left, const ModInt<mod> &right) {
return ModInt<mod>(left) ^= right;
}
template <int64_t mod>
std::ostream &operator<<(std::ostream &stream, const ModInt<mod> &mod_int) {
stream << mod_int.GetValue();
return stream;
}
int main() {
cout << std::fixed << std::setprecision(16);
cin.tie(nullptr);
std::ios::sync_with_stdio(false);
const int64_t MOD = 1000000007;
ModCombination cmb(2000010, MOD);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ModInt<MOD> result = ModInt<MOD>(cmb.GetCombination(r2 + c2 + 2, r2 + 1) - 1);
result -= ModInt<MOD>(cmb.GetCombination(r1 + c2 + 1, r1) - 1);
result -= ModInt<MOD>(cmb.GetCombination(r2 + c1 + 1, c1) - 1);
result += ModInt<MOD>(cmb.GetCombination(r1 + c1, r1) - 1);
cout << result << endl;
return 0;
}
| replace | 227 | 228 | 227 | 228 | 0 | |
p02782 | C++ | Runtime Error | #define DEBUG 1
#include <bits/stdc++.h>
#define loop(n) \
for (lint ngtkana_is_a_genius = 0; ngtkana_is_a_genius < lint(n); \
ngtkana_is_a_genius++)
#define rep(i, begin, end) for (lint i = lint(begin); (i) < lint(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto &&a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
};
auto cmx = [](auto &&a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#if DEBUG
#define debug(...) \
do { \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename T> T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
std::swap(a, m);
u -= t * v;
std::swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> class modular {
private:
int value;
public:
constexpr modular() = default;
constexpr modular(const modular &) = default;
constexpr modular(modular &&) = default;
modular &operator=(const modular &) = default;
modular &operator=(modular &&) = default;
template <typename U> modular(const U &x) { value = normalize(x); }
template <typename U> static auto normalize(const U &x) {
int v = static_cast<int>(-mod() <= x && x < mod() ? x : x % mod());
if (v < 0)
v += mod();
return v;
}
auto const &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static auto mod() { return T::value; }
auto &operator+=(const modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
auto &operator-=(const modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> auto &operator+=(const U &other) {
return *this += modular(other);
}
template <typename U> auto &operator-=(const U &other) {
return *this -= modular(other);
}
auto operator-() const { return modular(-value); }
auto &operator++() { return *this += 1; }
auto &operator--() { return *this -= 1; }
auto operator++(int) {
modular result(*this);
operator++();
return result;
}
auto operator--(int) {
modular result(*this);
operator--();
return result;
}
template <typename U = T> auto &operator*=(const modular &rhs) {
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
return *this;
}
auto &operator/=(const modular &other) {
return *this *= modular(inverse(other.value, mod()));
}
};
template <typename T> struct is_modular : std::false_type {};
template <typename T> struct is_modular<modular<T>> : std::true_type {};
template <typename T> constexpr bool is_modular_v = is_modular<T>::value;
template <typename T>
bool operator==(const modular<T> &lhs, const modular<T> &rhs) {
return lhs() == rhs();
}
template <typename T, typename U>
bool operator==(const modular<T> &lhs, U rhs) {
return lhs == modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const modular<T> &lhs, const modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
modular<T> operator+(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) += rhs;
}
template <typename T, typename U>
modular<T> operator+(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) += rhs;
}
template <typename T, typename U>
modular<T> operator+(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) += rhs;
}
template <typename T>
modular<T> operator-(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
modular<T> operator-(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
modular<T> operator-(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) -= rhs;
}
template <typename T>
modular<T> operator*(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
modular<T> operator*(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
modular<T> operator*(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) *= rhs;
}
template <typename T>
modular<T> operator/(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
modular<T> operator/(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
modular<T> operator/(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) /= rhs;
}
template <typename T, typename U> modular<T> power(const modular<T> &a, U b) {
assert(b >= 0);
modular<T> x = a, ret = 1;
for (; b > 0; b /= 2) {
if (b % 2 == 1)
ret *= x;
x *= x;
}
return ret;
}
template <typename T> std::string to_string(const modular<T> &a) {
return std::to_string(a());
}
template <typename T>
auto operator<<(std::ostream &os, const T &a)
-> std::enable_if_t<is_modular_v<T>, std::ostream &> {
return os << a();
}
template <typename T>
auto operator>>(std::istream &is, T &a)
-> std::enable_if_t<is_modular_v<T>, std::istream &> {
long long x;
is >> x;
a = T(x);
return is;
}
// using mod_type = int;
// struct variable_mod { static mod_type value; };
// mod_type variable_mod::value;
// mod_type& mod = variable_mod::value;
// using mint = modular< variable_mod >;
constexpr int mod = 1'000'000'007;
using mint = modular<std::integral_constant<std::decay_t<decltype(mod)>, mod>>;
template <typename Value> class factorials {
std::vector<Value> fact, finv;
public:
factorials() = default;
void build(int n) {
fact.resize(n), finv.resize(n);
fact.at(0) = 1;
for (int i = 1; i < n; i++)
fact.at(i) = fact.at(i - 1) * Value(i);
finv.at(n - 1) = Value(1) / fact.at(n - 1);
for (int i = n - 2; i >= 0; i--)
finv.at(i) = finv.at(i + 1) * Value(i + 1);
}
auto operator()(int i) const { return fact.at(i); }
auto inv(int i) const { return finv.at(i); }
auto binom(int i, int j) const {
assert(0 <= i);
if (j < 0 || i < j)
return Value(0);
return fact.at(i) * finv.at(j) * finv.at(i - j);
}
auto deal(int i, int j) const { return binom(i + j - 1, j - 1); }
};
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
factorials<mint> fact;
fact.build(2000002);
int r1, c1, r2, c2;
std::cin >> r1 >> c1 >> r2 >> c2;
r1--, c1--;
auto cal = [&](int r, int c) { return fact.binom(r + c + 2, c + 1) - 1; };
mint ans = cal(c2, r2) - cal(c1, r2) - cal(c2, r1) + cal(c1, r1);
std::cout << ans << std::endl;
return 0;
} | #define DEBUG 1
#include <bits/stdc++.h>
#define loop(n) \
for (lint ngtkana_is_a_genius = 0; ngtkana_is_a_genius < lint(n); \
ngtkana_is_a_genius++)
#define rep(i, begin, end) for (lint i = lint(begin); (i) < lint(end); i++)
#define all(v) v.begin(), v.end()
#define rand(l, r) std::uniform_int_distribution<>(l, r)(mt)
using lint = long long;
auto mt = std::mt19937_64(std::random_device{}());
auto cmn = [](auto &&a, auto b) {
if (a > b) {
a = b;
return true;
}
return false;
};
auto cmx = [](auto &&a, auto b) {
if (a < b) {
a = b;
return true;
}
return false;
};
void debug_impl() { std::cerr << std::endl; }
template <typename Head, typename... Tail>
void debug_impl(Head head, Tail... tail) {
std::cerr << " " << head;
debug_impl(tail...);
}
#if DEBUG
#define debug(...) \
do { \
std::cerr << std::boolalpha << "[" << #__VA_ARGS__ << "]:"; \
debug_impl(__VA_ARGS__); \
std::cerr << std::noboolalpha; \
} while (false)
#else
#define debug(...) \
{}
#endif
template <typename T> T inverse(T a, T m) {
T u = 0, v = 1;
while (a != 0) {
T t = m / a;
m -= t * a;
std::swap(a, m);
u -= t * v;
std::swap(u, v);
}
assert(m == 1);
return u;
}
template <typename T> class modular {
private:
int value;
public:
constexpr modular() = default;
constexpr modular(const modular &) = default;
constexpr modular(modular &&) = default;
modular &operator=(const modular &) = default;
modular &operator=(modular &&) = default;
template <typename U> modular(const U &x) { value = normalize(x); }
template <typename U> static auto normalize(const U &x) {
int v = static_cast<int>(-mod() <= x && x < mod() ? x : x % mod());
if (v < 0)
v += mod();
return v;
}
auto const &operator()() const { return value; }
template <typename U> explicit operator U() const {
return static_cast<U>(value);
}
constexpr static auto mod() { return T::value; }
auto &operator+=(const modular &other) {
if ((value += other.value) >= mod())
value -= mod();
return *this;
}
auto &operator-=(const modular &other) {
if ((value -= other.value) < 0)
value += mod();
return *this;
}
template <typename U> auto &operator+=(const U &other) {
return *this += modular(other);
}
template <typename U> auto &operator-=(const U &other) {
return *this -= modular(other);
}
auto operator-() const { return modular(-value); }
auto &operator++() { return *this += 1; }
auto &operator--() { return *this -= 1; }
auto operator++(int) {
modular result(*this);
operator++();
return result;
}
auto operator--(int) {
modular result(*this);
operator--();
return result;
}
template <typename U = T> auto &operator*=(const modular &rhs) {
value = normalize(static_cast<int64_t>(value) *
static_cast<int64_t>(rhs.value));
return *this;
}
auto &operator/=(const modular &other) {
return *this *= modular(inverse(other.value, mod()));
}
};
template <typename T> struct is_modular : std::false_type {};
template <typename T> struct is_modular<modular<T>> : std::true_type {};
template <typename T> constexpr bool is_modular_v = is_modular<T>::value;
template <typename T>
bool operator==(const modular<T> &lhs, const modular<T> &rhs) {
return lhs() == rhs();
}
template <typename T, typename U>
bool operator==(const modular<T> &lhs, U rhs) {
return lhs == modular<T>(rhs);
}
template <typename T, typename U>
bool operator==(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) == rhs;
}
template <typename T>
bool operator!=(const modular<T> &lhs, const modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(const modular<T> &lhs, U rhs) {
return !(lhs == rhs);
}
template <typename T, typename U>
bool operator!=(U lhs, const modular<T> &rhs) {
return !(lhs == rhs);
}
template <typename T>
modular<T> operator+(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) += rhs;
}
template <typename T, typename U>
modular<T> operator+(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) += rhs;
}
template <typename T, typename U>
modular<T> operator+(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) += rhs;
}
template <typename T>
modular<T> operator-(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
modular<T> operator-(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) -= rhs;
}
template <typename T, typename U>
modular<T> operator-(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) -= rhs;
}
template <typename T>
modular<T> operator*(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
modular<T> operator*(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) *= rhs;
}
template <typename T, typename U>
modular<T> operator*(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) *= rhs;
}
template <typename T>
modular<T> operator/(const modular<T> &lhs, const modular<T> &rhs) {
return modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
modular<T> operator/(const modular<T> &lhs, U rhs) {
return modular<T>(lhs) /= rhs;
}
template <typename T, typename U>
modular<T> operator/(U lhs, const modular<T> &rhs) {
return modular<T>(lhs) /= rhs;
}
template <typename T, typename U> modular<T> power(const modular<T> &a, U b) {
assert(b >= 0);
modular<T> x = a, ret = 1;
for (; b > 0; b /= 2) {
if (b % 2 == 1)
ret *= x;
x *= x;
}
return ret;
}
template <typename T> std::string to_string(const modular<T> &a) {
return std::to_string(a());
}
template <typename T>
auto operator<<(std::ostream &os, const T &a)
-> std::enable_if_t<is_modular_v<T>, std::ostream &> {
return os << a();
}
template <typename T>
auto operator>>(std::istream &is, T &a)
-> std::enable_if_t<is_modular_v<T>, std::istream &> {
long long x;
is >> x;
a = T(x);
return is;
}
// using mod_type = int;
// struct variable_mod { static mod_type value; };
// mod_type variable_mod::value;
// mod_type& mod = variable_mod::value;
// using mint = modular< variable_mod >;
constexpr int mod = 1'000'000'007;
using mint = modular<std::integral_constant<std::decay_t<decltype(mod)>, mod>>;
template <typename Value> class factorials {
std::vector<Value> fact, finv;
public:
factorials() = default;
void build(int n) {
fact.resize(n), finv.resize(n);
fact.at(0) = 1;
for (int i = 1; i < n; i++)
fact.at(i) = fact.at(i - 1) * Value(i);
finv.at(n - 1) = Value(1) / fact.at(n - 1);
for (int i = n - 2; i >= 0; i--)
finv.at(i) = finv.at(i + 1) * Value(i + 1);
}
auto operator()(int i) const { return fact.at(i); }
auto inv(int i) const { return finv.at(i); }
auto binom(int i, int j) const {
assert(0 <= i);
if (j < 0 || i < j)
return Value(0);
return fact.at(i) * finv.at(j) * finv.at(i - j);
}
auto deal(int i, int j) const { return binom(i + j - 1, j - 1); }
};
int main() {
std::cin.tie(0);
std::cin.sync_with_stdio(false);
factorials<mint> fact;
fact.build(5000002);
int r1, c1, r2, c2;
std::cin >> r1 >> c1 >> r2 >> c2;
r1--, c1--;
auto cal = [&](int r, int c) { return fact.binom(r + c + 2, c + 1) - 1; };
mint ans = cal(c2, r2) - cal(c1, r2) - cal(c2, r1) + cal(c1, r1);
std::cout << ans << std::endl;
return 0;
} | replace | 269 | 270 | 269 | 270 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define rev(i, s, e) for (i64(i) = (s); (i)-- > (e);)
#define all(x) x.begin(), x.end()
template <class T>
static inline std::vector<T> ndvec(size_t &&n, T val) noexcept {
return std::vector<T>(n, std::forward<T>(val));
}
template <class... Tail>
static inline auto ndvec(size_t &&n, Tail &&...tail) noexcept {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(
n, ndvec(std::forward<Tail>(tail)...));
}
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
template <i64 M> struct modint {
i64 a;
constexpr modint(const i64 x = 0) noexcept : a((x % M + M) % M) {}
constexpr i64 value() const noexcept { return a; }
constexpr modint pow(i64 r) const noexcept {
modint ans(1);
modint aa = *this;
while (r) {
if (r & 1) {
ans *= aa;
}
aa *= aa;
r >>= 1;
}
return ans;
}
constexpr modint &operator+=(const modint r) noexcept {
a += r.a;
if (a >= M)
a -= M;
return *this;
}
constexpr modint &operator=(const i64 r) {
a = (r % M + M) % M;
return *this;
}
constexpr modint &operator-=(const modint r) noexcept {
a -= r.a;
if (a < 0)
a += M;
return *this;
}
constexpr modint &operator*=(const modint r) noexcept {
a = a * r.a % M;
return *this;
}
constexpr modint &operator/=(modint r) noexcept {
i64 ex = M - 2;
while (ex) {
if (ex & 1) {
*this *= r;
}
r *= r;
ex >>= 1;
}
return *this;
}
constexpr modint operator+(const modint r) const {
return modint(*this) += r;
}
constexpr modint operator-(const modint r) const {
return modint(*this) -= r;
}
constexpr modint operator*(const modint r) const {
return modint(*this) *= r;
}
constexpr modint operator/(const modint r) const {
return modint(*this) /= r;
}
};
template <const i64 M>
std::ostream &operator<<(std::ostream &os, const modint<M> &m) {
os << m.value();
return os;
}
using fp = modint<(i64)(1e9 + 7)>;
#include <vector>
using i64 = long long;
template <class T>
void build_factorial(std::vector<T> &fact, std::vector<T> &finv,
std::vector<T> &inv, std::vector<T> &bin) {
std::size_t N = fact.size();
fact[0] = T(1);
bin[0] = T(1);
for (int i = 1; i < N; i++) {
fact[i] = fact[i - 1] * T(i);
bin[i] = bin[i - 1] * T(2);
}
finv[N - 1] = T(1) / fact[N - 1];
for (int i = N - 1; i-- > 0;) {
finv[i] = finv[i + 1] * T(i + 1);
}
for (int i = 0; i < N; i++) {
inv[i] = fact[i - 1] * finv[i];
}
}
i64 R1, C1, R2, C2;
i64 NMAX = 1e6 + 1;
int main() {
cin >> R1 >> C1 >> R2 >> C2;
vector<fp> fact(NMAX);
vector<fp> finv(NMAX);
vector<fp> inv(NMAX);
vector<fp> bin(NMAX);
build_factorial(fact, finv, inv, bin);
auto f = [&](i64 i, i64 j) {
if (i == 0 && j == 0)
return fp(1);
fp ans = fp(0);
fp nowi = fp(0);
fp nowj = fp(0);
for (i64 n = 0; n <= i + j; n++) {
ans += bin[n];
if (n >= i + 1) {
nowi = nowi * fp(2) + fact[n - 1] * finv[n - i - 1] * finv[i];
if (n == i + 1)
nowi = fp(1);
ans -= nowi;
}
if (n >= j + 1) {
nowj = nowj * fp(2) + fact[n - 1] * finv[n - j - 1] * finv[j];
if (n == j + 1)
nowj = fp(1);
ans -= nowj;
}
}
return ans;
};
R1--;
C1--;
cout << (f(R2, C2) + f(R1, C1) - f(R1, C2) - f(R2, C1)).value() << endl;
}
| #include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define rep(i, s, e) for (i64(i) = (s); (i) < (e); (i)++)
#define rev(i, s, e) for (i64(i) = (s); (i)-- > (e);)
#define all(x) x.begin(), x.end()
template <class T>
static inline std::vector<T> ndvec(size_t &&n, T val) noexcept {
return std::vector<T>(n, std::forward<T>(val));
}
template <class... Tail>
static inline auto ndvec(size_t &&n, Tail &&...tail) noexcept {
return std::vector<decltype(ndvec(std::forward<Tail>(tail)...))>(
n, ndvec(std::forward<Tail>(tail)...));
}
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
template <i64 M> struct modint {
i64 a;
constexpr modint(const i64 x = 0) noexcept : a((x % M + M) % M) {}
constexpr i64 value() const noexcept { return a; }
constexpr modint pow(i64 r) const noexcept {
modint ans(1);
modint aa = *this;
while (r) {
if (r & 1) {
ans *= aa;
}
aa *= aa;
r >>= 1;
}
return ans;
}
constexpr modint &operator+=(const modint r) noexcept {
a += r.a;
if (a >= M)
a -= M;
return *this;
}
constexpr modint &operator=(const i64 r) {
a = (r % M + M) % M;
return *this;
}
constexpr modint &operator-=(const modint r) noexcept {
a -= r.a;
if (a < 0)
a += M;
return *this;
}
constexpr modint &operator*=(const modint r) noexcept {
a = a * r.a % M;
return *this;
}
constexpr modint &operator/=(modint r) noexcept {
i64 ex = M - 2;
while (ex) {
if (ex & 1) {
*this *= r;
}
r *= r;
ex >>= 1;
}
return *this;
}
constexpr modint operator+(const modint r) const {
return modint(*this) += r;
}
constexpr modint operator-(const modint r) const {
return modint(*this) -= r;
}
constexpr modint operator*(const modint r) const {
return modint(*this) *= r;
}
constexpr modint operator/(const modint r) const {
return modint(*this) /= r;
}
};
template <const i64 M>
std::ostream &operator<<(std::ostream &os, const modint<M> &m) {
os << m.value();
return os;
}
using fp = modint<(i64)(1e9 + 7)>;
#include <vector>
using i64 = long long;
template <class T>
void build_factorial(std::vector<T> &fact, std::vector<T> &finv,
std::vector<T> &inv, std::vector<T> &bin) {
std::size_t N = fact.size();
fact[0] = T(1);
bin[0] = T(1);
for (int i = 1; i < N; i++) {
fact[i] = fact[i - 1] * T(i);
bin[i] = bin[i - 1] * T(2);
}
finv[N - 1] = T(1) / fact[N - 1];
for (int i = N - 1; i-- > 0;) {
finv[i] = finv[i + 1] * T(i + 1);
}
for (int i = 0; i < N; i++) {
inv[i] = fact[i - 1] * finv[i];
}
}
i64 R1, C1, R2, C2;
i64 NMAX = 2e6 + 1000;
int main() {
cin >> R1 >> C1 >> R2 >> C2;
vector<fp> fact(NMAX);
vector<fp> finv(NMAX);
vector<fp> inv(NMAX);
vector<fp> bin(NMAX);
build_factorial(fact, finv, inv, bin);
auto f = [&](i64 i, i64 j) {
if (i == 0 && j == 0)
return fp(1);
fp ans = fp(0);
fp nowi = fp(0);
fp nowj = fp(0);
for (i64 n = 0; n <= i + j; n++) {
ans += bin[n];
if (n >= i + 1) {
nowi = nowi * fp(2) + fact[n - 1] * finv[n - i - 1] * finv[i];
if (n == i + 1)
nowi = fp(1);
ans -= nowi;
}
if (n >= j + 1) {
nowj = nowj * fp(2) + fact[n - 1] * finv[n - j - 1] * finv[j];
if (n == j + 1)
nowj = fp(1);
ans -= nowj;
}
}
return ans;
};
R1--;
C1--;
cout << (f(R2, C2) + f(R1, C1) - f(R1, C2) - f(R2, C1)).value() << endl;
}
| replace | 116 | 117 | 116 | 117 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vi2;
typedef vector<vi2> vi3;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<ll> vll;
typedef vector<vll> vll2;
typedef vector<vll2> vll3;
typedef vector<bool> vb;
#define el '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repi(i, a, b) for (int i = a; i >= b; i--)
#define umap unordered_map
#define uset unordered_set
#define vec vector
#define loop(a) for (auto &x : a)
#define all(a) a.begin(), a.end()
#define mp make_pair
const ll modulo = 1e9 + 7;
void add_self(ll &a, ll b) {
a += b;
if (a >= modulo) {
a -= modulo;
}
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += modulo;
}
return a;
}
ll mul(ll a, ll b) { return a * b % modulo; }
vll fac, fnv;
ll c(int total, int chosen) {
if (total < chosen) {
return 0;
}
if (chosen == 0 || total == chosen) {
return 1;
}
return mul(mul(fac[total], fnv[chosen]), fnv[total - chosen]);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = extgcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
ll invmod(ll a, ll m) {
ll x, y;
ll g = extgcd(a, m, x, y);
if (g != 1) {
return -1;
} else {
x = (x % m + m) % m;
return x;
}
}
void init() {
fac = vll(1e6);
fnv = vll(1e6);
fac[0] = fac[1] = 1;
fnv[0] = fnv[1] = 1;
rep(i, 2, fac.size()) {
fac[i] = mul(fac[i - 1], i);
ll work = invmod(i, modulo);
fnv[i] = mul(fnv[i - 1], work);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans = 0;
rep(i, r1, r2 + 1) {
add_self(ans, sub(c(i + c2 + 1, i + 1), c(i + c1, i + 1)));
}
cout << ans;
}
| #include <algorithm>
#include <cmath>
#include <iostream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vi2;
typedef vector<vi2> vi3;
typedef pair<int, int> pii;
typedef vector<pii> vii;
typedef vector<ll> vll;
typedef vector<vll> vll2;
typedef vector<vll2> vll3;
typedef vector<bool> vb;
#define el '\n'
#define rep(i, a, b) for (int i = a; i < b; i++)
#define repi(i, a, b) for (int i = a; i >= b; i--)
#define umap unordered_map
#define uset unordered_set
#define vec vector
#define loop(a) for (auto &x : a)
#define all(a) a.begin(), a.end()
#define mp make_pair
const ll modulo = 1e9 + 7;
void add_self(ll &a, ll b) {
a += b;
if (a >= modulo) {
a -= modulo;
}
}
ll sub(ll a, ll b) {
a -= b;
if (a < 0) {
a += modulo;
}
return a;
}
ll mul(ll a, ll b) { return a * b % modulo; }
vll fac, fnv;
ll c(int total, int chosen) {
if (total < chosen) {
return 0;
}
if (chosen == 0 || total == chosen) {
return 1;
}
return mul(mul(fac[total], fnv[chosen]), fnv[total - chosen]);
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
if (a == 0) {
x = 0;
y = 1;
return b;
}
ll x1, y1;
ll d = extgcd(b % a, a, x1, y1);
x = y1 - (b / a) * x1;
y = x1;
return d;
}
ll invmod(ll a, ll m) {
ll x, y;
ll g = extgcd(a, m, x, y);
if (g != 1) {
return -1;
} else {
x = (x % m + m) % m;
return x;
}
}
void init() {
fac = vll(2e6 + 100);
fnv = vll(2e6 + 100);
fac[0] = fac[1] = 1;
fnv[0] = fnv[1] = 1;
rep(i, 2, fac.size()) {
fac[i] = mul(fac[i - 1], i);
ll work = invmod(i, modulo);
fnv[i] = mul(fnv[i - 1], work);
}
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init();
ll ans = 0;
rep(i, r1, r2 + 1) {
add_self(ans, sub(c(i + c2 + 1, i + 1), c(i + c1, i + 1)));
}
cout << ans;
}
| replace | 90 | 92 | 90 | 92 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAX_N 200010
long long inv[MAX_N];
long long factorial[MAX_N];
long long inv_factorial[MAX_N];
void GetInv() {
for (int i = 1; i < MAX_N; i++) {
if (i == 1)
inv[i] = 1;
else {
inv[i] = (mod - (mod / i) * inv[mod % i]) % mod;
if (inv[i] < 0)
inv[i] += mod;
}
}
}
void GetFactorial() {
factorial[0] = 1;
inv_factorial[0] = 1;
for (int i = 1; i < MAX_N; i++) {
factorial[i] = factorial[i - 1] * i;
factorial[i] %= mod;
inv_factorial[i] = inv_factorial[i - 1] * inv[i];
inv_factorial[i] %= mod;
}
}
long long combination(int n, int r) {
long long ret = factorial[n] * inv_factorial[r];
ret %= mod;
ret *= inv_factorial[n - r];
return ret % mod;
}
long long rect(int r, int c) { return combination(c + r + 2, r + 1) - 1; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
GetInv();
GetFactorial();
long long r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long ans =
rect(r1 - 1, c1 - 1) + rect(r2, c2) - rect(r1 - 1, c2) - rect(r2, c1 - 1);
cout << (ans % mod + mod) % mod << "\n";
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
#define MAX_N 2000100
long long inv[MAX_N];
long long factorial[MAX_N];
long long inv_factorial[MAX_N];
void GetInv() {
for (int i = 1; i < MAX_N; i++) {
if (i == 1)
inv[i] = 1;
else {
inv[i] = (mod - (mod / i) * inv[mod % i]) % mod;
if (inv[i] < 0)
inv[i] += mod;
}
}
}
void GetFactorial() {
factorial[0] = 1;
inv_factorial[0] = 1;
for (int i = 1; i < MAX_N; i++) {
factorial[i] = factorial[i - 1] * i;
factorial[i] %= mod;
inv_factorial[i] = inv_factorial[i - 1] * inv[i];
inv_factorial[i] %= mod;
}
}
long long combination(int n, int r) {
long long ret = factorial[n] * inv_factorial[r];
ret %= mod;
ret *= inv_factorial[n - r];
return ret % mod;
}
long long rect(int r, int c) { return combination(c + r + 2, r + 1) - 1; }
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
GetInv();
GetFactorial();
long long r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long ans =
rect(r1 - 1, c1 - 1) + rect(r2, c2) - rect(r1 - 1, c2) - rect(r2, c1 - 1);
cout << (ans % mod + mod) % mod << "\n";
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LEN(x) (long long)(x.size())
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head &&head, Tail &&...tail) {
std::cerr << head;
if (sizeof...(tail) != 0) {
std::cerr << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void debug(std::vector<T> &v) {
for (auto &a : v) {
std::cerr << a;
if (&a != &v.back()) {
std::cerr << " ";
}
}
std::cerr << std::endl;
}
template <class T> void debug(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
bool is_bit_on(const unsigned long long bit, const unsigned int i) {
return (bit >> i) & 1u;
}
unsigned long long bit_set(const unsigned long long bit, const unsigned int i,
const unsigned int b) {
assert(b == 0 or b == 1);
if (b == 0) {
return bit & ~(1ull << i);
} else {
return bit | (1ull << i);
}
}
// 初項s交差d長さnの数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// xが2の階乗かどうか判定
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u; // 1,073,741,824
const long long LINF = 1ull << 60u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
template <int mod> struct mint {
long long x;
mint(long long x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
x -= mod;
}
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod) {
x -= mod;
}
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(long long t) const {
if (!t) {
return 1;
}
mint a = pow(t >> 1);
a *= a;
if (t & 1) {
a *= *this;
}
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
long long modpow(long long base, long long exp, long long mod) {
base %= mod;
long long result = 1;
while (exp > 0) {
if (exp & 1) {
result = (result * base) % mod;
}
base = (base * base) % mod;
exp >>= 1;
}
return result;
}
long long combination(long long n, long long r) {
uint64_t ans = 1;
for (uint64_t d = 1; d <= r; ++d) {
ans *= n--;
ans /= d;
}
return ans;
}
class Combination {
public:
int mod;
vector<long long> fact;
vector<long long> inv;
Combination(int n, int mod) : mod(mod) {
assert(0 < n);
this->fact.resize(n + 1, 1);
this->inv.resize(n + 1, 1);
for (int i = 1; i < fact.size(); ++i) {
this->fact[i] = (i * this->fact[i - 1]) % this->mod;
this->inv[i] = modpow(this->fact[i], this->mod - 2, this->mod);
}
}
long long nCr(int n, int k) {
assert(0 <= n and n < this->fact.size() and 0 <= k);
assert(n >= k);
auto a = this->fact[n];
auto b = (this->inv[k] * this->inv[n - k]) % this->mod;
return (a * b) % this->mod;
}
long long nHr(int n, int k) { return nCr(n + k - 1, k); }
};
const int MOD = 1000000000 + 7;
Combination comb(1000100, MOD);
mint<MOD> solve(LL Y1, LL X1, LL Y2, LL X2) {
const auto H = Y2 - Y1 + 1;
const auto W = X2 - X1 + 1;
mint<MOD> ans = comb.nCr(Y1 + X1, Y1);
FOR(y, 1, H) {
auto a = comb.nCr(Y1 + y + X1, X1);
ans += a;
LL m = (H - y);
LL n = (W - 1);
if (n == 0 or m == 0) {
continue;
}
// FOR(i, 0, m) {
// FOR(j, 0, n) {
// count += comb.nCr(i + j, i);
// }
// }
mint<MOD> count = mint<MOD>(m + 1) * comb.nCr(m + n, n - 1) / n - 1;
ans += count * a;
}
FOR(x, 1, W) {
auto a = comb.nCr(X1 + x + Y1, Y1);
ans += a;
LL m = (H - 1);
LL n = (W - x);
if (n == 0 or m == 0) {
continue;
}
// FOR(i, 0, H - 1) {
// FOR(j, 0, W - x) {
// int c = comb.nCr(i + j, i);
// count += comb.nCr(i + j, i);
// }
// }
mint<MOD> count = mint<MOD>(m + 1) * comb.nCr(m + n, n - 1) / n - 1;
ans += count * a;
}
return ans;
}
mint<MOD> check(LL Y1, LL X1, LL Y2, LL X2) {
mint<MOD> ans = 0;
FOR(y, Y1, Y2 + 1) {
FOR(x, X1, X2 + 1) { ans += comb.nCr(y + x, x); }
}
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL Y1, X1, Y2, X2;
cin >> Y1 >> X1 >> Y2 >> X2;
print(solve(Y1, X1, Y2, X2).x);
return 0;
}
| #include <algorithm>
#include <array>
#include <assert.h>
#include <bitset>
#include <climits>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define LEN(x) (long long)(x.size())
#define FOR(i, a, n) for (int i = (a); i < (n); ++i)
#define FOE(i, a) for (auto i : a)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SUM(x) std::accumulate(ALL(x), 0LL)
#define MIN(v) *std::min_element(v.begin(), v.end())
#define MAX(v) *std::max_element(v.begin(), v.end())
#define EXIST(v, x) (std::find(v.begin(), v.end(), x) != v.end())
#define BIT_COUNT(bit) (__builtin_popcount(bit))
typedef long long LL;
template <typename T> std::vector<T> make_v(size_t a) {
return std::vector<T>(a);
}
template <typename T, typename... Ts> auto make_v(size_t a, Ts... ts) {
return std::vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...));
} // C++14
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value == 0>::type fill_v(T &t,
const V &v) {
t = v;
}
template <typename T, typename V>
typename std::enable_if<std::is_class<T>::value != 0>::type fill_v(T &t,
const V &v) {
for (auto &e : t)
fill_v(e, v);
}
template <class T> inline T ceil(T a, T b) { return (a + b - 1) / b; }
void print() { std::cout << std::endl; }
template <class Head, class... Tail> void print(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(tail) != 0) {
std::cout << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void print(std::vector<T> &v) {
for (auto &a : v) {
std::cout << a;
if (&a != &v.back()) {
std::cout << " ";
}
}
std::cout << std::endl;
}
template <class T> void print(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
void debug() { std::cerr << std::endl; }
template <class Head, class... Tail> void debug(Head &&head, Tail &&...tail) {
std::cerr << head;
if (sizeof...(tail) != 0) {
std::cerr << " ";
}
print(std::forward<Tail>(tail)...);
}
template <class T> void debug(std::vector<T> &v) {
for (auto &a : v) {
std::cerr << a;
if (&a != &v.back()) {
std::cerr << " ";
}
}
std::cerr << std::endl;
}
template <class T> void debug(std::vector<std::vector<T>> &vv) {
for (auto &v : vv) {
print(v);
}
}
inline bool inside(long long y, long long x, long long H, long long W) {
return 0 <= y and y < H and 0 <= x and x < W;
}
template <class T> inline double euclidean_distance(T y1, T x1, T y2, T x2) {
return sqrt((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}
template <class T> inline double manhattan_distance(T y1, T x1, T y2, T x2) {
return abs(x1 - x2) + abs(y1 - y2);
}
template <typename T> T &chmin(T &a, const T &b) { return a = std::min(a, b); }
template <typename T> T &chmax(T &a, const T &b) { return a = std::max(a, b); }
bool is_bit_on(const unsigned long long bit, const unsigned int i) {
return (bit >> i) & 1u;
}
unsigned long long bit_set(const unsigned long long bit, const unsigned int i,
const unsigned int b) {
assert(b == 0 or b == 1);
if (b == 0) {
return bit & ~(1ull << i);
} else {
return bit | (1ull << i);
}
}
// 初項s交差d長さnの数列の和
long long sum_of_arithmetic_progression(long long s, long long d, long long n) {
return n * (2 * s + (n - 1) * d) / 2;
}
// xが2の階乗かどうか判定
bool is_power_of_two(long long x) { return !(x & (x - 1)); }
long long gcd(long long a, long long b) {
if (b == 0) {
return a;
}
return gcd(b, a % b);
}
long long gcd(std::vector<long long> &v) {
long long ans = v[0];
for (int i = 1; i < (int)v.size(); ++i) {
ans = gcd(ans, v[i]);
}
return ans;
}
long long lcm(long long a, long long b) {
long long g = gcd(a, b);
return a / g * b;
}
const int INF = 1u << 30u; // 1,073,741,824
const long long LINF = 1ull << 60u;
const double EPS = 1e-9;
const long double PI = acos(-1.0);
const std::vector<int> dy2 = {0, 1}, dx2 = {1, 0};
const std::vector<int> dy4 = {0, 1, 0, -1}, dx4 = {1, 0, -1, 0};
const std::vector<int> dy8 = {0, -1, 0, 1, 1, -1, -1, 1},
dx8 = {1, 0, -1, 0, 1, 1, -1, -1};
using namespace std;
template <int mod> struct mint {
long long x;
mint(long long x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod) {
x -= mod;
}
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod) {
x -= mod;
}
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(long long t) const {
if (!t) {
return 1;
}
mint a = pow(t >> 1);
a *= a;
if (t & 1) {
a *= *this;
}
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
long long modpow(long long base, long long exp, long long mod) {
base %= mod;
long long result = 1;
while (exp > 0) {
if (exp & 1) {
result = (result * base) % mod;
}
base = (base * base) % mod;
exp >>= 1;
}
return result;
}
long long combination(long long n, long long r) {
uint64_t ans = 1;
for (uint64_t d = 1; d <= r; ++d) {
ans *= n--;
ans /= d;
}
return ans;
}
class Combination {
public:
int mod;
vector<long long> fact;
vector<long long> inv;
Combination(int n, int mod) : mod(mod) {
assert(0 < n);
this->fact.resize(n + 1, 1);
this->inv.resize(n + 1, 1);
for (int i = 1; i < fact.size(); ++i) {
this->fact[i] = (i * this->fact[i - 1]) % this->mod;
this->inv[i] = modpow(this->fact[i], this->mod - 2, this->mod);
}
}
long long nCr(int n, int k) {
assert(0 <= n and n < this->fact.size() and 0 <= k);
assert(n >= k);
auto a = this->fact[n];
auto b = (this->inv[k] * this->inv[n - k]) % this->mod;
return (a * b) % this->mod;
}
long long nHr(int n, int k) { return nCr(n + k - 1, k); }
};
const int MOD = 1000000000 + 7;
Combination comb(3000100, MOD);
mint<MOD> solve(LL Y1, LL X1, LL Y2, LL X2) {
const auto H = Y2 - Y1 + 1;
const auto W = X2 - X1 + 1;
mint<MOD> ans = comb.nCr(Y1 + X1, Y1);
FOR(y, 1, H) {
auto a = comb.nCr(Y1 + y + X1, X1);
ans += a;
LL m = (H - y);
LL n = (W - 1);
if (n == 0 or m == 0) {
continue;
}
// FOR(i, 0, m) {
// FOR(j, 0, n) {
// count += comb.nCr(i + j, i);
// }
// }
mint<MOD> count = mint<MOD>(m + 1) * comb.nCr(m + n, n - 1) / n - 1;
ans += count * a;
}
FOR(x, 1, W) {
auto a = comb.nCr(X1 + x + Y1, Y1);
ans += a;
LL m = (H - 1);
LL n = (W - x);
if (n == 0 or m == 0) {
continue;
}
// FOR(i, 0, H - 1) {
// FOR(j, 0, W - x) {
// int c = comb.nCr(i + j, i);
// count += comb.nCr(i + j, i);
// }
// }
mint<MOD> count = mint<MOD>(m + 1) * comb.nCr(m + n, n - 1) / n - 1;
ans += count * a;
}
return ans;
}
mint<MOD> check(LL Y1, LL X1, LL Y2, LL X2) {
mint<MOD> ans = 0;
FOR(y, Y1, Y2 + 1) {
FOR(x, X1, X2 + 1) { ans += comb.nCr(y + x, x); }
}
return ans;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
LL Y1, X1, Y2, X2;
cin >> Y1 >> X1 >> Y2 >> X2;
print(solve(Y1, X1, Y2, X2).x);
return 0;
}
| replace | 263 | 264 | 263 | 264 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e6 + 10;
const int MOD = 1e9 + 7;
ll d[N];
ll qpow(ll x, ll k) {
ll r = 1;
while (k) {
if (k & 1)
r = r * x % MOD;
k >>= 1;
x = x * x % MOD;
}
return r;
}
ll C(int i, int j) {
return d[i] * qpow(d[i - j], MOD - 2) % MOD * qpow(d[j], MOD - 2) % MOD;
}
ll Cal(int i, int j) {
ll res = 0;
// C(i+j, j)
for (int x = 0; x <= j; x++) {
res += C(x + i - j + 1, x + 1);
res %= MOD;
}
return res;
}
int main() {
d[0] = 1;
for (int i = 1; i < N; i++) {
d[i] = d[i - 1] * i % MOD;
}
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = Cal(r2 + c2, c2) - Cal(r1 - 1 + c2, c2) - Cal(r2 + c1 - 1, c1 - 1) +
Cal(r1 - 1 + c1 - 1, c1 - 1);
ans %= MOD;
ans += MOD;
ans %= MOD;
cout << ans << '\n';
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 2e6 + 10;
const int MOD = 1e9 + 7;
ll d[N];
ll qpow(ll x, ll k) {
ll r = 1;
while (k) {
if (k & 1)
r = r * x % MOD;
k >>= 1;
x = x * x % MOD;
}
return r;
}
ll C(int i, int j) {
return d[i] * qpow(d[i - j], MOD - 2) % MOD * qpow(d[j], MOD - 2) % MOD;
}
ll Cal(int i, int j) {
ll res = 0;
// C(i+j, j)
for (int x = 0; x <= j; x++) {
res += C(x + i - j + 1, x + 1);
res %= MOD;
}
return res;
}
int main() {
d[0] = 1;
for (int i = 1; i < N; i++) {
d[i] = d[i - 1] * i % MOD;
}
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = Cal(r2 + c2, c2) - Cal(r1 - 1 + c2, c2) - Cal(r2 + c1 - 1, c1 - 1) +
Cal(r1 - 1 + c1 - 1, c1 - 1);
ans %= MOD;
ans += MOD;
ans %= MOD;
cout << ans << '\n';
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef vector<vector<ll>> VVL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
const int MAX = 510000;
const int mod = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep(i, MAX) {
if (i > 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
}
ll com(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
init();
ll ans = com(C + D + 2, C + 1) + com(A + B, B);
ans %= mod;
(ans += mod - com(A + D + 1, A)) %= mod;
(ans += mod - com(B + C + 1, B)) %= mod;
cout << ans << endl;
} | #include <algorithm>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
typedef vector<int> VI;
typedef vector<ll> VL;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef vector<vector<ll>> VVL;
typedef pair<int, int> PII;
typedef pair<ll, ll> PLL;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define mp make_pair
#define ub upper_bound
#define lb lower_bound
ll modpow(ll a, ll n, ll mod) {
ll res = 1;
while (n) {
if (n & 1)
res = res * a % mod;
a = a * a % mod;
n >>= 1;
}
return res;
}
ll modinv(ll a, ll mod) { return modpow(a, mod - 2, mod); }
const int MAX = 5000000;
const int mod = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep(i, MAX) {
if (i > 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
}
ll com(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
int A, B, C, D;
cin >> A >> B >> C >> D;
init();
ll ans = com(C + D + 2, C + 1) + com(A + B, B);
ans %= mod;
(ans += mod - com(A + D + 1, A)) %= mod;
(ans += mod - com(B + C + 1, B)) %= mod;
cout << ans << endl;
} | replace | 39 | 40 | 39 | 40 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x, vector<x>, greater<x>>
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
#define vtpl(x, y, z) vector<tuple<x, y, z>>
#define rev(x) reverse(x);
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
using vpl = vector<pl>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int mod = 1000000007;
using ll = long long;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
const int max_n = 1000010;
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(max_n);
mint box(ll a, ll b) {
mint ans = a + 2;
ans *= comb(a + b + 2, b);
ans -= b + 1;
ans /= b + 1;
return ans;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = box(c, d);
ans -= box(a - 1, d);
ans -= box(b - 1, c);
ans += box(a - 1, b - 1);
cout << ans << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < n; i++)
#define repl(i, l, r) for (ll i = (l); i < (r); i++)
#define per(i, n) for (ll i = n - 1; i >= 0; i--)
#define perl(i, r, l) for (ll i = r - 1; i >= l; i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x, vector<x>, greater<x>>
#define all(x) (x).begin(), (x).end()
#define CST(x) cout << fixed << setprecision(x)
#define vtpl(x, y, z) vector<tuple<x, y, z>>
#define rev(x) reverse(x);
using ll = long long;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll, ll>;
using vpl = vector<pl>;
using vvpl = vector<vpl>;
const ll MOD = 1000000007;
const ll MOD9 = 998244353;
const int inf = 1e9 + 10;
const ll INF = 4e18;
const ll dy[8] = {1, 0, -1, 0, 1, 1, -1, -1};
const ll dx[8] = {0, -1, 0, 1, 1, -1, 1, -1};
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
const int mod = 1000000007;
using ll = long long;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
const int max_n = 3000010;
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(max_n);
mint box(ll a, ll b) {
mint ans = a + 2;
ans *= comb(a + b + 2, b);
ans -= b + 1;
ans /= b + 1;
return ans;
}
int main() {
ll a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = box(c, d);
ans -= box(a - 1, d);
ans -= box(b - 1, c);
ans += box(a - 1, b - 1);
cout << ans << endl;
} | replace | 81 | 82 | 81 | 82 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
const int MAX = 1000000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll sum1 = 0;
for (ll i = c1; i <= c2; i++) {
// cout << COM(r2+i+1,i+1)<<endl;
sum1 += COM(r2 + i + 1, i + 1);
sum1 %= inf;
}
ll sum2 = 0;
for (ll i = c1; i <= c2; i++) {
// cout << COM(r1+i,i+1)<<endl;
sum2 += COM(r1 + i, i + 1);
sum2 %= inf;
}
if (sum1 - sum2 < 0) {
sum1 += inf;
}
cout << sum1 - sum2;
// your code goes here
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define INF 1LL << 62
#define inf 1000000007
const int MAX = 5100000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll sum1 = 0;
for (ll i = c1; i <= c2; i++) {
// cout << COM(r2+i+1,i+1)<<endl;
sum1 += COM(r2 + i + 1, i + 1);
sum1 %= inf;
}
ll sum2 = 0;
for (ll i = c1; i <= c2; i++) {
// cout << COM(r1+i,i+1)<<endl;
sum2 += COM(r1 + i, i + 1);
sum2 %= inf;
}
if (sum1 - sum2 < 0) {
sum1 += inf;
}
cout << sum1 - sum2;
// your code goes here
return 0;
}
| replace | 6 | 7 | 6 | 7 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
const int N = 1000 * 1000 + 20, mod = 1e9 + 7;
int fact[N], factRev[N];
int sum(int a, int b) { return ((1LL * a + b) % mod + mod) % mod; }
int mul(int a, int b) { return ((1LL * a * b) % mod + mod) % mod; }
int pw(int a, int b) {
int res = 1, tmp = a;
while (b) {
if (b & 1)
res = mul(res, tmp);
tmp = mul(tmp, tmp);
b >>= 1;
}
return res;
}
int c(int a, int b) { return mul(fact[a], mul(factRev[b], factRev[a - b])); }
int main() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
factRev[N - 1] = pw(fact[N - 1], mod - 2);
for (int i = N - 2; ~i; i--)
factRev[i] = mul(factRev[i + 1], i + 1);
int r1, r2, c1, c2, ans = 0;
cin >> r1 >> c1 >> r2 >> c2;
for (int i = r1; i <= r2; i++)
ans = sum(ans, sum(c(c2 + i + 1, i + 1), -c(c1 + i, i + 1)));
cout << ans << "\n";
} | #include <bits/stdc++.h>
using namespace std;
const int N = 2000 * 1000 + 20, mod = 1e9 + 7;
int fact[N], factRev[N];
int sum(int a, int b) { return ((1LL * a + b) % mod + mod) % mod; }
int mul(int a, int b) { return ((1LL * a * b) % mod + mod) % mod; }
int pw(int a, int b) {
int res = 1, tmp = a;
while (b) {
if (b & 1)
res = mul(res, tmp);
tmp = mul(tmp, tmp);
b >>= 1;
}
return res;
}
int c(int a, int b) { return mul(fact[a], mul(factRev[b], factRev[a - b])); }
int main() {
fact[0] = 1;
for (int i = 1; i < N; i++)
fact[i] = mul(fact[i - 1], i);
factRev[N - 1] = pw(fact[N - 1], mod - 2);
for (int i = N - 2; ~i; i--)
factRev[i] = mul(factRev[i + 1], i + 1);
int r1, r2, c1, c2, ans = 0;
cin >> r1 >> c1 >> r2 >> c2;
for (int i = r1; i <= r2; i++)
ans = sum(ans, sum(c(c2 + i + 1, i + 1), -c(c1 + i, i + 1)));
cout << ans << "\n";
} | replace | 3 | 4 | 3 | 4 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
ll g(int x, int y) { return COM(x + y + 2, x + 1) - 1; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
ll ans = g(c2, r2);
ans -= g(c2, r1);
ans -= g(c1, r2);
ans += g(c1, r1);
cout << (ans + 2 * mod) % mod << endl;
} | #include <bits/stdc++.h>
#define ALL(A) (A).begin(), (A).end()
#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
using namespace std;
const int MAX = 6666666;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
const ll mod = 1e9 + 7;
const ll INF = -1 * ((1LL << 63) + 1);
const int inf = -1 * ((1 << 31) + 1);
ll g(int x, int y) { return COM(x + y + 2, x + 1) - 1; }
int main(void) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
ll ans = g(c2, r2);
ans -= g(c2, r1);
ans -= g(c1, r2);
ans += g(c1, r1);
cout << (ans + 2 * mod) % mod << endl;
} | replace | 7 | 8 | 7 | 8 | 0 | |
p02782 | C++ | Runtime Error | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
using LL = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<double>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<LL, LL>;
using VPL = vector<PLL>;
template <class T> using Grid = vector<vector<T>>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
template <class T> inline void Sort(T &a) noexcept { sort(all(a)); }
template <class T> inline void RSort(T &a) noexcept { sort(rall(a)); }
template <class T> inline void Reverse(T &a) noexcept { reverse(all(a)); }
template <class T> inline void Unique(T &a) noexcept {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Sorted(T a) noexcept {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) noexcept {
RSort(a);
return a;
}
template <class T> inline T Reversed(T a) noexcept {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) noexcept {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) noexcept {
return *max_element(all(a));
}
template <class T> inline auto Min(const T &a) noexcept {
return *min_element(all(a));
}
template <class T> inline int MaxPos(const T &a) noexcept {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) noexcept {
return min_element(all(a)) - a.begin();
}
template <class T, class U> inline int Count(const T &a, const U &v) noexcept {
return count(all(a), v);
}
template <class T, class U> inline int Find(const T &a, const U &v) noexcept {
auto pos = find(all(a), v);
return pos == a.end() ? -1 : pos - a.begin();
}
template <class T, class U> inline U Sum(const T &a, const U &v) noexcept {
return accumulate(all(a), v);
}
template <class T, class U> inline int Lower(const T &a, const U &v) noexcept {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) noexcept {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class P> inline void RemoveIf(T &a, P f) noexcept {
a.erase(remove_if(all(a), f), a.end());
}
template <class T> inline T Age(T n, T m) noexcept { return (n + m - 1) / m; }
template <class T> inline T Age2(T n, T m) noexcept { return Age(n, m) * m; }
template <class T> inline T Tri(T n) noexcept {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T = long long> inline T BIT(int b) noexcept {
return T{1} << b;
}
template <class T> inline T Gcd(T n, T m) noexcept {
return m ? Gcd(m, n % m) : n;
}
template <class T> inline T Lcm(T n, T m) noexcept { return n / Gcd(n, m) * m; }
template <class T> inline T Pow(T a, T n) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool inRange(const T &v, const T &min, const T &max) noexcept {
return min <= v && v <= max;
}
inline string operator*(string s, int n) noexcept {
string ret;
rep(i, n) ret += s;
return ret;
}
// --- input --- //
#if defined(_WIN32) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc() noexcept { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) noexcept { cin >> v; }
inline void InputF(char &v) noexcept {
while (isspace(v = gc()))
;
}
inline void InputF(string &v) noexcept {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (LL)(c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) noexcept {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) noexcept {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) noexcept {
for (auto &e : v)
InputF(e);
}
template <class T> inline T input() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() noexcept {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() noexcept {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() noexcept { return input<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) noexcept { return InputV(n); }
InputV operator[](pair<int, int> n) noexcept { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T, size_t W> array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
rep(i, H) rep(j, W) {
T x = *this;
ret[j].push_back(x);
}
return ret;
}
} in;
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
bool isPrint = true;
void p(double v) { printf("%.20f", v); }
void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); }
void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); }
void p(bool v) { printf("%s", v ? B.t : B.f); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
printf("%s", D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.l);
p(v[i]);
}
}
void p(const BoolStr &v) {
B = v;
isPrint = false;
}
void p(const DivStr &v) {
D = v;
isPrint = false;
}
public:
void operator()() { printf("%s", D.l); }
template <class H> void operator()(H &&h) {
p(h);
if (isPrint)
printf("%s", D.l);
isPrint = true;
B = Yes;
D = spc;
}
template <class H, class... T> void operator()(H &&h, T &&...t) {
p(h);
if (isPrint)
printf("%s", D.d);
isPrint = true;
operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
} out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
// ---------------------------------------------------------------- //
template <class T> class Combi {
int Max;
T Mod;
vector<T> fac, finv, inv;
public:
Combi(int _Max = 300009, T _Mod = 1000000007)
: Max(_Max), Mod(_Mod), fac(_Max), finv(_Max), inv(_Max) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < Max; ++i) {
fac[i] = fac[i - 1] * i % Mod;
inv[i] = MOD - inv[Mod % i] * (Mod / i) % Mod;
finv[i] = finv[i - 1] * inv[i] % Mod;
}
}
T P(int n, int r) { // n P r
return (n < r || n < 0 || r < 0) ? 0 : fac[n] * finv[n - r] % MOD;
}
T C(int n, int r) { // n C r
return (n < r || n < 0 || r < 0)
? 0
: fac[n] * (finv[r] * finv[n - r] % Mod) % Mod;
}
T H(int n, int r) { // n H r
return (n < 0 || r < 0) ? 0 : r == 0 ? 1 : C(n + r - 1, r);
}
};
template <int MOD> struct modint {
using T = long long;
T n;
constexpr modint(const T x = 0) noexcept : n(x % MOD) {
if (n < 0)
n += MOD;
}
constexpr int get_mod() const noexcept { return MOD; }
constexpr modint operator+() const noexcept { return *this; }
constexpr modint operator-() const noexcept { return n ? MOD - n : 0; }
constexpr modint &operator++() noexcept {
if (MOD <= ++n)
n = 0;
return *this;
}
constexpr modint &operator--() noexcept {
if (n <= 0)
n = MOD;
n--;
return *this;
}
constexpr modint &operator++(int) noexcept {
modint t = *this;
++*this;
return t;
}
constexpr modint &operator--(int) noexcept {
modint t = *this;
--*this;
return t;
}
constexpr modint next() const noexcept {
modint t = *this;
++t;
return t;
}
constexpr modint pred() const noexcept {
modint t = *this;
--t;
return t;
}
constexpr modint operator+(const modint &m) const noexcept {
return modint(*this) += m;
}
constexpr modint operator-(const modint &m) const noexcept {
return modint(*this) -= m;
}
constexpr modint operator*(const modint &m) const noexcept {
return modint(*this) *= m;
}
constexpr modint operator/(const modint &m) const noexcept {
return modint(*this) /= m;
}
constexpr modint &operator+=(const modint &m) noexcept {
n += m.n;
if (n >= MOD)
n -= MOD;
return *this;
}
constexpr modint &operator-=(const modint &m) noexcept {
n -= m.n;
if (n < 0)
n += MOD;
return *this;
}
constexpr modint &operator*=(const modint &m) noexcept {
n = n * m.n % MOD;
return *this;
}
constexpr modint &operator/=(const modint &m) noexcept {
assert(m.n);
T a = m.n, b = MOD, u = 1, v = 0;
while (b) {
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
n = n * u % MOD;
if (n < 0)
n += MOD;
return *this;
}
constexpr bool operator==(const modint &m) const noexcept { return n == m.n; }
constexpr bool operator!=(const modint &m) const noexcept { return n != m.n; }
constexpr modint pow(modint m) const noexcept {
modint t = n, res = 1;
while (m.n > 0) {
if (m.n & 1)
res *= t;
t *= t;
m.n >>= 1;
}
return res;
}
constexpr modint operator^(modint m) const noexcept { return pow(m); }
};
using mint = modint<1000000007>;
using VM = vector<mint>;
ostream &operator<<(ostream &os, const modint<MOD> &m) noexcept {
return os << m.n;
}
istream &operator>>(istream &is, modint<MOD> &m) noexcept { return is >> m.n; }
mint operator""_m(unsigned long long n) { return n; }
int main() {
int x1, y1, x2, y2;
in(x1, y1, x2, y2);
Combi<LL> comb(1000007);
auto calc = [&](int x1, int y1, int x2, int y2) {
mint ans;
FOR(x, x1, x2 + 1) {
mint val1 = mint(comb.C(x + y2, y2)) * 2;
mint val2 = mint(comb.C(x + y1 - 1, y1 - 1)) * 2;
ans += val1 - val2;
}
return ans;
};
out(calc(x1, y1, x2, y2));
} | #define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include "bits/stdc++.h"
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define FOR(i, m, n) for (int i = (m); i < (n); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rfor(i, m, n) for (int i = (m); i >= (n); --i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define pb push_back
#define eb emplace_back
using namespace std;
using LL = long long;
using ld = long double;
using VB = vector<bool>;
using VVB = vector<VB>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VS = vector<string>;
using VD = vector<double>;
using PII = pair<int, int>;
using VP = vector<PII>;
using PLL = pair<LL, LL>;
using VPL = vector<PLL>;
template <class T> using Grid = vector<vector<T>>;
template <class T> using PQ = priority_queue<T>;
template <class T> using PQS = priority_queue<T, vector<T>, greater<T>>;
constexpr int inf = (int)1e9;
constexpr LL inf_ll = (LL)1e18, MOD = 1000000007;
constexpr ld PI = M_PI, EPS = 1e-12;
template <class T> inline void Sort(T &a) noexcept { sort(all(a)); }
template <class T> inline void RSort(T &a) noexcept { sort(rall(a)); }
template <class T> inline void Reverse(T &a) noexcept { reverse(all(a)); }
template <class T> inline void Unique(T &a) noexcept {
a.erase(unique(all(a)), a.end());
}
template <class T> inline T Sorted(T a) noexcept {
Sort(a);
return a;
}
template <class T> inline T RSorted(T a) noexcept {
RSort(a);
return a;
}
template <class T> inline T Reversed(T a) noexcept {
Reverse(a);
return a;
}
template <class T> inline T Uniqued(T a) noexcept {
Unique(a);
return a;
}
template <class T> inline auto Max(const T &a) noexcept {
return *max_element(all(a));
}
template <class T> inline auto Min(const T &a) noexcept {
return *min_element(all(a));
}
template <class T> inline int MaxPos(const T &a) noexcept {
return max_element(all(a)) - a.begin();
}
template <class T> inline int MinPos(const T &a) noexcept {
return min_element(all(a)) - a.begin();
}
template <class T, class U> inline int Count(const T &a, const U &v) noexcept {
return count(all(a), v);
}
template <class T, class U> inline int Find(const T &a, const U &v) noexcept {
auto pos = find(all(a), v);
return pos == a.end() ? -1 : pos - a.begin();
}
template <class T, class U> inline U Sum(const T &a, const U &v) noexcept {
return accumulate(all(a), v);
}
template <class T, class U> inline int Lower(const T &a, const U &v) noexcept {
return lower_bound(all(a), v) - a.begin();
}
template <class T, class U> inline int Upper(const T &a, const U &v) noexcept {
return upper_bound(all(a), v) - a.begin();
}
template <class T, class P> inline void RemoveIf(T &a, P f) noexcept {
a.erase(remove_if(all(a), f), a.end());
}
template <class T> inline T Age(T n, T m) noexcept { return (n + m - 1) / m; }
template <class T> inline T Age2(T n, T m) noexcept { return Age(n, m) * m; }
template <class T> inline T Tri(T n) noexcept {
return (n & 1) ? (n + 1) / 2 * n : n / 2 * (n + 1);
}
template <class T = long long> inline T BIT(int b) noexcept {
return T{1} << b;
}
template <class T> inline T Gcd(T n, T m) noexcept {
return m ? Gcd(m, n % m) : n;
}
template <class T> inline T Lcm(T n, T m) noexcept { return n / Gcd(n, m) * m; }
template <class T> inline T Pow(T a, T n) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r *= a;
a *= a;
n /= 2;
}
return r;
}
template <class T> inline T Powmod(T a, T n, T m = MOD) noexcept {
T r = 1;
while (n > 0) {
if (n & 1)
r = r * a % m, n--;
else
a = a * a % m, n /= 2;
}
return r;
}
template <class T> inline bool chmax(T &a, const T &b) noexcept {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, const T &b) noexcept {
if (a > b) {
a = b;
return true;
}
return false;
}
template <class T>
inline bool inRange(const T &v, const T &min, const T &max) noexcept {
return min <= v && v <= max;
}
inline string operator*(string s, int n) noexcept {
string ret;
rep(i, n) ret += s;
return ret;
}
// --- input --- //
#if defined(_WIN32) || defined(ONLINE_JUDGE)
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
inline int gc() noexcept { return getchar_unlocked(); }
template <class T> inline void InputF(T &v) noexcept { cin >> v; }
inline void InputF(char &v) noexcept {
while (isspace(v = gc()))
;
}
inline void InputF(string &v) noexcept {
char c;
for (InputF(c); !isspace(c); c = gc())
v += c;
}
inline void InputF(int &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (c - '0');
if (neg)
v = -v;
}
inline void InputF(long long &v) noexcept {
bool neg = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c); c = gc())
v = v * 10 + (LL)(c - '0');
if (neg)
v = -v;
}
inline void InputF(double &v) noexcept {
double dp = 1;
bool neg = false, adp = false;
v = 0;
char c;
InputF(c);
if (c == '-') {
neg = true;
c = gc();
}
for (; isdigit(c) || c == '.'; c = gc()) {
if (c == '.')
adp = true;
else if (adp)
v += (c - '0') * (dp *= 0.1);
else
v = v * 10 + (c - '0');
}
if (neg)
v = -v;
}
template <class T, class U> inline void InputF(pair<T, U> &v) noexcept {
InputF(v.first);
InputF(v.second);
}
template <class T> inline void InputF(vector<T> &v) noexcept {
for (auto &e : v)
InputF(e);
}
template <class T> inline T input() {
T v;
InputF(v);
return v;
}
struct InputV {
int n, m;
InputV(int N) : n(N), m(0) {}
InputV(pair<int, int> N) : n(N.first), m(N.second) {}
template <class T> operator vector<T>() noexcept {
vector<T> v(n);
InputF(v);
return v;
}
template <class T> operator vector<vector<T>>() noexcept {
vector<vector<T>> v(n, vector<T>(m));
InputF(v);
return v;
}
};
struct Input {
template <class T> operator T() noexcept { return input<T>(); }
int operator--(int) {
int v;
InputF(v);
v--;
return v;
}
InputV operator[](int n) noexcept { return InputV(n); }
InputV operator[](pair<int, int> n) noexcept { return InputV(n); }
void operator()() {}
template <class H, class... T> void operator()(H &&h, T &&...t) {
InputF(h);
operator()(forward<T>(t)...);
}
template <class T, size_t W> array<vector<T>, W> get(int H) {
array<vector<T>, W> ret;
rep(i, H) rep(j, W) {
T x = *this;
ret[j].push_back(x);
}
return ret;
}
} in;
// --- output --- //
struct BoolStr {
const char *t, *f;
BoolStr(const char *_t, const char *_f) : t(_t), f(_f) {}
} Yes("Yes", "No"), yes("yes", "no"), YES("YES", "NO"), Int("1", "0");
struct DivStr {
const char *d, *l;
DivStr(const char *_d, const char *_l) : d(_d), l(_l) {}
} spc(" ", "\n"), no_spc("", "\n"), end_line("\n", "\n"), comma(",", "\n"),
no_endl(" ", "");
class Output {
BoolStr B{Yes};
DivStr D{spc};
bool isPrint = true;
void p(double v) { printf("%.20f", v); }
void p(long double v) { printf("%.20Lf", v); }
void p(int v) { printf("%d", v); }
void p(LL v) { printf("%lld", v); }
void p(char v) { putchar(v); }
void p(bool v) { printf("%s", v ? B.t : B.f); }
template <class T> void p(const T &v) { cout << v; }
template <class T, class U> void p(const pair<T, U> &v) {
p(v.first);
printf("%s", D.d);
p(v.second);
}
template <class T> void p(const vector<T> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.d);
p(v[i]);
}
}
template <class T> void p(const vector<vector<T>> &v) {
rep(i, sz(v)) {
if (i)
printf("%s", D.l);
p(v[i]);
}
}
void p(const BoolStr &v) {
B = v;
isPrint = false;
}
void p(const DivStr &v) {
D = v;
isPrint = false;
}
public:
void operator()() { printf("%s", D.l); }
template <class H> void operator()(H &&h) {
p(h);
if (isPrint)
printf("%s", D.l);
isPrint = true;
B = Yes;
D = spc;
}
template <class H, class... T> void operator()(H &&h, T &&...t) {
p(h);
if (isPrint)
printf("%s", D.d);
isPrint = true;
operator()(forward<T>(t)...);
}
template <class... T> void exit(T &&...t) {
operator()(forward<T>(t)...);
std::exit(EXIT_SUCCESS);
}
} out;
// --- dump --- //
#if __has_include("dump.hpp")
#include "dump.hpp"
#else
#define dump(...) (void(0))
#endif
// ---------------------------------------------------------------- //
template <class T> class Combi {
int Max;
T Mod;
vector<T> fac, finv, inv;
public:
Combi(int _Max = 300009, T _Mod = 1000000007)
: Max(_Max), Mod(_Mod), fac(_Max), finv(_Max), inv(_Max) {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < Max; ++i) {
fac[i] = fac[i - 1] * i % Mod;
inv[i] = MOD - inv[Mod % i] * (Mod / i) % Mod;
finv[i] = finv[i - 1] * inv[i] % Mod;
}
}
T P(int n, int r) { // n P r
return (n < r || n < 0 || r < 0) ? 0 : fac[n] * finv[n - r] % MOD;
}
T C(int n, int r) { // n C r
return (n < r || n < 0 || r < 0)
? 0
: fac[n] * (finv[r] * finv[n - r] % Mod) % Mod;
}
T H(int n, int r) { // n H r
return (n < 0 || r < 0) ? 0 : r == 0 ? 1 : C(n + r - 1, r);
}
};
template <int MOD> struct modint {
using T = long long;
T n;
constexpr modint(const T x = 0) noexcept : n(x % MOD) {
if (n < 0)
n += MOD;
}
constexpr int get_mod() const noexcept { return MOD; }
constexpr modint operator+() const noexcept { return *this; }
constexpr modint operator-() const noexcept { return n ? MOD - n : 0; }
constexpr modint &operator++() noexcept {
if (MOD <= ++n)
n = 0;
return *this;
}
constexpr modint &operator--() noexcept {
if (n <= 0)
n = MOD;
n--;
return *this;
}
constexpr modint &operator++(int) noexcept {
modint t = *this;
++*this;
return t;
}
constexpr modint &operator--(int) noexcept {
modint t = *this;
--*this;
return t;
}
constexpr modint next() const noexcept {
modint t = *this;
++t;
return t;
}
constexpr modint pred() const noexcept {
modint t = *this;
--t;
return t;
}
constexpr modint operator+(const modint &m) const noexcept {
return modint(*this) += m;
}
constexpr modint operator-(const modint &m) const noexcept {
return modint(*this) -= m;
}
constexpr modint operator*(const modint &m) const noexcept {
return modint(*this) *= m;
}
constexpr modint operator/(const modint &m) const noexcept {
return modint(*this) /= m;
}
constexpr modint &operator+=(const modint &m) noexcept {
n += m.n;
if (n >= MOD)
n -= MOD;
return *this;
}
constexpr modint &operator-=(const modint &m) noexcept {
n -= m.n;
if (n < 0)
n += MOD;
return *this;
}
constexpr modint &operator*=(const modint &m) noexcept {
n = n * m.n % MOD;
return *this;
}
constexpr modint &operator/=(const modint &m) noexcept {
assert(m.n);
T a = m.n, b = MOD, u = 1, v = 0;
while (b) {
T t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
n = n * u % MOD;
if (n < 0)
n += MOD;
return *this;
}
constexpr bool operator==(const modint &m) const noexcept { return n == m.n; }
constexpr bool operator!=(const modint &m) const noexcept { return n != m.n; }
constexpr modint pow(modint m) const noexcept {
modint t = n, res = 1;
while (m.n > 0) {
if (m.n & 1)
res *= t;
t *= t;
m.n >>= 1;
}
return res;
}
constexpr modint operator^(modint m) const noexcept { return pow(m); }
};
using mint = modint<1000000007>;
using VM = vector<mint>;
ostream &operator<<(ostream &os, const modint<MOD> &m) noexcept {
return os << m.n;
}
istream &operator>>(istream &is, modint<MOD> &m) noexcept { return is >> m.n; }
mint operator""_m(unsigned long long n) { return n; }
int main() {
int x1, y1, x2, y2;
in(x1, y1, x2, y2);
Combi<LL> comb(3000007);
mint ans;
FOR(x, x1, x2 + 1) { ans += comb.C(x + y2 + 1, y2) - comb.C(x + y1, y1 - 1); }
out(ans);
} | replace | 483 | 497 | 483 | 489 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const ll MAX = 1010000;
const ll MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll mpow(ll base, ll n) {
if (n == 0)
return 1;
ll prev = mpow(base, n / 2);
if (n % 2 == 0) {
return (prev * prev) % MOD;
} else {
// assert(prev * prev * base > 0);
return (((prev * prev) % MOD) * base) % MOD;
}
}
int main() {
COMinit();
ll a, c, b, d;
cin >> a >> c >> b >> d;
ll ans = 0;
rep(i, a, b + 1) {
ll tmp = (d + 1) * COM(d + i + 1, d + 1);
tmp %= MOD;
tmp -= (c * COM(c + i, c)) % MOD;
while (tmp < 0)
tmp += MOD;
tmp *= mpow(i + 1, MOD - 2);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define ALL(x) x.begin(), x.end()
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
using ll = long long;
using lld = long double;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using PII = pair<int, int>;
const ll MAX = 2010000;
const ll MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll mpow(ll base, ll n) {
if (n == 0)
return 1;
ll prev = mpow(base, n / 2);
if (n % 2 == 0) {
return (prev * prev) % MOD;
} else {
// assert(prev * prev * base > 0);
return (((prev * prev) % MOD) * base) % MOD;
}
}
int main() {
COMinit();
ll a, c, b, d;
cin >> a >> c >> b >> d;
ll ans = 0;
rep(i, a, b + 1) {
ll tmp = (d + 1) * COM(d + i + 1, d + 1);
tmp %= MOD;
tmp -= (c * COM(c + i, c)) % MOD;
while (tmp < 0)
tmp += MOD;
tmp *= mpow(i + 1, MOD - 2);
tmp %= MOD;
ans += tmp;
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 16 | 17 | 16 | 17 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for (int(i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for (int(i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9 + 7;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll COMS(int x, int y) { return COM(x + y + 2, x + 1); }
int main() {
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = (COMS(r2, c2) - COMS(r2, c1 - 1) - COMS(r1 - 1, c2) +
COMS(r1 - 1, c1 - 1)) %
mod;
if (ans < 0) {
ans += mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for (int(i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for (int(i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9 + 7;
const int MAX = 2010000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll COMS(int x, int y) { return COM(x + y + 2, x + 1); }
int main() {
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans = (COMS(r2, c2) - COMS(r2, c1 - 1) - COMS(r1 - 1, c2) +
COMS(r1 - 1, c1 - 1)) %
mod;
if (ans < 0) {
ans += mod;
}
cout << ans << endl;
return 0;
}
| replace | 12 | 13 | 12 | 13 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for (int(i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for (int(i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9 + 7;
const int MAX = 510000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll cal(int r, int c) { return COM(r + c + 2, r + 1); }
int main() {
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans =
cal(r2, c2) - cal(r2, c1 - 1) - cal(r1 - 1, c2) + cal(r1 - 1, c1 - 1);
ans %= mod;
if (ans < 0) {
ans += mod;
}
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i, n) for (int(i) = 0; (i) < (n); ++(i))
#define REPR(i, n) for (int(i) = (n); (i) >= 0; --(i))
#define FOR(i, n, m) for (int(i) = (n); (i) < (m); ++(i))
constexpr int INF = 1e9;
// constexpr ll INF = 1LL<<61;
constexpr ll mod = 1e9 + 7;
const int MAX = 2100000;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll cal(int r, int c) { return COM(r + c + 2, r + 1); }
int main() {
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll ans =
cal(r2, c2) - cal(r2, c1 - 1) - cal(r1 - 1, c2) + cal(r1 - 1, c1 - 1);
ans %= mod;
if (ans < 0) {
ans += mod;
}
cout << ans << endl;
return 0;
} | replace | 12 | 13 | 12 | 13 | 0 | |
p02782 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
vector<long long int> inverse;
vector<long long int> f, f_inverse;
void factorial_Initialize(int max) {
vector<long long int> a(max + 1, 1);
inverse = a;
f = a;
f_inverse = a;
for (int i = 2; i <= max; i++) {
inverse[i] = MOD - inverse[MOD % i] * (MOD / i) % MOD;
f[i] = f[i - 1] * i % MOD;
f_inverse[i] = f_inverse[i - 1] * inverse[i] % MOD;
}
}
long long int nCr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= f.size()) {
factorial_Initialize(n);
}
return f[n] * f_inverse[r] % MOD * f_inverse[n - r] % MOD;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
factorial_Initialize(1e6);
long long int f11 = 0, f12 = 0, f21 = 0, f22 = 0;
for (int i = 0; i < r1; i++) {
f12 += nCr(i + c2 + 1, c2);
f12 %= MOD;
f11 += nCr(i + c1, c1 - 1);
f11 %= MOD;
}
for (int i = 0; i <= r2; i++) {
f22 += nCr(i + c2 + 1, c2);
f22 %= MOD;
f21 += nCr(i + c1, c1 - 1);
f21 %= MOD;
}
// cout << f11 << " " << f12 << " " << f21 << " " << f22 << endl;
cout << (((f22 - f21 - f12 + f11) % MOD + MOD) % MOD) << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
vector<long long int> inverse;
vector<long long int> f, f_inverse;
void factorial_Initialize(int max) {
vector<long long int> a(max + 1, 1);
inverse = a;
f = a;
f_inverse = a;
for (int i = 2; i <= max; i++) {
inverse[i] = MOD - inverse[MOD % i] * (MOD / i) % MOD;
f[i] = f[i - 1] * i % MOD;
f_inverse[i] = f_inverse[i - 1] * inverse[i] % MOD;
}
}
long long int nCr(int n, int r) {
if (n < r || r < 0)
return 0;
if (n >= f.size()) {
factorial_Initialize(n);
}
return f[n] * f_inverse[r] % MOD * f_inverse[n - r] % MOD;
}
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
factorial_Initialize(1e7);
long long int f11 = 0, f12 = 0, f21 = 0, f22 = 0;
for (int i = 0; i < r1; i++) {
f12 += nCr(i + c2 + 1, c2);
f12 %= MOD;
f11 += nCr(i + c1, c1 - 1);
f11 %= MOD;
}
for (int i = 0; i <= r2; i++) {
f22 += nCr(i + c2 + 1, c2);
f22 %= MOD;
f21 += nCr(i + c1, c1 - 1);
f21 %= MOD;
}
// cout << f11 << " " << f12 << " " << f21 << " " << f22 << endl;
cout << (((f22 - f21 - f12 + f11) % MOD + MOD) % MOD) << endl;
return 0;
} | replace | 32 | 33 | 32 | 33 | TLE | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
// typedef
//-------------------------#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
class UnionFind {
public:
vector<int> par;
vector<int> siz;
UnionFind(int sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { return siz[root(x)]; }
};
ll modPow(ll x, ll n, ll mod = MOD) {
if (n == 0)
return 1;
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % mod;
res %= mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000 + 10
bool sieve[SIEVE_SIZE];
void makeSieve() {
for (int i = 0; i < SIEVE_SIZE; ++i)
sieve[i] = true;
sieve[0] = sieve[1] = false;
for (int i = 2; i * i < SIEVE_SIZE; ++i)
if (sieve[i])
for (int j = 2; i * j < SIEVE_SIZE; ++j)
sieve[i * j] = false;
}
bool isprime(ll n) {
if (n == 0 || n == 1)
return false;
for (ll i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
const int MAX = 1000010;
long long fac[MAX], finv[MAX], inv[MAX];
const ll mod2 = 998244353;
const ll mod3 = 1777777777;
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
// cout << fac[i] << " " << inv[i] << " " << finv[i] << endl;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK)
inline long long mod(long long a, long long m) { return (a % m + m) % m; }
// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for (int i = 0; i < A.size(); ++i) {
for (int k = 0; k < B.size(); ++k) {
for (int j = 0; j < B[0].size(); ++j) {
C[i][j] = (C[i][j] + A[i][k] % MOD * B[k][j] % MOD) % MOD;
}
}
}
return C;
}
mat matPow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for (int i = 0; i < A.size(); ++i) {
B[i][i] = 1;
}
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
template <class TYPE> struct Fenwick {
int N;
vector<ll> bit;
Fenwick() : N(0) {}
Fenwick(int n) : N(n), bit(n + 1, 0) {}
void add(int i, ll x) {
// 0-indexedを避けるために加算
while (i <= N) {
bit[i] += x;
i += (i & -i);
}
}
ll sum(int i) {
ll res = 0;
while (i > 0) {
res += bit[i];
i -= (i & -i);
}
return res;
}
ll range(int i, int j) { return sum(j) - sum(i); }
ll get(int i) { return sum(i) - sum(i - 1); }
ll getKth(ll k) {
++k;
int res = 0;
int n = 1;
while (n < bit.size())
n *= 2;
for (int i = n / 2; i > 0; i /= 2) {
if (res + i < bit.size() && bit[res + i] < k) {
k = k - bit[res + i];
res = res + i;
}
}
return res + 1;
}
// bitは1-indexedで実装しているのでバグった時は初めに確認すること
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(4);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
for (int i = r1; i <= r2; i++) {
ll t1 = COM(i + c2 + 1, c2);
ll t2 = COM(i + c1, c1 - 1);
ans += (t1 - t2 + MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
// typedef
//-------------------------#include <bits/stdc++.h>
const double pi = 3.141592653589793238462643383279;
using namespace std;
// conversion
//------------------------------------------
inline int toInt(string s) {
int v;
istringstream sin(s);
sin >> v;
return v;
}
template <class T> inline string toString(T x) {
ostringstream sout;
sout << x;
return sout.str();
}
inline int readInt() {
int x;
scanf("%d", &x);
return x;
}
// typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<long long, long long> PLL;
typedef pair<int, PII> TIII;
typedef long long LL;
typedef unsigned long long ULL;
typedef vector<LL> VLL;
typedef vector<VLL> VVLL;
// container util
//------------------------------------------
#define ALL(a) (a).begin(), (a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define SQ(a) ((a) * (a))
#define EACH(i, c) \
for (typeof((c).begin()) i = (c).begin(); i != (c).end(); ++i)
#define EXIST(s, e) ((s).find(e) != (s).end())
#define SORT(c) sort((c).begin(), (c).end())
// repetition
//------------------------------------------
#define FOR(i, s, n) for (int i = s; i < (int)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define MOD 1000000007
#define rep(i, a, b) for (int i = a; i < (b); ++i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, int> pii;
typedef vector<int> vi;
const double EPS = 1E-8;
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
class UnionFind {
public:
vector<int> par;
vector<int> siz;
UnionFind(int sz_) : par(sz_), siz(sz_, 1) {
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
void init(int sz_) {
par.resize(sz_);
siz.assign(sz_, 1LL);
for (ll i = 0; i < sz_; ++i)
par[i] = i;
}
int root(int x) {
if (par[x] == x) {
return x;
} else {
return par[x] = root(par[x]);
}
}
bool merge(int x, int y) {
x = root(x);
y = root(y);
if (x == y)
return false;
if (siz[x] < siz[y])
swap(x, y);
siz[x] += siz[y];
par[y] = x;
return true;
}
bool issame(int x, int y) { return root(x) == root(y); }
int size(int x) { return siz[root(x)]; }
};
ll modPow(ll x, ll n, ll mod = MOD) {
if (n == 0)
return 1;
ll res = 1;
while (n) {
if (n & 1)
res = (res * x) % mod;
res %= mod;
x = x * x % mod;
n >>= 1;
}
return res;
}
#define SIEVE_SIZE 5000000 + 10
bool sieve[SIEVE_SIZE];
void makeSieve() {
for (int i = 0; i < SIEVE_SIZE; ++i)
sieve[i] = true;
sieve[0] = sieve[1] = false;
for (int i = 2; i * i < SIEVE_SIZE; ++i)
if (sieve[i])
for (int j = 2; i * j < SIEVE_SIZE; ++j)
sieve[i * j] = false;
}
bool isprime(ll n) {
if (n == 0 || n == 1)
return false;
for (ll i = 2; i * i <= n; ++i)
if (n % i == 0)
return false;
return true;
}
const int MAX = 3000010;
long long fac[MAX], finv[MAX], inv[MAX];
const ll mod2 = 998244353;
const ll mod3 = 1777777777;
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
// cout << fac[i] << " " << inv[i] << " " << finv[i] << endl;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
long long extGCD(long long a, long long b, long long &x, long long &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
long long d = extGCD(b, a % b, y, x);
y -= a / b * x;
return d;
}
// 負の数にも対応した mod (a = -11 とかでも OK)
inline long long mod(long long a, long long m) { return (a % m + m) % m; }
// 逆元計算 (ここでは a と m が互いに素であることが必要)
long long modinv(long long a, long long m) {
long long x, y;
extGCD(a, m, x, y);
return mod(x, m); // 気持ち的には x % m だが、x が負かもしれないので
}
ll GCD(ll a, ll b) {
if (b == 0)
return a;
return GCD(b, a % b);
}
typedef vector<ll> vec;
typedef vector<vec> mat;
mat mul(mat &A, mat &B) {
mat C(A.size(), vec((int)B[0].size()));
for (int i = 0; i < A.size(); ++i) {
for (int k = 0; k < B.size(); ++k) {
for (int j = 0; j < B[0].size(); ++j) {
C[i][j] = (C[i][j] + A[i][k] % MOD * B[k][j] % MOD) % MOD;
}
}
}
return C;
}
mat matPow(mat A, ll n) {
mat B(A.size(), vec((int)A.size()));
for (int i = 0; i < A.size(); ++i) {
B[i][i] = 1;
}
while (n > 0) {
if (n & 1)
B = mul(B, A);
A = mul(A, A);
n >>= 1;
}
return B;
}
template <class TYPE> struct Fenwick {
int N;
vector<ll> bit;
Fenwick() : N(0) {}
Fenwick(int n) : N(n), bit(n + 1, 0) {}
void add(int i, ll x) {
// 0-indexedを避けるために加算
while (i <= N) {
bit[i] += x;
i += (i & -i);
}
}
ll sum(int i) {
ll res = 0;
while (i > 0) {
res += bit[i];
i -= (i & -i);
}
return res;
}
ll range(int i, int j) { return sum(j) - sum(i); }
ll get(int i) { return sum(i) - sum(i - 1); }
ll getKth(ll k) {
++k;
int res = 0;
int n = 1;
while (n < bit.size())
n *= 2;
for (int i = n / 2; i > 0; i /= 2) {
if (res + i < bit.size() && bit[res + i] < k) {
k = k - bit[res + i];
res = res + i;
}
}
return res + 1;
}
// bitは1-indexedで実装しているのでバグった時は初めに確認すること
};
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(4);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
for (int i = r1; i <= r2; i++) {
ll t1 = COM(i + c2 + 1, c2);
ll t2 = COM(i + c1, c1 - 1);
ans += (t1 - t2 + MOD);
ans %= MOD;
}
cout << ans << endl;
return 0;
}
| replace | 151 | 152 | 151 | 152 | 0 | |
p02782 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
struct mint {
ll v;
mint() : v(0) {}
mint(ll v) : v((v % MOD + MOD) % MOD) {}
operator ll() const { return v; }
mint pow(ll t) const;
mint inv() const;
};
mint &operator+=(mint &a, mint b) { return a = a.v + b.v; }
mint &operator-=(mint &a, mint b) { return a = a.v - b.v; }
mint &operator*=(mint &a, mint b) { return a = a.v * b.v; }
mint operator+(mint a, mint b) { return a += b; }
mint operator-(mint a, mint b) { return a -= b; }
mint operator*(mint a, mint b) { return a *= b; }
mint operator-(mint a) { return (mint)0 - a; }
mint &operator/=(mint &a, mint b) { return a *= b.inv(); }
mint operator/(mint a, mint b) { return a /= b; }
mint mint::pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint mint::inv() const { return pow(MOD - 2); }
bool operator==(mint a, mint b) { return a.v == b.v; }
bool operator!=(mint a, mint b) { return a.v != b.v; }
istream &operator>>(istream &os, mint &a) { return (os >> a.v); }
ostream &operator<<(ostream &os, const mint &a) { return (os << a.v); }
mint mfact(int n) { // n! (mod MOD)
static vector<mint> fact(1, 1);
int pn = fact.size();
if (pn < n + 1) {
fact.resize(n + 1);
for (int i = pn; i <= n; i++)
fact[i] = fact[i - 1] * (mint)i;
}
return fact[n];
}
mint nPk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(n - k).inv();
}
mint nCk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(k).inv() * mfact(n - k).inv();
}
mint f(int r, int c) {
mint res = 0;
for (int i = 1; i <= r; i++) {
res += nCk(i + c + 1, c) - (mint)1;
}
return res;
}
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (abs(r2 - r1) > abs(c2 - c1)) {
swap(r1, c1);
swap(r2, c2);
}
dump(r1, r2, c1, c2);
mint ans = 0;
ans = f(r2, c2) - f(r1 - 1, c2) - f(r2, c1 - 1) + f(r1 - 1, c1 - 1);
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
// freopen("temp.1", "r", stdin);
solve();
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include "dump.hpp"
#else
#define dump(...)
#define dumpv(...)
#endif
#define rep(i, n) for (int i = 0; i < (n); i++)
#define mins(x, y) (x = min(x, y))
#define maxs(x, y) (x = max(x, y))
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vvi = vector<vi>;
using vvl = vector<vl>;
using P = pair<int, int>;
const int MOD = 1e9 + 7;
const int INF = 1001001001;
const ll LINF = 1001002003004005006ll;
struct mint {
ll v;
mint() : v(0) {}
mint(ll v) : v((v % MOD + MOD) % MOD) {}
operator ll() const { return v; }
mint pow(ll t) const;
mint inv() const;
};
mint &operator+=(mint &a, mint b) { return a = a.v + b.v; }
mint &operator-=(mint &a, mint b) { return a = a.v - b.v; }
mint &operator*=(mint &a, mint b) { return a = a.v * b.v; }
mint operator+(mint a, mint b) { return a += b; }
mint operator-(mint a, mint b) { return a -= b; }
mint operator*(mint a, mint b) { return a *= b; }
mint operator-(mint a) { return (mint)0 - a; }
mint &operator/=(mint &a, mint b) { return a *= b.inv(); }
mint operator/(mint a, mint b) { return a /= b; }
mint mint::pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
mint mint::inv() const { return pow(MOD - 2); }
bool operator==(mint a, mint b) { return a.v == b.v; }
bool operator!=(mint a, mint b) { return a.v != b.v; }
istream &operator>>(istream &os, mint &a) { return (os >> a.v); }
ostream &operator<<(ostream &os, const mint &a) { return (os << a.v); }
mint mfact(int n) { // n! (mod MOD)
static vector<mint> fact(1, 1);
int pn = fact.size();
if (pn < n + 1) {
fact.resize(n + 1);
for (int i = pn; i <= n; i++)
fact[i] = fact[i - 1] * (mint)i;
}
return fact[n];
}
mint nPk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(n - k).inv();
}
mint nCk(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
if (k == 0)
return 1;
return mfact(n) * mfact(k).inv() * mfact(n - k).inv();
}
mint f(int r, int c) {
mint res = 0;
// for (int i = 1; i <= r; i++) {
// res += nCk(i + c + 1, c) - (mint)1;
// }
res = nCk(r + 1 + c + 1, r + 1) - nCk(c + 1, 1) - (mint)1;
return res;
}
void solve() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if (abs(r2 - r1) > abs(c2 - c1)) {
swap(r1, c1);
swap(r2, c2);
}
dump(r1, r2, c1, c2);
mint ans = 0;
ans = f(r2, c2) - f(r1 - 1, c2) - f(r2, c1 - 1) + f(r1 - 1, c1 - 1);
cout << ans << endl;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
// freopen("temp.1", "r", stdin);
solve();
return 0;
} | replace | 82 | 85 | 82 | 86 | TLE | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// ------------------
// Integer modulo MOD
// ------------------
const int64_t MOD = 1e9 + 7;
struct mint {
int64_t x;
mint(int64_t x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(int64_t n) const {
if (n == 0)
return 1;
mint t = pow(n >> 1);
t *= t;
if (n & 1)
t *= *this;
return t;
}
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// ---------------------------------------
// Number of combinations (nCk) modulo MOD
// ---------------------------------------
vector<mint> fac;
vector<mint> fac_inv;
vector<mint> inv;
void init_comb(int mx) {
fac = vector<mint>(mx + 1), fac_inv = vector<mint>(mx + 1),
inv = vector<mint>(mx + 1);
fac.at(0) = fac.at(1) = 1;
fac_inv.at(0) = fac_inv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i <= mx; i++) {
fac.at(i) = fac.at(i - 1) * i;
inv.at(i) = -inv.at(MOD % i) * (MOD / i);
fac_inv.at(i) = fac_inv.at(i - 1) * inv.at(i);
}
}
mint comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * fac_inv.at(k) * fac_inv.at(n - k);
}
mint f(int r, int c) { return comb(r + c, c); }
mint g(int r, int c) { return f(r + 1, c + 1) - 1; }
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init_comb(2e6 + 1);
cout << g(r2, c2) - g(r1 - 1, c2) - g(r2, c1 - 1) + g(r1 - 1, c1 - 1) << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
// ------------------
// Integer modulo MOD
// ------------------
const int64_t MOD = 1e9 + 7;
struct mint {
int64_t x;
mint(int64_t x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(int64_t n) const {
if (n == 0)
return 1;
mint t = pow(n >> 1);
t *= t;
if (n & 1)
t *= *this;
return t;
}
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// ---------------------------------------
// Number of combinations (nCk) modulo MOD
// ---------------------------------------
vector<mint> fac;
vector<mint> fac_inv;
vector<mint> inv;
void init_comb(int mx) {
fac = vector<mint>(mx + 1), fac_inv = vector<mint>(mx + 1),
inv = vector<mint>(mx + 1);
fac.at(0) = fac.at(1) = 1;
fac_inv.at(0) = fac_inv.at(1) = 1;
inv.at(1) = 1;
for (int i = 2; i <= mx; i++) {
fac.at(i) = fac.at(i - 1) * i;
inv.at(i) = -inv.at(MOD % i) * (MOD / i);
fac_inv.at(i) = fac_inv.at(i - 1) * inv.at(i);
}
}
mint comb(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * fac_inv.at(k) * fac_inv.at(n - k);
}
mint f(int r, int c) { return comb(r + c, c); }
mint g(int r, int c) { return f(r + 1, c + 1) - 1; }
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
init_comb(2e6 + 2);
cout << g(r2, c2) - g(r1 - 1, c2) - g(r2, c1 - 1) + g(r1 - 1, c1 - 1) << endl;
return 0;
}
| replace | 78 | 79 | 78 | 79 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cstdio>
#define ll long long
using namespace std;
const int N = 404404;
int fac[N], ifac[N];
int p = 1e9 + 7;
ll ans = 0;
ll power(int a, int b) {
int sum = 1;
for (; b; b >>= 1) {
if (b & 1)
sum = 1ll * sum * a % p;
a = 1ll * a * a % p;
}
return sum;
}
ll C(int n, int m) { return 1ll * fac[n] * ifac[m] % p * ifac[n - m] % p; }
ll calc(int n, int m) {
if (n < 0 || m < 0)
return 0;
ll sum = 0;
for (int i = 1; i <= n + 1; i++)
sum = (sum + C(i + m, i)) % p;
return sum % p;
}
int main() {
int n1, m1, n2, m2;
scanf("%d%d%d%d", &n1, &m1, &n2, &m2);
int n = n2 + m2 + 1;
ifac[0] = fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = 1ll * fac[i - 1] * i % p;
ifac[n] = power(fac[n], p - 2);
for (int i = n - 1; i >= 1; i--)
ifac[i] = 1ll * ifac[i + 1] * (i + 1) % p;
ll ans =
calc(n2, m2) - calc(n2, m1 - 1) - calc(n1 - 1, m2) + calc(n1 - 1, m1 - 1);
printf("%lld\n", (ans % p + p) % p);
return 0;
} | #include <algorithm>
#include <cstdio>
#define ll long long
using namespace std;
const int N = 2022202;
int fac[N], ifac[N];
int p = 1e9 + 7;
ll ans = 0;
ll power(int a, int b) {
int sum = 1;
for (; b; b >>= 1) {
if (b & 1)
sum = 1ll * sum * a % p;
a = 1ll * a * a % p;
}
return sum;
}
ll C(int n, int m) { return 1ll * fac[n] * ifac[m] % p * ifac[n - m] % p; }
ll calc(int n, int m) {
if (n < 0 || m < 0)
return 0;
ll sum = 0;
for (int i = 1; i <= n + 1; i++)
sum = (sum + C(i + m, i)) % p;
return sum % p;
}
int main() {
int n1, m1, n2, m2;
scanf("%d%d%d%d", &n1, &m1, &n2, &m2);
int n = n2 + m2 + 1;
ifac[0] = fac[0] = 1;
for (int i = 1; i <= n; i++)
fac[i] = 1ll * fac[i - 1] * i % p;
ifac[n] = power(fac[n], p - 2);
for (int i = n - 1; i >= 1; i--)
ifac[i] = 1ll * ifac[i + 1] * (i + 1) % p;
ll ans =
calc(n2, m2) - calc(n2, m1 - 1) - calc(n1 - 1, m2) + calc(n1 - 1, m1 - 1);
printf("%lld\n", (ans % p + p) % p);
return 0;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Runtime Error | // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max() / 2 - 1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
bool f = true;
for (auto const &x : v)
os << (f ? "" : " ") << x, f = false;
return os;
}
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
istream &operator>>(istream &is, T &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F &&f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T &&...x) const {
return F::operator()(*this, forward<T>(x)...);
}
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F &&f) const {
return FixPoint<F>(forward<F>(f));
}
};
#define MFP MakeFixPoint() |
#define def(name, ...) auto name = MFP[&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
template <class T> int sz(T const &x) { return x.size(); }
template <class C, class T> int lbd(C const &v, T const &x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <class C, class T> int ubd(C const &v, T const &x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
// <<<
// >>> modint
template <int32_t md> class modint {
static_assert(md > 0, "");
using M = modint;
using ll = int64_t;
int32_t x;
public:
static constexpr int32_t mod = md;
constexpr modint(ll x = 0) : x((x %= mod) < 0 ? x + mod : x) {}
constexpr ll val() const { return x; }
constexpr operator ll() const { return x; }
constexpr bool operator==(M const &r) const { return x == r.x; }
constexpr bool operator!=(M const &r) const { return x != r.x; }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { return M() - *this; }
constexpr M &operator+=(M const &r) {
ll t = ll(x) + r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator-=(M const &r) {
ll t = ll(x) + mod - r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator*=(M const &r) { return *this = *this * r; }
constexpr M operator*(M const &r) const {
M t;
t.x = (ll(x) * r.x) % mod;
return t;
}
constexpr M &operator/=(M const &r) { return *this *= r.inv(); }
constexpr M operator+(M const &r) const { return M(*this) += r; }
constexpr M operator-(M const &r) const { return M(*this) -= r; }
constexpr M operator/(M const &r) const { return M(*this) /= r; }
friend constexpr M operator+(ll x, M const &y) { return M(x) + y; }
friend constexpr M operator-(ll x, M const &y) { return M(x) - y; }
friend constexpr M operator*(ll x, M const &y) { return M(x) * y; }
friend constexpr M operator/(ll x, M const &y) { return M(x) / y; }
constexpr M pow(ll n) const {
if (n < 0)
return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v)
if (n & 1)
r *= v;
return r;
}
constexpr M inv() const {
assert(x > 0);
ll t = 1, v = x, q = 0, r = 0;
while (v != 1) {
q = mod / v;
r = mod % v;
if (r * 2 < v) {
t *= -q;
t %= mod;
v = r;
} else {
t *= q + 1;
t %= mod;
v -= r;
}
}
if (t < 0)
t += mod;
M y;
y.x = t;
return y;
}
#ifdef LOCAL
friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
friend ostream &operator<<(ostream &os, M r) { return os << r.val(); }
friend istream &operator>>(istream &is, M &r) {
int64_t x;
is >> x;
r = x;
return is;
}
};
// <<<
// constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9 + 7;
using mint = modint<(int32_t)MOD>;
// >>> mod table
template <int32_t mod> struct ModTable {
static constexpr int32_t Size = 1e6 + 10;
static_assert(Size <= mod, "");
using ll = int64_t;
int32_t fact[Size], finv[Size], inv[Size];
ModTable() {
fact[0] = fact[1] = finv[0] = finv[1] = inv[1] = 1;
for (int i = 2; i < Size; i++) {
fact[i] = ll(fact[i - 1]) * i % mod;
inv[i] = mod - ll(inv[mod % i]) * (mod / i) % mod;
finv[i] = ll(finv[i - 1]) * inv[i] % mod;
}
}
};
const ModTable<MOD> mod_tab;
modint<MOD> fact(int n) {
assert(0 <= n);
assert(n < ModTable<MOD>::Size);
return mod_tab.fact[n];
}
modint<MOD> finv(int n) {
assert(0 <= n);
assert(n < ModTable<MOD>::Size);
return mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact(n) * finv(k) * finv(n - k);
}
modint<MOD> P(int n, int k) {
assert(k >= 0);
return fact(n) * finv(n - k);
}
// <<<
int32_t main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto f = [&](int n, int k) { return C(n + k + 1, k); };
mint sum = 0;
loop(i, r1, <= r2) sum += f(i, c2) - f(i, c1 - 1);
cout << sum << endl;
}
| // >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define int ll
#define double ld
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define repR(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i, n) for (int i = (int)(n); i >= 1; i--)
#define loop(i, a, B) for (int i = a; i B; i++)
#define loopR(i, a, B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#define INF (numeric_limits<int>::max() / 2 - 1)
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", \
dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) \
cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T>>;
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
ostream &operator<<(ostream &os, T const &v) {
bool f = true;
for (auto const &x : v)
os << (f ? "" : " ") << x, f = false;
return os;
}
template <class T, class = typename T::iterator,
class = typename enable_if<!is_same<T, string>::value>::type>
istream &operator>>(istream &is, T &v) {
for (auto &x : v)
is >> x;
return is;
}
template <class T, class S> istream &operator>>(istream &is, pair<T, S> &p) {
return is >> p.first >> p.second;
}
struct IOSetup {
IOSetup() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
cout << fixed << setprecision(15);
}
} iosetup;
template <class F> struct FixPoint : private F {
constexpr FixPoint(F &&f) : F(forward<F>(f)) {}
template <class... T> constexpr auto operator()(T &&...x) const {
return F::operator()(*this, forward<T>(x)...);
}
};
struct MakeFixPoint {
template <class F> constexpr auto operator|(F &&f) const {
return FixPoint<F>(forward<F>(f));
}
};
#define MFP MakeFixPoint() |
#define def(name, ...) auto name = MFP[&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
using type = vector<typename vec_impl<T, d - 1>::type>;
template <class... U> static type make_v(size_t n, U &&...x) {
return type(n, vec_impl<T, d - 1>::make_v(forward<U>(x)...));
}
};
template <class T> struct vec_impl<T, 0> {
using type = T;
static type make_v(T const &x = {}) { return x; }
};
template <class T, size_t d = 1> using vec = typename vec_impl<T, d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args &&...args) {
return vec_impl<T, d>::make_v(forward<Args>(args)...);
}
template <class T> void quit(T const &x) {
cout << x << endl;
exit(0);
}
template <class T> constexpr bool chmin(T &x, T const &y) {
if (x > y) {
x = y;
return true;
}
return false;
}
template <class T> constexpr bool chmax(T &x, T const &y) {
if (x < y) {
x = y;
return true;
}
return false;
}
template <class It> constexpr auto sumof(It b, It e) {
return accumulate(b, e, typename iterator_traits<It>::value_type{});
}
template <class T> int sz(T const &x) { return x.size(); }
template <class C, class T> int lbd(C const &v, T const &x) {
return lower_bound(v.begin(), v.end(), x) - v.begin();
}
template <class C, class T> int ubd(C const &v, T const &x) {
return upper_bound(v.begin(), v.end(), x) - v.begin();
}
// <<<
// >>> modint
template <int32_t md> class modint {
static_assert(md > 0, "");
using M = modint;
using ll = int64_t;
int32_t x;
public:
static constexpr int32_t mod = md;
constexpr modint(ll x = 0) : x((x %= mod) < 0 ? x + mod : x) {}
constexpr ll val() const { return x; }
constexpr operator ll() const { return x; }
constexpr bool operator==(M const &r) const { return x == r.x; }
constexpr bool operator!=(M const &r) const { return x != r.x; }
constexpr M operator+() const { return *this; }
constexpr M operator-() const { return M() - *this; }
constexpr M &operator+=(M const &r) {
ll t = ll(x) + r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator-=(M const &r) {
ll t = ll(x) + mod - r.x;
if (t >= mod)
t -= mod;
x = t;
return *this;
}
constexpr M &operator*=(M const &r) { return *this = *this * r; }
constexpr M operator*(M const &r) const {
M t;
t.x = (ll(x) * r.x) % mod;
return t;
}
constexpr M &operator/=(M const &r) { return *this *= r.inv(); }
constexpr M operator+(M const &r) const { return M(*this) += r; }
constexpr M operator-(M const &r) const { return M(*this) -= r; }
constexpr M operator/(M const &r) const { return M(*this) /= r; }
friend constexpr M operator+(ll x, M const &y) { return M(x) + y; }
friend constexpr M operator-(ll x, M const &y) { return M(x) - y; }
friend constexpr M operator*(ll x, M const &y) { return M(x) * y; }
friend constexpr M operator/(ll x, M const &y) { return M(x) / y; }
constexpr M pow(ll n) const {
if (n < 0)
return inv().pow(-n);
M v = *this, r = 1;
for (; n > 0; n >>= 1, v *= v)
if (n & 1)
r *= v;
return r;
}
constexpr M inv() const {
assert(x > 0);
ll t = 1, v = x, q = 0, r = 0;
while (v != 1) {
q = mod / v;
r = mod % v;
if (r * 2 < v) {
t *= -q;
t %= mod;
v = r;
} else {
t *= q + 1;
t %= mod;
v -= r;
}
}
if (t < 0)
t += mod;
M y;
y.x = t;
return y;
}
#ifdef LOCAL
friend string to_s(M r) { return to_s(r.val(), mod); }
#endif
friend ostream &operator<<(ostream &os, M r) { return os << r.val(); }
friend istream &operator>>(istream &is, M &r) {
int64_t x;
is >> x;
r = x;
return is;
}
};
// <<<
// constexpr int64_t MOD = 998244353;
constexpr int64_t MOD = 1e9 + 7;
using mint = modint<(int32_t)MOD>;
// >>> mod table
template <int32_t mod> struct ModTable {
static constexpr int32_t Size = 3e6 + 10;
static_assert(Size <= mod, "");
using ll = int64_t;
int32_t fact[Size], finv[Size], inv[Size];
ModTable() {
fact[0] = fact[1] = finv[0] = finv[1] = inv[1] = 1;
for (int i = 2; i < Size; i++) {
fact[i] = ll(fact[i - 1]) * i % mod;
inv[i] = mod - ll(inv[mod % i]) * (mod / i) % mod;
finv[i] = ll(finv[i - 1]) * inv[i] % mod;
}
}
};
const ModTable<MOD> mod_tab;
modint<MOD> fact(int n) {
assert(0 <= n);
assert(n < ModTable<MOD>::Size);
return mod_tab.fact[n];
}
modint<MOD> finv(int n) {
assert(0 <= n);
assert(n < ModTable<MOD>::Size);
return mod_tab.finv[n];
}
modint<MOD> C(int n, int k) {
if (n < 0 || k < 0 || n < k)
return 0;
return fact(n) * finv(k) * finv(n - k);
}
modint<MOD> P(int n, int k) {
assert(k >= 0);
return fact(n) * finv(n - k);
}
// <<<
int32_t main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
auto f = [&](int n, int k) { return C(n + k + 1, k); };
mint sum = 0;
loop(i, r1, <= r2) sum += f(i, c2) - f(i, c1 - 1);
cout << sum << endl;
}
| replace | 210 | 211 | 210 | 211 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
// const long long MOD = 998244353;
using namespace std;
const int max_comb = 220000;
vector<ll> fac(max_comb + 1); // n! (mod M)
vector<ll> ifac(max_comb + 1); // k!^(-1) (mod M)
ll mpow(ll x, ll n) { // x^n(mod M)
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll minv(ll x) { return mpow(x, MOD - 2); }
ll comb(int a, int b) { // C(a,b) = a! * b!^(-1) * (a-b)^(-1)
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
ll perm(int a, int b) { // P(a,b) = a! * (a-b)!^(-1)
if (b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] % MOD;
return tmp * fac[a] % MOD;
}
void pre_comb() {
fac[0] = 1;
ifac[0] = 1;
for (int i = 0; i < max_comb; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD; // n!(mod M)
ifac[i + 1] = ifac[i] * minv(i + 1) % MOD; // k!^(-1) (mod M)
}
return;
}
void solve() {
int r0, c0, r1, c1;
scanf("%d%d%d%d", &r0, &c0, &r1, &c1);
pre_comb();
ll ans0 = comb(r1 + c1 + 2, r1 + 1);
ll ans1 = comb(r1 + c0 + 1, c0);
ll ans2 = comb(r0 + c1 + 1, r0);
ll ans3 = comb(r0 + c0, r0);
ll ans = (ans0 - ans1 - ans2 + ans3 + MOD + MOD) % MOD;
printf("%lld\n", ans);
return;
}
int main(int argc, char *argv[]) {
#if 1
solve();
#else
int T;
scanf("%d", &T);
while (T--) {
solve();
}
#endif
return 0;
}
| #include <algorithm>
#include <assert.h>
#include <cstring>
#include <iterator>
#include <list>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <stdio.h>
#include <stdlib.h>
#include <string>
#include <vector>
#pragma warning(disable : 4996)
typedef long long ll;
#define MIN(a, b) ((a) > (b) ? (b) : (a))
#define MAX(a, b) ((a) < (b) ? (b) : (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
// const long long MOD = 998244353;
using namespace std;
const int max_comb = 2100000;
vector<ll> fac(max_comb + 1); // n! (mod M)
vector<ll> ifac(max_comb + 1); // k!^(-1) (mod M)
ll mpow(ll x, ll n) { // x^n(mod M)
ll ans = 1;
while (n != 0) {
if (n & 1)
ans = ans * x % MOD;
x = x * x % MOD;
n = n >> 1;
}
return ans;
}
ll minv(ll x) { return mpow(x, MOD - 2); }
ll comb(int a, int b) { // C(a,b) = a! * b!^(-1) * (a-b)^(-1)
if (a == 0 && b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] * ifac[b] % MOD;
return tmp * fac[a] % MOD;
}
ll perm(int a, int b) { // P(a,b) = a! * (a-b)!^(-1)
if (b == 0)
return 1;
if (a < b || a < 0)
return 0;
ll tmp = ifac[a - b] % MOD;
return tmp * fac[a] % MOD;
}
void pre_comb() {
fac[0] = 1;
ifac[0] = 1;
for (int i = 0; i < max_comb; i++) {
fac[i + 1] = fac[i] * (i + 1) % MOD; // n!(mod M)
ifac[i + 1] = ifac[i] * minv(i + 1) % MOD; // k!^(-1) (mod M)
}
return;
}
void solve() {
int r0, c0, r1, c1;
scanf("%d%d%d%d", &r0, &c0, &r1, &c1);
pre_comb();
ll ans0 = comb(r1 + c1 + 2, r1 + 1);
ll ans1 = comb(r1 + c0 + 1, c0);
ll ans2 = comb(r0 + c1 + 1, r0);
ll ans3 = comb(r0 + c0, r0);
ll ans = (ans0 - ans1 - ans2 + ans3 + MOD + MOD) % MOD;
printf("%lld\n", ans);
return;
}
int main(int argc, char *argv[]) {
#if 1
solve();
#else
int T;
scanf("%d", &T);
while (T--) {
solve();
}
#endif
return 0;
}
| replace | 26 | 27 | 26 | 27 | 0 | |
p02782 | C++ | Runtime Error | #define __mode_debug__
/* ξ
ll
＿ll＿
／ ∞ ＼
│* Ａ *│
│* Ｃ *│
│* 祈 *│
│* 願 *│
│* *│
￣￣￣￣￣ */
// C++14 (GCC 5.4.1)
#include <bits/stdc++.h>
using namespace std;
#ifdef __mode_debug__
#define DBG
#else
#define DBG if (false)
#endif
#define LLINF (1LL << 60)
using ll = long long;
#define mod 1000000007
#define whole(a) (a).begin(), (a).end()
#define rwhole(a) (a).rbegin(), (a).rend()
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
#define each(itr, ds) for (auto itr = (ds).begin(); itr != (ds).end(); itr++)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
}
// DUMP
// ostream vector<T> , vector<vector<T>> , set<T> ,queue<T> ,
// priority_queue<T> , pair<T,U> , map<T,U>
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "{ ";
rep(i, vec.size()) os << ((i == 0) ? "" : ", ") << i << ":" << vec[i];
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
os << "{" << endl;
rep(i, vec.size()) os << "\t " << i << ":" << vec[i]
<< ((i == vec.size() - 1) ? "" : ",") << endl;
os << "\t }";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << *itr;
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, queue<T> &p) {
queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.front();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T> ostream &operator<<(ostream &os, priority_queue<T> &p) {
priority_queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.top();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, map<T, U> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << itr->first << ":"
<< itr->second;
os << " }";
return os;
}
void dump_f(string &nm, char t) { cerr << endl; }
template <class T, class... Ts>
void dump_f(string &nm, char t, T &&x, Ts &&...ts) {
int l = nm.find_first_of(',');
string name(nm, 0, l), nx(nm, l + 1, -1);
if (t == '\n')
cerr << " " << name << "\t: " << x << t;
else
cerr << name << ": " << x << "," << t;
dump_f(nx, t, forward<Ts>(ts)...);
}
template <class... Ts> void dump_m(int &&ln, string &&nm, char t, Ts &&...ts) {
cerr << "[ln: " << ln << "]" << t;
dump_f(nm, t, forward<Ts>(ts)...);
}
#define dump(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\n', __VA_ARGS__)
#define dl(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\t', __VA_ARGS__)
#define lower_bound_idx(V, c) distance(V.begin(), lower_bound(whole(V), c))
ll powmod(ll x, int n) {
ll ans = 1, y = x;
int k = n;
while (k) {
if (k & 1)
ans = (ans * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return ans;
}
#define inv(x) powmod(x, mod - 2)
// mod付 階乗・階乗の逆元逆数を事前求値initF()
// 階乗をO(N)で求めた後、O(logMOD)で逆元を1度求値
// 1/x!*x = 1/(x-1)!を利用して戻るようにO(N)で逆元を一通り求める
#define needF 1000100
ll f[needF + 1], rf[needF + 1]; // f[x]=x!
void initF() {
f[0] = 1;
repd(i, 1, needF + 1) f[i] = (f[i - 1] * i) % mod;
rf[needF] = inv(f[needF]);
rrepd(i, needF - 1, 0) rf[i] = (rf[i + 1] * (i + 1)) % mod;
}
ll nPk(int n, int k) { return (f[n] * rf[n - k]) % mod; }
ll nCk(int n, int k) {
ll bc = (rf[n - k] * rf[k]) % mod;
return (f[n] * bc) % mod;
}
#define nHk(n, k) nCr((n) + (k)-1, k)
int main() {
ios::sync_with_stdio(false); // stdout<=>cout
cin.tie(nullptr); // cin<=>cout
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
initF();
ll ans;
ans = nCk(r2 + c2 + 2, r2 + 1) + nCk(r1 + c1, c1) - 2;
// dl(ans);
ans %= mod;
ans -= nCk(r1 + c2 + 1, r1) + nCk(c1 + r2 + 1, c1) - 2;
while (ans < 0)
ans += mod;
ans %= mod;
cout << ans << endl;
return (0);
} | #define __mode_debug__
/* ξ
ll
＿ll＿
／ ∞ ＼
│* Ａ *│
│* Ｃ *│
│* 祈 *│
│* 願 *│
│* *│
￣￣￣￣￣ */
// C++14 (GCC 5.4.1)
#include <bits/stdc++.h>
using namespace std;
#ifdef __mode_debug__
#define DBG
#else
#define DBG if (false)
#endif
#define LLINF (1LL << 60)
using ll = long long;
#define mod 1000000007
#define whole(a) (a).begin(), (a).end()
#define rwhole(a) (a).rbegin(), (a).rend()
#define repd(i, a, b) for (int i = (a); i < (b); i++)
#define rep(i, n) repd(i, 0, n)
#define rrepd(i, a, b) for (int i = (a); i >= (b); i--)
#define each(itr, ds) for (auto itr = (ds).begin(); itr != (ds).end(); itr++)
template <typename T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
template <typename T> inline string toString(const T &a) {
ostringstream oss;
oss << a;
return oss.str();
}
// DUMP
// ostream vector<T> , vector<vector<T>> , set<T> ,queue<T> ,
// priority_queue<T> , pair<T,U> , map<T,U>
template <class T> ostream &operator<<(ostream &os, vector<T> &vec) {
os << "{ ";
rep(i, vec.size()) os << ((i == 0) ? "" : ", ") << i << ":" << vec[i];
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, vector<vector<T>> &vec) {
os << "{" << endl;
rep(i, vec.size()) os << "\t " << i << ":" << vec[i]
<< ((i == vec.size() - 1) ? "" : ",") << endl;
os << "\t }";
return os;
}
template <class T> ostream &operator<<(ostream &os, set<T> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << *itr;
os << " }";
return os;
}
template <class T> ostream &operator<<(ostream &os, queue<T> &p) {
queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.front();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T> ostream &operator<<(ostream &os, priority_queue<T> &p) {
priority_queue<T> q(p);
os << "[< " << (q.empty() ? " <]" : "");
while (!q.empty()) {
os << q.top();
q.pop();
os << (q.empty() ? " <]" : ", ");
}
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, pair<T, U> &p) {
os << "(" << p.first << "," << p.second << ")";
return os;
}
template <class T, class U> ostream &operator<<(ostream &os, map<T, U> &p) {
os << "{ ";
each(itr, p) os << ((itr == p.begin()) ? "" : ", ") << itr->first << ":"
<< itr->second;
os << " }";
return os;
}
void dump_f(string &nm, char t) { cerr << endl; }
template <class T, class... Ts>
void dump_f(string &nm, char t, T &&x, Ts &&...ts) {
int l = nm.find_first_of(',');
string name(nm, 0, l), nx(nm, l + 1, -1);
if (t == '\n')
cerr << " " << name << "\t: " << x << t;
else
cerr << name << ": " << x << "," << t;
dump_f(nx, t, forward<Ts>(ts)...);
}
template <class... Ts> void dump_m(int &&ln, string &&nm, char t, Ts &&...ts) {
cerr << "[ln: " << ln << "]" << t;
dump_f(nm, t, forward<Ts>(ts)...);
}
#define dump(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\n', __VA_ARGS__)
#define dl(...) DBG dump_m(__LINE__, #__VA_ARGS__, '\t', __VA_ARGS__)
#define lower_bound_idx(V, c) distance(V.begin(), lower_bound(whole(V), c))
ll powmod(ll x, int n) {
ll ans = 1, y = x;
int k = n;
while (k) {
if (k & 1)
ans = (ans * y) % mod;
y = (y * y) % mod;
k /= 2;
}
return ans;
}
#define inv(x) powmod(x, mod - 2)
// mod付 階乗・階乗の逆元逆数を事前求値initF()
// 階乗をO(N)で求めた後、O(logMOD)で逆元を1度求値
// 1/x!*x = 1/(x-1)!を利用して戻るようにO(N)で逆元を一通り求める
#define needF 2000100
ll f[needF + 1], rf[needF + 1]; // f[x]=x!
void initF() {
f[0] = 1;
repd(i, 1, needF + 1) f[i] = (f[i - 1] * i) % mod;
rf[needF] = inv(f[needF]);
rrepd(i, needF - 1, 0) rf[i] = (rf[i + 1] * (i + 1)) % mod;
}
ll nPk(int n, int k) { return (f[n] * rf[n - k]) % mod; }
ll nCk(int n, int k) {
ll bc = (rf[n - k] * rf[k]) % mod;
return (f[n] * bc) % mod;
}
#define nHk(n, k) nCr((n) + (k)-1, k)
int main() {
ios::sync_with_stdio(false); // stdout<=>cout
cin.tie(nullptr); // cin<=>cout
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
initF();
ll ans;
ans = nCk(r2 + c2 + 2, r2 + 1) + nCk(r1 + c1, c1) - 2;
// dl(ans);
ans %= mod;
ans -= nCk(r1 + c2 + 1, r1) + nCk(c1 + r2 + 1, c1) - 2;
while (ans < 0)
ans += mod;
ans %= mod;
cout << ans << endl;
return (0);
} | replace | 142 | 143 | 142 | 143 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (int x = 0; x < n; x++)
#define rep2(x, f, v) for (int x = f; x < v; x++)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define alm1(a) memset(a, -1, sizeof(a))
const ll INF = 1000000007;
const int MAX = 1000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll bit[200010];
int max_n = 200000;
int pm = 0;
void add(int x) {
while (max_n >= x) {
bit[x]++;
x += x & -x;
}
}
void sub(int x) {
while (max_n >= x) {
bit[x]--;
x += x & -x;
}
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
int k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (size_t i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
void dfs(string s, char a) {
if (s.size() == n) {
cout << s << endl;
return;
}
for (char b = 'a'; b <= a; b++) {
dfs(s + b, (b == a) ? (char)(a + 1) : a);
}
}
string combine(string s, string t) {
string res = s + t;
for (int i = s.size() - 1; i >= 0; i--) {
int p = s.size() - i;
bool ok = true;
for (int j = 0; j < p && ok; j++) {
if (!(s[i + j] == t[j] || s[i + j] == '?' || t[j] == '?')) {
ok = false;
}
}
if (!ok)
continue;
string v = "";
for (int j = 0; j < i; j++) {
v += s[j];
}
for (int j = 0; j < t.size(); j++) {
if (j < p) {
if (s[i + j] == '?' && t[j] != '?') {
v += t[j];
} else if (s[i + j] != '?' && t[j] == '?') {
v += s[i + j];
} else {
v += t[j];
}
} else
v += t[j];
}
res = v;
}
return res;
}
string cmc(string a, string b, string c) {
string a1 = combine(a, b);
return combine(a1, c);
}
bool match(char a, char b) { return a == '?' || b == '?' || a == b; }
bool between(ll x, ll y1, ll y2) {
if (y1 > y2)
swap(y1, y2);
y1++;
y2--;
if (!(y1 <= y2))
return false;
while (x > 0) {
if (x % 3 == 1) {
if (y2 - y1 > 3)
return true;
for (ll y = y1; y <= y2; y++)
if (y % 3 == 1)
return true;
}
x /= 3;
y1 /= 3;
y2 /= 3;
}
return false;
}
ll get_extra(ll x1, ll y1, ll x2, ll y2) {
ll ans = 0;
int i;
ll three = 1;
rep(i, 36) {
if (x1 / three == x2 / three &&
between(x1 / three, y1 / three, y2 / three)) {
ll tmp = min(min(x1 % three, x2 % three) + 1,
three - max(x1 % three, x2 % three));
ans = max(ans, tmp);
}
three *= 3;
}
return ans;
}
ll get_dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x1 - x2) + abs(y1 - y2) +
2 * max(get_extra(x1, y1, x2, y2), get_extra(y1, x1, y2, x2));
}
void solv() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll res = 0;
for (ll i = 1; i <= r2 + 1; i++) {
res += COM(c2 + i, i);
res %= INF;
}
for (ll i = 1; i <= r2 + 1; i++) {
res += INF;
res -= COM(c1 - 1 + i, i);
res %= INF;
}
for (ll i = 1; i <= r1; i++) {
res += INF;
res -= COM(c2 + i, i);
res %= INF;
}
for (ll i = 1; i <= r1; i++) {
res += COM(c1 - 1 + i, i);
res %= INF;
}
cout << res << endl;
}
int main() {
COMinit();
solv();
return 0;
} | #include <algorithm>
#include <array>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <ctype.h>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdio.h>
#include <string.h>
#include <unordered_map>
#include <utility>
#include <vector>
#define _USE_MATH_DEFINES
#include <iostream>
#include <math.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ll, double> pld;
typedef pair<double, double> pdd;
typedef pair<double, ll> pdl;
typedef pair<int, char> pic;
typedef vector<ll> vl;
typedef vector<int> vi;
typedef priority_queue<ll, vector<ll>, greater<ll>> llgreaterq;
typedef priority_queue<pll, vector<pll>, greater<pll>> pllgreaterq;
typedef priority_queue<pair<ll, pll>, vector<pair<ll, pll>>,
greater<pair<ll, pll>>>
plpllgreaterq;
typedef priority_queue<vi, vector<vi>, greater<vi>> vigreaterq;
typedef priority_queue<vl, vector<vl>, greater<vl>> vlgreaterq;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, -1, 0, 1};
#define bit(x, v) ((ll)x << v)
#define rep(x, n) for (int x = 0; x < n; x++)
#define rep2(x, f, v) for (int x = f; x < v; x++)
// 許容する誤差ε
#define EPS (1e-10)
// 2つのスカラーが等しいかどうか
#define EQ(a, b) (std::abs(a - b) < EPS)
// 2つのベクトルが等しいかどうか
#define EQV(a, b) (EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()))
#define all(a) a.begin(), a.end()
#define all0(a) memset(a, 0, sizeof(a))
#define alm1(a) memset(a, -1, sizeof(a))
const ll INF = 1000000007;
const int MAX = 2000010;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
ll gcd(ll a, ll b) {
if (b == 0)
return a;
return gcd(b, a % b);
}
int pr[100010];
int lank[100010];
void uini(int n) {
for (size_t i = 0; i <= n; i++) {
pr[i] = i;
lank[i] = 1;
}
}
int parent(int x) {
if (x == pr[x])
return x;
return pr[x] = parent(pr[x]);
}
int same(int x, int y) { return parent(x) == parent(y); }
bool unit(int x, int y) {
int px = parent(x);
int py = parent(y);
if (px == py)
return false;
if (lank[py] < lank[px]) {
pr[py] = px;
lank[px] += lank[py];
} else {
pr[px] = py;
lank[py] += lank[px];
}
return true;
}
ll bit[200010];
int max_n = 200000;
int pm = 0;
void add(int x) {
while (max_n >= x) {
bit[x]++;
x += x & -x;
}
}
void sub(int x) {
while (max_n >= x) {
bit[x]--;
x += x & -x;
}
}
ll merge(ll *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<int> L(n1 + 1);
vector<int> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = INF;
R[n2] = INF;
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i] <= R[j]) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll merge2(pair<int, char> *a, int left, int mid, int right) {
ll n1 = mid - left;
ll n2 = right - mid;
vector<pair<int, char>> L(n1 + 1);
vector<pair<int, char>> R(n2 + 1);
for (size_t i = 0; i < n1; i++) {
L[i] = a[left + i];
}
for (size_t i = 0; i < n2; i++) {
R[i] = a[mid + i];
}
L[n1] = make_pair(INF, ' ');
R[n2] = make_pair(INF, ' ');
ll i = 0;
ll j = 0;
ll r = 0;
for (size_t k = left; k < right; k++) {
if (L[i].first <= R[j].first) {
a[k] = L[i];
i++;
} else {
a[k] = R[j];
r += n1 - i;
j++;
}
}
return r;
}
ll mergeSort2(pair<int, char> *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort2(a, left, mid);
res += mergeSort2(a, mid, right);
res += merge2(a, left, mid, right);
}
return res;
}
ll mergeSort(ll *a, int left, int right) {
ll res = 0;
if (left + 1 < right) {
int mid = (left + right) / 2;
res = mergeSort(a, left, mid);
res += mergeSort(a, mid, right);
res += merge(a, left, mid, right);
}
return res;
}
int partition(pair<int, char> *a, int p, int r) {
pair<int, char> x = a[r];
int i = p - 1;
for (size_t j = p; j < r; j++) {
if (a[j].first <= x.first) {
i++;
swap(a[i], a[j]);
}
}
swap(a[i + 1], a[r]);
return i + 1;
}
void quick(pair<int, char> *a, int p, int r) {
if (p < r) {
int q = partition(a, p, r);
quick(a, p, q - 1);
quick(a, q + 1, r);
}
}
ll n;
int ci = 0;
ll P[1000010];
struct Node {
int key;
int priority;
Node *parent, *left, *right;
Node(int key, int priority);
Node() {}
};
Node NIL;
Node::Node(int key, int priority) : key(key), priority(priority) {
left = &NIL;
right = &NIL;
}
Node *root = new Node();
void cenrec(Node *k) {
if (k->key == NIL.key)
return;
cenrec(k->left);
cout << " " << k->key;
cenrec(k->right);
}
void fastrec(Node *k) {
if (k->key == NIL.key)
return;
cout << " " << k->key;
fastrec(k->left);
fastrec(k->right);
}
void insert(Node *v) {
Node *y = &NIL;
Node *x = root;
while (x->key != NIL.key) {
y = x;
if (v->key < x->key) {
x = x->left;
} else {
x = x->right;
}
}
v->parent = y;
if (y->key == NIL.key) {
root = v;
} else if (v->key < y->key) {
y->left = v;
} else {
y->right = v;
}
}
Node *find(Node *k, ll v) {
if (k->key == NIL.key)
return &NIL;
if (k->key == v)
return k;
if (v < k->key)
return find(k->left, v);
return find(k->right, v);
}
void delp12(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key == NIL.key && r->key == NIL.key) {
if (pr->left == x) {
pr->left = &NIL;
} else
pr->right = &NIL;
} else if (l->key != NIL.key) {
if (pr->left == x) {
pr->left = l;
} else
pr->right = l;
l->parent = pr;
} else if (r->key != NIL.key) {
if (pr->left == x) {
pr->left = r;
} else
pr->right = r;
r->parent = pr;
}
}
Node *get_next(Node *k) {
if (k->key == NIL.key)
return &NIL;
Node *res = get_next(k->left);
if (res->key != NIL.key)
return res;
return k;
}
void del(Node *x) {
if (x->key == NIL.key)
return;
Node *l = x->left;
Node *r = x->right;
Node *pr = x->parent;
if (l->key != NIL.key && r->key != NIL.key) {
Node *nex = get_next(r);
x->key = nex->key;
delp12(nex);
} else {
delp12(x);
}
}
Node *rightRotate(Node *t) {
Node *s = t->left;
t->left = s->right;
s->right = t;
return s;
}
Node *leftRotate(Node *t) {
Node *s = t->right;
t->right = s->left;
s->left = t;
return s;
}
Node *_insert(Node *t, int key, int priority) {
if (t->key == NIL.key) {
return new Node(key, priority);
}
if (key == t->key) {
return t;
}
if (key < t->key) {
t->left = _insert(t->left, key, priority);
if (t->priority < t->left->priority) {
t = rightRotate(t);
}
} else {
t->right = _insert(t->right, key, priority);
if (t->priority < t->right->priority) {
t = leftRotate(t);
}
}
return t;
}
Node *delete1(Node *t, int key);
Node *_delete(Node *t, int key) {
if (t->left->key == NIL.key && t->right->key == NIL.key) {
return &NIL;
} else if (t->left->key == NIL.key) {
t = leftRotate(t);
} else if (t->right->key == NIL.key) {
t = rightRotate(t);
} else {
if (t->left->priority > t->right->priority) {
t = rightRotate(t);
} else
t = leftRotate(t);
}
return delete1(t, key);
}
Node *delete1(Node *t, int key) {
if (t->key == NIL.key) {
return &NIL;
}
if (key < t->key) {
t->left = delete1(t->left, key);
} else if (key > t->key) {
t->right = delete1(t->right, key);
} else
return _delete(t, key);
return t;
}
int H;
int left(int i) { return i * 2 + 1; }
int right(int i) { return i * 2 + 2; }
struct edge {
int from, to;
ll val;
edge(int from, int to, ll val) : from(from), to(to), val(val) {}
};
int k;
int _rank[1010];
int temp[1010];
bool compare_sa(int i, int j) {
if (_rank[i] != _rank[j])
return _rank[i] < _rank[j];
else {
int ri = i + k <= n ? _rank[i + k] : -1;
int rj = j + k <= n ? _rank[j + k] : -1;
return ri < rj;
}
}
void construct_sa(string S, int *sa) {
n = S.length();
for (size_t i = 0; i <= n; i++) {
sa[i] = i;
_rank[i] = i < n ? S[i] : -1;
}
for (k = 1; k <= n; k *= 2) {
sort(sa, sa + n + 1, compare_sa);
// saはソート後の接尾辞の並びになっている、rankは元の位置のindexを保持したまま、更新されている。
// ピンとこなかった部分
temp[sa[0]] = 0;
for (size_t i = 1; i <= n; i++) {
temp[sa[i]] = temp[sa[i - 1]] + (compare_sa(sa[i - 1], sa[i]) ? 1 : 0);
}
for (size_t i = 0; i <= n; i++) {
_rank[i] = temp[i];
}
}
}
bool contain(string S, int *sa, string T) {
int a = 0, b = S.length();
// sa は 接尾辞が辞書順に並んでいる、入っているのはその位置のインデックス
while (b - a > 1) {
int c = (a + b) / 2;
if (S.compare(sa[c], T.length(), T) < 0)
a = c;
else
b = c;
}
return S.compare(sa[b], T.length(), T) == 0;
}
#define bit(x, v) ((ll)x << v)
class BIT {
static const int MAX_N = 500010;
public:
BIT() { memset(bit, 0, sizeof(bit)); }
ll bit[MAX_N + 1], n;
ll sum(int i) {
ll s = 0;
while (i > 0) {
s += bit[i];
i -= i & -i;
}
return s;
}
void add(int i, int x) {
while (i <= n) {
bit[i] += x;
i += i & -i;
}
}
};
struct UnionFind {
vector<int> A;
UnionFind(int n) : A(n, -1) {}
int find(int x) {
if (A[x] < 0)
return x;
return A[x] = find(A[x]);
}
void unite(int x, int y) {
x = find(x), y = find(y);
if (x == y)
return;
if (A[x] > A[y])
swap(x, y);
A[x] += A[y];
A[y] = x;
}
int ngroups() {
int ans = 0;
for (auto a : A)
if (a < 0)
ans++;
return ans;
}
};
void yes() {
cout << "Yes\n";
exit(0);
}
void no() {
cout << "No\n";
exit(0);
}
vector<ll> getp(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
res.push_back(2);
while (n % 2 == 0)
n /= 2;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(i);
while (n % i == 0)
n /= i;
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<ll> getp2(ll n) {
vector<ll> res;
ll a = 2;
if (n % 2 == 0) {
while (n % 2 == 0) {
n /= 2;
res.push_back(2);
}
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
while (n % i == 0) {
n /= i;
res.push_back(i);
}
}
}
if (n != 1)
res.push_back(n);
return res;
}
vector<pll> getp3(ll n) {
vector<pll> res;
ll a = 2;
int si = 0;
if (n % 2 == 0) {
res.push_back(make_pair(2, 0));
while (n % 2 == 0) {
n /= 2;
res[si].second++;
}
si++;
}
for (ll i = 3; i * i <= n; i += 2) {
if (n % i == 0) {
res.push_back(make_pair(i, 0));
while (n % i == 0) {
n /= i;
res[si].second++;
}
si++;
}
}
if (n != 1) {
res.push_back(make_pair(n, 1));
}
return res;
}
vector<ll> getDivisors(ll n) {
vector<ll> res;
ll a = 2;
res.push_back(1);
for (ll i = 2; i * i <= n; i++) {
if (n % i == 0) {
res.push_back(i);
if (n / i != i)
res.push_back(n / i);
}
}
return res;
}
struct ve {
public:
vector<ve> child;
int _t = INF;
ve(int t) : _t(t) {}
ve(ve _left, ve _right) {
_t = _left._t + _right._t;
child.push_back(_left);
child.push_back(_right);
}
bool operator<(const ve &t) const { return _t > t._t; }
};
vector<bool> elas(ll n) {
vector<bool> r(n);
fill(r.begin(), r.end(), 1);
r[0] = 0;
r[1] = 0;
for (ll i = 2; i * i < n; i++) {
if (!r[i])
continue;
ll ti = i * 2;
while (ti < n) {
r[ti] = false;
ti += i;
}
}
return r;
}
bool isPrime(ll v) {
for (ll i = 2; i * i <= v; i++) {
if (v % i == 0)
return false;
}
return true;
}
ll getpow(ll b, ll x, ll md) {
ll t = b;
ll res = 1;
while (x > 0) {
if (x & 1) {
res *= t;
res %= md;
}
x >>= 1;
t *= t;
t %= md;
}
return res;
}
ll getpow(ll b, ll x) { return getpow(b, x, INF); }
class SegTree {
public:
const static int MAX_N = 100010;
const static int DAT_SIZE = (1 << 18) - 1;
int N, Q;
int A[MAX_N];
ll data[DAT_SIZE], datb[DAT_SIZE];
void init(int _n) {
N = 1;
while (N < _n)
N <<= 1;
memset(data, 0, sizeof(data));
memset(datb, 0, sizeof(datb));
}
void init(int _n, ll iv) {
N = 1;
while (N < _n)
N <<= 1;
rep(i, DAT_SIZE) {
data[i] = iv;
datb[i] = iv;
}
}
void add(int a, int b, int x) { add(a, b + 1, x, 0, 0, N); }
void add(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] += x;
} else if (l < b && a < r) {
datb[k] += (min(b, r) - max(a, l)) * x;
add(a, b, x, k * 2 + 1, l, (l + r) / 2);
add(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
void change(int a, int b, int x) { change(a, b + 1, x, 0, 0, N); }
void change(int a, int b, int x, int k, int l, int r) {
if (a <= l && r <= b) {
data[k] = x;
} else if (l < b && a < r) {
datb[k] = x;
change(a, b, x, k * 2 + 1, l, (l + r) / 2);
change(a, b, x, k * 2 + 2, (l + r) / 2, r);
}
}
ll sum(int a, int b) { return sum(a, b + 1, 0, 0, N); }
ll sum(int a, int b, int k, int l, int r) {
if (b <= l || r <= a) {
return 0;
}
if (a <= l && r <= b) {
return data[k] * (r - l) + datb[k];
}
ll res = (min(b, r) - max(a, l)) * data[k];
res += sum(a, b, k * 2 + 1, l, (l + r) / 2);
res += sum(a, b, k * 2 + 2, (l + r) / 2, r);
return res;
}
};
class Segment;
class Circle;
class Point {
public:
double x, y;
Point(double x = 0, double y = 0) : x(x), y(y) {}
Point operator+(Point p) { return Point(x + p.x, y + p.y); }
Point operator-(Point p) { return Point(x - p.x, y - p.y); }
Point operator*(double a) { return Point(a * x, a * y); }
Point operator/(double a) { return Point(x / a, y / a); }
double abs() { return sqrt(norm()); }
double norm() { return x * x + y * y; }
bool operator<(const Point &p) const { return x != p.x ? x < p.x : y < p.y; }
bool operator==(const Point &p) const {
return fabs(x - p.x) < EPS && fabs(y - p.y) < EPS;
}
static double dot(Point a, Point b) { return a.x * b.x + a.y * b.y; }
static double cross(Point a, Point b) { return a.x * b.y - a.y * b.x; }
static bool isOrthogonal(Point a, Point b) { return EQ(dot(a, b), 0.0); }
static bool isOrthogonal(Point a1, Point a2, Point b1, Point b2) {
return isOrthogonal(a1 - a2, b1 - b2);
}
static bool isOrthogonal(Segment s1, Segment s2);
static bool isPalallel(Point a, Point b) { return EQ(cross(a, b), 0.0); }
static bool isPalallel(Point a1, Point a2, Point b1, Point b2) {
return isPalallel(a1 - a2, b1 - b2);
}
static bool isPalallel(Segment s1, Segment s2);
static const int COUNTER_CLOCKWISE = 1;
static const int CLOCKWISE = -1;
static const int ONLINE_BACK = 2;
static const int ONLINE_FRONT = -2;
static const int ON_SEGMENT = 0;
static int ccw(Point p0, Point p1, Point p2) {
Point a = p1 - p0;
Point b = p2 - p0;
if (cross(a, b) > EPS)
return COUNTER_CLOCKWISE;
if (cross(a, b) < -EPS)
return CLOCKWISE;
if (dot(a, b) < -EPS)
return ONLINE_BACK;
if (a.norm() < b.norm())
return ONLINE_FRONT;
return ON_SEGMENT;
}
static bool intersect(Point p1, Point p2, Point p3, Point p4) {
return (ccw(p1, p2, p3) * ccw(p1, p2, p4) <= 0 &&
ccw(p3, p4, p1) * ccw(p3, p4, p2) <= 0);
}
static bool intersect(Segment s1, Segment s2);
static Point project(Segment s, Point p);
static Point reflect(Segment s, Point p);
static Point getDistance(Point a, Point b) { return (a - b).abs(); }
static double getDistanceLP(Segment s, Point p);
static double getDistanceSP(Segment s, Point p);
static double getDistance(Segment s1, Segment s2);
static Point getIntersection(Segment s1, Segment s2);
static pair<Point, Point> crossPoints(Circle c, Segment s);
};
class Segment {
public:
Point p1, p2;
Segment() {}
Segment(Point p1, Point p2) : p1(p1), p2(p2) {}
Point p1tp2() { return p2 - p1; }
Point p2tp1() { return p1 - p2; }
double abs() { return std::abs(norm()); }
double norm() { return (p2 - p1).norm(); }
};
bool Point::isOrthogonal(Segment s1, Segment s2) {
return EQ(dot(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::isPalallel(Segment s1, Segment s2) {
return EQ(cross(s1.p2 - s1.p1, s2.p2 - s2.p1), 0.0);
}
bool Point::intersect(Segment s1, Segment s2) {
return intersect(s1.p1, s1.p2, s2.p1, s2.p2);
}
Point Point::project(Segment s, Point p) {
Point base = s.p2 - s.p1;
double r = Point::dot(p - s.p1, base) / base.norm();
return s.p1 + base * r;
}
Point Point::reflect(Segment s, Point p) { return (project(s, p) * 2) - p; }
double Point::getDistanceLP(Segment s, Point p) {
return std::abs(cross(s.p2 - s.p1, p - s.p1) / (s.p2 - s.p1).abs());
}
double Point::getDistanceSP(Segment s, Point p) {
if (dot(s.p2 - s.p1, p - s.p1) < 0.0)
return (p - s.p1).abs();
if (dot(s.p1 - s.p2, p - s.p2) < 0.0)
return (p - s.p2).abs();
return getDistanceLP(s, p);
}
double Point::getDistance(Segment s1, Segment s2) {
if (intersect(s1, s2))
return 0.0;
return min({getDistanceSP(s1, s2.p1), getDistanceSP(s1, s2.p2),
getDistanceSP(s2, s1.p1), getDistanceSP(s2, s1.p2)});
}
Point Point::getIntersection(Segment s1, Segment s2) {
// (s1.p1 - s2.p1).norm()
auto bs = s1.p2 - s1.p1;
auto n1 = s2.p1 - s1.p1;
auto n2 = s2.p2 - s1.p1;
auto c1 = std::abs(cross(n1, bs)) / bs.norm();
auto c2 = std::abs(cross(n2, bs)) / bs.norm();
return s2.p1 + (s2.p2 - s2.p1) * (c1 / (c1 + c2));
// c1:c2=t:1-t
// c2t=(1-t)c1
// t/(1-t)=c1/(c1+c2)
//
}
double arg(Point p) { return atan2(p.y, p.x); }
Point polar(double a, double r) { return Point(cos(r) * a, sin(r) * a); }
class Circle {
public:
Point c;
double r;
Circle(Point c = Point(), double r = 0.0) : c(c), r(r) {}
static pair<Point, Point> getCrossPoints(Circle c1, Circle c2) {
double d = (c1.c - c2.c).abs(); // 中心点どうしの距離
double a = acos((c1.r * c1.r + d * d - c2.r * c2.r) / (2 * c1.r * d));
double t = arg(c2.c - c1.c);
return make_pair(c1.c + polar(c1.r, t + a), c1.c + polar(c1.r, t - a));
}
};
pair<Point, Point> Point::crossPoints(Circle c, Segment s) {
auto pp = project(s, c.c);
auto f = (pp - c.c).norm();
auto mu = sqrt(c.r * c.r - f);
auto e = s.p1tp2() / s.p1tp2().abs();
return make_pair(pp + e * mu, pp - e * mu);
}
ll divRm(string s, ll x) {
ll r = 0;
for (size_t i = 0; i < s.size(); i++) {
r *= 10;
r += s[i] - '0';
r %= x;
}
return r;
}
ll cmbi(ll x, ll b) {
ll res = 1;
for (size_t i = 0; i < b; i++) {
res *= x - i;
res %= INF;
res *= inv[b - i];
res %= INF;
}
return res;
}
void dfs(string s, char a) {
if (s.size() == n) {
cout << s << endl;
return;
}
for (char b = 'a'; b <= a; b++) {
dfs(s + b, (b == a) ? (char)(a + 1) : a);
}
}
string combine(string s, string t) {
string res = s + t;
for (int i = s.size() - 1; i >= 0; i--) {
int p = s.size() - i;
bool ok = true;
for (int j = 0; j < p && ok; j++) {
if (!(s[i + j] == t[j] || s[i + j] == '?' || t[j] == '?')) {
ok = false;
}
}
if (!ok)
continue;
string v = "";
for (int j = 0; j < i; j++) {
v += s[j];
}
for (int j = 0; j < t.size(); j++) {
if (j < p) {
if (s[i + j] == '?' && t[j] != '?') {
v += t[j];
} else if (s[i + j] != '?' && t[j] == '?') {
v += s[i + j];
} else {
v += t[j];
}
} else
v += t[j];
}
res = v;
}
return res;
}
string cmc(string a, string b, string c) {
string a1 = combine(a, b);
return combine(a1, c);
}
bool match(char a, char b) { return a == '?' || b == '?' || a == b; }
bool between(ll x, ll y1, ll y2) {
if (y1 > y2)
swap(y1, y2);
y1++;
y2--;
if (!(y1 <= y2))
return false;
while (x > 0) {
if (x % 3 == 1) {
if (y2 - y1 > 3)
return true;
for (ll y = y1; y <= y2; y++)
if (y % 3 == 1)
return true;
}
x /= 3;
y1 /= 3;
y2 /= 3;
}
return false;
}
ll get_extra(ll x1, ll y1, ll x2, ll y2) {
ll ans = 0;
int i;
ll three = 1;
rep(i, 36) {
if (x1 / three == x2 / three &&
between(x1 / three, y1 / three, y2 / three)) {
ll tmp = min(min(x1 % three, x2 % three) + 1,
three - max(x1 % three, x2 % three));
ans = max(ans, tmp);
}
three *= 3;
}
return ans;
}
ll get_dist(ll x1, ll y1, ll x2, ll y2) {
return abs(x1 - x2) + abs(y1 - y2) +
2 * max(get_extra(x1, y1, x2, y2), get_extra(y1, x1, y2, x2));
}
void solv() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll res = 0;
for (ll i = 1; i <= r2 + 1; i++) {
res += COM(c2 + i, i);
res %= INF;
}
for (ll i = 1; i <= r2 + 1; i++) {
res += INF;
res -= COM(c1 - 1 + i, i);
res %= INF;
}
for (ll i = 1; i <= r1; i++) {
res += INF;
res -= COM(c2 + i, i);
res %= INF;
}
for (ll i = 1; i <= r1; i++) {
res += COM(c1 - 1 + i, i);
res %= INF;
}
cout << res << endl;
}
int main() {
COMinit();
solv();
return 0;
} | replace | 60 | 61 | 60 | 61 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
const int Max_Num = 1e5 + 10;
const LL mod = 1e9 + 7;
LL F[Max_Num], Finv[Max_Num];
LL modpow(LL x, LL n) {
LL r = 1;
while (n) {
if (n & 1)
r = r * x % mod;
x = x * x % mod;
n >>= 1;
}
return r;
}
LL modinv(LL x) {
LL m = mod, u = 1, v = 0;
while (m) {
LL t = x / m;
x -= t * m;
swap(x, m);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void fact() {
F[0] = 1;
rep(i, Max_Num - 1) {
F[i + 1] = F[i] * (i + 1);
F[i + 1] %= mod;
}
rep(i, Max_Num) Finv[i] = modinv(F[i]);
}
LL calc(LL r, LL c) {
return F[r + c + 2] * Finv[c + 1] % mod * Finv[r + 1] % mod;
}
int main() {
fact();
LL r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
LL ans =
calc(r2, c2) - calc(r1 - 1, c2) - calc(r2, c1 - 1) + calc(r1 - 1, c1 - 1);
ans %= mod;
while (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using LL = long long;
const int Max_Num = 2e6 + 10;
const LL mod = 1e9 + 7;
LL F[Max_Num], Finv[Max_Num];
LL modpow(LL x, LL n) {
LL r = 1;
while (n) {
if (n & 1)
r = r * x % mod;
x = x * x % mod;
n >>= 1;
}
return r;
}
LL modinv(LL x) {
LL m = mod, u = 1, v = 0;
while (m) {
LL t = x / m;
x -= t * m;
swap(x, m);
u -= t * v;
swap(u, v);
}
u %= mod;
if (u < 0)
u += mod;
return u;
}
void fact() {
F[0] = 1;
rep(i, Max_Num - 1) {
F[i + 1] = F[i] * (i + 1);
F[i + 1] %= mod;
}
rep(i, Max_Num) Finv[i] = modinv(F[i]);
}
LL calc(LL r, LL c) {
return F[r + c + 2] * Finv[c + 1] % mod * Finv[r + 1] % mod;
}
int main() {
fact();
LL r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
LL ans =
calc(r2, c2) - calc(r1 - 1, c2) - calc(r2, c1 - 1) + calc(r1 - 1, c1 - 1);
ans %= mod;
while (ans < 0)
ans += mod;
cout << ans << endl;
return 0;
} | replace | 5 | 6 | 5 | 6 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T> using uset = unordered_set<T>;
template <typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
template <typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template <typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v)
os << u << el;
return (os);
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &u : v)
is >> u;
return (is);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return (is);
}
constexpr int MAX = 1010000;
constexpr int MOD = 1000000007;
// Please set MAX and MOD!!========================================
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return (0);
return (fac[n] * (finv[k] * finv[n - k] % MOD) % MOD);
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll sum = 0;
COMinit();
for (int i = r1 + 1; i <= r2 + 1; i++) {
(sum += COM(i + c2, i)) %= mod;
(sum += (mod - COM(i + c1 - 1, i))) %= mod;
}
cout << sum << endl;
return (0);
} | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Pi = pair<int, int>;
using Pl = pair<ll, ll>;
using vint = vector<int>;
using vll = vector<ll>;
using uint = unsigned int;
using ull = unsigned long long;
template <typename T> using uset = unordered_set<T>;
template <typename T1, typename T2> using umap = unordered_map<T1, T2>;
constexpr int INF = (1 << 30) - 1;
constexpr ll LLINF = 1LL << 60;
constexpr int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};
constexpr int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
constexpr char el = '\n';
constexpr int mod = 1000000007;
template <typename T> T gcd(T a, T b) { return (b ? gcd(b, a % b) : a); }
template <typename T> T lcm(T a, T b) { return (a / gcd(a, b) * b); }
template <typename T1, typename T2> inline void chmin(T1 &a, T2 b) {
if (a > b)
a = b;
}
template <typename T1, typename T2> inline void chmax(T1 &a, T2 b) {
if (a < b)
a = b;
}
template <typename T> ostream &operator<<(ostream &os, vector<T> &v) {
for (auto &u : v)
os << u << el;
return (os);
}
template <typename T> istream &operator>>(istream &is, vector<T> &v) {
for (auto &u : v)
is >> u;
return (is);
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
is >> p.first >> p.second;
return (is);
}
constexpr int MAX = 3010000;
constexpr int MOD = 1000000007;
// Please set MAX and MOD!!========================================
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(int n, int k) {
if (n < k || n < 0 || k < 0)
return (0);
return (fac[n] * (finv[k] * finv[n - k] % MOD) % MOD);
}
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll sum = 0;
COMinit();
for (int i = r1 + 1; i <= r2 + 1; i++) {
(sum += COM(i + c2, i)) %= mod;
(sum += (mod - COM(i + c1 - 1, i))) %= mod;
}
cout << sum << endl;
return (0);
}
| replace | 50 | 51 | 50 | 51 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#include <functional> // for less
#include <iostream>
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(ar) ar.begin(), ar.end()
#define mp make_pair
#define sot(bello) bello.begin(), bello.end()
#define bitc __builtin_popcountl
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define fill(ar, val) rep(i, sizeof(ar) / sizeof(ll)) ar[i] = val
#define fill0(ar) fill((ar), 0)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define MOD 1000000007
#define MOD1 998244353
#define print(x) \
{ \
cout << x << endl; \
cerr << endl; \
return; \
}
#define debug(x) cerr << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define clr(a) memset(a, 0, sizeof(a))
#define dbug(x) cerr << #x << ": " << x << " "
auto clk = clock();
#define PI 3.1415926535897932385
#define fi first
#define se second
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define INF LLONG_MAX
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0},
dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
/* This Template is authored by Ankit Anvesh */
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// gcd for negatives too
/* ll gcd(ll a, ll b) {
if (a == 0) return b;
if (b == 0) return a;
if (b < 0) return gcd(a, -1 * b);
if (a < 0) return gcd(-1 * a, b);
if (a > b) return gcd(b, a);
return gcd(b%a, a);
}
*/
// gcd
const ll MAXN = 100010;
ll Gcd(ll a, ll b) {
if (a % b == 0)
return b;
return Gcd(b, a % b);
}
// max
ll Max(ll a, ll b) {
if (a > b)
return a;
return b;
}
// min
ll Min(ll a, ll b) {
if (a < b)
return a;
return b;
}
void printvector(std::vector<ll> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << "" << endl;
}
void printarray(ll a[], ll n) {
for (ll i = 0; i < n; ++i) {
cout << a[i] << " ";
}
cout << "" << endl;
}
ll findlcm(vector<ll> arr, ll n) {
// Initialize result
ll ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (Gcd(arr[i], ans)));
return ans;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll lowerbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>=k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] < k)
l = mid + 1;
else {
r = mid - 1;
}
}
return l;
}
ll upperbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] > k)
r = mid - 1;
else {
l = mid + 1;
}
}
return l;
}
ll spf[MAXN];
void sieve() {
spf[1] = 1;
for (int i = 2; i < MAXN; i++)
spf[i] = i;
for (int i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (int i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (int j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
// Segment Tree Implementation
// const ll N = 100000;
ll n, m;
// BIT tree
/*
start indexing from 1
ll BIT[100010];
void update(ll x,ll val){
for (; x <=n ; x +=(x&(-x)) )
BIT[x]+=val;
}
ll query(ll x){
ll sum=0;
for(;x>0;x -= (x&(-x)) )
sum+=BIT[x];
return sum;
}*/
// Dijkstra's Algorithm
// if x->y (weight=w) then v[x].push_back(mp(y,w));
vector<ll> shortPath(vector<pair<ll, ll>> v[], ll src, ll V = 0) {
set<pair<ll, ll>> setds;
ll sizee = V;
ll IN = INF;
vector<ll> dist(sizee, IN);
vector<bool> vis(sizee, false);
setds.insert(make_pair(0, src));
dist[src] = 0;
while (!setds.empty()) {
pair<ll, ll> tmp = *(setds.begin());
setds.erase(setds.begin());
ll u = tmp.second;
if (vis[u])
continue;
vis[u] = true;
vector<pair<ll, ll>>::iterator i;
for (auto i = v[u].begin(); i != v[u].end(); ++i) {
ll v = (*i).first;
ll weight = (*i).second;
if (dist[v] > dist[u] + weight) {
if (dist[v] != INF)
setds.erase(setds.find(make_pair(dist[v], v)));
dist[v] = dist[u] + weight;
setds.insert(make_pair(dist[v], v));
}
}
}
return dist;
}
ll root(ll a[], ll r) {
if (a[r] == r) {
return r;
} else {
ll x = root(a, a[r]);
a[r] = x;
return x;
}
}
void unio(ll a[], ll size[], ll x, ll y) {
x = root(a, x);
y = root(a, y);
if (x == y) {
return;
}
if (size[x] >= size[y]) {
a[y] = x;
size[x] += size[y];
} else {
a[x] = y;
size[y] += size[x];
}
}
// Sieve Implementation
/*
for (ll i=2;i<=100005;i++)
if (p[i]==0)
for (ll j=2*i;j<=100005;j+=i) p[j]=1; */
// Dfs search
// do not use n , m , N , C
// Using iterators in C++
// set<ll>:: iterator it;
// string to integer stuuu()
// string to long long stoll()
// string to float stof
// string.substr(position,length);
// integer to string to_string();
// intialize 2d vector vector<vector<ll>> dp(105,vector<ll>(105));
// for taking ceil use (num+den-1)/den
void neuer(ll txt) {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll mx1 = max(r1, c1);
ll mx2 = max(r2, c2);
ll mxc = max(c2, c1);
ll mxr = max(r2, r1);
ll mir = min(r2, r1);
ll mic = min(c2, c1);
ll mi1 = min(c1, r1);
ll mi2 = min(r2, c2);
/* n=(mx1-mi1+1);
m=(mx2-mi2+1);
ll mx=max(n,m);
ll mi=min(n,m);
*/
ll ans = 0;
vector<ll> f(1000010, 1);
for (ll i = 2; i <= 1000000; i++) {
f[i] = (f[i - 1] * i) % MOD;
}
ll a1, a2, a3, a4, a5;
a1 = a2 = a3 = a4 = a5 = 0;
for (ll i = 1; i <= r2 + 1; i++) {
ll up = c2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a1 = (a1 + ok1) % MOD;
}
for (ll i = 1; i <= mi2 + 1; i++) {
ll up = mx2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[mx2] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a2 = (a2 + ok1) % MOD;
}
for (ll i = 1; i <= r1; i++) {
ll up = c2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a3 = (a3 + ok1) % MOD;
}
for (ll i = 1; i <= c1; i++) {
ll up = r2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a4 = (a4 + ok1) % MOD;
}
ll ki = max(mic, mir);
ll ko = min(mic, mir);
for (ll i = 1; i <= ko; i++) {
ll up = ki + i - 1;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a5 = (a5 + ok1) % MOD;
}
n = max(a1, a2);
m = min(a1, a2);
n = a1;
debug(a1);
debug(a2);
debug(a3);
debug(a4);
debug(a5);
ll res = (n - a3 - a4 + a5 + MOD) % MOD;
print(res);
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x68 = 1;
// cin >> x68;
for (ll vi = 1; vi <= x68; vi++) {
neuer(vi);
}
return 0;
} | #include <bits/stdc++.h>
#include <functional> // for less
#include <iostream>
#define ll long long
#define ull unsigned long long
#define ld long double
#define all(ar) ar.begin(), ar.end()
#define mp make_pair
#define sot(bello) bello.begin(), bello.end()
#define bitc __builtin_popcountl
#define fr(i, a, b) for (int i = (a), _b = (b); i <= _b; i++)
#define frr(i, a, b) for (int i = (a), _b = (b); i >= _b; i--)
#define rep(i, n) for (int i = 0, _n = (n); i < _n; i++)
#define repr(i, n) for (int i = n - 1; i >= 0; i--)
#define fill(ar, val) rep(i, sizeof(ar) / sizeof(ll)) ar[i] = val
#define fill0(ar) fill((ar), 0)
#define foreach(it, ar) \
for (typeof(ar.begin()) it = ar.begin(); it != ar.end(); it++)
#define fillinf(ar, n) fr(i, 0, (n)) ar[i] = INF
#define MOD 1000000007
#define MOD1 998244353
#define print(x) \
{ \
cout << x << endl; \
cerr << endl; \
return; \
}
#define debug(x) cerr << #x << ": " << x << endl
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define clr(a) memset(a, 0, sizeof(a))
#define dbug(x) cerr << #x << ": " << x << " "
auto clk = clock();
#define PI 3.1415926535897932385
#define fi first
#define se second
#define arr1d(a, n) \
cout << #a << " : "; \
fr(_, 1, n) cout << a[_] << ' '; \
cout << endl;
#define arr1d0(a, n) \
cout << #a << " : "; \
rep(_, n) cout << a[_] << ' '; \
cout << endl;
#define arr2d(a, n, m) \
cout << #a << " :" << endl; \
fr(_, 1, n) { \
fr(__, 1, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define arr2d0(a, n, m) \
cout << #a << " :" << endl; \
rep(_, n) { \
rep(__, m) cout << a[_][__] << ' '; \
cout << endl; \
}
#define INF LLONG_MAX
const int dx[] = {0, 0, -1, 1}, dy[] = {-1, 1, 0, 0};
const int dx8[] = {-1, -1, -1, 0, 1, 1, 1, 0},
dy8[] = {-1, 0, 1, 1, 1, 0, -1, -1};
/* This Template is authored by Ankit Anvesh */
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// gcd for negatives too
/* ll gcd(ll a, ll b) {
if (a == 0) return b;
if (b == 0) return a;
if (b < 0) return gcd(a, -1 * b);
if (a < 0) return gcd(-1 * a, b);
if (a > b) return gcd(b, a);
return gcd(b%a, a);
}
*/
// gcd
const ll MAXN = 100010;
ll Gcd(ll a, ll b) {
if (a % b == 0)
return b;
return Gcd(b, a % b);
}
// max
ll Max(ll a, ll b) {
if (a > b)
return a;
return b;
}
// min
ll Min(ll a, ll b) {
if (a < b)
return a;
return b;
}
void printvector(std::vector<ll> v) {
for (int i = 0; i < v.size(); ++i) {
cout << v[i] << " ";
}
cout << "" << endl;
}
void printarray(ll a[], ll n) {
for (ll i = 0; i < n; ++i) {
cout << a[i] << " ";
}
cout << "" << endl;
}
ll findlcm(vector<ll> arr, ll n) {
// Initialize result
ll ans = arr[0];
// ans contains LCM of arr[0], ..arr[i]
// after i'th iteration,
for (int i = 1; i < n; i++)
ans = (((arr[i] * ans)) / (Gcd(arr[i], ans)));
return ans;
}
ll power(ll x, ll y, ll p) {
ll res = 1;
x = x % p;
while (y > 0) {
if (y & 1)
res = (res * x) % p;
y = y >> 1;
x = (x * x) % p;
}
return res;
}
ll lowerbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>=k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] < k)
l = mid + 1;
else {
r = mid - 1;
}
}
return l;
}
ll upperbound(ll k, vector<ll> v) {
// lowerbound to be used when first index such that
// ar[index]>k is needed
ll l = 0;
ll size = v.size();
ll r = size - 1;
ll mid;
while (l <= r) {
mid = (l + r) / 2;
if (v[mid] > k)
r = mid - 1;
else {
l = mid + 1;
}
}
return l;
}
ll spf[MAXN];
void sieve() {
spf[1] = 1;
for (int i = 2; i < MAXN; i++)
spf[i] = i;
for (int i = 4; i < MAXN; i += 2)
spf[i] = 2;
for (int i = 3; i * i < MAXN; i++) {
if (spf[i] == i) {
for (int j = i * i; j < MAXN; j += i)
if (spf[j] == j)
spf[j] = i;
}
}
}
// Segment Tree Implementation
// const ll N = 100000;
ll n, m;
// BIT tree
/*
start indexing from 1
ll BIT[100010];
void update(ll x,ll val){
for (; x <=n ; x +=(x&(-x)) )
BIT[x]+=val;
}
ll query(ll x){
ll sum=0;
for(;x>0;x -= (x&(-x)) )
sum+=BIT[x];
return sum;
}*/
// Dijkstra's Algorithm
// if x->y (weight=w) then v[x].push_back(mp(y,w));
vector<ll> shortPath(vector<pair<ll, ll>> v[], ll src, ll V = 0) {
set<pair<ll, ll>> setds;
ll sizee = V;
ll IN = INF;
vector<ll> dist(sizee, IN);
vector<bool> vis(sizee, false);
setds.insert(make_pair(0, src));
dist[src] = 0;
while (!setds.empty()) {
pair<ll, ll> tmp = *(setds.begin());
setds.erase(setds.begin());
ll u = tmp.second;
if (vis[u])
continue;
vis[u] = true;
vector<pair<ll, ll>>::iterator i;
for (auto i = v[u].begin(); i != v[u].end(); ++i) {
ll v = (*i).first;
ll weight = (*i).second;
if (dist[v] > dist[u] + weight) {
if (dist[v] != INF)
setds.erase(setds.find(make_pair(dist[v], v)));
dist[v] = dist[u] + weight;
setds.insert(make_pair(dist[v], v));
}
}
}
return dist;
}
ll root(ll a[], ll r) {
if (a[r] == r) {
return r;
} else {
ll x = root(a, a[r]);
a[r] = x;
return x;
}
}
void unio(ll a[], ll size[], ll x, ll y) {
x = root(a, x);
y = root(a, y);
if (x == y) {
return;
}
if (size[x] >= size[y]) {
a[y] = x;
size[x] += size[y];
} else {
a[x] = y;
size[y] += size[x];
}
}
// Sieve Implementation
/*
for (ll i=2;i<=100005;i++)
if (p[i]==0)
for (ll j=2*i;j<=100005;j+=i) p[j]=1; */
// Dfs search
// do not use n , m , N , C
// Using iterators in C++
// set<ll>:: iterator it;
// string to integer stuuu()
// string to long long stoll()
// string to float stof
// string.substr(position,length);
// integer to string to_string();
// intialize 2d vector vector<vector<ll>> dp(105,vector<ll>(105));
// for taking ceil use (num+den-1)/den
void neuer(ll txt) {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
ll mx1 = max(r1, c1);
ll mx2 = max(r2, c2);
ll mxc = max(c2, c1);
ll mxr = max(r2, r1);
ll mir = min(r2, r1);
ll mic = min(c2, c1);
ll mi1 = min(c1, r1);
ll mi2 = min(r2, c2);
/* n=(mx1-mi1+1);
m=(mx2-mi2+1);
ll mx=max(n,m);
ll mi=min(n,m);
*/
ll ans = 0;
vector<ll> f(3000010, 1);
for (ll i = 2; i <= 2000050; i++) {
f[i] = (f[i - 1] * i) % MOD;
}
ll a1, a2, a3, a4, a5;
a1 = a2 = a3 = a4 = a5 = 0;
for (ll i = 1; i <= r2 + 1; i++) {
ll up = c2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a1 = (a1 + ok1) % MOD;
}
for (ll i = 1; i <= mi2 + 1; i++) {
ll up = mx2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[mx2] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a2 = (a2 + ok1) % MOD;
}
for (ll i = 1; i <= r1; i++) {
ll up = c2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a3 = (a3 + ok1) % MOD;
}
for (ll i = 1; i <= c1; i++) {
ll up = r2 + i;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a4 = (a4 + ok1) % MOD;
}
ll ki = max(mic, mir);
ll ko = min(mic, mir);
for (ll i = 1; i <= ko; i++) {
ll up = ki + i - 1;
ll den = i;
ll ok1 = f[up];
ll ok2 = (f[up - den] * f[i]) % MOD;
ok2 = power(ok2, MOD - 2, MOD);
ok1 = (ok1 * ok2) % MOD;
a5 = (a5 + ok1) % MOD;
}
n = max(a1, a2);
m = min(a1, a2);
n = a1;
debug(a1);
debug(a2);
debug(a3);
debug(a4);
debug(a5);
ll res = (n - a3 - a4 + a5 + MOD) % MOD;
print(res);
return;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll x68 = 1;
// cin >> x68;
for (ll vi = 1; vi <= x68; vi++) {
neuer(vi);
}
return 0;
} | replace | 335 | 337 | 335 | 337 | 0 | a1: 19
a2: 19
a3: 3
a4: 3
a5: 1
|
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(1000005);
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// mint res = comb(n,k);
mint ans = 0;
for (int i = c1; i <= c2; i++) {
ans += comb(r2 + i + 1, r2) - comb(r1 + i, r1 - 1);
// cout << ans.x << endl;;
}
cout << ans.x;
}
| #include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
} comb(10000005);
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
// mint res = comb(n,k);
mint ans = 0;
for (int i = c1; i <= c2; i++) {
ans += comb(r2 + i + 1, r2) - comb(r1 + i, r1 - 1);
// cout << ans.x << endl;;
}
cout << ans.x;
}
| replace | 68 | 69 | 68 | 69 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nmax = 2000100;
const ll mod = 1e9 + 7;
ll fac[nmax], finv[nmax], inv[nmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < nmax; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (n < k || n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
COMinit();
int r1, c1, r, c;
cin >> r1 >> c1 >> r >> c;
vector<vector<ll>> sum(r + 1, vector<ll>(c + 1));
for (int i = 1; i <= r; i++) {
for (int j = 1; j <= c; j++) {
sum[i][j] = com(i + j, i);
}
}
for (int i = 0; i <= r; i++) {
for (int j = 0; j < c; j++) {
sum[i][j + 1] += sum[i][j];
sum[i][j + 1] %= mod;
}
}
for (int i = 0; i <= c; i++) {
for (int j = 0; j < r; j++) {
sum[j + 1][i] += sum[j][i];
sum[j + 1][i] %= mod;
}
}
cout << (sum[r][c] - sum[r1 - 1][c] - sum[r][c1 - 1] + sum[r1 - 1][c1 - 1] +
mod * 2) %
mod
<< endl;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int nmax = 2000100;
const ll mod = 1e9 + 7;
ll fac[nmax], finv[nmax], inv[nmax];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < nmax; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
ll com(int n, int k) {
if (n < k || n < 0 || k < 0) {
return 0;
}
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
int main() {
COMinit();
int r1, c1, r, c;
cin >> r1 >> c1 >> r >> c;
cout << (com(r + 1 + c + 1, r + 1) - com(r + 1 + c1, c1) -
com(r1 + c + 1, r1) + com(r1 + c1, r1) + 2 * mod) %
mod
<< endl;
} | replace | 27 | 47 | 27 | 29 | 0 | |
p02782 | C++ | Runtime Error | #include <cassert>
#include <iostream>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
const ll mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
ll r1, c1, r2, c2;
combination comb(1000010);
int main() {
scanf("%lld%lld%lld%lld", &r1, &c1, &r2, &c2);
mint ans = 0;
repi(c, c1, c2 + 1) {
ans += comb(r2 + c + 1, c + 1) - comb(r1 + c, c + 1);
// printf( "+%lld\n", comb(r2+1,c+1)-comb(r1,c+1) );
}
printf("%lld\n", ans.x);
return 0;
} | #include <cassert>
#include <iostream>
#include <string>
#include <vector>
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(i, a) repi(i, 0, a)
#define all(a) (a).begin(), (a).end()
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
using namespace std;
using ll = long long;
const ll mod = 1000000007;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
ll r1, c1, r2, c2;
combination comb(3000010);
int main() {
scanf("%lld%lld%lld%lld", &r1, &c1, &r2, &c2);
mint ans = 0;
repi(c, c1, c2 + 1) {
ans += comb(r2 + c + 1, c + 1) - comb(r1 + c, c + 1);
// printf( "+%lld\n", comb(r2+1,c+1)-comb(r1,c+1) );
}
printf("%lld\n", ans.x);
return 0;
} | replace | 97 | 98 | 97 | 98 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
const int MAX = 1000010;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
for (ll y = c1; y <= c2; y++) {
ans = (ans + COM(r2 + y + 1, y + 1)) % MOD;
ans = (ans + MOD - COM(r1 - 1 + y + 1, y + 1)) % MOD;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
// types
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<ld, ld> pdd;
typedef vector<ll> vll;
typedef vector<ld> vld;
typedef vector<pll> vpl;
// macros
#define ALL(a) a.begin(), a.end()
#define SZ(a) ((int)a.size())
#define FI first
#define SE second
#define REP(i, n) for (int i = 0; i < ((int)n); i++)
#define REP1(i, n) for (int i = 1; i < ((int)n); i++)
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define PB push_back
#define EB emplace_back
#define MP(a, b) make_pair(a, b)
#define SORT_UNIQUE(c) \
(sort(c.begin(), c.end()), \
c.resize(distance(c.begin(), unique(c.begin(), c.end()))))
#define GET_POS(c, x) (lower_bound(c.begin(), c.end(), x) - c.begin())
#define Decimal fixed << setprecision(20)
#define INF 1000000000
#define LLINF 1000000000000000000LL
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double eps = 1e-10;
const int MOD = 1e9 + 7;
const int dx[4] = {-1, 0, 1, 0};
const int dy[4] = {0, -1, 0, 1};
const int MAX = 2000010;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
for (ll y = c1; y <= c2; y++) {
ans = (ans + COM(r2 + y + 1, y + 1)) % MOD;
ans = (ans + MOD - COM(r1 - 1 + y + 1, y + 1)) % MOD;
}
cout << ans << endl;
}
| replace | 40 | 41 | 40 | 41 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mo 1000000007
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
ll comb(ll N_, ll C_) {
const int NUM_ = 400001;
static ll fact[400002], factr[400002], inv[400002];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mo % i] * (mo - mo / i) % mo;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % mo, factr[i] = factr[i - 1] * inv[i] % mo;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % mo * factr[N_ - C_] % mo;
}
ll modpow(ll a, ll n = mo - 2) {
ll r = 1;
while (n)
r = r * ((n % 2) ? a : 1) % mo, a = a * a % mo, n >>= 1;
return r;
}
int g(int a, int b) { return comb(a + b + 2, a + 1) - 1; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
A--;
B--;
cout << (g(C, D) - g(A, D) - g(C, B) + g(A, B) + mod) % mod << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef priority_queue<int> PQ;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mo 1000000007
#define mod 1000000007
// vector<vector<int> > dp;
// vector<vector<vector<int> > > vvvi;
// dp=vector<vector<int> >(N, vector<int>(M,0));
// vector<pair<int,int> > v;
// v.push_back(make_pair(x,y));
// priority_queue<int,vector<int>, greater<int> > q2;
ll comb(ll N_, ll C_) {
const int NUM_ = 4000001;
static ll fact[4000002], factr[4000002], inv[4000002];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mo % i] * (mo - mo / i) % mo;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % mo, factr[i] = factr[i - 1] * inv[i] % mo;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % mo * factr[N_ - C_] % mo;
}
ll modpow(ll a, ll n = mo - 2) {
ll r = 1;
while (n)
r = r * ((n % 2) ? a : 1) % mo, a = a * a % mo, n >>= 1;
return r;
}
int g(int a, int b) { return comb(a + b + 2, a + 1) - 1; }
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int A, B, C, D;
cin >> A >> B >> C >> D;
A--;
B--;
cout << (g(C, D) - g(A, D) - g(C, B) + g(A, B) + mod) % mod << endl;
return 0;
}
| replace | 50 | 52 | 50 | 52 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint fact(int n) {
if (n == 1 || n == 0)
return 1;
mint res = n;
return res * fact(n - 1);
}
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
combination c(1e6 + 10);
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans1 = c(r2 + c2 + 2, c2 + 1);
mint ans2 = c(r2 + 1 + c1, c1);
mint ans3 = c(c2 + 1 + r1, r1);
mint ans4 = c(c1 + r1, c1);
mint ans = ans1 - ans2 - ans3 + ans4;
cout << ans.x << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define rep2(i, x, n) for (int i = x, i##_len = (n); i < i##_len; ++i)
#define all(n) begin(n), end(n)
using ll = long long;
using P = pair<int, int>;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vb = vector<bool>;
vi dir = {-1, 0, 1, 0, -1, -1, 1, 1, -1};
const int mod = 1000000007;
struct mint {
ll x;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint fact(int n) {
if (n == 1 || n == 0)
return 1;
mint res = n;
return res * fact(n - 1);
}
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
combination c(1e7 + 10);
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans1 = c(r2 + c2 + 2, c2 + 1);
mint ans2 = c(r2 + 1 + c1, c1);
mint ans3 = c(c2 + 1 + r1, r1);
mint ans4 = c(c1 + r1, c1);
mint ans = ans1 - ans2 - ans3 + ans4;
cout << ans.x << endl;
} | replace | 87 | 88 | 87 | 88 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mypow(long a, long long b) {
long long c;
if (b == 0)
return 1;
else {
c = mypow(a, b / 2) * mypow(a, b / 2) % mod;
if (b % 2 == 1)
c = c * a % mod;
return c;
}
}
vector<long long> fac(200001);
vector<long long> minv(200001);
void myfact(long n) {
long i;
fac.at(0) = 1;
minv.at(0) = 1;
for (i = 1; i <= n; i++) {
fac.at(i) = i * fac.at(i - 1) % mod;
minv.at(i) = mypow(fac.at(i), mod - 2) % mod;
}
}
long long mycomb(long n, long r) {
long long c;
c = fac.at(n) * minv.at(r) % mod * minv.at(n - r) % mod;
return c;
}
int main() {
long r1, c1, r2, c2;
long long a;
cin >> r1 >> c1 >> r2 >> c2;
myfact(r2 + c2 + 2);
a = (mycomb(r2 + c2 + 2, r2 + 1) - mycomb(r2 + c1 + 1, r2 + 1) -
mycomb(r1 + c2 + 1, r1) + mycomb(r1 + c1, r1)) %
mod;
if (a < 0)
a += mod;
cout << a << endl;
}
// 1≤r1≤r2≤10^6
// 1≤c1≤c2≤10^6 | #include <bits/stdc++.h>
using namespace std;
long long mod = 1000000007;
long long mypow(long a, long long b) {
long long c;
if (b == 0)
return 1;
else {
c = mypow(a, b / 2) * mypow(a, b / 2) % mod;
if (b % 2 == 1)
c = c * a % mod;
return c;
}
}
vector<long long> fac(2000003);
vector<long long> minv(2000003);
void myfact(long n) {
long i;
fac.at(0) = 1;
minv.at(0) = 1;
for (i = 1; i <= n; i++) {
fac.at(i) = i * fac.at(i - 1) % mod;
minv.at(i) = mypow(fac.at(i), mod - 2) % mod;
}
}
long long mycomb(long n, long r) {
long long c;
c = fac.at(n) * minv.at(r) % mod * minv.at(n - r) % mod;
return c;
}
int main() {
long r1, c1, r2, c2;
long long a;
cin >> r1 >> c1 >> r2 >> c2;
myfact(r2 + c2 + 2);
a = (mycomb(r2 + c2 + 2, r2 + 1) - mycomb(r2 + c1 + 1, r2 + 1) -
mycomb(r1 + c2 + 1, r1) + mycomb(r1 + c1, r1)) %
mod;
if (a < 0)
a += mod;
cout << a << endl;
}
// 1≤r1≤r2≤10^6
// 1≤c1≤c2≤10^6 | replace | 14 | 16 | 14 | 16 | TLE | |
p02782 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
// mod
int mod = 1e9 + 7;
struct mint {
unsigned x;
mint() : x(0) {}
mint(signed sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }
mint(signed long long sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }
int get() const { return (int)x; }
mint &operator+=(mint that) {
if ((x += that.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(mint that) {
if ((x += mod - that.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(mint that) {
x = (unsigned long long)x * that.x % mod;
return *this;
}
mint &operator/=(mint that) { return *this *= that.inverse(); }
mint operator+(mint that) const { return mint(*this) += that; }
mint operator-(mint that) const { return mint(*this) -= that; }
mint operator*(mint that) const { return mint(*this) *= that; }
mint operator/(mint that) const { return mint(*this) /= that; }
mint inverse() const {
long long a = x, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mint(u);
}
bool operator==(mint that) const { return x == that.x; }
bool operator!=(mint that) const { return x != that.x; }
mint operator-() const {
mint t;
t.x = x == 0 ? 0 : mod - x;
return t;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inverse();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
class FManyManyPaths {
public:
void solve(std::istream &cin, std::ostream &cout) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
combination cb(1000005);
mint res = 0;
FOR(r, r1, r2) { res += cb(c2 + r + 1, r + 1) - cb(c1 + r, r + 1); }
cout << res.get() << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream &in(std::cin);
std::ostream &out(std::cout);
FManyManyPaths solver;
solver.solve(in, out);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author tatsumack
*/
#include <fstream>
#include <iostream>
#include <bits/stdc++.h>
#define int long long
#define REP(i, n) for (int i = 0, i##_len = (n); i < i##_len; ++i)
#define FOR(i, a, b) for (int i = (a), i##_len = (b); i <= i##_len; ++i)
#define REV(i, a, b) for (int i = (a); i >= (b); --i)
#define CLR(a, b) memset((a), (b), sizeof(a))
#define DUMP(x) cout << #x << " = " << (x) << endl;
#define INF 1001001001001001001ll
#define fcout cout << fixed << setprecision(12)
using namespace std;
typedef pair<int, int> P;
// mod
int mod = 1e9 + 7;
struct mint {
unsigned x;
mint() : x(0) {}
mint(signed sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }
mint(signed long long sig) { x = sig < 0 ? sig % mod + mod : sig % mod; }
int get() const { return (int)x; }
mint &operator+=(mint that) {
if ((x += that.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(mint that) {
if ((x += mod - that.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(mint that) {
x = (unsigned long long)x * that.x % mod;
return *this;
}
mint &operator/=(mint that) { return *this *= that.inverse(); }
mint operator+(mint that) const { return mint(*this) += that; }
mint operator-(mint that) const { return mint(*this) -= that; }
mint operator*(mint that) const { return mint(*this) *= that; }
mint operator/(mint that) const { return mint(*this) /= that; }
mint inverse() const {
long long a = x, b = mod, u = 1, v = 0;
while (b) {
long long t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mint(u);
}
bool operator==(mint that) const { return x == that.x; }
bool operator!=(mint that) const { return x != that.x; }
mint operator-() const {
mint t;
t.x = x == 0 ? 0 : mod - x;
return t;
}
};
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inverse();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
class FManyManyPaths {
public:
void solve(std::istream &cin, std::ostream &cout) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
combination cb(3000005);
mint res = 0;
FOR(r, r1, r2) { res += cb(c2 + r + 1, r + 1) - cb(c1 + r, r + 1); }
cout << res.get() << endl;
}
};
signed main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
std::istream &in(std::cin);
std::ostream &out(std::cout);
FManyManyPaths solver;
solver.solve(in, out);
return 0;
}
| replace | 113 | 114 | 113 | 114 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 1000005
ll r1, c1, r2, c2;
ll fact[SIZE], inv_fact[SIZE];
ll mod_pow(ll x, ll count, ll mod) {
if (count == 0)
return 1;
ll ret = mod_pow((x * x) % mod, count / 2, mod);
if (count % 2 == 1) {
ret = (ret * x) % mod;
}
return ret;
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_inverse(ll a, ll m) {
ll x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
ll nCk(ll n, ll k) {
ll ret = fact[n] * inv_fact[k];
ret %= MOD;
ret *= inv_fact[n - k];
return ret % MOD;
}
int main() {
fact[0] = 1;
for (ll i = 1; i < SIZE; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= MOD;
}
inv_fact[SIZE - 1] = mod_inverse(fact[SIZE - 1], MOD);
for (ll i = SIZE - 1; i >= 1; i--) {
inv_fact[i - 1] = inv_fact[i] * i;
inv_fact[i - 1] %= MOD;
}
scanf("%lld %lld %lld %lld", &r1, &c1, &r2, &c2);
ll ans = 0;
for (ll i = c1; i <= c2; i++) {
ll tmp = nCk((r2 + i + 1), i + 1);
tmp -= nCk((r1 + i), i + 1);
if (tmp < 0) {
tmp += MOD;
}
ans += tmp;
ans %= MOD;
}
printf("%lld\n", ans);
return 0;
}
| #include <bits/stdc++.h>
typedef long long int ll;
typedef unsigned long long int ull;
#define BIG_NUM 2000000000
#define HUGE_NUM 1000000000000000000
#define MOD 1000000007
#define EPS 0.000000001
using namespace std;
#define SIZE 2000005
ll r1, c1, r2, c2;
ll fact[SIZE], inv_fact[SIZE];
ll mod_pow(ll x, ll count, ll mod) {
if (count == 0)
return 1;
ll ret = mod_pow((x * x) % mod, count / 2, mod);
if (count % 2 == 1) {
ret = (ret * x) % mod;
}
return ret;
}
ll extgcd(ll a, ll b, ll &x, ll &y) {
ll d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1;
y = 0;
}
return d;
}
ll mod_inverse(ll a, ll m) {
ll x, y;
extgcd(a, m, x, y);
return (m + x % m) % m;
}
ll nCk(ll n, ll k) {
ll ret = fact[n] * inv_fact[k];
ret %= MOD;
ret *= inv_fact[n - k];
return ret % MOD;
}
int main() {
fact[0] = 1;
for (ll i = 1; i < SIZE; i++) {
fact[i] = i * fact[i - 1];
fact[i] %= MOD;
}
inv_fact[SIZE - 1] = mod_inverse(fact[SIZE - 1], MOD);
for (ll i = SIZE - 1; i >= 1; i--) {
inv_fact[i - 1] = inv_fact[i] * i;
inv_fact[i - 1] %= MOD;
}
scanf("%lld %lld %lld %lld", &r1, &c1, &r2, &c2);
ll ans = 0;
for (ll i = c1; i <= c2; i++) {
ll tmp = nCk((r2 + i + 1), i + 1);
tmp -= nCk((r1 + i), i + 1);
if (tmp < 0) {
tmp += MOD;
}
ans += tmp;
ans %= MOD;
}
printf("%lld\n", ans);
return 0;
}
| replace | 9 | 10 | 9 | 10 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define DEBUG
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = (1e6) + 10, maxm = (1 << 18);
const double PI = acos(-1);
ll fat[maxn], inv[maxn];
ll fexp(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b = (b >> 1);
}
return ans;
}
void init() {
fat[0] = 1;
for (int i = 1; i < maxn; i++) {
fat[i] = (fat[i - 1] * i) % mod;
}
inv[maxn - 1] = fexp(fat[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
}
ll C(ll n, ll a) {
if (n == a || a == 0)
return 1;
if (a > n)
return 0;
return ((fat[n] * inv[a]) % mod * inv[n - a]) % mod;
}
int main() {
init();
ll xi, xf, yi, yf;
cin >> xi >> yi >> xf >> yf;
ll ans = C(xf + yf + 2, xf + 1);
ans = (ans - C(yi + xf + 1, yi) + mod) % mod;
ans = (ans - C(xi + yf + 1, xi) + mod) % mod;
ans = (ans + C(xi + yi, xi) + mod) % mod;
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
#define ss second
#define ff first
#define all(x) x.begin(), x.end()
#define DEBUG
using namespace std;
using ll = long long;
using pii = pair<ll, ll>;
const int oo = 1e9 + 7;
const ll mod = 1e9 + 7, maxn = (2 * 1e6) + 10, maxm = (1 << 18);
const double PI = acos(-1);
ll fat[maxn], inv[maxn];
ll fexp(ll a, ll b) {
ll ans = 1;
while (b) {
if (b & 1) {
ans = (ans * a) % mod;
}
a = (a * a) % mod;
b = (b >> 1);
}
return ans;
}
void init() {
fat[0] = 1;
for (int i = 1; i < maxn; i++) {
fat[i] = (fat[i - 1] * i) % mod;
}
inv[maxn - 1] = fexp(fat[maxn - 1], mod - 2);
for (int i = maxn - 2; i >= 0; i--) {
inv[i] = (inv[i + 1] * (i + 1)) % mod;
}
}
ll C(ll n, ll a) {
if (n == a || a == 0)
return 1;
if (a > n)
return 0;
return ((fat[n] * inv[a]) % mod * inv[n - a]) % mod;
}
int main() {
init();
ll xi, xf, yi, yf;
cin >> xi >> yi >> xf >> yf;
ll ans = C(xf + yf + 2, xf + 1);
ans = (ans - C(yi + xf + 1, yi) + mod) % mod;
ans = (ans - C(xi + yf + 1, xi) + mod) % mod;
ans = (ans + C(xi + yi, xi) + mod) % mod;
cout << ans << endl;
return 0;
} | replace | 11 | 12 | 11 | 12 | 0 | |
p02782 | C++ | Runtime Error | // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
// #define mt make_tuple
// typedef tuple<int,int,int,int> tp;
// typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
#define yes cout << "Yes\n"
#define no cout << "No\n"
// nCr mod m
#define MOD 1000000007
#define M 1000000
vector<ll> fact;
bool h = false;
void init() {
h = true;
fact = vector<ll>(M);
fact[0] = fact[1] = 1;
loop(i, 2, M) fact[i] = fact[i - 1] * i % MOD;
}
// a^b mod MOD
ll powmod(ll a, ll b, ll m = MOD) {
ll out = 1;
ll p = a % m;
while (b) {
if (b & 1)
out = out * p % m;
p = p * p % m;
b >>= 1;
}
return out;
}
// nCr
ll nCr(ll n, ll r, ll m = MOD) {
if (!h)
init();
if (n < 0 || r < 0 || n < r)
return 1; //??????
ll out = fact[n] * powmod(fact[r] * fact[n - r] % m, m - 2, m) % m;
return out;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int out = 0;
loop(i, a, c + 1)(out +=
MOD + nCr(i + d + 1, d) - nCr(i + b - 1 + 1, b - 1)) %= MOD;
cout << out << endl;
}
| // g++ -std=c++11 a.cpp
#include <algorithm>
#include <assert.h>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <typeinfo>
#include <unordered_map>
#include <utility>
#include <vector>
#define loop(i, a, b) for (long long i = a; i < b; i++)
#define rep(i, a) loop(i, 0, a)
#define FOR(i, a) for (auto i : a)
#define pb push_back
#define all(in) in.begin(), in.end()
#define shosu(x) fixed << setprecision(x)
#define show1d(v) \
{ \
rep(_, v.size()) cout << " " << v[_]; \
cout << endl; \
}
#define show2d(v) \
{ rep(__, v.size()) show1d(v[__]); }
using namespace std;
// kaewasuretyuui
typedef long long ll;
#define int ll
typedef int Def;
typedef pair<Def, Def> pii;
typedef vector<Def> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef pair<Def, pii> pip;
typedef vector<pip> vip;
// #define mt make_tuple
// typedef tuple<int,int,int,int> tp;
// typedef vector<tp> vt;
template <typename A, typename B> bool cmin(A &a, const B &b) {
return a > b ? (a = b, true) : false;
}
template <typename A, typename B> bool cmax(A &a, const B &b) {
return a < b ? (a = b, true) : false;
}
const double PI = acos(-1);
const double EPS = 1e-9;
Def inf = sizeof(Def) == sizeof(long long) ? 2e18 : 1e9 + 10;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
#define yes cout << "Yes\n"
#define no cout << "No\n"
// nCr mod m
#define MOD 1000000007
#define M 2200000
vector<ll> fact;
bool h = false;
void init() {
h = true;
fact = vector<ll>(M);
fact[0] = fact[1] = 1;
loop(i, 2, M) fact[i] = fact[i - 1] * i % MOD;
}
// a^b mod MOD
ll powmod(ll a, ll b, ll m = MOD) {
ll out = 1;
ll p = a % m;
while (b) {
if (b & 1)
out = out * p % m;
p = p * p % m;
b >>= 1;
}
return out;
}
// nCr
ll nCr(ll n, ll r, ll m = MOD) {
if (!h)
init();
if (n < 0 || r < 0 || n < r)
return 1; //??????
ll out = fact[n] * powmod(fact[r] * fact[n - r] % m, m - 2, m) % m;
return out;
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
int a, b, c, d;
cin >> a >> b >> c >> d;
int out = 0;
loop(i, a, c + 1)(out +=
MOD + nCr(i + d + 1, d) - nCr(i + b - 1 + 1, b - 1)) %= MOD;
cout << out << endl;
}
| replace | 67 | 68 | 67 | 68 | 0 | |
p02782 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
map<pair<long long, long long>, long long> mp;
long long modpow(long long x, long long y) {
if (mp[{x, y}])
return mp[{x, y}];
if (y == 0)
return 1;
if (y % 2) {
long long res = x * modpow(x, y - 1) % mod;
mp[{x, y}] = res;
return res;
}
long long res = modpow(x, y / 2) * modpow(x, y / 2) % mod;
mp[{x, y}] = res;
return res;
}
int main() {
long long ans = 0;
vector<long long> fac(1e7, 1);
for (int i = 2; i < 1e7; i++)
fac[i] = fac[i - 1] * i % mod;
vector<long long> inv(1e7, 1);
for (int i = 2; i < 1e7; i++)
inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
for (int r = r1; r <= r2; r++) {
ans += (mod +
(fac[r + c2 + 1] * modpow(fac[r + 1], mod - 2) % mod) *
modpow(fac[c2], mod - 2) % mod -
(fac[r + c1] * modpow(fac[r + 1], mod - 2) % mod) *
modpow(fac[c1 - 1], mod - 2) % mod) %
mod;
ans %= mod;
}
cout << ans << endl;
}
| #include <bits/stdc++.h>
using namespace std;
int mod = 1e9 + 7;
map<pair<long long, long long>, long long> mp;
long long modpow(long long x, long long y) {
if (mp[{x, y}])
return mp[{x, y}];
if (y == 0)
return 1;
if (y % 2) {
long long res = x * modpow(x, y - 1) % mod;
mp[{x, y}] = res;
return res;
}
long long res = modpow(x, y / 2) * modpow(x, y / 2) % mod;
mp[{x, y}] = res;
return res;
}
int main() {
long long ans = 0;
vector<long long> fac(1e7, 1);
for (int i = 2; i < 1e7; i++)
fac[i] = fac[i - 1] * i % mod;
vector<long long> inv(1e7, 1);
for (int i = 2; i < 1e7; i++)
inv[i] = (mod - (mod / i) * inv[mod % i] % mod) % mod;
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
long long a = (fac[r1 + c2 + 1] * modpow(fac[r1 + 1], mod - 2) % mod) *
modpow(fac[c2], mod - 2) % mod;
long long b = (fac[r1 + c1] * modpow(fac[r1 + 1], mod - 2) % mod) *
modpow(fac[c1 - 1], mod - 2) % mod;
ans += (mod + a - b) % mod;
ans %= mod;
for (int r = r1 + 1; r <= r2; r++) {
a *= r + c2 + 1;
a %= mod;
a *= inv[r + 1];
a %= mod;
b *= r + c1;
b %= mod;
b *= inv[r + 1];
b %= mod;
ans += (mod + a - b) % mod;
ans %= mod;
}
cout << ans << endl;
}
| replace | 31 | 38 | 31 | 47 | TLE | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll inf = 1LL << 60;
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
const int MOD = 1e9 + 7;
class mint {
ll x;
public:
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
const int MAX = 200010;
mint fac[MAX], finv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * mint(i);
finv[i] = finv[i - 1] * mint(i).inv();
}
}
mint COM(int n, int k) {
if (n < k)
return mint(0);
if (n < 0 || k < 0)
return mint(0);
// o(k)
// if (k < MAX) {
// mint ret(1);
// Rep (i, k) {
// ret *= mint(n-i);
// ret /= mint(k-i);
// }
// return ret;
// }
return fac[n] * finv[k] * finv[n - k];
}
mint s(ll r, ll c) {
mint a(0);
Rep(i, r + 1) a += COM(i + 1 + c, c);
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
COMinit();
// cout << s(r2, c2) << "\n";
cout << s(r2, c2) - s(r1, c2) - s(r2, c1) + s(r1, c1) << endl;
} | #include <algorithm>
#include <cmath>
#include <complex>
#include <cstdio>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#define ll int64_t
#define Rep(i, n) for (ll i = 0; i < n; i++)
using namespace std;
typedef vector<ll> vec;
typedef vector<vec> mat;
const ll inf = 1LL << 60;
template <class T> inline void chmin(T &a, T b) {
if (a > b) {
a = b;
}
}
template <class T> inline void chmax(T &a, T b) {
if (a < b) {
a = b;
}
}
const int MOD = 1e9 + 7;
class mint {
ll x;
public:
mint(ll x = 0) : x((x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint &a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint &a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint &a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint &a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint &a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint &a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
mint operator/(const mint &a) const {
mint res(*this);
return res /= a;
}
friend ostream &operator<<(ostream &os, const mint &m) {
os << m.x;
return os;
}
};
const int MAX = 2000010;
mint fac[MAX], finv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * mint(i);
finv[i] = finv[i - 1] * mint(i).inv();
}
}
mint COM(int n, int k) {
if (n < k)
return mint(0);
if (n < 0 || k < 0)
return mint(0);
// o(k)
// if (k < MAX) {
// mint ret(1);
// Rep (i, k) {
// ret *= mint(n-i);
// ret /= mint(k-i);
// }
// return ret;
// }
return fac[n] * finv[k] * finv[n - k];
}
mint s(ll r, ll c) {
mint a(0);
Rep(i, r + 1) a += COM(i + 1 + c, c);
return a;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
r1--;
c1--;
COMinit();
// cout << s(r2, c2) << "\n";
cout << s(r2, c2) - s(r1, c2) - s(r2, c1) + s(r1, c1) << endl;
} | replace | 104 | 105 | 104 | 105 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define INF 2000000000000000000
#define ll long long
using namespace std;
const ll MAX = 1010010;
const ll mod = 1000000007;
vector<ll> fac(MAX), finv(MAX), inv(MAX);
bool init_called = false;
//=============modinv============================
void COMinit() {
init_called = true;
fac.at(0) = 1;
fac.at(1) = 1;
finv.at(0) = 1;
finv.at(1) = 1;
inv.at(1) = 1;
for (ll i = 2; i < MAX; i++) {
fac.at(i) = fac.at(i - 1) * i % mod;
inv.at(i) = mod - inv.at(mod % i) * (mod / i) % mod;
finv.at(i) = finv.at(i - 1) * inv.at(i) % mod;
}
}
ll COM(ll n, ll k) {
if (!init_called) {
COMinit();
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * (finv.at(k) * finv.at(n - k) % mod) % mod;
}
//=================================================
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if ((r1 == r2) && (c1 == c2)) {
cout << COM(r1 + c1, r1) << "\n";
return 0;
}
ll ans = (COM(r1 + c1, r1) + COM(r2 + c2, r2)) % mod;
if ((r1 != r2) && (c1 != c2)) {
ans = (ans + COM(r2 + c2, r2)) % mod;
}
for (ll i = r1 + 1; i < r2; ++i) {
ans = (ans + COM(i + c2, c2)) % mod;
}
for (ll i = c1 + 1; i < c2; ++i) {
ans = (ans + COM(r2 + i, r2)) % mod;
}
cout << ans << "\n";
}
| #include <bits/stdc++.h>
#define INF 2000000000000000000
#define ll long long
using namespace std;
const ll MAX = 2010010;
const ll mod = 1000000007;
vector<ll> fac(MAX), finv(MAX), inv(MAX);
bool init_called = false;
//=============modinv============================
void COMinit() {
init_called = true;
fac.at(0) = 1;
fac.at(1) = 1;
finv.at(0) = 1;
finv.at(1) = 1;
inv.at(1) = 1;
for (ll i = 2; i < MAX; i++) {
fac.at(i) = fac.at(i - 1) * i % mod;
inv.at(i) = mod - inv.at(mod % i) * (mod / i) % mod;
finv.at(i) = finv.at(i - 1) * inv.at(i) % mod;
}
}
ll COM(ll n, ll k) {
if (!init_called) {
COMinit();
}
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac.at(n) * (finv.at(k) * finv.at(n - k) % mod) % mod;
}
//=================================================
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
if ((r1 == r2) && (c1 == c2)) {
cout << COM(r1 + c1, r1) << "\n";
return 0;
}
ll ans = (COM(r1 + c1, r1) + COM(r2 + c2, r2)) % mod;
if ((r1 != r2) && (c1 != c2)) {
ans = (ans + COM(r2 + c2, r2)) % mod;
}
for (ll i = r1 + 1; i < r2; ++i) {
ans = (ans + COM(i + c2, c2)) % mod;
}
for (ll i = c1 + 1; i < c2; ++i) {
ans = (ans + COM(r2 + i, r2)) % mod;
}
cout << ans << "\n";
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
#include <cassert>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
// #define rep(i,n) for(int i=0;i<(n);++i)
#define all(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(begin(cccc), end(cccc), ##__VA_ARGS__); \
})(c))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _fromto2(i, n) for (int i = 0; i <= (n); ++i)
#define _fromto3(i, a, b) for (int i = (a); i <= (b); ++i)
#define fromto(...) _overload3(__VA_ARGS__, _fromto3, _fromto2, )(__VA_ARGS__)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// debug
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); ++i)
os << (i ? ", " : "") << vec[i];
os << "}";
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
#ifdef LOCAL
void debug() { cerr << "\n"; }
template <class First> void debug(const First &first) { cerr << first << "\n"; }
template <class First, class... Rest>
void debug(const First &first, const Rest &...rest) {
cerr << first << ",";
debug(rest...);
}
#else
#define debug(...) 42
#endif
const int MAX = 1e6 + 5;
long long fac[MAX], finv[MAX], inv[MAX];
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int f(int r, int c) { return (fac[r + c] * finv[r] % MOD) * finv[c] % MOD; }
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
comb_init();
// ll ans = 0;
// fromto(i, r1, r2) {
// fromto(j, c1, c2) {
// ans += f(i, j);
// ans %= MOD;
// }
// }
// cout << ans << endl;
// debug(f(r2, c2) * 2 % MOD);
ll ans = f(r2 + 1, c2 + 1);
ans = MOD + ans - f(r2 + 1, c1);
ans %= MOD;
ans = MOD + ans - f(r1, c2 + 1);
ans %= MOD;
ans += f(r1, c1);
ans %= MOD;
cout << ans << endl;
// f(r, c) = (r+c)! * (1/(r!)) * (1/(c!))
return 0;
}
| #include <algorithm>
#include <cmath>
#include <functional>
#include <iomanip>
#include <iostream>
#include <queue>
#include <vector>
#include <cassert>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vvi = vector<vi>;
// #define rep(i,n) for(int i=0;i<(n);++i)
#define all(f, c, ...) \
(([&](decltype((c)) cccc) { \
return (f)(begin(cccc), end(cccc), ##__VA_ARGS__); \
})(c))
#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) for (int i = 0; i < (n); ++i)
#define repi(i, a, b) for (int i = (a); i < (b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _fromto2(i, n) for (int i = 0; i <= (n); ++i)
#define _fromto3(i, a, b) for (int i = (a); i <= (b); ++i)
#define fromto(...) _overload3(__VA_ARGS__, _fromto3, _fromto2, )(__VA_ARGS__)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
const int MOD = 1e9 + 7;
const int INF = 1e9;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// debug
template <class T> ostream &operator<<(ostream &os, const vector<T> &vec) {
os << "{";
for (int i = 0; i < vec.size(); ++i)
os << (i ? ", " : "") << vec[i];
os << "}";
return os;
}
template <class T1, class T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &rhs) {
os << "(" << rhs.first << ", " << rhs.second << ")";
return os;
}
#ifdef LOCAL
void debug() { cerr << "\n"; }
template <class First> void debug(const First &first) { cerr << first << "\n"; }
template <class First, class... Rest>
void debug(const First &first, const Rest &...rest) {
cerr << first << ",";
debug(rest...);
}
#else
#define debug(...) 42
#endif
const int MAX = 2e6 + 500;
long long fac[MAX], finv[MAX], inv[MAX];
void comb_init() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
int f(int r, int c) { return (fac[r + c] * finv[r] % MOD) * finv[c] % MOD; }
int main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
comb_init();
// ll ans = 0;
// fromto(i, r1, r2) {
// fromto(j, c1, c2) {
// ans += f(i, j);
// ans %= MOD;
// }
// }
// cout << ans << endl;
// debug(f(r2, c2) * 2 % MOD);
ll ans = f(r2 + 1, c2 + 1);
ans = MOD + ans - f(r2 + 1, c1);
ans %= MOD;
ans = MOD + ans - f(r1, c2 + 1);
ans %= MOD;
ans += f(r1, c1);
ans %= MOD;
cout << ans << endl;
// f(r, c) = (r+c)! * (1/(r!)) * (1/(c!))
return 0;
}
| replace | 74 | 75 | 74 | 75 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T> T gcd(T a, T b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL LINF = 334ll << 53;
constexpr int INF = 15 << 26;
constexpr LL MOD = 1E9 + 7;
namespace Problem {
using namespace std;
template <long long Mod = MOD> class Modint {
public:
long long v;
Modint(const Modint &x) { v = x.v; }
explicit Modint(int x) {
if (x < 0 or Mod <= x)
x %= Mod;
if (x < 0)
x += Mod;
v = x;
}
explicit Modint(long long x) {
if (x < 0 or Mod <= x)
x %= Mod;
if (x < 0)
x += Mod;
v = x;
}
explicit Modint(unsigned x) {
if (Mod <= x)
x %= Mod;
v = x;
}
explicit Modint(unsigned long long x) {
if (Mod <= x)
x %= Mod;
v = x;
}
template <typename T> explicit Modint(T x) {
if (x < 0 or Mod <= x)
x %= Mod;
v = x;
}
Modint() : v(0) {}
long long get() const { return v; }
Modint mpow(Modint &n) const { return mpow(n.v); }
Modint mpow(long long n) const {
long long i = 1, p = v;
Modint ret(1);
while (i <= n) {
if (i & n)
ret *= p;
i = (i << 1);
p = (p * p) % Mod;
}
return ret;
}
Modint operator-() const { return (v ? Modint(Mod - v) : Modint(0)); }
explicit operator int() const { return v; }
explicit operator long long() const { return v; }
Modint &operator+=(const Modint &a) {
v = (v + a.v);
if (v >= Mod)
v -= Mod;
return *this;
}
Modint &operator-=(const Modint &a) {
v = (v - a.v);
if (v < 0)
v += Mod;
return *this;
}
Modint &operator*=(const Modint &a) {
v = (v * a.v) % Mod;
return *this;
}
Modint &operator/=(const Modint &a) {
v = (v * a.mpow(Mod - 2).v) % Mod;
return *this;
}
template <class T> Modint &operator+=(const T &a) {
v = (v + Modint(a).v);
if (v >= Mod)
v -= Mod;
return *this;
}
template <class T> Modint &operator-=(const T &a) {
v = (v - Modint(a).v);
if (v < 0)
v += Mod;
return *this;
}
template <class T> Modint &operator*=(const T &a) {
v = (v * Modint(a).v) % Mod;
return *this;
}
template <class T> Modint &operator/=(const T &a) {
v = (v * Modint(a).mpow(Mod - 2).v) % Mod;
return *this;
}
friend Modint operator+(const Modint &a, const Modint &b) {
return Modint(a) += b;
}
friend Modint operator-(const Modint &a, const Modint &b) {
return Modint(a) -= b;
}
friend Modint operator*(const Modint &a, const Modint &b) {
return Modint(a) *= b;
}
friend Modint operator/(const Modint &a, const Modint &b) {
return Modint(a) /= b;
}
template <class T, class U> friend Modint operator+(const T &a, const U &b) {
return Modint(a) += Modint(b);
}
template <class T, class U> friend Modint operator-(const T &a, const U &b) {
return Modint(a) -= Modint(b);
}
template <class T, class U> friend Modint operator*(const T &a, const U &b) {
return Modint(a) *= Modint(b);
}
template <class T, class U> friend Modint operator/(const T &a, const U &b) {
return Modint(a) /= Modint(b);
}
};
template <long long M> ostream &operator<<(ostream &os, const Modint<M> m) {
return os << m.v;
}
template <long long Mod = MOD> class Factorial {
private:
int n;
public:
vector<long long> fac, inv;
public:
Factorial(long long n) : n(n), fac(n + 1), inv(n + 1) {
fac[0] = 1;
for (int i = 0; i < n; ++i)
fac[i + 1] = fac[i] * (i + 1) % Mod;
inv[n] = modpow(fac[n], Mod - 2);
for (int i = n - 1; i >= 0; --i)
inv[i] = inv[i + 1] * (i + 1) % Mod;
};
long long modpow(long long a, long long n, long long mod = Mod) {
long long i = 1, ret = 1, p = a;
while (i <= n) {
if (i & n) {
ret = (ret * p) % mod;
}
i = (i << 1);
p = (p * p) % mod;
}
return ret;
}
long long C(int a, int b) {
return (fac[a] * inv[b] % Mod) * inv[a - b] % Mod;
}
long long P(int a, int b) { return (fac[a]) * inv[a - b] % Mod; }
long long H(int a, int b) { // The number of multisets of length b on a
// symbols
return C(a + b - 1, b);
}
};
class Solver2 {
public:
int r1, r2, c1, c2;
Factorial<> fac;
Solver2(LL r1, LL r2, LL c1, LL c2)
: r1(r1), r2(r2), c1(c1), c2(c2), fac(222222){};
void solve() {
Modint<> ans(0);
ans += calc(r2, c2);
ans -= calc(r2, c1 - 1);
ans -= calc(r1 - 1, c2);
ans += calc(r1 - 1, c1 - 1);
cout << ans << endl;
}
Modint<> calc(int r, int c) {
auto ret = sumRows(r + c);
DBG(ret)
for (int i = 0; i < c; ++i) {
// from (r,0) ~ (r,c-1)
ret -= Modint<>(fac.C(r + i, r)) * sumRows(c - 1 - i);
}
for (int i = 0; i < r; ++i) {
// from (0,c) ~ (r-1,c)
ret -= Modint<>(fac.C(c + i, c)) * sumRows(r - 1 - i);
}
DBG(r, c, ret)
return ret;
}
Modint<> sumRows(int x) { return Modint<>(2).mpow(x + 1) - 1; }
};
} // namespace Problem
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(12);
long long r1, r2, c1, c2;
std::cin >> r1 >> c1 >> r2 >> c2;
Problem::Solver2 sol(r1, r2, c1, c2);
sol.solve();
return 0;
}
| #include <bits/stdc++.h>
#if MYDEBUG
#include "lib/cp_debug.hpp"
#else
#define DBG(...) ;
#endif
#if __cplusplus <= 201402L
template <typename T> T gcd(T a, T b) {
return ((a % b == 0) ? b : gcd(b, a % b));
}
template <typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#endif
using LL = long long;
constexpr LL LINF = 334ll << 53;
constexpr int INF = 15 << 26;
constexpr LL MOD = 1E9 + 7;
namespace Problem {
using namespace std;
template <long long Mod = MOD> class Modint {
public:
long long v;
Modint(const Modint &x) { v = x.v; }
explicit Modint(int x) {
if (x < 0 or Mod <= x)
x %= Mod;
if (x < 0)
x += Mod;
v = x;
}
explicit Modint(long long x) {
if (x < 0 or Mod <= x)
x %= Mod;
if (x < 0)
x += Mod;
v = x;
}
explicit Modint(unsigned x) {
if (Mod <= x)
x %= Mod;
v = x;
}
explicit Modint(unsigned long long x) {
if (Mod <= x)
x %= Mod;
v = x;
}
template <typename T> explicit Modint(T x) {
if (x < 0 or Mod <= x)
x %= Mod;
v = x;
}
Modint() : v(0) {}
long long get() const { return v; }
Modint mpow(Modint &n) const { return mpow(n.v); }
Modint mpow(long long n) const {
long long i = 1, p = v;
Modint ret(1);
while (i <= n) {
if (i & n)
ret *= p;
i = (i << 1);
p = (p * p) % Mod;
}
return ret;
}
Modint operator-() const { return (v ? Modint(Mod - v) : Modint(0)); }
explicit operator int() const { return v; }
explicit operator long long() const { return v; }
Modint &operator+=(const Modint &a) {
v = (v + a.v);
if (v >= Mod)
v -= Mod;
return *this;
}
Modint &operator-=(const Modint &a) {
v = (v - a.v);
if (v < 0)
v += Mod;
return *this;
}
Modint &operator*=(const Modint &a) {
v = (v * a.v) % Mod;
return *this;
}
Modint &operator/=(const Modint &a) {
v = (v * a.mpow(Mod - 2).v) % Mod;
return *this;
}
template <class T> Modint &operator+=(const T &a) {
v = (v + Modint(a).v);
if (v >= Mod)
v -= Mod;
return *this;
}
template <class T> Modint &operator-=(const T &a) {
v = (v - Modint(a).v);
if (v < 0)
v += Mod;
return *this;
}
template <class T> Modint &operator*=(const T &a) {
v = (v * Modint(a).v) % Mod;
return *this;
}
template <class T> Modint &operator/=(const T &a) {
v = (v * Modint(a).mpow(Mod - 2).v) % Mod;
return *this;
}
friend Modint operator+(const Modint &a, const Modint &b) {
return Modint(a) += b;
}
friend Modint operator-(const Modint &a, const Modint &b) {
return Modint(a) -= b;
}
friend Modint operator*(const Modint &a, const Modint &b) {
return Modint(a) *= b;
}
friend Modint operator/(const Modint &a, const Modint &b) {
return Modint(a) /= b;
}
template <class T, class U> friend Modint operator+(const T &a, const U &b) {
return Modint(a) += Modint(b);
}
template <class T, class U> friend Modint operator-(const T &a, const U &b) {
return Modint(a) -= Modint(b);
}
template <class T, class U> friend Modint operator*(const T &a, const U &b) {
return Modint(a) *= Modint(b);
}
template <class T, class U> friend Modint operator/(const T &a, const U &b) {
return Modint(a) /= Modint(b);
}
};
template <long long M> ostream &operator<<(ostream &os, const Modint<M> m) {
return os << m.v;
}
template <long long Mod = MOD> class Factorial {
private:
int n;
public:
vector<long long> fac, inv;
public:
Factorial(long long n) : n(n), fac(n + 1), inv(n + 1) {
fac[0] = 1;
for (int i = 0; i < n; ++i)
fac[i + 1] = fac[i] * (i + 1) % Mod;
inv[n] = modpow(fac[n], Mod - 2);
for (int i = n - 1; i >= 0; --i)
inv[i] = inv[i + 1] * (i + 1) % Mod;
};
long long modpow(long long a, long long n, long long mod = Mod) {
long long i = 1, ret = 1, p = a;
while (i <= n) {
if (i & n) {
ret = (ret * p) % mod;
}
i = (i << 1);
p = (p * p) % mod;
}
return ret;
}
long long C(int a, int b) {
return (fac[a] * inv[b] % Mod) * inv[a - b] % Mod;
}
long long P(int a, int b) { return (fac[a]) * inv[a - b] % Mod; }
long long H(int a, int b) { // The number of multisets of length b on a
// symbols
return C(a + b - 1, b);
}
};
class Solver2 {
public:
int r1, r2, c1, c2;
Factorial<> fac;
Solver2(LL r1, LL r2, LL c1, LL c2)
: r1(r1), r2(r2), c1(c1), c2(c2), fac(2222222){};
void solve() {
Modint<> ans(0);
ans += calc(r2, c2);
ans -= calc(r2, c1 - 1);
ans -= calc(r1 - 1, c2);
ans += calc(r1 - 1, c1 - 1);
cout << ans << endl;
}
Modint<> calc(int r, int c) {
auto ret = sumRows(r + c);
DBG(ret)
for (int i = 0; i < c; ++i) {
// from (r,0) ~ (r,c-1)
ret -= Modint<>(fac.C(r + i, r)) * sumRows(c - 1 - i);
}
for (int i = 0; i < r; ++i) {
// from (0,c) ~ (r-1,c)
ret -= Modint<>(fac.C(c + i, c)) * sumRows(r - 1 - i);
}
DBG(r, c, ret)
return ret;
}
Modint<> sumRows(int x) { return Modint<>(2).mpow(x + 1) - 1; }
};
} // namespace Problem
int main() {
std::cin.tie(0);
std::ios_base::sync_with_stdio(false);
// std::cout << std::fixed << std::setprecision(12);
long long r1, r2, c1, c2;
std::cin >> r1 >> c1 >> r2 >> c2;
Problem::Solver2 sol(r1, r2, c1, c2);
sol.solve();
return 0;
}
| replace | 183 | 184 | 183 | 184 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
#define rep(a, n) for (ll a = 0; a < (n); ++a)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e18;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// mintが必要
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
combination c(1e6 + 5);
mint ans = 0;
ans += c(r2 + c2 + 2, c2 + 1);
ans -= c(r2 + c1 + 1, c1);
ans -= c(r1 + c2 + 1, c2 + 1);
ans += c(r1 + c1, c1);
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
#define rep(a, n) for (ll a = 0; a < (n); ++a)
#define _GLIBCXX_DEBUG
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<vector<ll>> Graph;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
const ll INF = 1e18;
// auto mod int
// https://youtu.be/L8grWxBlIZ4?t=9858
// https://youtu.be/ERZuLAxZffQ?t=4807 : optimize
// https://youtu.be/8uowVvQ_-Mo?t=1329 : division
const int mod = 1000000007;
// const int mod = 998244353;
struct mint {
ll x; // typedef long long ll;
mint(ll x = 0) : x((x % mod + mod) % mod) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const { return mint(*this) += a; }
mint operator-(const mint a) const { return mint(*this) -= a; }
mint operator*(const mint a) const { return mint(*this) *= a; }
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return *this *= a.inv(); }
mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream &operator>>(istream &is, const mint &a) { return is >> a.x; }
ostream &operator<<(ostream &os, const mint &a) { return os << a.x; }
// combination mod prime
// mintが必要
// https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619
struct combination {
vector<mint> fact, ifact;
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < mod);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint operator()(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
};
int main() {
ll r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
combination c(1e7);
mint ans = 0;
ans += c(r2 + c2 + 2, c2 + 1);
ans -= c(r2 + c1 + 1, c1);
ans -= c(r1 + c2 + 1, c2 + 1);
ans += c(r1 + c1, c1);
cout << ans << endl;
return 0;
}
| replace | 92 | 93 | 92 | 93 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll ANS;
const ll MAX = 1000005;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll i, ll j) {
if (i < j)
return 0;
if (i < 0 || j < 0)
return 0;
return fac[i] * (finv[j] * finv[i - j] % MOD) % MOD;
}
int main(void) {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
for (ll i = 1; i <= r2 + 1; i++) {
ANS = (ANS + COM(i + c2, i)) % MOD;
}
for (int i = 1; i <= r1; i++) {
ANS = (ANS + COM(i + c1 - 1, i)) % MOD;
}
for (int i = 1; i <= r1; i++) {
ANS = (ANS - COM(i + c2, i)) % MOD;
}
for (int i = 1; i <= r2 + 1; i++) {
ANS = (ANS - COM(i + c1 - 1, i)) % MOD;
}
if (ANS < 0)
ANS += MOD;
cout << ANS << endl;
}
| #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
ll ANS;
const ll MAX = 2000005;
const ll MOD = 1000000007;
ll fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (ll i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
ll COM(ll i, ll j) {
if (i < j)
return 0;
if (i < 0 || j < 0)
return 0;
return fac[i] * (finv[j] * finv[i - j] % MOD) % MOD;
}
int main(void) {
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
for (ll i = 1; i <= r2 + 1; i++) {
ANS = (ANS + COM(i + c2, i)) % MOD;
}
for (int i = 1; i <= r1; i++) {
ANS = (ANS + COM(i + c1 - 1, i)) % MOD;
}
for (int i = 1; i <= r1; i++) {
ANS = (ANS - COM(i + c2, i)) % MOD;
}
for (int i = 1; i <= r2 + 1; i++) {
ANS = (ANS - COM(i + c1 - 1, i)) % MOD;
}
if (ANS < 0)
ANS += MOD;
cout << ANS << endl;
}
| replace | 5 | 6 | 5 | 6 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define F first
#define S second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
const int MOD = 1e9 + 7;
const int N = 1e6;
ll iv[3 * N], f1[3 * N], f2[3 * N];
ll combi(int n, int k) { return f1[n] * f2[k] % MOD * f2[n - k] % MOD; }
int main(void) {
#ifndef LOCAL
freopen("input.txt", "r", stdin);
#endif
iv[1] = 1;
for (int i = 2; i < 3 * N; i++)
iv[i] = MOD - MOD / i * iv[MOD % i] % MOD;
f1[0] = f2[0] = 1;
for (int i = 1; i < 3 * N; i++) {
f1[i] = f1[i - 1] * i % MOD;
f2[i] = f2[i - 1] * iv[i] % MOD;
}
int r1, r2, c1, c2;
scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
int ans = 0;
cout << (combi(r2 + c2 + 2, c2 + 1) - combi(r1 + c2 + 1, c2 + 1) -
combi(r2 + c1 + 1, c1) + combi(r1 + c1, c1) % MOD + MOD) %
MOD;
// cout << fixed << setprecision(9) << (double) (ans+k)*0.5 << '\n';
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define ll long long
#define ull unsigned long long
#define F first
#define S second
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V> void __print(const pair<T, V> &x) {
cerr << '{';
__print(x.first);
cerr << ',';
__print(x.second);
cerr << '}';
}
template <typename T> void __print(const T &x) {
int f = 0;
cerr << '{';
for (auto &i : x)
cerr << (f++ ? "," : ""), __print(i);
cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V> void _print(T t, V... v) {
__print(t);
if (sizeof...(v))
cerr << ", ";
_print(v...);
}
#ifndef ONLINE_JUDGE
#define debug(x...) \
cerr << "[" << #x << "] = ["; \
_print(x)
#else
#define debug(x...)
#endif
const int MOD = 1e9 + 7;
const int N = 1e6;
ll iv[3 * N], f1[3 * N], f2[3 * N];
ll combi(int n, int k) { return f1[n] * f2[k] % MOD * f2[n - k] % MOD; }
int main(void) {
#ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
#endif
iv[1] = 1;
for (int i = 2; i < 3 * N; i++)
iv[i] = MOD - MOD / i * iv[MOD % i] % MOD;
f1[0] = f2[0] = 1;
for (int i = 1; i < 3 * N; i++) {
f1[i] = f1[i - 1] * i % MOD;
f2[i] = f2[i - 1] * iv[i] % MOD;
}
int r1, r2, c1, c2;
scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
int ans = 0;
cout << (combi(r2 + c2 + 2, c2 + 1) - combi(r1 + c2 + 1, c2 + 1) -
combi(r2 + c1 + 1, c1) + combi(r1 + c1, c1) % MOD + MOD) %
MOD;
// cout << fixed << setprecision(9) << (double) (ans+k)*0.5 << '\n';
return 0;
}
| replace | 60 | 62 | 60 | 62 | -11 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
int const nax = 3e5 + 10;
constexpr int mod = 1e9 + 7;
int r1, r2, c1, c2;
void plusle(int &a, int b) {
if ((a += b) >= mod)
a -= mod;
}
void minun(int &a, int b) {
if ((a -= b) < 0)
a += mod;
}
int add(int a, int b) { return ((a += b) >= mod) ? a - mod : a; }
int sub(int a, int b) { return ((a -= b) < 0) ? a + mod : a; }
int mul(int a, int b) { return 1LL * a * b % mod; }
int power(int a, int b) {
int res = 1;
for (; b > 0; b >>= 1, a = mul(a, a))
if (b & 1)
res = mul(res, a);
return res;
}
const int Mx = 1e6 + 10;
int fac[Mx], invf[Mx];
void prefact() {
fac[0] = 1;
for (int i = 1; i < Mx; i++) {
fac[i] = mul(fac[i - 1], i);
}
invf[Mx - 1] = power(fac[Mx - 1], mod - 2);
for (int i = Mx - 2; i >= 0; i--) {
invf[i] = mul(invf[i + 1], i + 1);
}
}
int ncr(int N, int R) {
if (R > N)
return 0;
if (R == 0 || R == N)
return 1;
return mul(fac[N], mul(invf[N - R], invf[R]));
}
/**
find the number of ways to move from (0 , 0)
to any of square (r , c ) -> r1 <= r <= r2 , c1 <= c <= c2
Let's represent the number of ways again
To move from (0 , 0 ) to any (r , c)
RRRRR -> r chars and UUUUU -> c chars
and the number of shuffle equal to (r + c)! / (r!) / (c!)
or (r + c) choose r
Then it's trivially ask you
compute summation (r + c) choose (r) from r = r1 to r = r2 and c from c1 to
c2 This can be done easily in O(rc) Of course, we can do it better. ;) Let's
iterate over r from r1 to r2 summation (r + c) choose r from c1 to c2 by
Pascal's theorem (r , 0 ) + (r + 1 , 1 ) + (r + 2 , 2) ... (r + 1 , 0) + (r +
1, 1) -> (r + 2, 1) + (r + 2 , 2) -> (r + 3, 2 ) + (r + 3, 3)
.... (r + c + 1 , c)
*/
int main() {
prefact();
scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
auto sum = [&](int r, int c) -> int {
/// (r , 0) + (r + 1 , 1) , .... (r + c, c)
return ncr(r + c + 1, c);
};
int ans = 0;
for (int r = r1; r <= r2; ++r) {
plusle(ans, sub(sum(r, c2), sum(r, c1 - 1)));
}
printf("%d\n", ans);
}
| #include <bits/stdc++.h>
using namespace std;
int const nax = 3e5 + 10;
constexpr int mod = 1e9 + 7;
int r1, r2, c1, c2;
void plusle(int &a, int b) {
if ((a += b) >= mod)
a -= mod;
}
void minun(int &a, int b) {
if ((a -= b) < 0)
a += mod;
}
int add(int a, int b) { return ((a += b) >= mod) ? a - mod : a; }
int sub(int a, int b) { return ((a -= b) < 0) ? a + mod : a; }
int mul(int a, int b) { return 1LL * a * b % mod; }
int power(int a, int b) {
int res = 1;
for (; b > 0; b >>= 1, a = mul(a, a))
if (b & 1)
res = mul(res, a);
return res;
}
const int Mx = 2e6 + 10;
int fac[Mx], invf[Mx];
void prefact() {
fac[0] = 1;
for (int i = 1; i < Mx; i++) {
fac[i] = mul(fac[i - 1], i);
}
invf[Mx - 1] = power(fac[Mx - 1], mod - 2);
for (int i = Mx - 2; i >= 0; i--) {
invf[i] = mul(invf[i + 1], i + 1);
}
}
int ncr(int N, int R) {
if (R > N)
return 0;
if (R == 0 || R == N)
return 1;
return mul(fac[N], mul(invf[N - R], invf[R]));
}
/**
find the number of ways to move from (0 , 0)
to any of square (r , c ) -> r1 <= r <= r2 , c1 <= c <= c2
Let's represent the number of ways again
To move from (0 , 0 ) to any (r , c)
RRRRR -> r chars and UUUUU -> c chars
and the number of shuffle equal to (r + c)! / (r!) / (c!)
or (r + c) choose r
Then it's trivially ask you
compute summation (r + c) choose (r) from r = r1 to r = r2 and c from c1 to
c2 This can be done easily in O(rc) Of course, we can do it better. ;) Let's
iterate over r from r1 to r2 summation (r + c) choose r from c1 to c2 by
Pascal's theorem (r , 0 ) + (r + 1 , 1 ) + (r + 2 , 2) ... (r + 1 , 0) + (r +
1, 1) -> (r + 2, 1) + (r + 2 , 2) -> (r + 3, 2 ) + (r + 3, 3)
.... (r + c + 1 , c)
*/
int main() {
prefact();
scanf("%d %d %d %d", &r1, &c1, &r2, &c2);
auto sum = [&](int r, int c) -> int {
/// (r , 0) + (r + 1 , 1) , .... (r + c, c)
return ncr(r + c + 1, c);
};
int ans = 0;
for (int r = r1; r <= r2; ++r) {
plusle(ans, sub(sum(r, c2), sum(r, c1 - 1)));
}
printf("%d\n", ans);
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/*
*/
using vi = vector<int>;
using vvi = vector<vi>;
using P = pair<int, int>;
const int mod = 1e9 + 7;
template <int M> class Combination {
public:
int n;
vector<int> fac, finv;
Combination(int n_) : n(n_), fac(n_), finv(n_) {
fac[0] = 1;
for (int i = 1; i < n; i++)
fac[i] = fac[i - 1] * i % M;
finv[n - 1] = pow(fac[n - 1], M - 2);
for (int i = n - 1; i > 0; i--)
finv[i - 1] = finv[i] * i % M;
}
int pow(int a, int b) {
if (b == 0)
return 1;
return pow(a * a % M, b / 2) * (b % 2 ? a : 1) % M;
}
int C(int a, int b) {
if (b < 0 or a < b)
return 0;
return fac[a] * finv[a - b] % M * finv[b] % M;
}
int P(int a, int b) {
if (b < 0 or a < b)
return 0;
return fac[a] * finv[a - b] % M;
}
int H(int a, int b) {
if (a == 0 and b == 0)
return 1;
return C(a + b - 1, b);
}
};
signed main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
Combination<mod> comb(201010);
int ans = 0;
rep(r, r1, r2 + 1) {
int tmp1 =
comb.fac[r + c2 + 1] * comb.finv[r + 1] % mod * comb.finv[c2] % mod;
int tmp2 =
comb.fac[r + c1] * comb.finv[r + 1] % mod * comb.finv[c1 - 1] % mod;
ans += (tmp1 - tmp2 + mod) % mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| #include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i, l, r) for (int i = (int)(l); i < (int)(r); i++)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)x.size())
template <class T> bool chmax(T &a, T b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, T b) {
if (a > b) {
a = b;
return 1;
}
return 0;
}
/*
*/
using vi = vector<int>;
using vvi = vector<vi>;
using P = pair<int, int>;
const int mod = 1e9 + 7;
template <int M> class Combination {
public:
int n;
vector<int> fac, finv;
Combination(int n_) : n(n_), fac(n_), finv(n_) {
fac[0] = 1;
for (int i = 1; i < n; i++)
fac[i] = fac[i - 1] * i % M;
finv[n - 1] = pow(fac[n - 1], M - 2);
for (int i = n - 1; i > 0; i--)
finv[i - 1] = finv[i] * i % M;
}
int pow(int a, int b) {
if (b == 0)
return 1;
return pow(a * a % M, b / 2) * (b % 2 ? a : 1) % M;
}
int C(int a, int b) {
if (b < 0 or a < b)
return 0;
return fac[a] * finv[a - b] % M * finv[b] % M;
}
int P(int a, int b) {
if (b < 0 or a < b)
return 0;
return fac[a] * finv[a - b] % M;
}
int H(int a, int b) {
if (a == 0 and b == 0)
return 1;
return C(a + b - 1, b);
}
};
signed main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
Combination<mod> comb(2000010);
int ans = 0;
rep(r, r1, r2 + 1) {
int tmp1 =
comb.fac[r + c2 + 1] * comb.finv[r + 1] % mod * comb.finv[c2] % mod;
int tmp2 =
comb.fac[r + c1] * comb.finv[r + 1] % mod * comb.finv[c1 - 1] % mod;
ans += (tmp1 - tmp2 + mod) % mod;
ans %= mod;
}
cout << ans << endl;
return 0;
}
| replace | 74 | 75 | 74 | 75 | 0 | |
p02782 | C++ | Time Limit Exceeded | #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll d[2000010];
ll go(ll x, ll y) {
if (y == 0)
return 1;
else if (y == 1)
return x;
else if (y == 2)
return x * x % mod;
else if (y & 1) {
return (x * go(x, y - 1)) % mod;
} else {
ll tmp = go(x, y / 2) % mod;
return (tmp * tmp) % mod;
}
}
ll go2(ll x, ll y) {
if (x == 0 && y == 0)
return 0;
ll cnt = d[x];
ll tmp = d[y] * (d[x - y]) % mod;
tmp = go(tmp, mod - 2);
cnt *= tmp;
cnt %= mod;
return cnt;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
ll r, c, r1, c1;
cin >> r >> c >> r1 >> c1;
ll ans = 0;
d[0] = 1;
d[1] = 1;
for (ll i = 2; i <= 2000002; i++) {
d[i] = d[i - 1] * i;
d[i] %= mod;
}
for (int i = r; i <= r1; i++) {
ll x = i + 1, y = c1;
ll cnt = go2(x + y, x);
x = i + 1;
y = c - 1;
ll tmp = go2(x + y, x);
tmp = (cnt - tmp);
while (tmp < 0)
tmp += mod;
ans += tmp;
ans %= mod;
}
cout << ans << '\n';
} | #include <algorithm>
#include <climits>
#include <cstring>
#include <iostream>
#include <map>
#include <queue>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
ll mod = 1e9 + 7;
ll d[2000010];
ll go(ll x, ll y) {
if (y == 0)
return 1;
else if (y == 1)
return x;
else if (y == 2)
return x * x % mod;
else if (y & 1) {
return (x * go(x, y - 1)) % mod;
} else {
ll tmp = go(x, y / 2) % mod;
return (tmp * tmp) % mod;
}
}
ll go2(ll x, ll y) {
if (x == 0 && y == 0)
return 0;
ll cnt = d[x];
ll tmp = d[y] * (d[x - y]) % mod;
tmp = go(tmp, mod - 2);
cnt *= tmp;
cnt %= mod;
return cnt;
}
int main() {
cin.sync_with_stdio(0);
cin.tie(0);
ll r, c, r1, c1;
cin >> r >> c >> r1 >> c1;
ll ans = 0;
d[0] = 1;
d[1] = 1;
for (ll i = 2; i <= 2000002; i++) {
d[i] = d[i - 1] * i;
d[i] %= mod;
}
ans = go2(r1 + c1 + 2, r1 + 1);
ll tmp = go2(c1 + r + 1, r);
ans -= tmp;
while (ans < 0)
ans += mod;
ans %= mod;
tmp = go2(r1 + c + 1, r1 + 1);
tmp -= go2(r + c, r);
while (tmp < 0)
tmp += mod;
ans -= tmp;
while (ans < 0)
ans += mod;
cout << ans << '\n';
} | replace | 52 | 64 | 52 | 65 | TLE | |
p02782 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define all(v) (v).begin(), (v).end()
#define io ios::sync_with_stdio(0)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rson rt << 1 | 1, mid + 1, r
#define lson rt << 1, l, mid
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
const int mod = 1e9 + 7;
inline int ksm(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
struct nd {
int l, r;
int d;
int v;
};
int fac[300000], inv[3000000];
int C(int n, int m) {
if (n < 0 || m > n)
return 0;
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
nd cal(nd t, int d, int l, int r) {
// nd res = t;
if (r - l + 1 <= 4) {
rep(i, t.l, t.r) t.v = (t.v - C(t.d, i)) % mod;
t.d = d;
t.l = l;
t.r = r;
rep(i, l, r) t.v = (t.v + C(t.d, i)) % mod;
} else {
t.v = (2 * t.v % mod - C(t.d, t.l) - C(t.d, t.r)) % mod;
t.v = (t.v + C(d, t.l)) % mod;
if (t.l < l)
t.v = (t.v - C(d, t.l)) % mod;
if (t.r < r)
t.v = (t.v + C(d, r)) % mod;
t.d = d;
t.l = l;
t.r = r;
}
return t;
}
int gao(int n, int m) {
if (n > m)
swap(n, m);
// cout<<n<<" "<<m<<endl;
int ans = 0;
nd t;
t.d = t.l = t.r = 0;
t.v = 1;
rep(i, 0, m + n) {
int l = max(i - m, 0ll), r = min(i, n);
t = cal(t, i, l, r);
ans = (ans + t.v) % mod;
// cout<<t.d<<" "<<t.v<<" "<<t.l<<" "<<t.r<<endl;
}
return ans;
}
signed main() {
fac[0] = inv[0] = 1;
rep(i, 1, 3e6 - 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = ksm(fac[i], mod - 2);
}
// cout<<C(0,0);
/*
{ nd t;
t.d = t.l = t.r = 0;
t.v = 1;
rep(i,1,20){
t=cal(t,i,0,i);
cout<<t.v<<endl;
}
}
*/
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
int t = gao(r2, c2) - gao(r1 - 1, c2) - gao(r2, c1 - 1) + gao(c1 - 1, r1 - 1);
t = (t % mod + mod) % mod;
cout << t << endl;
getchar();
getchar();
}
| #include "bits/stdc++.h"
using namespace std;
#define all(v) (v).begin(), (v).end()
#define io ios::sync_with_stdio(0)
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define rson rt << 1 | 1, mid + 1, r
#define lson rt << 1, l, mid
#define lll __int128
#define pii pair<int, int>
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define int long long
const int mod = 1e9 + 7;
inline int ksm(int a, int b) {
int ans = 1;
for (; b; b >>= 1, a = a * a % mod)
if (b & 1)
ans = ans * a % mod;
return ans;
}
struct nd {
int l, r;
int d;
int v;
};
int fac[3000000], inv[3000000];
int C(int n, int m) {
if (n < 0 || m > n)
return 0;
return fac[n] * inv[m] % mod * inv[n - m] % mod;
}
nd cal(nd t, int d, int l, int r) {
// nd res = t;
if (r - l + 1 <= 4) {
rep(i, t.l, t.r) t.v = (t.v - C(t.d, i)) % mod;
t.d = d;
t.l = l;
t.r = r;
rep(i, l, r) t.v = (t.v + C(t.d, i)) % mod;
} else {
t.v = (2 * t.v % mod - C(t.d, t.l) - C(t.d, t.r)) % mod;
t.v = (t.v + C(d, t.l)) % mod;
if (t.l < l)
t.v = (t.v - C(d, t.l)) % mod;
if (t.r < r)
t.v = (t.v + C(d, r)) % mod;
t.d = d;
t.l = l;
t.r = r;
}
return t;
}
int gao(int n, int m) {
if (n > m)
swap(n, m);
// cout<<n<<" "<<m<<endl;
int ans = 0;
nd t;
t.d = t.l = t.r = 0;
t.v = 1;
rep(i, 0, m + n) {
int l = max(i - m, 0ll), r = min(i, n);
t = cal(t, i, l, r);
ans = (ans + t.v) % mod;
// cout<<t.d<<" "<<t.v<<" "<<t.l<<" "<<t.r<<endl;
}
return ans;
}
signed main() {
fac[0] = inv[0] = 1;
rep(i, 1, 3e6 - 1) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = ksm(fac[i], mod - 2);
}
// cout<<C(0,0);
/*
{ nd t;
t.d = t.l = t.r = 0;
t.v = 1;
rep(i,1,20){
t=cal(t,i,0,i);
cout<<t.v<<endl;
}
}
*/
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
int t = gao(r2, c2) - gao(r1 - 1, c2) - gao(r2, c1 - 1) + gao(c1 - 1, r1 - 1);
t = (t % mod + mod) % mod;
cout << t << endl;
getchar();
getchar();
}
| replace | 27 | 28 | 27 | 28 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
// #define int long long
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> std::string printVector(const std::vector<T> &data) {
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
template <typename T> void print_array(const T &ary, int size) {
REP(i, size) { cout << ary[i] << " "; }
cout << endl;
}
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
const int MAX = 1e6 + 10;
const int MOD = 1000000007;
const int mod = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct mint {
LL x; // typedef long long LL;
mint(LL x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(LL t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint func(int r, int c) {
mint all;
mint two = 2;
all = two.pow(r + c + 1) - 1;
REP(i, c) {
mint base = 1;
base = base * COM(r + i, i) * (two.pow(c - i) - 1);
all -= base;
}
REP(i, r) {
mint base = 1;
base = base * COM(c + i, i) * (two.pow(r - i) - 1);
all -= base;
}
return all;
}
signed main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12);
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans =
func(r2, c2) + func(r1 - 1, c1 - 1) - func(r2, c1 - 1) - func(r1 - 1, c2);
// dump(func(2,2).x)
// dump(func(0,0).x)
// dump(func(2,0).x)
// dump(func(0,2).x)
cout << ans.x << endl;
}
| #include <algorithm>
#include <bitset>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>
using namespace std;
#define DEBUG_ //!!提出時にコメントアウト!!
#ifdef DEBUG_
#define dump(x) cerr << #x << " = " << (x) << endl;
#else
#define dump(x) ;
#endif
#define equals(a, b) (fabs((a) - (b)) < EPS)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define REP(i, n) FOR(i, 0, n)
#define SZ(x) ((int)(x).size())
#define pb push_back
#define eb emplace_back
// #define int long long
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
template <typename T> std::string printVector(const std::vector<T> &data) {
std::stringstream ss;
std::ostream_iterator<T> out_it(ss, ", ");
ss << "[";
std::copy(data.begin(), data.end() - 1, out_it);
ss << data.back() << "]";
return ss.str();
}
template <typename T> void print_array(const T &ary, int size) {
REP(i, size) { cout << ary[i] << " "; }
cout << endl;
}
const LL LINF = 1001002003004005006ll;
const int INF = 1001001001;
const double EPS = (1e-10);
const int MAX = 2e6 + 10;
const int MOD = 1000000007;
const int mod = 1e9 + 7;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
struct mint {
LL x; // typedef long long LL;
mint(LL x = 0) : x(x % mod) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= mod)
x -= mod;
return *this;
}
mint &operator-=(const mint a) {
if ((x += mod - a.x) >= mod)
x -= mod;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= mod;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(LL t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(mod - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
mint func(int r, int c) {
mint all;
mint two = 2;
all = two.pow(r + c + 1) - 1;
REP(i, c) {
mint base = 1;
base = base * COM(r + i, i) * (two.pow(c - i) - 1);
all -= base;
}
REP(i, r) {
mint base = 1;
base = base * COM(c + i, i) * (two.pow(r - i) - 1);
all -= base;
}
return all;
}
signed main(int argc, char const *argv[]) {
cin.tie(0);
ios::sync_with_stdio(false);
cout << setprecision(12);
COMinit();
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans =
func(r2, c2) + func(r1 - 1, c1 - 1) - func(r2, c1 - 1) - func(r1 - 1, c2);
// dump(func(2,2).x)
// dump(func(0,0).x)
// dump(func(2,0).x)
// dump(func(0,2).x)
cout << ans.x << endl;
}
| replace | 78 | 79 | 78 | 79 | 0 | |
p02782 | C++ | Runtime Error | /*author: hyperion_1724
date:
*/
// Optional FAST
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Required namespaces
using namespace std;
using namespace __gnu_pbds;
// Required defines
#define endl '\n'
#define READ(X) cin >> X;
#define READV(X) \
long long X; \
cin >> X;
#define READAR(A, N) \
long long A[N]; \
for (long long i = 0; i < N; i++) { \
cin >> A[i]; \
}
#define rz(A, N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define trav(x, A) for (auto &x : A)
#define FORI(a, b, c) for (long long a = b; a < c; a++)
#define FORD(a, b, c) for (long long a = b; a > c; a--)
// Required typedefs
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, greater<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> veci;
typedef vector<long long> vecl;
// Required Constants
const long long inf = (long long)1e18;
const long long MOD = (long long)(1e9 + 7);
const long long INIT = (long long)(1e6 + 1);
// Required Functions
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2) % MOD;
p = (p * p) % MOD;
return (y % 2 == 0) ? p : (x * p) % MOD;
}
ll modInverse(ll a) { return power(a, MOD - 2); }
// Work
ll fact[INIT] = {0};
int main() {
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r")) {
freopen("INPUT.txt", "r", stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t clk;
clk = clock();
//-----------------------------------------------------------------------------------------------------------//
fact[0] = 1;
FORI(i, 1, INIT) { fact[i] = (fact[i - 1] * i) % MOD; }
ll R1, C1, R2, C2;
cin >> R1 >> C1 >> R2 >> C2;
ll ans = 0;
FORI(i, C1, C2 + 1) {
ans =
(ans +
(fact[i + R2 + 1] * modInverse((fact[R2] * fact[i + 1]) % MOD)) % MOD -
(fact[i + R1] * modInverse((fact[R1 - 1] * fact[i + 1]) % MOD)) % MOD +
MOD) %
MOD;
}
cout << ans << endl;
//-----------------------------------------------------------------------------------------------------------//
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< endl;
return 0;
} | /*author: hyperion_1724
date:
*/
// Optional FAST
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC
// target("sse,sse2,sse3,ssse3,sse4,popcnt,fma,abm,mmx,avx,avx2,tune=native")
// Required Libraries
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/tree_policy.hpp>
// Required namespaces
using namespace std;
using namespace __gnu_pbds;
// Required defines
#define endl '\n'
#define READ(X) cin >> X;
#define READV(X) \
long long X; \
cin >> X;
#define READAR(A, N) \
long long A[N]; \
for (long long i = 0; i < N; i++) { \
cin >> A[i]; \
}
#define rz(A, N) A.resize(N);
#define sz(X) (long long)(X.size())
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define trav(x, A) for (auto &x : A)
#define FORI(a, b, c) for (long long a = b; a < c; a++)
#define FORD(a, b, c) for (long long a = b; a > c; a--)
// Required typedefs
typedef tree<long long, null_type, less<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set;
typedef tree<long long, null_type, greater<long long>, rb_tree_tag,
tree_order_statistics_node_update>
ordered_set1;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
typedef vector<int> veci;
typedef vector<long long> vecl;
// Required Constants
const long long inf = (long long)1e18;
const long long MOD = (long long)(1e9 + 7);
const long long INIT = (long long)(3e6 + 1);
// Required Functions
ll power(ll x, ll y) {
if (y == 0)
return 1;
ll p = power(x, y / 2) % MOD;
p = (p * p) % MOD;
return (y % 2 == 0) ? p : (x * p) % MOD;
}
ll modInverse(ll a) { return power(a, MOD - 2); }
// Work
ll fact[INIT] = {0};
int main() {
#ifndef ONLINE_JUDGE
if (fopen("INPUT.txt", "r")) {
freopen("INPUT.txt", "r", stdin);
// freopen ("OUTPUT.txt" , "w" , stdout);
}
#endif
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
clock_t clk;
clk = clock();
//-----------------------------------------------------------------------------------------------------------//
fact[0] = 1;
FORI(i, 1, INIT) { fact[i] = (fact[i - 1] * i) % MOD; }
ll R1, C1, R2, C2;
cin >> R1 >> C1 >> R2 >> C2;
ll ans = 0;
FORI(i, C1, C2 + 1) {
ans =
(ans +
(fact[i + R2 + 1] * modInverse((fact[R2] * fact[i + 1]) % MOD)) % MOD -
(fact[i + R1] * modInverse((fact[R1 - 1] * fact[i + 1]) % MOD)) % MOD +
MOD) %
MOD;
}
cout << ans << endl;
//-----------------------------------------------------------------------------------------------------------//
clk = clock() - clk;
cerr << fixed << setprecision(6) << "Time: " << ((double)clk) / CLOCKS_PER_SEC
<< endl;
return 0;
} | replace | 65 | 66 | 65 | 66 | 0 | Time: 0.014032
|
p02782 | C++ | Runtime Error | /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef int
#define VI vector<long long>
#define V2I(v, size_1, size_2, value) \
vector<vector<long long>> v(size_1, vector<long long>(size_2, value))
#define V3I(v, size_1, size_2, size_3, value) \
vector<vector<vector<long long>>> v( \
size_1, \
vector<vector<long long>>(size_2, vector<long long>(size_3, value)))
#define G(g, size_1) vector<vector<long long>> g(size_1, vector<long long>())
#define SZ(x) ((long long)(x).size())
#define READ \
({ \
long long t; \
cin >> t; \
t; \
})
#define PII pair<long long, long long>
#else
#define VI vector<int>
#define V2I(v, size_1, size_2, value) \
vector<vector<int>> v(size_1, vector<int>(size_2, value))
#define V3I(v, size_1, size_2, size_3, value) \
vector<vector<vector<int>>> v( \
size_1, vector<vector<int>>(size_2, vector<int>(size_3, value)))
#define G(g, size_1) vector<vector<int>> g(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
int t; \
cin >> t; \
t; \
})
#define PII pair<int, int>
#endif
#define V2(v, type, size_1, size_2, value) \
vector<vector<type>> v(size_1, vector<type>(size_2, value))
#define V3(v, type, size_1, size_2, size_3, value) \
vector<vector<vector<type>>> v( \
size_1, vector<vector<type>>(size_2, vector<type>(size_3, value)))
#define TR(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define IN(c, x) ((c).find(x) != (c).end()) // O(log n)
#define IN_L(c, x) (find((c).begin(), (c).end(), x) != (c).end()) // O(n)
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define ERR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
// const ll mod = (ll) 998244353 ;
const double eps = 1e-10;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << V[i] << " ";
curr = V[i];
}
os << V.back();
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]";
return os;
};
/*
template <class F>
struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args>
decltype(auto) operator()(Args&&... args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or
similar. return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F>
y_combinator<std::decay_t<F>> recursive(F&& f){
return {std::forward<F>(f)};
}
*/
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
/*
struct X{
int x,y,id;
bool operator < (const X R)const{
return id < R.id;
}
friend ostream& operator << (ostream& os, X R){
os << "(" << R.x << "," << R.y << "," << R.id << ")";
}
friend bool operator == (const X L, const X R){
return L.id == R.id;
}
*/
template <class T> void Chmod(T &a, const T &m) { a = MOD(a, m); }
template <class T> bool Chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool Chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// 256MB = 2^29(~5.3*10^8)*sizeof(int)
// #define int ll //2^31=2.15*10^9, 2^63=9.22*10^18
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 1000010;
const int MOD = 1000000007;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
class FManyManyPaths {
public:
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = 0;
if (r2 - r1 < 5 || c2 - c1 < 5) {
FOR(i, r1, r2 + 1) FOR(j, c1, c2 + 1) ans += mint(i + j).choose(i);
print(ans);
} else {
ans += mint(r1 + c1).choose(r1);
FOR(i, c1 + 1, c2 + 1) ans += mint(i + r2).choose(i);
FOR(i, r1 + 1, r2 + 1) ans += mint(i + c2).choose(i);
print(ans);
}
}
};
#undef int
int main() {
FManyManyPaths solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
// solver.solve(in, out);
solver.solve(in, out, err);
return 0;
}
| /**
* code generated by JHelper
* More info: https://github.com/AlexeyDmitriev/JHelper
* @author Gosu_Hiroo
*/
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#ifdef int
#define VI vector<long long>
#define V2I(v, size_1, size_2, value) \
vector<vector<long long>> v(size_1, vector<long long>(size_2, value))
#define V3I(v, size_1, size_2, size_3, value) \
vector<vector<vector<long long>>> v( \
size_1, \
vector<vector<long long>>(size_2, vector<long long>(size_3, value)))
#define G(g, size_1) vector<vector<long long>> g(size_1, vector<long long>())
#define SZ(x) ((long long)(x).size())
#define READ \
({ \
long long t; \
cin >> t; \
t; \
})
#define PII pair<long long, long long>
#else
#define VI vector<int>
#define V2I(v, size_1, size_2, value) \
vector<vector<int>> v(size_1, vector<int>(size_2, value))
#define V3I(v, size_1, size_2, size_3, value) \
vector<vector<vector<int>>> v( \
size_1, vector<vector<int>>(size_2, vector<int>(size_3, value)))
#define G(g, size_1) vector<vector<int>> g(size_1, vector<int>())
#define SZ(x) ((int)(x).size())
#define READ \
({ \
int t; \
cin >> t; \
t; \
})
#define PII pair<int, int>
#endif
#define V2(v, type, size_1, size_2, value) \
vector<vector<type>> v(size_1, vector<type>(size_2, value))
#define V3(v, type, size_1, size_2, size_3, value) \
vector<vector<vector<type>>> v( \
size_1, vector<vector<type>>(size_2, vector<type>(size_3, value)))
#define TR(container, it) \
for (auto it = container.begin(); it != container.end(); it++)
#define IN(c, x) ((c).find(x) != (c).end()) // O(log n)
#define IN_L(c, x) (find((c).begin(), (c).end(), x) != (c).end()) // O(n)
#define FOR(i, _begin, _end) \
for (__typeof(_end) end = _end, begin = _begin, \
i = (begin) - ((begin) > (end)); \
i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define REP(i, end) for (__typeof(end) i = 0, _len = (end); i < (_len); i += 1)
#define ALL(x) (x).begin(), (x).end()
#define F first
#define S second
#define y0 y3487465
#define y1 y8687969
#define j0 j1347829
#define j1 j234892
#define MOD(x, m) ((((x) % (m)) + (m)) % (m))
#define BIT(n) (1LL << (n))
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end());
#define EB emplace_back
#define PB push_back
#define fcout cout << fixed << setprecision(12)
#define fcerr cerr << fixed << setprecision(12)
#define print(x) cout << (x) << endl
#define fprint(x) cout << fixed << setprecision(12) << (x) << endl
#define BYE(a) \
do { \
cout << (a) << endl; \
return; \
} while (false)
#ifdef DEBUG
#define ERR(args...) \
{ \
string _s = #args; \
replace(_s.begin(), _s.end(), ',', ' '); \
stringstream _ss(_s); \
istream_iterator<string> _it(_ss); \
_err(cerr, _it, args); \
}
#define DBG(x) cerr << #x << " is " << x << endl;
#else
#define DBG(x) {};
#define ERR(args...) {};
#endif
void _err(std::ostream &cerr, istream_iterator<string> it) { cerr << endl; }
template <typename T, typename... Args>
void _err(std::ostream &cerr, istream_iterator<string> it, T a, Args... args) {
cerr << *it << " = " << a << " ";
_err(cerr, ++it, args...);
}
const double pi = 2 * acos(.0);
const int inf = 0x3f3f3f3f;
const ll mod = (ll)(1e9) + 7;
// const ll mod = (ll) 998244353 ;
const double eps = 1e-10;
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
std::fill((T *)array, (T *)(array + N), val);
}
template <typename T> ostream &operator<<(ostream &os, const vector<T> V) {
os << "[";
int cnt = 0;
T curr;
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
if (V[i] == curr)
cnt++;
else
cnt = 0;
if (cnt == 4)
os << "... ";
if (cnt < 4)
os << V[i] << " ";
curr = V[i];
}
os << V.back();
}
os << "]";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> P) {
os << "(";
os << P.first << "," << P.second;
os << ")";
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const set<T, U> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename H, typename P>
ostream &operator<<(ostream &os, const unordered_set<K, H, P> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename C>
ostream &operator<<(ostream &os, const multiset<K, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << *it << " ";
it++;
}
os << *it;
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}";
return os;
}
template <typename K, typename T, typename C>
ostream &operator<<(ostream &os, const unordered_map<K, T, C> V) {
os << "{";
if (!V.empty()) {
auto it = V.begin();
for (int i = 0; i < V.size() - 1; ++i) {
os << "(";
os << it->first << "," << it->second;
os << ") ";
it++;
}
os << "(";
os << it->first << "," << it->second;
os << ")";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const deque<T> V) {
os << "[";
if (!V.empty()) {
for (int i = 0; i < V.size() - 1; ++i) {
os << V[i] << "->";
}
if (!V.empty())
os << V.back();
}
os << "]";
return os;
};
template <typename T, typename Cont, typename Comp>
ostream &operator<<(ostream &os, const priority_queue<T, Cont, Comp> V) {
priority_queue<T, Cont, Comp> _V = V;
os << "[";
if (!_V.empty()) {
while (_V.size() > 1) {
os << _V.top() << "->";
_V.pop();
}
os << _V.top();
}
os << "]";
return os;
};
/*
template <class F>
struct y_combinator {
F f; // the lambda will be stored here
// a forwarding operator():
template <class... Args>
decltype(auto) operator()(Args&&... args) const {
// we pass ourselves to f, then the arguments.
// the lambda should take the first argument as `auto&& recurse` or
similar. return f(*this, std::forward<Args>(args)...);
}
};
// helper function that deduces the type of the lambda:
template <class F>
y_combinator<std::decay_t<F>> recursive(F&& f){
return {std::forward<F>(f)};
}
*/
struct hash_pair {
template <class T1, class T2> size_t operator()(const pair<T1, T2> &p) const {
auto hash1 = hash<T1>{}(p.first);
auto hash2 = hash<T2>{}(p.second);
return hash1 ^ hash2;
}
};
/*
struct X{
int x,y,id;
bool operator < (const X R)const{
return id < R.id;
}
friend ostream& operator << (ostream& os, X R){
os << "(" << R.x << "," << R.y << "," << R.id << ")";
}
friend bool operator == (const X L, const X R){
return L.id == R.id;
}
*/
template <class T> void Chmod(T &a, const T &m) { a = MOD(a, m); }
template <class T> bool Chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool Chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
// 256MB = 2^29(~5.3*10^8)*sizeof(int)
// #define int ll //2^31=2.15*10^9, 2^63=9.22*10^18
template <signed M, unsigned T> struct mod_int {
constexpr static signed MODULO = M;
constexpr static unsigned TABLE_SIZE = T;
signed x;
mod_int() : x(0) {}
mod_int(long long y)
: x(static_cast<signed>(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO)) {}
mod_int(int y) : x(y >= 0 ? y % MODULO : MODULO - (-y) % MODULO) {}
explicit operator int() const { return x; }
explicit operator long long() const { return x; }
explicit operator double() const { return x; }
mod_int &operator+=(const mod_int &rhs) {
if ((x += rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator-=(const mod_int &rhs) {
if ((x += MODULO - rhs.x) >= MODULO)
x -= MODULO;
return *this;
}
mod_int &operator*=(const mod_int &rhs) {
x = static_cast<signed>(1LL * x * rhs.x % MODULO);
return *this;
}
mod_int &operator/=(const mod_int &rhs) {
x = static_cast<signed>((1LL * x * rhs.inv().x) % MODULO);
return *this;
}
mod_int operator-() const { return mod_int(-x); }
mod_int operator+(const mod_int &rhs) const { return mod_int(*this) += rhs; }
mod_int operator-(const mod_int &rhs) const { return mod_int(*this) -= rhs; }
mod_int operator*(const mod_int &rhs) const { return mod_int(*this) *= rhs; }
mod_int operator/(const mod_int &rhs) const { return mod_int(*this) /= rhs; }
bool operator<(const mod_int &rhs) const { return x < rhs.x; }
mod_int inv() const {
assert(x != 0);
if (x <= static_cast<signed>(TABLE_SIZE)) {
if (_inv[1].x == 0)
prepare();
return _inv[x];
} else {
signed a = x, b = MODULO, u = 1, v = 0, t;
while (b) {
t = a / b;
a -= t * b;
std::swap(a, b);
u -= t * v;
std::swap(u, v);
}
return mod_int(u);
}
}
mod_int pow(long long t) const {
assert(!(x == 0 && t == 0));
mod_int e = *this, res = mod_int(1);
for (; t; e *= e, t >>= 1)
if (t & 1)
res *= e;
return res;
}
mod_int fact() {
if (_fact[0].x == 0)
prepare();
return _fact[x];
}
mod_int inv_fact() {
if (_fact[0].x == 0)
prepare();
return _inv_fact[x];
}
mod_int choose(mod_int y) {
assert(y.x <= x);
return this->fact() * y.inv_fact() * mod_int(x - y.x).inv_fact();
}
static mod_int _inv[TABLE_SIZE + 1];
static mod_int _fact[TABLE_SIZE + 1];
static mod_int _inv_fact[TABLE_SIZE + 1];
static void prepare() {
_inv[1] = 1;
for (int i = 2; i <= (int)TABLE_SIZE; ++i) {
_inv[i] = 1LL * _inv[MODULO % i].x * (MODULO - MODULO / i) % MODULO;
}
_fact[0] = 1;
for (unsigned i = 1; i <= TABLE_SIZE; ++i) {
_fact[i] = _fact[i - 1] * int(i);
}
_inv_fact[TABLE_SIZE] = _fact[TABLE_SIZE].inv();
for (int i = (int)TABLE_SIZE - 1; i >= 0; --i) {
_inv_fact[i] = _inv_fact[i + 1] * (i + 1);
}
}
};
template <int M, unsigned F>
std::ostream &operator<<(std::ostream &os, const mod_int<M, F> &rhs) {
return os << rhs.x;
}
template <int M, unsigned F>
std::istream &operator>>(std::istream &is, mod_int<M, F> &rhs) {
long long s;
is >> s;
rhs = mod_int<M, F>(s);
return is;
}
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_inv[TABLE_SIZE + 1];
template <int M, unsigned F> mod_int<M, F> mod_int<M, F>::_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
mod_int<M, F> mod_int<M, F>::_inv_fact[TABLE_SIZE + 1];
template <int M, unsigned F>
bool operator==(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return lhs.x == rhs.x;
}
template <int M, unsigned F>
bool operator!=(const mod_int<M, F> &lhs, const mod_int<M, F> &rhs) {
return !(lhs == rhs);
}
const int MF = 2000010;
const int MOD = 1000000007;
using mint = mod_int<MOD, MF>;
mint binom(int n, int r) {
return (r < 0 || r > n || n < 0) ? 0 : mint(n).choose(r);
}
mint fact(int n) { return mint(n).fact(); }
mint inv_fact(int n) { return mint(n).inv_fact(); }
class FManyManyPaths {
public:
void solve(std::istream &cin, std::ostream &cout, std::ostream &cerr) {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
mint ans = 0;
if (r2 - r1 < 5 || c2 - c1 < 5) {
FOR(i, r1, r2 + 1) FOR(j, c1, c2 + 1) ans += mint(i + j).choose(i);
print(ans);
} else {
ans += mint(r1 + c1).choose(r1);
FOR(i, c1 + 1, c2 + 1) ans += mint(i + r2).choose(i);
FOR(i, r1 + 1, r2 + 1) ans += mint(i + c2).choose(i);
print(ans);
}
}
};
#undef int
int main() {
FManyManyPaths solver;
std::istream &in(std::cin);
std::ostream &out(std::cout);
std::ostringstream err;
in.tie(0);
ios::sync_with_stdio(0);
// solver.solve(in, out);
solver.solve(in, out, err);
return 0;
}
| replace | 463 | 464 | 463 | 464 | 0 | |
p02782 | C++ | Runtime Error | #ifndef LOCAL
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,tune=native")
#endif // LOCAL
#define _SCL_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
// #define push_back pb
#define first x
#define second y
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#ifdef LOCAL
// #include <vld.h>
#endif // LOCAL
using namespace std;
// typedef __int128_t ll;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
#define speedup \
cout.tie(nullptr); \
cin.tie(nullptr); \
ios_base::sync_with_stdio(false)
#define coutdouble \
cout << setprecision(20); \
cout << fixed
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#ifdef LOCAL
mt19937 rd(57322);
#else
mt19937 rd((uint)chrono::steady_clock::now().time_since_epoch().count());
#endif
/*------CommentInInteractive--------*/
#ifndef LOCAL
#define endl '\n'
#endif // LOCAL
/*----------------------------------*/
const int INF = 1000 * 1000 * 1000 + 322;
const ll LLINF = 2LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL + 57;
constexpr uint MOD = 1000 * 1000 * 1000 + 7;
constexpr uint FFT_MOD = 998244353;
const int P1E6 = 1336337;
const int P1E3 = 1009;
const ll P1E14 = 100000000000031;
const ll P1E17 = 100000000000000003;
const ld PI = acosl(-1.); // 3.1415926535897932384626433832795
const ld EPS = 1e-9;
/*------------------------------------------------IO_OPERATORS---------------------------------------------*/
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
_out << _p.first << " " << _p.second;
return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
_in >> _p.first >> _p.second;
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
if (_v.empty())
return _out;
_out << _v.front();
for (auto _it = ++_v.begin(); _it != _v.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T> inline istream &operator>>(istream &_in, vector<T> &_v) {
for (auto &_i : _v)
_in >> _i;
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
if (_m.empty())
return _out;
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
_out << ", (" << _it->first << ": " << _it->second << ')';
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
if (_m.empty())
return _out;
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
_out << ", (" << _it->first << ": " << _it->second << ')';
return _out;
}
/*--------------------------------------------------IO_FILES-----------------------------------------------*/
const char *infile =
#ifdef LOCAL
"input.txt"
#else
""
#endif // LOCAL
;
const char *outfile =
#ifdef LOCAL
""
#else
""
#endif // LOCAL
;
/*-------------------------------------------------ALLOCATOR----------------------------------------------*/
// #define ALLOC_LOCAL
#ifdef ALLOC_LOCAL
const int ML_ = 450;
char mem_[ML_ * 1024 * 1024];
size_t _ptr = 0, _magic = 21323400;
void *operator new(size_t cnt) {
if (_ptr + cnt < sizeof mem_) {
_ptr += cnt;
return mem_ + _ptr - cnt;
} else {
assert(false);
_ptr = cnt + _magic;
return mem_ + _magic;
}
}
void operator delete(void *) {}
#endif // ALLOC_LOCAL
/*-----------------------------------------------------MATH------------------------------------------------*/
inline ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline int pwm(ll xx, ll pow, int MD) {
if (pow < 0) {
pow = pow % (MD - 1) + MD - 1;
}
ll mlt = 1;
while (pow) {
if (pow & 1) {
mlt *= xx;
mlt %= MD;
}
xx *= xx;
pow >>= 1;
xx %= MD;
}
return (int)mlt;
}
inline ll gcdex(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll xx, yy;
ll gc = gcdex(b, a % b, yy, xx);
x = xx;
y = yy - (a / b) * xx;
return gc;
}
inline int inv(ll r, int _mod) { return pwm(r % _mod, _mod - 2, _mod); }
/*-----------------------------------------------------CODE------------------------------------------------*/
int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
int sub(int a, int b) {
a -= b;
if (a < 0)
a += MOD;
return a;
}
const int N = 1000 * 1000 + 57;
int fct[N], ifct[N];
int f(int n, int k) {
n += k;
// c(n + 2, k + 1)
return int(ll(fct[n + 2]) * ifct[k + 1] % MOD * ifct[n - k + 1] % MOD);
}
void solve() {
fct[0] = 1;
for (int i = 1; i < N; ++i) {
fct[i] = int(ll(fct[i - 1]) * i % MOD);
}
ifct[N - 1] = inv(fct[N - 1], MOD);
for (int i = N - 2; i >= 0; --i) {
ifct[i] = int(ll(ifct[i + 1]) * (i + 1) % MOD);
}
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
--r1;
--c1;
cout << add(sub(sub(f(r2, c2), f(r1, c2)), f(r2, c1)), f(r1, c1)) << endl;
}
int main() {
if (*infile != '\0')
(void)freopen(infile, "r", stdin);
if (*outfile != '\0')
(void)freopen(outfile, "w", stdout);
speedup;
coutdouble;
// int tst = 1;
// srand(time(NULL));
// cin >> tst;
// scanf("%d", &tst);
// while (tst-- > 0) {
// while(true) {
solve();
// if ((tst & 0xF) == 0) {
// cerr << "ok\n";
// }
// cerr << "/*-----------------*/\n";
// }
#ifdef LOCAL
cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << endl;
while (true)
;
#endif // LOCAL
return 0;
} | #ifndef LOCAL
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,mmx,tune=native")
#endif // LOCAL
#define _SCL_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#define _CRT_SECURE_NO_WARNINGS
#pragma comment(linker, "/STACK:256000000")
// #define push_back pb
#define first x
#define second y
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <ciso646>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <initializer_list>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <regex>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
#ifdef LOCAL
// #include <vld.h>
#endif // LOCAL
using namespace std;
// typedef __int128_t ll;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef long double ld;
#define speedup \
cout.tie(nullptr); \
cin.tie(nullptr); \
ios_base::sync_with_stdio(false)
#define coutdouble \
cout << setprecision(20); \
cout << fixed
#define all(v) (v).begin(), (v).end()
#define sz(v) (int)(v).size()
#ifdef LOCAL
mt19937 rd(57322);
#else
mt19937 rd((uint)chrono::steady_clock::now().time_since_epoch().count());
#endif
/*------CommentInInteractive--------*/
#ifndef LOCAL
#define endl '\n'
#endif // LOCAL
/*----------------------------------*/
const int INF = 1000 * 1000 * 1000 + 322;
const ll LLINF = 2LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL + 57;
constexpr uint MOD = 1000 * 1000 * 1000 + 7;
constexpr uint FFT_MOD = 998244353;
const int P1E6 = 1336337;
const int P1E3 = 1009;
const ll P1E14 = 100000000000031;
const ll P1E17 = 100000000000000003;
const ld PI = acosl(-1.); // 3.1415926535897932384626433832795
const ld EPS = 1e-9;
/*------------------------------------------------IO_OPERATORS---------------------------------------------*/
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const pair<T, U> &_p) {
_out << _p.first << " " << _p.second;
return _out;
}
template <typename T, typename U>
inline istream &operator>>(istream &_in, pair<T, U> &_p) {
_in >> _p.first >> _p.second;
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const vector<T> &_v) {
if (_v.empty())
return _out;
_out << _v.front();
for (auto _it = ++_v.begin(); _it != _v.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T> inline istream &operator>>(istream &_in, vector<T> &_v) {
for (auto &_i : _v)
_in >> _i;
return _in;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const set<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const multiset<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_set<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T>
inline ostream &operator<<(ostream &_out, const unordered_multiset<T> &_s) {
if (_s.empty())
return _out;
_out << *_s.begin();
for (auto _it = ++_s.begin(); _it != _s.end(); ++_it)
_out << ' ' << *_it;
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const map<T, U> &_m) {
if (_m.empty())
return _out;
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
_out << ", (" << _it->first << ": " << _it->second << ')';
return _out;
}
template <typename T, typename U>
inline ostream &operator<<(ostream &_out, const unordered_map<T, U> &_m) {
if (_m.empty())
return _out;
_out << '(' << _m.begin()->first << ": " << _m.begin()->second << ')';
for (auto _it = ++_m.begin(); _it != _m.end(); ++_it)
_out << ", (" << _it->first << ": " << _it->second << ')';
return _out;
}
/*--------------------------------------------------IO_FILES-----------------------------------------------*/
const char *infile =
#ifdef LOCAL
"input.txt"
#else
""
#endif // LOCAL
;
const char *outfile =
#ifdef LOCAL
""
#else
""
#endif // LOCAL
;
/*-------------------------------------------------ALLOCATOR----------------------------------------------*/
// #define ALLOC_LOCAL
#ifdef ALLOC_LOCAL
const int ML_ = 450;
char mem_[ML_ * 1024 * 1024];
size_t _ptr = 0, _magic = 21323400;
void *operator new(size_t cnt) {
if (_ptr + cnt < sizeof mem_) {
_ptr += cnt;
return mem_ + _ptr - cnt;
} else {
assert(false);
_ptr = cnt + _magic;
return mem_ + _magic;
}
}
void operator delete(void *) {}
#endif // ALLOC_LOCAL
/*-----------------------------------------------------MATH------------------------------------------------*/
inline ll gcd(ll a, ll b) {
while (b) {
a %= b;
swap(a, b);
}
return a;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline int pwm(ll xx, ll pow, int MD) {
if (pow < 0) {
pow = pow % (MD - 1) + MD - 1;
}
ll mlt = 1;
while (pow) {
if (pow & 1) {
mlt *= xx;
mlt %= MD;
}
xx *= xx;
pow >>= 1;
xx %= MD;
}
return (int)mlt;
}
inline ll gcdex(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1;
y = 0;
return a;
}
ll xx, yy;
ll gc = gcdex(b, a % b, yy, xx);
x = xx;
y = yy - (a / b) * xx;
return gc;
}
inline int inv(ll r, int _mod) { return pwm(r % _mod, _mod - 2, _mod); }
/*-----------------------------------------------------CODE------------------------------------------------*/
int add(int a, int b) {
a += b;
if (a >= MOD)
a -= MOD;
return a;
}
int sub(int a, int b) {
a -= b;
if (a < 0)
a += MOD;
return a;
}
const int N = 2000 * 1000 + 57;
int fct[N], ifct[N];
int f(int n, int k) {
n += k;
// c(n + 2, k + 1)
return int(ll(fct[n + 2]) * ifct[k + 1] % MOD * ifct[n - k + 1] % MOD);
}
void solve() {
fct[0] = 1;
for (int i = 1; i < N; ++i) {
fct[i] = int(ll(fct[i - 1]) * i % MOD);
}
ifct[N - 1] = inv(fct[N - 1], MOD);
for (int i = N - 2; i >= 0; --i) {
ifct[i] = int(ll(ifct[i + 1]) * (i + 1) % MOD);
}
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
--r1;
--c1;
cout << add(sub(sub(f(r2, c2), f(r1, c2)), f(r2, c1)), f(r1, c1)) << endl;
}
int main() {
if (*infile != '\0')
(void)freopen(infile, "r", stdin);
if (*outfile != '\0')
(void)freopen(outfile, "w", stdout);
speedup;
coutdouble;
// int tst = 1;
// srand(time(NULL));
// cin >> tst;
// scanf("%d", &tst);
// while (tst-- > 0) {
// while(true) {
solve();
// if ((tst & 0xF) == 0) {
// cerr << "ok\n";
// }
// cerr << "/*-----------------*/\n";
// }
#ifdef LOCAL
cerr << "Time: " << (ld)clock() / CLOCKS_PER_SEC << endl;
while (true)
;
#endif // LOCAL
return 0;
} | replace | 264 | 265 | 264 | 265 | 0 | |
p02782 | C++ | Runtime Error | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
/*** MOD CALCULATION ***/
const int MOD = 1e9 + 7;
const int MAX = 1'000'005;
ll addM(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
ll mulM(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll powM(ll a, ll b) {
if (b == 0)
return 1;
else if (b == 1)
return a % MOD;
else if (b % 2 == 0)
return mulM(powM(a, b / 2), powM(a, b / 2));
else
return mulM(a, mulM(powM(a, (b - 1) / 2), powM(a, (b - 1) / 2)));
}
// b^{-1} = b^{p-2} (mod p)
// a/b = a*b^{p-2} (mod p)
ll divM(ll a, ll b) { return mulM(a, powM(b, MOD - 2)); }
// n!, (n!)^{-1} のテーブル作成
ll fac[MAX], finv[MAX], inv[MAX];
void COMBinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep3(i, 2, MAX - 1) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COMB(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*** MOD CALCULATION ここまで ***/
void Main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMBinit();
auto f = [&](int r, int c) { return COMB(r + c, r); };
auto g = [&](int r, int c) { return f(r + 1, c + 1); };
ll ans = addM(g(r2, c2), MOD - g(r2, c1 - 1));
ans = addM(ans, MOD - g(r1 - 1, c2));
ans = addM(ans, g(r1 - 1, c1 - 1));
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | #include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for (int(i) = 0; (i) < (n); (i)++)
#define rep3(i, m, n) for (int(i) = m; (i) <= (n); (i)++)
#define rep3rev(i, m, n) for (int(i) = m; (i) >= (n); (i)--)
#define all(a) (a.begin()), (a.end())
#define rall(a) (a.rbegin()), (a.rend())
#define fi first
#define se second
#define pb push_back
#define eb emplace_back
using ll = long long;
using vll = vector<ll>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using P = pair<int, int>;
/*** MOD CALCULATION ***/
const int MOD = 1e9 + 7;
const int MAX = 2'000'005;
ll addM(ll a, ll b) { return ((a % MOD) + (b % MOD)) % MOD; }
ll mulM(ll a, ll b) { return ((a % MOD) * (b % MOD)) % MOD; }
ll powM(ll a, ll b) {
if (b == 0)
return 1;
else if (b == 1)
return a % MOD;
else if (b % 2 == 0)
return mulM(powM(a, b / 2), powM(a, b / 2));
else
return mulM(a, mulM(powM(a, (b - 1) / 2), powM(a, (b - 1) / 2)));
}
// b^{-1} = b^{p-2} (mod p)
// a/b = a*b^{p-2} (mod p)
ll divM(ll a, ll b) { return mulM(a, powM(b, MOD - 2)); }
// n!, (n!)^{-1} のテーブル作成
ll fac[MAX], finv[MAX], inv[MAX];
void COMBinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
rep3(i, 2, MAX - 1) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
ll COMB(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
/*** MOD CALCULATION ここまで ***/
void Main() {
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMBinit();
auto f = [&](int r, int c) { return COMB(r + c, r); };
auto g = [&](int r, int c) { return f(r + 1, c + 1); };
ll ans = addM(g(r2, c2), MOD - g(r2, c1 - 1));
ans = addM(ans, MOD - g(r1 - 1, c2));
ans = addM(ans, g(r1 - 1, c1 - 1));
cout << ans << endl;
return;
}
int main() {
cin.tie(nullptr);
ios_base::sync_with_stdio(false);
cout << fixed << setprecision(15);
Main();
return 0;
} | replace | 22 | 23 | 22 | 23 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
#define dump(x) cerr << #x << ": " << x << endl;
#define bit(k) (1LL << (k))
#define Yes "Yes"
#define No "No"
#define YES "YES"
#define NO "NO"
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18 + 1;
const ll MOD = (ll)1e9 + 7;
const double PI = acos(-1.0);
/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/
struct mint {
long long x;
mint(long long _x = 0) : x((_x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint modpow(long long t) const {
if (!t)
return 1;
mint a = modpow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return modpow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
// constructor(initiation)
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint Comb(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
mint H(int n, int m) { return Comb(n + m, m); }
};
combination comb(1e6 + 1);
// (0, 0) ~ (a, b)までの和
// (2, 2)だったら、(3 + 3) C (3) - 1
mint f(int a, int b) { return comb.Comb(a + 1 + b + 1, a + 1) - 1; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = f(c, d) - f(a - 1, d) - f(c, b - 1) + f(a - 1, b - 1);
cout << ans.x << endl;
} | #include <bits/stdc++.h>
using namespace std;
#define rep(i, N) for (int i = 0; i < int(N); ++i)
#define rep1(i, N) for (int i = 1; i < int(N); ++i)
#define all(a) (a).begin(), (a).end()
#define print(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << _ << ", "; \
cerr << "]" << endl; \
}
#define printpair(v) \
{ \
cerr << #v << ": [ "; \
for (auto _ : v) \
cerr << "{" << _.first << "," << _.second << "}" \
<< ", "; \
cerr << "]" << endl; \
}
#define dump(x) cerr << #x << ": " << x << endl;
#define bit(k) (1LL << (k))
#define Yes "Yes"
#define No "No"
#define YES "YES"
#define NO "NO"
typedef long long ll;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
const int INF = (ll)1e9;
const ll INFLL = (ll)1e18 + 1;
const ll MOD = (ll)1e9 + 7;
const double PI = acos(-1.0);
/*
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const string dir = "DRUL";
*/
struct mint {
long long x;
mint(long long _x = 0) : x((_x % MOD + MOD) % MOD) {}
mint operator-() const { return mint(-x); }
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint modpow(long long t) const {
if (!t)
return 1;
mint a = modpow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime MOD
mint inv() const { return modpow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
struct combination {
vector<mint> fact, ifact;
// constructor(initiation)
combination(int n) : fact(n + 1), ifact(n + 1) {
assert(n < MOD);
fact[0] = 1;
for (int i = 1; i <= n; ++i)
fact[i] = fact[i - 1] * i;
ifact[n] = fact[n].inv();
for (int i = n; i >= 1; --i)
ifact[i - 1] = ifact[i] * i;
}
mint Comb(int n, int k) {
if (k < 0 || k > n)
return 0;
return fact[n] * ifact[k] * ifact[n - k];
}
mint H(int n, int m) { return Comb(n + m, m); }
};
combination comb(1e7 + 1);
// (0, 0) ~ (a, b)までの和
// (2, 2)だったら、(3 + 3) C (3) - 1
mint f(int a, int b) { return comb.Comb(a + 1 + b + 1, a + 1) - 1; }
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cout << fixed << setprecision(20);
int a, b, c, d;
cin >> a >> b >> c >> d;
mint ans = f(c, d) - f(a - 1, d) - f(c, b - 1) + f(a - 1, b - 1);
cout << ans.x << endl;
} | replace | 119 | 120 | 119 | 120 | 0 | |
p02782 | C++ | Runtime Error | #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
// 単純に範囲内の各座標の C を足すのは 10^6まで範囲があるので、 10^12
// で全くもってNG 工夫して計算量を抑える必要がある。 ある座標での経路総数を
// f(x,y) とすると f(a+1,b) = f(a,0) + f(a,1) + f(a,2) + ... + f(a,b) らしい。
// 3 ─〇 ← (a+1, 3)
// 2 ─┤
// 1 ─┤
// 0 ─┘
// a a+1
// となると、(a+1, 4) に行く経路は (a,0),(a,1),(a,2),(a,3) の合計になる。
// ということは求める長方形に上辺の各値を計算したら、その一つ左の列の縦全部を加算した値がわかる。
// 求める長方形の下辺の一個下の各値を計算して引いてやると、長方形の中身の合計がわかる。
// 上辺の各値の加算も、上記のxとyとが逆になった版と考えることができて、
// 上辺の右端+1
// までの合計値は、上辺の右端+1をさらに一個上に行った座標の値になる。
// よって範囲が 横 r1 ～ r2、縦 c1 ～ c2 なので、
// f(r2+1, c2+1) - f(r1, c2+1) - f(r2+1, c1) + f(r1+1,c1+1)
// で計算できる。
const int MAX = 1000005;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
// 前処理
COMinit();
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
// f(r2+1, c2+1) - f(r1, c2+1) - f(r2+1, c1) + f(r1+1,c1+1)
ll ans = (COM(r2 + 1 + c2 + 1, c2 + 1) + COM(r1 + c1, c1)) % MOD;
ans -= COM(r1 + c2 + 1, c2 + 1);
ans = (ans < 0) ? ans + MOD : ans;
ans -= COM(r2 + 1 + c1, c1);
ans = (ans < 0) ? ans + MOD : ans;
cout << ans << endl;
}
| #include <iostream>
#define REP(i, n) for (int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
// 単純に範囲内の各座標の C を足すのは 10^6まで範囲があるので、 10^12
// で全くもってNG 工夫して計算量を抑える必要がある。 ある座標での経路総数を
// f(x,y) とすると f(a+1,b) = f(a,0) + f(a,1) + f(a,2) + ... + f(a,b) らしい。
// 3 ─〇 ← (a+1, 3)
// 2 ─┤
// 1 ─┤
// 0 ─┘
// a a+1
// となると、(a+1, 4) に行く経路は (a,0),(a,1),(a,2),(a,3) の合計になる。
// ということは求める長方形に上辺の各値を計算したら、その一つ左の列の縦全部を加算した値がわかる。
// 求める長方形の下辺の一個下の各値を計算して引いてやると、長方形の中身の合計がわかる。
// 上辺の各値の加算も、上記のxとyとが逆になった版と考えることができて、
// 上辺の右端+1
// までの合計値は、上辺の右端+1をさらに一個上に行った座標の値になる。
// よって範囲が 横 r1 ～ r2、縦 c1 ～ c2 なので、
// f(r2+1, c2+1) - f(r1, c2+1) - f(r2+1, c1) + f(r1+1,c1+1)
// で計算できる。
const int MAX = 2000005;
const int MOD = 1000000007;
long long fac[MAX], finv[MAX], inv[MAX];
// テーブルを作る前処理
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % MOD;
inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
finv[i] = finv[i - 1] * inv[i] % MOD;
}
}
// 二項係数計算
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;
}
int main() {
// 前処理
COMinit();
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
// f(r2+1, c2+1) - f(r1, c2+1) - f(r2+1, c1) + f(r1+1,c1+1)
ll ans = (COM(r2 + 1 + c2 + 1, c2 + 1) + COM(r1 + c1, c1)) % MOD;
ans -= COM(r1 + c2 + 1, c2 + 1);
ans = (ans < 0) ? ans + MOD : ans;
ans -= COM(r2 + 1 + c1, c1);
ans = (ans < 0) ? ans + MOD : ans;
cout << ans << endl;
}
| replace | 23 | 24 | 23 | 24 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
const ll MOD = 1e+9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x(x % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
const int NMAX = 1000010;
mint fact[NMAX], infac[NMAX];
void Make_Fact() {
fact[0] = fact[1] = 1;
for (int i = 2; i <= NMAX - 1; ++i) {
fact[i] = fact[i - 1] * (mint)i;
}
}
void Make_InvFact() {
infac[0] = infac[1] = 1;
for (int i = 2; i <= NMAX - 1; ++i) {
infac[i] = infac[i - 1] / (mint)i;
}
}
mint Comb(int n, int k) {
if (n < 0 || k < 0 || n - k < 0)
return 0;
return fact[n] * infac[k] * infac[n - k];
}
mint g(int a, int b) {
mint res;
for (int i = 1; i <= b + 1; ++i) {
res += Comb(a + i, a);
}
return res;
}
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
Make_Fact();
Make_InvFact();
mint res = g(r2, c2) - g(r1 - 1, c2) - g(r2, c1 - 1) + g(r1 - 1, c1 - 1);
cout << res.x << "\n";
return 0;
}
| #include <algorithm>
#include <iostream>
#include <vector>
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep1(i, n) for (int i = 1; i <= n; ++i)
using namespace std;
typedef long long ll;
const ll MOD = 1e+9 + 7;
struct mint {
ll x;
mint(ll x = 0) : x(x % MOD) {}
mint &operator+=(const mint a) {
if ((x += a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator-=(const mint a) {
if ((x += MOD - a.x) >= MOD)
x -= MOD;
return *this;
}
mint &operator*=(const mint a) {
(x *= a.x) %= MOD;
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint pow(ll t) const {
if (!t)
return 1;
mint a = pow(t >> 1);
a *= a;
if (t & 1)
a *= *this;
return a;
}
// for prime mod
mint inv() const { return pow(MOD - 2); }
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
};
const int NMAX = 2000010;
mint fact[NMAX], infac[NMAX];
void Make_Fact() {
fact[0] = fact[1] = 1;
for (int i = 2; i <= NMAX - 1; ++i) {
fact[i] = fact[i - 1] * (mint)i;
}
}
void Make_InvFact() {
infac[0] = infac[1] = 1;
for (int i = 2; i <= NMAX - 1; ++i) {
infac[i] = infac[i - 1] / (mint)i;
}
}
mint Comb(int n, int k) {
if (n < 0 || k < 0 || n - k < 0)
return 0;
return fact[n] * infac[k] * infac[n - k];
}
mint g(int a, int b) {
mint res;
for (int i = 1; i <= b + 1; ++i) {
res += Comb(a + i, a);
}
return res;
}
int main() {
int r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
Make_Fact();
Make_InvFact();
mint res = g(r2, c2) - g(r1 - 1, c2) - g(r2, c1 - 1) + g(r1 - 1, c1 - 1);
cout << res.x << "\n";
return 0;
}
| replace | 55 | 56 | 55 | 56 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
*/
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b) {
double ax = a.first, ay = a.second, bx = b.first, by = b.second;
return atan2(by - ay, bx - ax);
}
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
// const int mod = 1000000007;
const int MAX = 1000005;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll g(int r, int c) {
ll res = 0;
for (int i = 1; i <= r + 1; ++i) {
res += COM(i + c, i);
chmod(res);
}
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
ans += g(r2, c2);
chmod(ans);
ans -= g(r2, c1 - 1);
chmod(ans);
ans -= g(r1 - 1, c2);
chmod(ans);
ans += g(r1 - 1, c1 - 1);
chmod(ans);
cout << ans << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
#define reprrev(i, a, b) for (int i = b - 1; i >= a; i--) // [a, b)
#define reprev(i, n) reprrev(i, 0, n)
typedef long long ll;
typedef unsigned long long ull;
template <class T> inline bool chmax(T &a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
template <class T> inline bool chmin(T &a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
/* attention
long longのシフト演算には気をつけよう
タイポした時のデバッグが死ぬほどきつくなるので変数名は最低3字くらい使った方がいいかも
*/
const ll mod = 1e9 + 7;
void chmod(ll &M) {
if (M >= mod)
M %= mod;
else if (M < 0) {
M += (abs(M) / mod + 1) * mod;
M %= mod;
}
}
ll modpow(ll x, ll n) {
if (n == 0)
return 1;
ll res = modpow(x, n / 2);
if (n % 2 == 0)
return res * res % mod;
else
return res * res % mod * x % mod;
}
int getl(int i, int N) { return i == 0 ? N - 1 : i - 1; };
int getr(int i, int N) { return i == N - 1 ? 0 : i + 1; };
// 線分 ab の偏角 返り値は[-π, π]
double argument(const pair<double, double> &a, const pair<double, double> &b) {
double ax = a.first, ay = a.second, bx = b.first, by = b.second;
return atan2(by - ay, bx - ax);
}
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
/* <----------------------------------------------------------------------------------->
*/
// const int mod = 1000000007;
const int MAX = 20000005;
long long fac[MAX], finv[MAX], inv[MAX];
void COMinit() {
fac[0] = fac[1] = 1;
finv[0] = finv[1] = 1;
inv[1] = 1;
for (int i = 2; i < MAX; i++) {
fac[i] = fac[i - 1] * i % mod;
inv[i] = mod - inv[mod % i] * (mod / i) % mod;
finv[i] = finv[i - 1] * inv[i] % mod;
}
}
long long COM(int n, int k) {
if (n < k)
return 0;
if (n < 0 || k < 0)
return 0;
return fac[n] * (finv[k] * finv[n - k] % mod) % mod;
}
ll g(int r, int c) {
ll res = 0;
for (int i = 1; i <= r + 1; ++i) {
res += COM(i + c, i);
chmod(res);
}
return res;
}
int main() {
cin.tie(nullptr);
ios::sync_with_stdio(false);
int r1, c1, r2, c2;
cin >> r1 >> c1 >> r2 >> c2;
COMinit();
ll ans = 0;
ans += g(r2, c2);
chmod(ans);
ans -= g(r2, c1 - 1);
chmod(ans);
ans -= g(r1 - 1, c2);
chmod(ans);
ans += g(r1 - 1, c1 - 1);
chmod(ans);
cout << ans << endl;
return 0;
} | replace | 69 | 70 | 69 | 70 | 0 | |
p02782 | C++ | Runtime Error | #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// priority_queue<int,vector<int>, greater<int> > q2;
ll comb(ll N_, ll C_) {
const int NUM_ = 1000001;
static ll fact[1000002], factr[1000002], inv[1000002];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % mod, factr[i] = factr[i - 1] * inv[i] % mod;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % mod * factr[N_ - C_] % mod;
}
ll modpow(ll a, ll n = mod - 2) {
ll r = 1;
while (n)
r = r * ((n % 2) ? a : 1) % mod, a = a * a % mod, n >>= 1;
return r;
}
int solve(int x, int y) {
// cout << x << " " << y << endl;
int res = 0;
y += x;
y++;
while (y > x) {
res += comb(y--, x);
res %= mod;
}
// cout << res << endl;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
int ans = solve(c, d);
ans -= solve(a, d);
ans = (ans + mod) % mod;
ans -= solve(c, b);
ans = (ans + mod) % mod;
ans += solve(a, b);
ans %= mod;
cout << ans << endl;
return 0;
}
| #include <algorithm>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
using namespace std;
typedef long long ll;
#define int long long
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template <class T> bool chmax(T &a, const T &b) {
if (a < b) {
a = b;
return 1;
}
return 0;
}
template <class T> bool chmin(T &a, const T &b) {
if (b < a) {
a = b;
return 1;
}
return 0;
}
#define fore(i, a) for (auto &i : a)
#define REP(i, n) for (int i = 0; i < n; i++)
#define eREP(i, n) for (int i = 0; i <= n; i++)
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
#define eFOR(i, a, b) for (int i = (a); i <= (b); ++i)
#define SORT(c) sort((c).begin(), (c).end())
#define rSORT(c) sort((c).rbegin(), (c).rend())
#define LB(x, a) lower_bound((x).begin(), (x).end(), (a))
#define UB(x, a) upper_bound((x).begin(), (x).end(), (a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
// priority_queue<int,vector<int>, greater<int> > q2;
ll comb(ll N_, ll C_) {
const int NUM_ = 2000010;
static ll fact[2000020], factr[2000020], inv[2000020];
if (fact[0] == 0) {
inv[1] = fact[0] = factr[0] = 1;
for (int i = 2; i <= NUM_; ++i)
inv[i] = inv[mod % i] * (mod - mod / i) % mod;
for (int i = 1; i <= NUM_; ++i)
fact[i] = fact[i - 1] * i % mod, factr[i] = factr[i - 1] * inv[i] % mod;
}
if (C_ < 0 || C_ > N_)
return 0;
return factr[C_] * fact[N_] % mod * factr[N_ - C_] % mod;
}
ll modpow(ll a, ll n = mod - 2) {
ll r = 1;
while (n)
r = r * ((n % 2) ? a : 1) % mod, a = a * a % mod, n >>= 1;
return r;
}
int solve(int x, int y) {
// cout << x << " " << y << endl;
int res = 0;
y += x;
y++;
while (y > x) {
res += comb(y--, x);
res %= mod;
}
// cout << res << endl;
return res;
}
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int a, b, c, d;
cin >> a >> b >> c >> d;
a--;
b--;
int ans = solve(c, d);
ans -= solve(a, d);
ans = (ans + mod) % mod;
ans -= solve(c, b);
ans = (ans + mod) % mod;
ans += solve(a, b);
ans %= mod;
cout << ans << endl;
return 0;
}
| replace | 46 | 48 | 46 | 48 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const int N = 1000000 + 10;
const int MOD = 1000000007;
int f[N], fr[N], p[N];
int exp(int x, int n) {
int tmp;
if (n == 0)
return 1;
tmp = exp(x, n / 2);
tmp = 1LL * tmp * tmp % MOD;
if (n % 2)
tmp = 1LL * tmp * x % MOD;
return tmp;
}
int calc(int n, int m) { return 1LL * f[n] * fr[m] % MOD * fr[n - m] % MOD; }
int main() {
int res, r1, c1, r2, c2, n, m, a, b, i, j;
cin >> r1 >> c1 >> r2 >> c2;
n = r2 + c2 + 2;
f[0] = fr[0] = p[0] = 1;
for (i = 1; i <= n; i++) {
f[i] = 1LL * f[i - 1] * i % MOD;
fr[i] = exp(f[i], MOD - 2);
p[i] = p[i - 1] * 2LL % MOD;
}
a = (calc(r2 + c2 + 2, r2 + 1) + calc(r1 + c1, r1)) % MOD;
b = (calc(r1 + c2 + 1, r1) + calc(r2 + c1 + 1, c1)) % MOD;
res = ((a - b) % MOD + MOD) % MOD;
cout << res << endl;
return 0;
} | #include <bits/stdc++.h>
using namespace std;
typedef long long lli;
const int N = 2000000 + 10;
const int MOD = 1000000007;
int f[N], fr[N], p[N];
int exp(int x, int n) {
int tmp;
if (n == 0)
return 1;
tmp = exp(x, n / 2);
tmp = 1LL * tmp * tmp % MOD;
if (n % 2)
tmp = 1LL * tmp * x % MOD;
return tmp;
}
int calc(int n, int m) { return 1LL * f[n] * fr[m] % MOD * fr[n - m] % MOD; }
int main() {
int res, r1, c1, r2, c2, n, m, a, b, i, j;
cin >> r1 >> c1 >> r2 >> c2;
n = r2 + c2 + 2;
f[0] = fr[0] = p[0] = 1;
for (i = 1; i <= n; i++) {
f[i] = 1LL * f[i - 1] * i % MOD;
fr[i] = exp(f[i], MOD - 2);
p[i] = p[i - 1] * 2LL % MOD;
}
a = (calc(r2 + c2 + 2, r2 + 1) + calc(r1 + c1, r1)) % MOD;
b = (calc(r1 + c2 + 1, r1) + calc(r2 + c1 + 1, c1)) % MOD;
res = ((a - b) % MOD + MOD) % MOD;
cout << res << endl;
return 0;
} | replace | 6 | 7 | 6 | 7 | 0 | |
p02782 | C++ | Runtime Error | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long)(1e9 + 7)
#define MAX 500000
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ans(1), mul(x);
while (n) {
if (n & 1)
ans *= mul;
mul *= mul;
n >>= 1;
}
return ans;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
struct Combination {
vector<ModInt<MOD>> _fact, _rfact, _inv;
Combination(long long nsize = MAX)
: _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {
_fact[0] = _rfact[nsize] = _inv[0] = 1;
for (int i = 1; i <= nsize; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[nsize] /= _fact[nsize];
for (int i = nsize - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= nsize; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline ModInt<MOD> fact(int k) const { return _fact[k]; }
inline ModInt<MOD> rfact(int k) const { return _rfact[k]; }
inline ModInt<MOD> inv(int k) const { return _inv[k]; }
ModInt<MOD> P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
ModInt<MOD> C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
ModInt<MOD> H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
long long r1, r2, c1, c2;
Combination com;
ModInt<MOD> solve();
int main() {
cin >> r1 >> c1 >> r2 >> c2;
cout << solve() << endl;
return 0;
}
ModInt<MOD> solve() {
ModInt<MOD> res = 0;
for (int i = r1; i <= r2; ++i)
res += com.C(c2 + i + 1, i + 1) - com.C(c1 - 1 + i + 1, i + 1);
return res;
} | #include <bits/stdc++.h>
using namespace std;
#define MOD (long long)(1e9 + 7)
#define MAX 5000000
template <int mod> struct ModInt {
int x;
ModInt() : x(0) {}
ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}
ModInt &operator+=(const ModInt &p) {
if ((x += p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator-=(const ModInt &p) {
if ((x += mod - p.x) >= mod)
x -= mod;
return *this;
}
ModInt &operator*=(const ModInt &p) {
x = (int)(1LL * x * p.x % mod);
return *this;
}
ModInt &operator/=(const ModInt &p) {
*this *= p.inverse();
return *this;
}
ModInt operator-() const { return ModInt(-x); }
ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
bool operator==(const ModInt &p) const { return x == p.x; }
bool operator!=(const ModInt &p) const { return x != p.x; }
ModInt inverse() const {
int a = x, b = mod, u = 1, v = 0, t;
while (b > 0) {
t = a / b;
swap(a -= t * b, b);
swap(u -= t * v, v);
}
return ModInt(u);
}
ModInt pow(int64_t n) const {
ModInt ans(1), mul(x);
while (n) {
if (n & 1)
ans *= mul;
mul *= mul;
n >>= 1;
}
return ans;
}
friend ostream &operator<<(ostream &os, const ModInt &p) { return os << p.x; }
friend istream &operator>>(istream &is, ModInt &a) {
int64_t t;
is >> t;
a = ModInt<mod>(t);
return (is);
}
static int get_mod() { return mod; }
};
struct Combination {
vector<ModInt<MOD>> _fact, _rfact, _inv;
Combination(long long nsize = MAX)
: _fact(nsize + 1), _rfact(nsize + 1), _inv(nsize + 1) {
_fact[0] = _rfact[nsize] = _inv[0] = 1;
for (int i = 1; i <= nsize; i++)
_fact[i] = _fact[i - 1] * i;
_rfact[nsize] /= _fact[nsize];
for (int i = nsize - 1; i >= 0; i--)
_rfact[i] = _rfact[i + 1] * (i + 1);
for (int i = 1; i <= nsize; i++)
_inv[i] = _rfact[i] * _fact[i - 1];
}
inline ModInt<MOD> fact(int k) const { return _fact[k]; }
inline ModInt<MOD> rfact(int k) const { return _rfact[k]; }
inline ModInt<MOD> inv(int k) const { return _inv[k]; }
ModInt<MOD> P(int n, int r) const {
if (r < 0 || n < r)
return 0;
return fact(n) * rfact(n - r);
}
ModInt<MOD> C(int p, int q) const {
if (q < 0 || p < q)
return 0;
return fact(p) * rfact(q) * rfact(p - q);
}
ModInt<MOD> H(int n, int r) const {
if (n < 0 || r < 0)
return (0);
return r == 0 ? 1 : C(n + r - 1, r);
}
};
long long r1, r2, c1, c2;
Combination com;
ModInt<MOD> solve();
int main() {
cin >> r1 >> c1 >> r2 >> c2;
cout << solve() << endl;
return 0;
}
ModInt<MOD> solve() {
ModInt<MOD> res = 0;
for (int i = r1; i <= r2; ++i)
res += com.C(c2 + i + 1, i + 1) - com.C(c1 - 1 + i + 1, i + 1);
return res;
} | replace | 4 | 5 | 4 | 5 | 0 | |
p02782 | C++ | Time Limit Exceeded | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pci pair<char, int>
#define ppll pair<pll, pll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mll map<ll, ll>
#define fastmap gp_hash_table
#define cd complex<double>
#define vcd vector<cd>
#define PI 3.14159265358979
#pragma 03
using namespace std;
using namespace __gnu_pbds;
ll inv[3000005], fact[3000005], invfact[3000005];
ll mod = 1e9 + 7;
ll nck(ll n, ll k) { return fact[n] * invfact[k] % mod * invfact[n - k] % mod; }
ll binpow(ll a, ll b) {
if (b == 0)
return 1;
ll x = binpow(a, b / 2);
x *= x;
x %= mod;
if (b % 2)
return (a * x) % mod;
else
return x;
}
ll bindiv(ll a, ll b) { return a * binpow(b, mod - 2) % mod; }
int main() {
inv[1] = 1;
for (ll i = 2; i < 3000005; i++)
inv[i] = bindiv(1LL, i);
fact[0] = invfact[0] = 1;
for (ll i = 1; i < 3000005; i++) {
fact[i] = fact[i - 1] * i % mod;
invfact[i] = invfact[i - 1] * inv[i] % mod;
}
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << ((nck(r2 + c2 + 2, c2 + 1) - nck(r1 + c2 + 1, c2 + 1) -
nck(r2 + c1 + 1, c1) + nck(r1 + c1, c1)) %
mod +
mod) %
mod;
return 0;
} | #include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#define fastio \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define pci pair<char, int>
#define ppll pair<pll, pll>
#define vll vector<ll>
#define vvll vector<vll>
#define vpll vector<pll>
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define mll map<ll, ll>
#define fastmap gp_hash_table
#define cd complex<double>
#define vcd vector<cd>
#define PI 3.14159265358979
#pragma 03
using namespace std;
using namespace __gnu_pbds;
ll inv[3000005], fact[3000005], invfact[3000005];
ll mod = 1e9 + 7;
ll nck(ll n, ll k) { return fact[n] * invfact[k] % mod * invfact[n - k] % mod; }
ll binpow(ll a, ll b) {
if (b == 0)
return 1;
ll x = binpow(a, b / 2);
x *= x;
x %= mod;
if (b % 2)
return (a * x) % mod;
else
return x;
}
ll bindiv(ll a, ll b) { return a * binpow(b, mod - 2) % mod; }
int main() {
inv[1] = 1;
for (ll i = 2; i < 3000005; i++)
inv[i] = mod - mod / i * inv[mod % i] % mod;
fact[0] = invfact[0] = 1;
for (ll i = 1; i < 3000005; i++) {
fact[i] = fact[i - 1] * i % mod;
invfact[i] = invfact[i - 1] * inv[i] % mod;
}
ll r1, r2, c1, c2;
cin >> r1 >> c1 >> r2 >> c2;
cout << ((nck(r2 + c2 + 2, c2 + 1) - nck(r1 + c2 + 1, c2 + 1) -
nck(r2 + c1 + 1, c1) + nck(r1 + c1, c1)) %
mod +
mod) %
mod;
return 0;
} | replace | 46 | 47 | 46 | 47 | TLE |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.