結果
| 問題 |
No.749 クエリ全部盛り
|
| コンテスト | |
| ユーザー |
 Ricky_pon
|
| 提出日時 | 2020-09-19 11:24:14 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 504 ms / 3,000 ms |
| コード長 | 10,650 bytes |
| コンパイル時間 | 2,230 ms |
| コンパイル使用メモリ | 209,368 KB |
| 最終ジャッジ日時 | 2025-01-14 18:41:37 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 20 |
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:410:24: warning: format ‘%lld’ expects argument of type ‘long long int’, but argument 2 has type ‘modint<1000000007>::i64’ {aka ‘long int’} [-Wformat=]
410 | printf("%lld\n", (lst.prod(l, r).sum * k).a);
| ~~~^ ~~~~~~~~~~~~~~~~~~~~~~~~~~
| | |
| long long int modint<1000000007>::i64 {aka long int}
| %ld
main.cpp:389:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
389 | scanf("%d%d", &n, &q);
| ~~~~~^~~~~~~~~~~~~~~~
main.cpp:407:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
407 | scanf("%d%d%d%d", &t, &l, &r, &k);
| ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>
#define For(i, a, b) for (int(i) = (int)(a); (i) < (int)(b); ++(i))
#define rFor(i, a, b) for (int(i) = (int)(a)-1; (i) >= (int)(b); --(i))
#define rep(i, n) For((i), 0, (n))
#define rrep(i, n) rFor((i), (n), 0)
#define fi first
#define se second
using namespace std;
typedef long long lint;
typedef unsigned long long ulint;
typedef pair<int, int> pii;
typedef pair<lint, lint> pll;
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;
}
template <class T>
T div_floor(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a >= 0 ? a / b : (a + 1) / b - 1;
}
template <class T>
T div_ceil(T a, T b) {
if (b < 0) a *= -1, b *= -1;
return a > 0 ? (a - 1) / b + 1 : a / b;
}
constexpr lint mod = 1000000007;
constexpr lint INF = mod * mod;
constexpr int MAX = 1000010;
#ifndef ATCODER_INTERNAL_BITOP_HPP
#define ATCODER_INTERNAL_BITOP_HPP 1
#ifdef _MSC_VER
#include <intrin.h>
#endif
namespace atcoder {
namespace internal {
// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
int x = 0;
while ((1U << x) < (unsigned int)(n)) x++;
return x;
}
// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
} // namespace internal
} // namespace atcoder
#endif // ATCODER_INTERNAL_BITOP_HPP
#ifndef ATCODER_LAZYSEGTREE_HPP
#define ATCODER_LAZYSEGTREE_HPP 1
namespace atcoder {
template <class S, S (*op)(S, S), S (*e)(), class F, S (*mapping)(F, S),
F (*composition)(F, F), F (*id)()>
struct lazy_segtree {
public:
lazy_segtree() : lazy_segtree(0) {}
lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
lazy_segtree(const std::vector<S> &v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
lz = std::vector<F>(size, id());
for (int i = 0; i < _n; i++) d[size + i] = v[i];
for (int i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(int p, S x) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--) push(p >> i);
d[p] = x;
for (int i = 1; i <= log; i++) update(p >> i);
}
S get(int p) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--) push(p >> i);
return d[p];
}
S prod(int l, int r) {
assert(0 <= l && l <= r && r <= _n);
if (l == r) return e();
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push(r >> i);
}
S sml = e(), smr = e();
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
void apply(int p, F f) {
assert(0 <= p && p < _n);
p += size;
for (int i = log; i >= 1; i--) push(p >> i);
d[p] = mapping(f, d[p]);
for (int i = 1; i <= log; i++) update(p >> i);
}
void apply(int l, int r, F f) {
assert(0 <= l && l <= r && r <= _n);
if (l == r) return;
l += size;
r += size;
for (int i = log; i >= 1; i--) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push((r - 1) >> i);
}
{
int l2 = l, r2 = r;
while (l < r) {
if (l & 1) all_apply(l++, f);
if (r & 1) all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (int i = 1; i <= log; i++) {
if (((l >> i) << i) != l) update(l >> i);
if (((r >> i) << i) != r) update((r - 1) >> i);
}
}
template <bool (*g)(S)>
int max_right(int l) {
return max_right(l, [](S x) { return g(x); });
}
template <class G>
int max_right(int l, G g) {
assert(0 <= l && l <= _n);
assert(g(e()));
if (l == _n) return _n;
l += size;
for (int i = log; i >= 1; i--) push(l >> i);
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!g(op(sm, d[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (g(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*g)(S)>
int min_left(int r) {
return min_left(r, [](S x) { return g(x); });
}
template <class G>
int min_left(int r, G g) {
assert(0 <= r && r <= _n);
assert(g(e()));
if (r == 0) return 0;
r += size;
for (int i = log; i >= 1; i--) push((r - 1) >> i);
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!g(op(d[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (g(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
int _n, size, log;
std::vector<S> d;
std::vector<F> lz;
void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
void all_apply(int k, F f) {
d[k] = mapping(f, d[k]);
if (k < size) lz[k] = composition(f, lz[k]);
}
void push(int k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
} // namespace atcoder
#endif // ATCODER_LAZYSEGTREE_HPP
template <int_fast64_t MOD>
struct modint {
using i64 = int_fast64_t;
i64 a;
modint(const i64 a_ = 0) : a(a_) {
if (a > MOD)
a %= MOD;
else if (a < 0)
(a %= MOD) += MOD;
}
modint inv() {
i64 t = 1, n = MOD - 2, x = a;
while (n) {
if (n & 1) (t *= x) %= MOD;
(x *= x) %= MOD;
n >>= 1;
}
modint ret(t);
return ret;
}
bool operator==(const modint x) const { return a == x.a; }
bool operator!=(const modint x) const { return a != x.a; }
modint operator+(const modint x) const { return modint(*this) += x; }
modint operator-(const modint x) const { return modint(*this) -= x; }
modint operator*(const modint x) const { return modint(*this) *= x; }
modint operator/(const modint x) const { return modint(*this) /= x; }
modint operator^(const lint x) const { return modint(*this) ^= x; }
modint &operator+=(const modint &x) {
a += x.a;
if (a >= MOD) a -= MOD;
return *this;
}
modint &operator-=(const modint &x) {
a -= x.a;
if (a < 0) a += MOD;
return *this;
}
modint &operator*=(const modint &x) {
(a *= x.a) %= MOD;
return *this;
}
modint &operator/=(modint x) {
(a *= x.inv().a) %= MOD;
return *this;
}
modint &operator^=(lint n) {
i64 ret = 1;
while (n) {
if (n & 1) (ret *= a) %= MOD;
(a *= a) %= MOD;
n >>= 1;
}
a = ret;
return *this;
}
modint operator-() const { return modint(0) - *this; }
modint &operator++() { return *this += 1; }
modint &operator--() { return *this -= 1; }
bool operator<(const modint x) const { return a < x.a; }
};
using mint = modint<1000000007>;
vector<mint> fact;
vector<mint> revfact;
void setfact(int n) {
fact.resize(n + 1);
revfact.resize(n + 1);
fact[0] = 1;
rep(i, n) fact[i + 1] = fact[i] * mint(i + 1);
revfact[n] = fact[n].inv();
for (int i = n - 1; i >= 0; i--) revfact[i] = revfact[i + 1] * mint(i + 1);
}
mint getC(int n, int r) {
if (n < r) return 0;
return fact[n] * revfact[r] * revfact[n - r];
}
struct monoid {
mint sum, len, fib;
static monoid op(monoid lhs, monoid rhs) {
return {lhs.sum + rhs.sum, lhs.len + rhs.len, lhs.fib + rhs.fib};
}
static monoid e() { return {0, 0, 0}; }
};
struct op_monoid {
mint chval, add, fib, mul;
bool ch;
static monoid mapping(op_monoid lhs, monoid rhs) {
if (lhs.ch)
rhs.sum = lhs.chval * rhs.len;
else
rhs.sum *= lhs.mul;
rhs.sum += lhs.add * rhs.len;
rhs.sum += rhs.fib * lhs.fib;
return rhs;
}
static op_monoid composition(op_monoid lhs, op_monoid rhs) {
if (lhs.ch)
return lhs;
else {
rhs.chval *= lhs.mul;
rhs.add *= lhs.mul;
rhs.fib *= lhs.mul;
rhs.add += lhs.add;
rhs.fib += lhs.fib;
rhs.mul *= lhs.mul;
return rhs;
}
}
static op_monoid id() { return {0, 0, 0, 1, false}; }
};
using namespace atcoder;
int main() {
int n, q;
scanf("%d%d", &n, &q);
vector<monoid> a(n);
rep(i, n) {
a[i].sum = 0;
a[i].len = 1;
if (i == 0)
a[i].fib = 0;
else if (i == 1)
a[i].fib = 1;
else
a[i].fib = a[i - 1].fib + a[i - 2].fib;
}
lazy_segtree<monoid, monoid::op, monoid::e, op_monoid, op_monoid::mapping,
op_monoid::composition, op_monoid::id>
lst(a);
rep(_, q) {
int t, l, r, k;
scanf("%d%d%d%d", &t, &l, &r, &k);
++r;
if (t == 0)
printf("%lld\n", (lst.prod(l, r).sum * k).a);
else if (t == 1)
lst.apply(l, r, {k, 0, 0, 1, true});
else if (t == 2)
lst.apply(l, r, {0, k, 0, 1, false});
else if (t == 3)
lst.apply(l, r, {0, 0, 0, k, false});
else
lst.apply(l, r, {0, 0, k, 1, false});
}
}