結果
| 問題 | No.749 クエリ全部盛り |
| ユーザー |
 ningenMe
|
| 提出日時 | 2020-09-26 23:31:47 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 756 ms / 3,000 ms |
| コード長 | 13,578 bytes |
| コンパイル時間 | 2,925 ms |
| コンパイル使用メモリ | 223,016 KB |
| 実行使用メモリ | 141,296 KB |
| 最終ジャッジ日時 | 2023-09-12 12:45:18 |
| 合計ジャッジ時間 | 8,973 ms |
|
ジャッジサーバーID （参考情報） |
judge11 / judge13 |
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 6 ms
10,720 KB |
| testcase_01 | AC | 5 ms
10,592 KB |
| testcase_02 | AC | 6 ms
10,724 KB |
| testcase_03 | AC | 6 ms
10,720 KB |
| testcase_04 | AC | 5 ms
10,600 KB |
| testcase_05 | AC | 8 ms
11,220 KB |
| testcase_06 | AC | 7 ms
11,224 KB |
| testcase_07 | AC | 7 ms
11,144 KB |
| testcase_08 | AC | 8 ms
11,100 KB |
| testcase_09 | AC | 8 ms
11,140 KB |
| testcase_10 | AC | 30 ms
12,816 KB |
| testcase_11 | AC | 30 ms
12,864 KB |
| testcase_12 | AC | 31 ms
12,852 KB |
| testcase_13 | AC | 32 ms
12,904 KB |
| testcase_14 | AC | 31 ms
12,944 KB |
| testcase_15 | AC | 756 ms
141,296 KB |
| testcase_16 | AC | 727 ms
141,204 KB |
| testcase_17 | AC | 725 ms
141,056 KB |
| testcase_18 | AC | 724 ms
141,204 KB |
| testcase_19 | AC | 707 ms
141,252 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;
constexpr long long MOD = 1'000'000'000LL + 7;
constexpr long long MOD2 = 998244353;
constexpr long long HIGHINF = (long long)1e18;
constexpr long long LOWINF = (long long)1e15;
constexpr long double PI = 3.1415926535897932384626433L;
template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const array<T,2>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
int msb(int x) {return x?31-__builtin_clz(x):-1;}
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}
/*
* @title ModInt
* @docs md/util/ModInt.md
*/
template<long long mod> class ModInt {
public:
long long x;
constexpr ModInt():x(0) {}
constexpr ModInt(long long 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 long long y) {ModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;}
ModInt &operator+=(const int y) {ModInt p(y);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 long long y) {ModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;}
ModInt &operator-=(const int y) {ModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;}
ModInt &operator*=(const ModInt &p) {x = (x * p.x % mod);return *this;}
ModInt &operator*=(const long long y) {ModInt p(y);x = (x * p.x % mod);return *this;}
ModInt &operator*=(const int y) {ModInt p(y);x = (x * p.x % mod);return *this;}
ModInt &operator^=(const ModInt &p) {x = (x ^ p.x) % mod;return *this;}
ModInt &operator^=(const long long y) {ModInt p(y);x = (x ^ p.x) % mod;return *this;}
ModInt &operator^=(const int y) {ModInt p(y);x = (x ^ p.x) % mod;return *this;}
ModInt &operator/=(const ModInt &p) {*this *= p.inv();return *this;}
ModInt &operator/=(const long long y) {ModInt p(y);*this *= p.inv();return *this;}
ModInt &operator/=(const int y) {ModInt p(y);*this *= p.inv();return *this;}
ModInt operator=(const int y) {ModInt p(y);*this = p;return *this;}
ModInt operator=(const long long y) {ModInt p(y);*this = p;return *this;}
ModInt operator-() const {return ModInt(-x); }
ModInt operator++() {x++;if(x>=mod) x-=mod;return *this;}
ModInt operator--() {x--;if(x<0) x+=mod;return *this;}
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; }
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 inv() 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(long long n) const {ModInt ret(1), mul(x);for(;n > 0;mul *= mul,n >>= 1) if(n & 1) ret *= mul;return ret;}
friend ostream &operator<<(ostream &os, const ModInt &p) {return os << p.x;}
friend istream &operator>>(istream &is, ModInt &a) {long long t;is >> t;a = ModInt<mod>(t);return (is);}
};
using modint = ModInt<MOD>;
constexpr int NMAX=1000000;
vector<modint> F(NMAX);
/*
* @title LazySegmentTree - 非再帰抽象化遅延評価セグメント木
* @docs md/segment/LazySegmentTree.md
*/
template<class Operator> class LazySegmentTree {
using TypeNode = typename Operator::TypeNode;
using TypeLazy = typename Operator::TypeLazy;
size_t num;
size_t length;
size_t height;
vector<TypeNode> node;
vector<TypeLazy> lazy;
vector<pair<size_t,size_t>> range;
void propagate(int k) {
if(lazy[k] == Operator::unit_lazy) return;
node[k] = Operator::func_merge(node[k],lazy[k],range[k].first,range[k].second);
if(k < length) lazy[2*k+0] = Operator::func_lazy(lazy[2*k+0],lazy[k],range[k].first,range[k].second);
if(k < length) lazy[2*k+1] = Operator::func_lazy(lazy[2*k+1],lazy[k],range[k].first,range[k].second);
lazy[k] = Operator::unit_lazy;
}
public:
//unitで初期化
LazySegmentTree(const size_t num) : num(num) {
for (length = 1,height = 0; length <= num; length *= 2, height++);
node.resize(2 * length, Operator::unit_node);
lazy.resize(2 * length, Operator::unit_lazy);
for (int i = 0; i < num; ++i) node[i + length] = Operator::unit_node;
for (int i = length - 1; i >= 0; --i) node[i] = Operator::func_node(node[(i<<1)+0],node[(i<<1)+1]);
range.resize(2 * length);
for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1);
for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second);
}
// //同じinitで初期化
LazySegmentTree(const size_t num, const TypeNode init) : num(num) {
for (length = 1,height = 0; length <= num; length *= 2, height++);
node.resize(2 * length, Operator::unit_node);
lazy.resize(2 * length, Operator::unit_lazy);
for (int i = 0; i < num; ++i) node[i + length] = init;
for (int i = length - 1; i >= 0; --i) node[i] = Operator::func_node(node[(i<<1)+0],node[(i<<1)+1]);
range.resize(2 * length);
for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1);
for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second);
}
//vectorで初期化
LazySegmentTree(const vector<TypeNode>& vec) : num(vec.size()) {
for (length = 1,height = 0; length <= vec.size(); length *= 2, height++);
node.resize(2 * length, Operator::unit_node);
lazy.resize(2 * length, Operator::unit_lazy);
for (int i = 0; i < vec.size(); ++i) node[i + length] = vec[i];
for (int i = length - 1; i >= 0; --i) node[i] = Operator::func_node(node[(i<<1)+0],node[(i<<1)+1]);
range.resize(2 * length);
for (int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1);
for (int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second);
}
//update [a,b)
void update(int a, int b, TypeLazy x) {
int l = a + length, r = b + length - 1;
for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i);
for(r++; l < r; l >>=1, r >>=1) {
if(l&1) lazy[l] = Operator::func_lazy(lazy[l],x,range[l].first,range[l].second), propagate(l),l++;
if(r&1) --r,lazy[r] = Operator::func_lazy(lazy[r],x,range[r].first,range[r].second), propagate(r);
}
l = a + length, r = b + length - 1;
while ((l>>=1),(r>>=1),l) {
if(lazy[l] == Operator::unit_lazy) node[l] = Operator::func_node(Operator::func_merge(node[(l<<1)+0],lazy[(l<<1)+0],range[(l<<1)+0].first,range[(l<<1)+0].second),Operator::func_merge(node[(l<<1)+1],lazy[(l<<1)+1],range[(l<<1)+1].first,range[(l<<1)+1].second));
if(lazy[r] == Operator::unit_lazy) node[r] = Operator::func_node(Operator::func_merge(node[(r<<1)+0],lazy[(r<<1)+0],range[(r<<1)+0].first,range[(r<<1)+0].second),Operator::func_merge(node[(r<<1)+1],lazy[(r<<1)+1],range[(r<<1)+1].first,range[(r<<1)+1].second));
}
}
//get [a,b)
TypeNode get(int a, int b) {
int l = a + length, r = b + length - 1;
for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i);
TypeNode vl = Operator::unit_node, vr = Operator::unit_node;
for(r++; l < r; l >>=1, r >>=1) {
if(l&1) vl = Operator::func_node(vl,Operator::func_merge(node[l],lazy[l],range[l].first,range[l].second)),l++;
if(r&1) r--,vr = Operator::func_node(Operator::func_merge(node[r],lazy[r],range[r].first,range[r].second),vr);
}
return Operator::func_node(vl,vr);
}
//return [0,length]
int prefix_binary_search(TypeNode var) {
int l = length, r = 2*length - 1;
for (int i = height; 0 < i; --i) propagate(l >> i), propagate(r >> i);
if(!Operator::func_check(node[1],var)) return num;
TypeNode ret = Operator::unit_node;
size_t idx = 2;
for(; idx < 2*length; idx<<=1){
if(!Operator::func_check(Operator::func_node(ret,Operator::func_merge(node[idx],lazy[idx],range[idx].first,range[idx].second)),var)) {
ret = Operator::func_node(ret,Operator::func_merge(node[idx],lazy[idx],range[idx].first,range[idx].second));
idx++;
}
}
return min((idx>>1) - length,num);
}
//range[l,r) return [l,r]
int binary_search(size_t l, size_t r, TypeNode var) {
if (l < 0 || length <= l || r < 0 || length < r) return -1;
for (int i = height; 0 < i; --i) propagate((l+length) >> i), propagate((r+length-1) >> i);
TypeNode ret = Operator::unit_node;
size_t off = l;
for(size_t idx = l+length; idx < 2*length && off < r; ){
if(range[idx].second<=r && !Operator::func_check(Operator::func_node(ret,Operator::func_merge(node[idx],lazy[idx],range[idx].first,range[idx].second)),var)) {
ret = Operator::func_node(ret,Operator::func_merge(node[idx],lazy[idx],range[idx].first,range[idx].second));
off = range[idx++].second;
if(!(idx&1)) idx >>= 1;
}
else{
idx <<=1;
}
}
return off;
}
void print(){
// cout << "node" << endl;
// for(int i = 1,j = 1; i < 2*length; ++i) {
// cout << node[i] << " ";
// if(i==((1<<j)-1) && ++j) cout << endl;
// }
// cout << "lazy" << endl;
// for(int i = 1,j = 1; i < 2*length; ++i) {
// cout << lazy[i] << " ";
// if(i==((1<<j)-1) && ++j) cout << endl;
// }
cout << "vector" << endl;
cout << "{ " << get(0,1);
for(int i = 1; i < length; ++i) cout << ", " << get(i,i+1);
cout << " }" << endl;
}
};
//node:総和 lazy:加算
template<class T, class U> struct NodeSumRangeManyQuery {
using TypeNode = T;
using TypeLazy = U;
inline static constexpr TypeNode unit_node = {0,0};
inline static constexpr TypeLazy unit_lazy = {1,0,0};
inline static constexpr TypeNode func_node(TypeNode l,TypeNode r){
return {l[0]+r[0],l[1]+r[1]};
}
inline static constexpr TypeLazy func_lazy(TypeLazy pre_lazy,TypeLazy cur_lazy,int l, int r){
pre_lazy[0] = cur_lazy[0]*pre_lazy[0];
pre_lazy[1] = cur_lazy[0]*pre_lazy[1]+cur_lazy[1];
pre_lazy[2] = cur_lazy[0]*pre_lazy[2]+cur_lazy[2];
return pre_lazy;
}
inline static constexpr TypeNode func_merge(TypeNode node,TypeLazy lazy,int l, int r){
return {lazy[0]*node[0]+lazy[1]*(r-l)+lazy[2]*node[1],node[1]};
}
inline static constexpr bool func_check(TypeNode nodeVal,TypeNode var){return var <= nodeVal;}
// LazySegmentTree<NodeSumRangeUpdate<ll,ll>> Seg(N,0);
};
using no = array<modint,2>;
using la = array<modint,3>;
int main() {
cin.tie(0);ios::sync_with_stdio(false);
F[0]=0,F[1]=1;
for(int i=2;i<NMAX;++i) F[i]=F[i-1]+F[i-2];
int N,Q; cin >> N >> Q;
vector<no> a(N);
for(int i=0;i<N;++i) a[i]={0,F[i]};
LazySegmentTree<NodeSumRangeManyQuery<no,la>> seg(a);
while(Q--) {
int q,l,r,k; cin >> q >> l >> r >> k;
r++;
if(q==0) {
cout << seg.get(l,r)[0]*k << endl;
continue;
}
la query={0,0,0};
if(q==1) query[1]=k;
if(q==2) query[0]=1,query[1]=k;
if(q==3) query[0]=k;
if(q==4) query[0]=1,query[2]=k;
seg.update(l,r,query);
}
return 0;
}