結果

問題 No.2395 区間二次変換一点取得
ユーザー dyktr_06dyktr_06
提出日時 2024-04-18 20:51:22
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 65 ms / 2,000 ms
コード長 10,442 bytes
コンパイル時間 5,498 ms
コンパイル使用メモリ 265,444 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-10-10 14:18:18
合計ジャッジ時間 7,861 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 20
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()
#define Sort(a) sort(a.begin(), a.end())
#define RSort(a) sort(a.rbegin(), a.rend())
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T& a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T& a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T& a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
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; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return
    os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v
    .size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " ";
    } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os << *itr
    << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int)st.size(); ++i){ os <<
    *itr << (i + 1 != (int)st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os
    << pq.top() << " "; pq.pop(); } return os; }
template<class T, class U> inline T vin(T& vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T& a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>>& G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b;
    cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
struct ModInt{
long long val;
ModInt(const long long &_val = 0) noexcept : val(_val) {
normalize();
}
static long long &Modulus(){
static long long mod = 0;
return mod;
}
static void setMod(const int &mod){
Modulus() = mod;
}
void normalize(){
val = (val % Modulus() + Modulus()) % Modulus();
}
inline ModInt& operator+=(const ModInt& rhs) noexcept {
if(val += rhs.val, val >= Modulus()) val -= Modulus();
return *this;
}
inline ModInt& operator-=(const ModInt& rhs) noexcept {
if(val -= rhs.val, val < 0) val += Modulus();
return *this;
}
inline ModInt& operator*=(const ModInt& rhs) noexcept {
val = val * rhs.val % Modulus();
return *this;
}
inline ModInt& operator/=(const ModInt& rhs) noexcept {
val = val * inv(rhs.val).val % Modulus();
return *this;
}
inline ModInt& operator++() noexcept {
if(++val >= Modulus()) val -= Modulus();
return *this;
}
inline ModInt operator++(int) noexcept {
ModInt t = val;
if(++val >= Modulus()) val -= Modulus();
return t;
}
inline ModInt& operator--() noexcept {
if(--val < 0) val += Modulus();
return *this;
}
inline ModInt operator--(int) noexcept {
ModInt t = val;
if(--val < 0) val += Modulus();
return t;
}
inline ModInt operator-() const noexcept { return (Modulus() - val) % Modulus(); }
inline ModInt inv(void) const { return inv(val); }
ModInt inv(const long long& n) const {
long long a = n, b = Modulus(), u = 1, v = 0;
while(b){
long long t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= Modulus();
if(u < 0) u += Modulus();
return u;
}
friend inline ModInt operator+(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) += rhs; }
friend inline ModInt operator-(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) -= rhs; }
friend inline ModInt operator*(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) *= rhs; }
friend inline ModInt operator/(const ModInt& lhs, const ModInt& rhs) noexcept { return ModInt(lhs) /= rhs; }
friend inline bool operator==(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val == rhs.val; }
friend inline bool operator!=(const ModInt& lhs, const ModInt& rhs) noexcept { return lhs.val != rhs.val; }
friend inline istream& operator>>(istream& is, ModInt& x) noexcept {
is >> x.val;
x.normalize();
return is;
}
friend inline ostream& operator<<(ostream& os, const ModInt& x) noexcept { return os << x.val; }
};
namespace modcalc{
template <typename T>
T modpow(T x, T n, const T &m){
T ret = 1 % m;
x %= m;
while(n > 0){
if(n & 1) (ret *= x) %= m;
(x *= x) %= m;
n >>= 1;
}
return ret;
}
template <typename T>
T modinv(T a, T m){
T b = m, u = 1, v = 0;
while(b){
T t = a / b;
a -= t * b; swap(a, b);
u -= t * v; swap(u, v);
}
u %= m;
if (u < 0) u += m;
return u;
}
template <typename T>
T modarithmeticsum(T a, T d, T n, T m){
T m2 = m * 2;
a %= m2, n %= m2, d %= m2;
T b = (n - 1) * d % m2;
return ((n * (a * 2 + b) % m2) / 2) % m;
}
template <typename T>
T modgeometricsum(T a, T r, T n, T m){
a %= m;
if(r == 1){
n %= m;
return a * n % m;
}
return a * (modpow(r, n, m) + m - 1) % m * modinv(r - 1, m) % m;
}
template <typename T>
T modgeometricsum2(T a, T r, T n, T m){
a %= m;
if(r == 1){
n %= m;
return a * n % m;
}
T ret = 0;
T x = 1 % m;
T sum = 0;
for(int i = 0; n > 0; ++i){
if(n & 1){
(ret += x * modpow(r, sum, m) % m) %= m;
sum |= 1LL << i;
}
(x += x * modpow(r, 1LL << i, m) % m) %= m;
n >>= 1;
}
return a * ret % m;
}
}
using namespace modcalc;
using mint = ModInt;
template <typename T>
struct BinaryIndexedTree{
int N;
vector<T> BIT;
BinaryIndexedTree(const int &N): N(N), BIT(N + 1, 0){
}
T get(int i){
return sum(i + 1) - sum(i);
}
void add(int i, T x){
i++;
while(i <= N){
BIT[i] += x;
i += i & -i;
}
}
T sum(int i) const {
T ans = 0;
while(i > 0){
ans += BIT[i];
i -= i & -i;
}
return ans;
}
T sum(int L, int R) const {
return sum(R) - sum(L);
}
int lower_bound(T x) const {
if(x <= 0){
return 0;
}else{
int v = 0, r = 1;
while(r < N) r = r << 1;
for(int len = r; len > 0; len = len >> 1){
if(v + len < N && BIT[v + len] < x){
x -= BIT[v + len];
v += len;
}
}
return v;
}
}
int upper_bound(T x) const {
if(x < 0){
return 0;
}else{
int v = 0, r = 1;
while(r <= N) r = r << 1;
for(int len = r; len > 0; len = len >> 1){
if(v + len <= N && BIT[v + len] <= x){
x -= BIT[v + len];
v += len;
}
}
return v;
}
}
T operator [](int i) const {
return sum(i, i + 1);
}
};
ll n, b, q;
void input(){
in(n, b, q);
}
void solve(){
mint::setMod(b);
BinaryIndexedTree<ll> BIT(n + 1);
vector<mint> x(100001, 1), y(100001, 1), z(100001, 1);
rep(i, 1, 100001){
x[i] = x[i - 1] + 1;
y[i] = 3 * y[i - 1] + 2 * x[i] * z[i - 1];
z[i] = 3 * z[i - 1];
}
while(q--){
ll l, m, r; in(l, m, r);
l--, m--;
BIT.add(l, 1);
BIT.add(r, -1);
ll s = BIT.sum(0, m + 1);
out(x[s], y[s], z[s]);
}
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
input();
solve();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0