#include<bits/stdc++.h>
using namespace std;
#define int long long
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define pb push_back
#define sz(x) (int)(x.size())
#define chmin(x,y) x=min(x,y)
#define chmax(x,y) x=max(x,y)
#define vi vector<int>
#define vp vector<pii>
#define vvi vector<vi>
#define ykh mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count())
#define __lg(x) 63-__builtin_clzll(x)
#define pow2(x) (1LL<<x)
void __print(int x) {cerr << x;}
void __print(float x) {cerr << x;}
void __print(double x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ','; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? "," : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef local
void setio(){freopen("/Users/iantsai/Library/Mobile Documents/com~apple~CloudDocs/cpp/Empty.md","r",stdin);}
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
void setio(){}
#define debug(x...)
#endif
void setIO(string s) {
freopen((s + ".in").c_str(), "r", stdin);
freopen((s + ".out").c_str(), "w", stdout);
}
struct line{
int a,b;
int operator()(const int x)const{
return a*x+b;
}
};
bool check(line l1,line l2,line l3){
return (l3.b-l2.b)*(l1.a-l2.a)<=(l2.b-l1.b)*(l2.a-l3.a);
}
int n,q,k;
const int mxn=1e5+5;
int a[mxn];
struct state{
int mx,sum;
};
struct segtree{
state seg[4*mxn];
void pull(int id,int l,int r){
seg[id].mx=max(seg[l].mx,seg[r].mx);
seg[id].sum=seg[l].sum+seg[r].sum;
}
void build(int l,int r,int id){
if(l==r){
seg[id].sum=seg[id].mx=a[l];
return ;
}
int mm=l+r>>1;
build(l,mm,id*2);
build(mm+1,r,id*2+1);
pull(id,id*2,id*2+1);
}
void modify(int l,int r,int id,int p,int v){
if(l==r){
seg[id].mx=seg[id].sum=v;
return;
}
int mm=l+r>>1;
if(p<=mm){
modify(l,mm,id*2,p,v);
}
else{
modify(mm+1,r,id*2+1,p,v);
}
pull(id,id*2,id*2+1);
}
void modify(int p,int v){
modify(1,n,1,p,v);
}
void go(int l,int r,int id,int ql,int qr){
if(r<ql or qr<l){
return;
}
if(l==r){
seg[id].mx/=k;
seg[id].sum/=k;
return ;
}
int mm=l+r>>1;
if(seg[id*2].mx>0){
go(l,mm,id*2,ql,qr);
}
if(seg[id*2+1].mx>0){
go(mm+1,r,id*2+1,ql,qr);
}
pull(id,id*2,id*2+1);
}
void go(int ql,int qr){
go(1,n,1,ql,qr);
}
int query(int l,int r,int id,int ql,int qr){
if(qr<l or r<ql){
return 0;
}
if(ql<=l and r<=qr){
return seg[id].sum;
}
int mm=l+r>>1;
return query(l,mm,id*2,ql,qr)+query(mm+1,r,id*2+1,ql,qr);
}
int query(int ql,int qr){
return query(1,n,1,ql,qr);
}
}tr;
signed main(){
setio();
ios::sync_with_stdio(0);
cin.tie(0);cout.tie(0);
cin>>n>>q>>k;
for(int i=1;i<=n;i++){
cin>>a[i];
}
tr.build(1,n,1);
for(int i=1;i<=q;i++){
int ty,x,y;
cin>>ty>>x>>y;
if(ty==1){
tr.modify(x,y);
}
else if(ty==2){
tr.go(x,y);
}
else{
cout<<tr.query(x,y)<<'\n';
}
}
}
/*
input:
*/
Compilation message
sterilizing.cpp: In member function 'void segtree::build(long long int, long long int, long long int)':
sterilizing.cpp:71:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
71 | int mm=l+r>>1;
| ~^~
sterilizing.cpp: In member function 'void segtree::modify(long long int, long long int, long long int, long long int, long long int)':
sterilizing.cpp:81:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
81 | int mm=l+r>>1;
| ~^~
sterilizing.cpp: In member function 'void segtree::go(long long int, long long int, long long int, long long int, long long int)':
sterilizing.cpp:102:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
102 | int mm=l+r>>1;
| ~^~
sterilizing.cpp: In member function 'long long int segtree::query(long long int, long long int, long long int, long long int, long long int)':
sterilizing.cpp:121:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
121 | int mm=l+r>>1;
| ~^~
sterilizing.cpp: In function 'void setIO(std::string)':
sterilizing.cpp:42:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
42 | freopen((s + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sterilizing.cpp:43:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
43 | freopen((s + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
2 ms |
2800 KB |
Output is correct |
| 2 |
Correct |
2 ms |
2392 KB |
Output is correct |
| 3 |
Correct |
1 ms |
2396 KB |
Output is correct |
| 4 |
Correct |
3 ms |
2396 KB |
Output is correct |
| 5 |
Correct |
3 ms |
2712 KB |
Output is correct |
| 6 |
Correct |
2 ms |
2652 KB |
Output is correct |
| 7 |
Correct |
3 ms |
2648 KB |
Output is correct |
| 8 |
Correct |
3 ms |
2652 KB |
Output is correct |
| 9 |
Correct |
3 ms |
2652 KB |
Output is correct |
| 10 |
Correct |
3 ms |
2712 KB |
Output is correct |
| 11 |
Correct |
3 ms |
2652 KB |
Output is correct |
| 12 |
Correct |
3 ms |
2652 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Execution timed out |
5007 ms |
6928 KB |
Time limit exceeded |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
13 ms |
5208 KB |
Output is correct |
| 2 |
Correct |
8 ms |
5208 KB |
Output is correct |
| 3 |
Correct |
12 ms |
5208 KB |
Output is correct |
| 4 |
Correct |
41 ms |
6372 KB |
Output is correct |
| 5 |
Correct |
39 ms |
8796 KB |
Output is correct |
| 6 |
Correct |
40 ms |
8920 KB |
Output is correct |
| 7 |
Execution timed out |
5011 ms |
8872 KB |
Time limit exceeded |
| 8 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
49 ms |
6740 KB |
Output is correct |
| 2 |
Correct |
53 ms |
6744 KB |
Output is correct |
| 3 |
Correct |
71 ms |
6144 KB |
Output is correct |
| 4 |
Correct |
64 ms |
6736 KB |
Output is correct |
| 5 |
Correct |
77 ms |
10056 KB |
Output is correct |
| 6 |
Correct |
87 ms |
10052 KB |
Output is correct |
| 7 |
Correct |
74 ms |
10080 KB |
Output is correct |
| 8 |
Correct |
102 ms |
10068 KB |
Output is correct |
| 9 |
Correct |
88 ms |
9940 KB |
Output is correct |
| 10 |
Correct |
114 ms |
10088 KB |
Output is correct |
| 11 |
Correct |
80 ms |
9940 KB |
Output is correct |
| 12 |
Correct |
129 ms |
9916 KB |
Output is correct |
