#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
#include<vector>
#include<sstream>
#include<string>
#include<climits>
#include<stack>
#include<set>
#include<bitset>
#include<cmath>
#include<deque>
#include<map>
#include<queue>
#define iinf 2000000000
#define linf 1000000000000000000LL
#define dinf 1e200
#define eps 1e-5
#define all(v) (v).begin(),(v).end()
#define sz(x) x.size()
#define pb push_back
#define mp make_pair
#define lng long long
#define sqr(a) ((a)*(a))
#define pii pair<int,int>
#define pll pair<lng,lng>
#define pss pair<string,string>
#define pdd pair<double,double>
#define X first
#define Y second
#define pi 3.14159265359
#define ff(i,xi,n) for(int i=xi;i<=(int)(n);++i)
#define ffd(i,xi,n) for(int i=xi;i>=(int)(n);--i)
#define ffl(i,r) for(int i=head[r];i!=-1;i=edge[i].next)
#define cc(i,j) memset(i,j,sizeof(i))
#define two(x) ((lng)1<<(x))
#define N 1000002
#define M 1000000
#define lson l , mid , rt << 1
#define rson mid + 1 , r , rt << 1 | 1
#define Mod n
#define Pmod(x) (x%Mod+Mod)%Mod
using namespace std;
typedef vector<int> vi;
typedef vector<string> vs;
typedef unsigned int uint;
typedef unsigned lng ulng;
template<class T> inline void checkmax(T &x,T y){if(x<y) x=y;}
template<class T> inline void checkmin(T &x,T y){if(x>y) x=y;}
template<class T> inline T Min(T x,T y){return (x>y?y:x);}
template<class T> inline T Max(T x,T y){return (x<y?y:x);}
template<class T> T gcd(T a,T b){return (a%b)==0?b:gcd(b,a%b);}
template<class T> T lcm(T a,T b){return a*b/gcd(a,b);}
template<class T> T Abs(T a){return a>0?a:(-a);}
template<class T> inline T lowbit(T n){return (n^(n-1))&n;}
template<class T> inline int countbit(T n){return (n==0)?0:(1+countbit(n&(n-1)));}
template<class T> inline bool isPrimeNumber(T n)
{if(n<=1)return false;for (T i=2;i*i<=n;i++) if (n%i==0) return false;return true;}
int ncase,n,sum[N<<2],clo[N<<2];
inline void pushup(int rt)
{
sum[rt]=sum[rt<<1]+sum[rt<<1|1];
}
void build(int l,int r,int rt)
{
sum[rt]=1;
clo[rt]=0;
if(l==r) return ;
int mid=(l+r)/2;
build(lson);
build(rson);
pushup(rt);
}
inline void pushdown(int rt,int len)
{
if(clo[rt])
{
clo[rt<<1]=clo[rt<<1|1]=clo[rt];
sum[rt<<1]=(len-(len>>1))*clo[rt];
sum[rt<<1|1]=(len>>1)*clo[rt];
clo[rt]=0;
}
}
void update(int L,int R,int add,int l,int r,int rt)
{
if(L<=l&&r<=R)
{
sum[rt]=add*(r-l+1);
clo[rt]=add;
return ;
}
pushdown(rt,r-l+1);
int mid=(l+r)>>1;
if(L<=mid) update(L,R,add,lson);
if(R>mid) update(L,R,add,rson);
pushup(rt);
}
int main()
{
scanf("%d",&ncase);
ff(numcase,1,ncase)
{
scanf("%d",&n);
int q;
build(1,n,1);
scanf("%d",&q);
ff(i,1,q)
{
int a,b,c;
scanf("%d%d%d",&a,&b,&c);
update(a,b,c,1,n,1);
}
printf("Case %d: The total value of the hook is %d.\n",numcase,sum[1]);
}
return 0;
}
hdu 1698 线段树成段更新简单题。
最新推荐文章于 2022-02-24 21:59:13 发布