結果
| 問題 |
No.2395 区間二次変換一点取得
|
| コンテスト | |
| ユーザー |
 iiljj
|
| 提出日時 | 2023-07-28 22:03:25 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 93 ms / 2,000 ms |
| コード長 | 15,063 bytes |
| コンパイル時間 | 1,358 ms |
| コンパイル使用メモリ | 140,756 KB |
| 最終ジャッジ日時 | 2025-02-15 20:25:37 |
|
ジャッジサーバーID （参考情報） |
judge3 / judge5 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| other | AC * 20 |
ソースコード
/* #region Head */
// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath> // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;
#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))
#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c) \
sort(ALL(c)); \
for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))
#define endl '\n'
constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;
template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
for (T &x : vec) is >> x;
return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
os << "{";
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
return os;
}
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
REP(i, 0, SIZE(arr)) is >> arr[i];
return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
os << "{";
REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
os << "}";
return os;
}
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
is >> pair_var.first >> pair_var.second;
return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
os << "(" << pair_var.first << ", " << pair_var.second << ")";
return os;
}
// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
os << "{";
REPI(itr, map_var) {
os << *itr;
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
os << "{";
REPI(itr, map_var) {
auto [key, value] = *itr;
os << "(" << key << ", " << value << ")";
auto itrcp = itr;
if (++itrcp != map_var.end()) os << ", ";
}
os << "}";
return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
pq<T> pq_cp(pq_var);
os << "{";
if (!pq_cp.empty()) {
os << pq_cp.top(), pq_cp.pop();
while (!pq_cp.empty()) os << ", " << pq_cp.top(), pq_cp.pop();
}
return os << "}";
}
// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
os << get<N>(a);
if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
os << ' ';
} else if constexpr (end_line) {
os << '\n';
}
return operator<< <N + 1, end_line>(os, a);
}
return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(std::cout, a); }
void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
std::cout << head;
if (sizeof...(Tail) > 0) std::cout << ' ';
pprint(move(tail)...);
}
// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(move(tail)...);
}
// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
if (comp(xmax, x)) {
xmax = x;
return true;
}
return false;
}
// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
if (comp(x, xmin)) {
xmin = x;
return true;
}
return false;
}
// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif
#ifndef MYLOCAL
#undef DEBUG_
#endif
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
#define VAR(type, ...) \
type __VA_ARGS__; \
assert((std::cin >> __VA_ARGS__));
template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }
struct AtCoderInitialize {
static constexpr int IOS_PREC = 15;
static constexpr bool AUTOFLUSH = false;
AtCoderInitialize() {
ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
std::cout << fixed << setprecision(IOS_PREC);
if (AUTOFLUSH) std::cout << unitbuf;
}
} ATCODER_INITIALIZE;
void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }
template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
for (int i = 0; i < ISIZE(v); ++i) v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
for (int i = 0; i < ISIZE(v); ++i) v[i]++;
}
/* #endregion */
// #include <atcoder/all>
// using namespace atcoder;
/* #region mint2 */
// 自動で mod を取る整数 (mod を動的に決める版)
struct mint {
ll mod;
ll x;
mint(ll mod, ll x) : mod(mod), x((x % mod + mod) % mod) {}
// mint(const mint &another) : mod(another.mod), x(another.x) {}
mint() : mod(0), x(0) {}
mint &operator+=(const mint a) {
assert(a.mod == mod);
if ((x += a.x) >= mod) x -= mod;
return *this;
}
mint &operator+=(const ll a) {
if ((x += a % mod) >= mod) x -= mod;
return *this;
}
mint &operator-=(const mint a) {
assert(a.mod == mod);
if ((x += mod - a.x) >= mod) x -= mod;
return *this;
}
mint &operator-=(const ll a) {
if ((x += mod - (a % mod)) >= mod) x -= mod;
return *this;
}
mint &operator*=(const mint a) {
assert(a.mod == mod);
(x *= a.x) %= mod;
return *this;
}
mint &operator*=(const ll a) {
// (x *= a % mod) %= mod;
*this *= mint(mod, a);
return *this;
}
mint operator+(const mint a) const {
mint res(*this);
return res += a;
}
mint operator+(const ll a) const {
mint res(*this);
return res += a;
}
mint operator-(const mint a) const {
mint res(*this);
return res -= a;
}
mint operator-(const ll a) const {
mint res(*this);
return res -= a;
}
mint operator*(const mint a) const {
mint res(*this);
return res *= a;
}
mint operator*(const ll a) const {
mint res(*this);
return res *= a;
}
// O(log(t))
mint pow(ll t) const {
if (!t) return mint(mod, 1);
mint a = pow(t >> 1); // ⌊t/2⌋ 乗
a *= a; // ⌊t/2⌋*2 乗
if (t & 1) // ⌊t/2⌋*2 == t-1 のとき
a *= *this; // ⌊t/2⌋*2+1 乗 => t 乗
return a;
}
// for prime mod
mint inv_prime() const {
return pow(mod - 2); // オイラーの定理から， x^(-1) ≡ x^(p-2)
}
mint inv() const {
ll a = this->x, b = mod, u = 1, v = 0, t;
// mint res;
while (b) {
t = a / b;
a -= t * b;
swap(a, b);
u -= t * v;
swap(u, v);
}
if (u < 0) u += mod;
mint res(mod, u);
return res;
}
mint &operator/=(const mint a) { return (*this) *= a.inv(); }
mint &operator/=(const ll a) { return (*this) *= mint(mod, a).inv(); }
mint operator/(const mint a) const {
mint res(*this);
return res /= a;
}
mint operator/(const ll a) const {
mint res(*this);
return res /= a;
}
bool operator==(const mint a) const { return this->x == a.x; }
bool operator==(const ll a) const { return this->x == a % mod; }
// mint 入力
friend istream &operator>>(istream &is, mint &x) {
is >> x.x;
return is;
}
// mint 出力
friend ostream &operator<<(ostream &os, mint x) {
os << x.x;
return os;
}
};
/* #endregion */
/* #region BIT */
template <class T = ll> struct BinaryIndexedTree {
int n;
vector<T> data;
BinaryIndexedTree(int sz) : n(sz + 1), data(n, 0) {}
// 初期化する
void init() { fill(ALL(data), T(0)); }
T sum(int k) const {
T ret = 0;
for (++k; k > 0; k -= k & -k) ret += data[k];
return (ret);
}
void add(int k, const T &x) {
for (++k; k < n; k += k & -k) data[k] += x;
}
// query for 0-indexed range [l, r)
// subtraction is required
T query(const int l, const int r) const { return sum(r - 1) - sum(l - 1); }
// a_1 + a_2 + ... + a_x >= w となるような最小の x を求める(ただし a_i >= 0)
// 0-indexed 区間 [l, r] の和が w 以上となる最小の r を求める（ただし単調性がある場合のみ動作）
// 全体の和が w 未満のときは n が返される
int lower_bound(T w) const {
if (w <= 0) {
return 0;
} else {
int x = 0, r = 1;
while (r < n) r <<= 1;
for (int len = r; len > 0; len = len >> 1) { // 長さlenは1段下るごとに半分に
if (x + len < n && data[x + len] < w) { // 採用するとき
w -= data[x + len];
x += len;
}
}
return x;
}
}
void _dump() const { TREP(int, i, 0, n - 1) cerr << query(i, i + 1) << (i == n - 2 ? '\n' : ' '); }
};
/* #endregion */
/* #region RangeAddBIT */
template <class T = ll> struct RangeAddBinaryIndexedTree {
BinaryIndexedTree<T> p, q;
RangeAddBinaryIndexedTree(const int n) : p(n + 1), q(n + 1) {}
// 初期化する
void init() {
p.init();
q.init();
}
// 0-indexed [l, r) に w を加算する
void add_range(const int l, const int r, const T w) {
p.add(l, -w * l);
p.add(r, w * r);
q.add(l, w);
q.add(r, -w);
}
// 0-indexed [0, r) の和を求める
T get_range(const int r) const { return p.sum(r) + q.sum(r) * r; }
// 0-indexed [l, r) の和を求める
T query(const int l, const int r) const {
if (l >= r) return T(0);
return get_range(r) - get_range(l);
}
T get(const int i) const { return get_range(i + 1) - get_range(i); }
};
/* #endregion */
// Problem
void solve() {
VAR(ll, n, b, q);
vll l(q), m(q), r(q);
REP(i, 0, q) cin >> l[i], m[i], r[i];
l--, m--;
// 最大 q 回なので事前に求めておく
mint e(b, 1);
vc<vc<mint>> ans(q + 1, vc<mint>(3, e));
REP(i, 0, q) {
ans[i + 1][0] = ans[i][0] + 1;
ans[i + 1][1] = ans[i][1] * 3 + ans[i + 1][0] * ans[i][2] * 2;
ans[i + 1][2] = ans[i][2] * 3;
}
RangeAddBinaryIndexedTree<> bit(n);
REP(qi, 0, q) {
// 加算
bit.add_range(l[qi], r[qi], 1);
// 合計回数をクエリ
ll cnt = bit.get(m[qi]);
cout >> (ans[cnt]);
}
}
// entry point
int main() {
solve();
return 0;
}