結果

問題 No.1099 Range Square Sum
ユーザー hotman78
提出日時 2020-06-26 22:13:03
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 525 ms / 2,000 ms
コード長 5,714 bytes
コンパイル時間 17,089 ms
コンパイル使用メモリ 470,652 KB
最終ジャッジ日時 2025-01-11 11:38:04
ジャッジサーバーID
(参考情報)
judge3 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 1
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC push_options
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#include<bits/stdc++.h>
#include <xmmintrin.h>
#include <immintrin.h>
using namespace::std;
__attribute__((constructor))void init(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(15);}
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include<ext/pb_ds/tag_and_trait.hpp>
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision;
// typedef mp::number<mp::cpp_dec_float<0>> cdouble;
// typedef mp::cpp_int cint;
template<typename T>using pbds=__gnu_pbds::tree<T,__gnu_pbds::null_type,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update
    >;
template<typename T>using pbds_map=__gnu_pbds::tree<T,T,less<T>,__gnu_pbds::rb_tree_tag,__gnu_pbds::tree_order_statistics_node_update>;
template<typename T,typename E>using hash_map=__gnu_pbds::gp_hash_table<T,E>;
template<typename T>using pqueue =__gnu_pbds::priority_queue<T, greater<T>,__gnu_pbds::rc_binomial_heap_tag>;
typedef long long lint;
#define INF (1LL<<60)
#define IINF (1<<30)
#define LINF (9223372036854775807LL)
#define EPS (1e-10)
#define endl ('\n')
//#define MOD 1000000007LL
#define MOD 998244353LL
//#define MOD 18446744069414584321ULL
typedef vector<lint> vec;
typedef vector<vector<lint>> mat;
typedef vector<vector<vector<lint>>> mat3;
typedef vector<string> svec;
typedef vector<vector<string>> smat;
template<typename T>inline void numout(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i<INF/2?i:"INF";f=1;}cout<<endl;}
template<typename T>inline void numout2(T t){for(auto i:t)numout(i);}
template<typename T>inline void output(T t){bool f=0;for(auto i:t){cout<<(f?" ":"")<<i;f=1;}cout<<endl;}
template<typename T>inline void output2(T t){for(auto i:t)output(i);}
template<typename T>inline void _output(T t){bool f=0;for(lint i=0;i<t.size();i++){cout<<f?"":" "<<t[i];f=1;}cout<<endl;}
template<typename T>inline void _output2(T t){for(lint i=0;i<t.size();i++)output(t[i]);}
#define rep(i,n) for(lint i=0;i<lint(n);++i)
#define repi(i,a,b) for(lint i=lint(a);i<(lint)(b);++i)
#define rrep(i,n) for(lint i=lint(n)-1;i>=0;--i)
#define rrepi(i,a,b) for(lint i=lint(b)-1;i>=lint(a);--i)
#define irep(i) for(lint i=0;;++i)
#define all(n) begin(n),end(n)
#define dist(a,b,c,d) sqrt(pow(a-c,2)+pow(b-d,2))
inline lint gcd(lint A,lint B){return B?gcd(B,A%B):A;}
inline lint lcm(lint A,lint B){return A/gcd(A,B)*B;}
// inline cint cgcd(cint A,cint B){return B?cgcd(B,A%B):A;}
// inline cint clcm(cint A,cint B){return A/cgcd(A,B)*B;}
bool chmin(auto& s,const auto& t){bool res=s>t;s=min(s,t);return res;}
bool chmax(auto& s,const auto& t){bool res=s<t;s=max(s,t);return res;}
const vector<lint> dx={1,0,-1,0,1,1,-1,-1};
const vector<lint> dy={0,1,0,-1,1,-1,1,-1};
#define SUM(v) accumulate(all(v),0LL)
auto call=[](auto f,auto... args){return f(f,args...);};
template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else return
    vector(arg,make_vector<T>(x,args...));}
template<typename T,typename E>
class dynamic_lazy_segment{
using lint=long long;
lint n;
lint sz;
struct node;
using np=node*;
struct node{
T val=et;
E lazy=ee;
np lch=nullptr,rch=nullptr;
node(){}
};
np root=new node();
T update(lint a,lint b,E x,lint l,lint r,np t){
eval(t,l,r);
//
if(r<=a||b<=l)return t->val;
//
if(a<=l&&r<=b){
t->lazy=x;
eval(t,l,r);
return t->val;
}
//
return t->val=f(update(a,b,x,l,(l+r)/2,t->lch),update(a,b,x,(l+r)/2,r,t->rch));
}
T get(lint a,lint b,lint l,lint r,np t){
eval(t,l,r);
//
if(r<=a||b<=l)return et;
//
if(a<=l&&r<=b)return t->val;
//
return f(get(a,b,l,(l+r)/2,t->lch),get(a,b,(l+r)/2,r,t->rch));
}
void eval(np t,lint l,lint r){
if(r-l>1){
if(!t->lch)t->lch=new node();
if(!t->rch)t->rch=new node();
t->lch->lazy=g(t->lch->lazy,t->lazy);
t->rch->lazy=g(t->rch->lazy,t->lazy);
}
t->val=h(t->val,t->lazy,r-l);
t->lazy=ee;
}
static T et;
static E ee;
T f(T a,T b){
return {a.first+b.first,a.second+b.second};
}
T h(T a,E b,lint len){
return make_pair(a.first+a.second*b*2LL+b*b*len,a.second+b*len);
}
E g(E a,E b){
return a+b;
}
//auto update(auto a,auto b){return b==ee?a:b;}
public:
dynamic_lazy_segment(lint sz):n(1),sz(sz){while(n<sz)n<<=1;}
dynamic_lazy_segment():n(1LL<<60),sz(1LL<<60){}
//0-indexed [a,b)
void update(lint a,lint b,E x){update(a,b,x,0,n,root);}
//0-indexed [a,b)
T get(lint a,lint b){return get(a,b,0,n,root);}
};
template<typename T,typename E>T dynamic_lazy_segment<T,E>::et={0,0};
template<typename T,typename E>E dynamic_lazy_segment<T,E>::ee=0;
int main(){
lint n;
cin>>n;
vec a(n);
rep(i,n)cin>>a[i];
dynamic_lazy_segment<pair<lint,lint>,lint>seg;
lint q;
cin>>q;
rep(i,n)seg.update(i,i+1,a[i]);
rep(i,q){
lint x;
cin>>x;
if(x==1){
lint s,t,x;
cin>>s>>t>>x;
seg.update(s-1,t,x);
}else{
lint s,t;
cin>>s>>t;
cout<<seg.get(s-1,t).first<<endl;
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0