/// .-~~~~~~~~~-._ _.-~~~~~~~~~-.
/// __.' ~. .~ `.__
/// .'// \./ \\`.
/// .'// | \\`.
/// .'// .-~"""""""~~~~-._ | _,-~~~~"""""""~-. \\`.
/// .'//.-" `-. | .-' "-.\\`.
/// .'//______.============-.. \ | / ..-============.______\\`.
/// .'______________________________\|/______________________________`.
//#pragma GCC optimize("Ofast")
//#pragma comment(linker, "/STACK:102400000,102400000")
//#pragma GCC target(sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx)
#include <vector>
#include <iostream>
#include <string>
#include <map>
#include <stack>
#include <cstring>
#include <queue>
#include <list>
#include <stdio.h>
#include <set>
#include <algorithm>
#include <cstdlib>
#include <cmath>
#include <iomanip>
#include <cctype>
#include <sstream>
#include <functional>
#include <stdlib.h>
#include <time.h>
#include <bitset>
using namespace std;
#define pi acos(-1)
#define s_1(x) scanf("%d",&x)
#define s_2(x,y) scanf("%d%d",&x,&y)
#define s_3(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define s_4(x,y,z,X) scanf("%d%d%d%d",&x,&y,&z,&X)
#define S_1(x) scan_d(x)
#define S_2(x,y) scan_d(x),scan_d(y)
#define S_3(x,y,z) scan_d(x),scan_d(y),scan_d(z)
#define PI acos(-1)
#define endl '\n'
#define srand() srand(time(0));
#define me(x,y) memset(x,y,sizeof(x));
#define foreach(it,a) for(__typeof((a).begin()) it=(a).begin();it!=(a).end();it++)
#define close() ios::sync_with_stdio(0); cin.tie(0);
#define FOR(x,n,i) for(int i=x;i<=n;i++)
#define FOr(x,n,i) for(int i=x;i<n;i++)
#define fOR(n,x,i) for(int i=n;i>=x;i--)
#define fOr(n,x,i) for(int i=n;i>x;i--)
#define W while
#define sgn(x) ((x) < 0 ? -1 : (x) > 0)
#define bug printf("***********\n");
#define db double
#define ll long long
#define mp make_pair
#define pb push_back
typedef long long LL;
typedef pair <int, int> ii;
const int INF=0x3f3f3f3f;
const LL LINF=0x3f3f3f3f3f3f3f3fLL;
const int dx[]={-1,0,1,0,1,-1,-1,1};
const int dy[]={0,1,0,-1,-1,1,-1,1};
const int maxn=1e6+5;
const int maxx=1e6+10;
const double EPS=1e-8;
const double eps=1e-8;
const int mod=1e9+7;
template<class T>inline T min(T a,T b,T c) { return min(min(a,b),c);}
template<class T>inline T max(T a,T b,T c) { return max(max(a,b),c);}
template<class T>inline T min(T a,T b,T c,T d) { return min(min(a,b),min(c,d));}
template<class T>inline T max(T a,T b,T c,T d) { return max(max(a,b),max(c,d));}
template <class T>
inline bool scan_d(T &ret){char c;int sgn;if (c = getchar(), c == EOF){return 0;}
while (c != '-' && (c < '0' || c > '9')){c = getchar();}sgn = (c == '-') ? -1 : 1;ret = (c == '-') ? 0 : (c - '0');
while (c = getchar(), c >= '0' && c <= '9'){ret = ret * 10 + (c - '0');}ret *= sgn;return 1;}
inline bool scan_lf(double &num){char in;double Dec=0.1;bool IsN=false,IsD=false;in=getchar();if(in==EOF) return false;
while(in!='-'&&in!='.'&&(in<'0'||in>'9'))in=getchar();if(in=='-'){IsN=true;num=0;}else if(in=='.'){IsD=true;num=0;}
else num=in-'0';if(!IsD){while(in=getchar(),in>='0'&&in<='9'){num*=10;num+=in-'0';}}
if(in!='.'){if(IsN) num=-num;return true;}else{while(in=getchar(),in>='0'&&in<='9'){num+=Dec*(in-'0');Dec*=0.1;}}
if(IsN) num=-num;return true;}
void Out(LL a){if(a < 0) { putchar('-'); a = -a; }if(a >= 10) Out(a / 10);putchar(a % 10 + '0');}
void print(LL a){ Out(a),puts("");}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
//cerr << "run time is " << clock() << endl;
struct Edge {
int v,next;
}edge[maxn<<1];
struct node {
LL sum,lazy;
}tree[maxn<<2];
int head[maxn],tot,cnt;
int a[maxn];
int in[maxn],out[maxn],seg[maxn];//seg 重新标号的值
int flag[maxn<<2];//正值负值
int io[maxn];
void init() {
tot=cnt=0;
me(seg,0);
me(io,0);
me(head,-1);
}
void addEdge(int u,int v) {
edge[tot].v=v;
edge[tot].next=head[u];
head[u]=tot++;
}
void dfs(int u,int fa) {
seg[in[u]=++cnt]=(LL)a[u];
io[cnt]=1;
for(int i=head[u];~i;i=edge[i].next) {
if(edge[i].v!=fa)
dfs(edge[i].v,u);
}
seg[out[u]=++cnt]=(LL)(-a[u]);
io[cnt]=-1;
}
void pushup(int idx) {
tree[idx].sum=tree[idx<<1].sum+tree[idx<<1|1].sum;
}
void pushdown(int idx) {
int lazyval=tree[idx].lazy;
if(lazyval) {
tree[idx<<1].sum+=flag[idx<<1]*tree[idx].lazy;
tree[idx<<1|1].sum+=flag[idx<<1|1]*tree[idx].lazy;
tree[idx<<1|1].lazy+=tree[idx].lazy;
tree[idx<<1].lazy+=tree[idx].lazy;
tree[idx].lazy=0;
}
}
void update(int l,int r,int L,int R,int idx,int val) {
if(l>=L&&r<=R) {
tree[idx].sum+=(LL)flag[idx]*val;
tree[idx].lazy+=(LL)val;
return ;
}
int mid=(l+r)>>1;
pushdown(idx);
if(mid>=L) update(l,mid,L,R,idx<<1,val);
if(mid<R) update(mid+1,r,L,R,idx<<1|1,val);
pushup(idx);
}
void build(int l,int r,int idx){
tree[idx].sum=tree[idx].lazy=0;
if(l==r) {
tree[idx].sum=seg[l];
if(io[l]>0) flag[idx]=1;
else flag[idx]=-1;
return ;
}
int mid=(l+r)>>1;
build(l,mid,idx<<1);
build(mid+1,r,idx<<1|1);
pushup(idx);
flag[idx]=flag[idx<<1]+flag[idx<<1|1];
}
LL query(int l,int r,int L,int R,int idx) {
if(l>=L&&r<=R) return tree[idx].sum;
int mid=(l+r)>>1;
LL ans=0;
pushdown(idx);
if(mid>=L) ans+=query(l,mid,L,R,idx<<1);
if(mid<R) ans+=query(mid+1,r,L,R,idx<<1|1);
return ans;
}
int n,m;
void solve() {
W(cin>>n>>m) {
init();
FOR(1,n,i) s_1(a[i]);
FOr(1,n,i) {
int u,v;
s_2(u,v);
addEdge(u,v);
addEdge(v,u);
}
dfs(1,0);
build(1,2*n,1);
W(m--) {
int op,x,y;
s_1(op);
if(op==1) {
s_2(x,y);
update(1,2*n,in[x],in[x],1,y);
update(1,2*n,out[x],out[x],1,y);
}
else if(op==2) {
s_2(x,y);
update(1,2*n,in[x],out[x],1,y);
}
else {
s_1(x);
LL sum=query(1,2*n,1,in[x],1);
print(sum);
}
}
}
}
int main() {
//freopen( "1.in" , "r" , stdin );
//freopen( "1.out" , "w" , stdout );
int t=1;
//init();
//s_1(t);
for(int cas=1;cas<=t;cas++) {
//printf("Case #%d: ",cas);
solve();
}
}
bzoj 4034 (dfs序+线段树
猜你喜欢
转载自blog.csdn.net/qq_36553623/article/details/82806150
今日推荐
周排行