zoukankan      html  css  js  c++  java
  • HDU

    Just a Hook

    Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 39606    Accepted Submission(s): 19194


    Problem Description
    In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of the heroes. The hook is made up of several consecutive metallic sticks which are of the same length.



    Now Pudge wants to do some operations on the hook.

    Let us number the consecutive metallic sticks of the hook from 1 to N. For each operation, Pudge can change the consecutive metallic sticks, numbered from X to Y, into cupreous sticks, silver sticks or golden sticks.
    The total value of the hook is calculated as the sum of values of N metallic sticks. More precisely, the value for each kind of stick is calculated as follows:

    For each cupreous stick, the value is 1.
    For each silver stick, the value is 2.
    For each golden stick, the value is 3.

    Pudge wants to know the total value of the hook after performing the operations.
    You may consider the original hook is made up of cupreous sticks.
     




    Input
    The input consists of several test cases. The first line of the input is the number of the cases. There are no more than 10 cases.
    For each case, the first line contains an integer N, 1<=N<=100,000, which is the number of the sticks of Pudge’s meat hook and the second line contains an integer Q, 0<=Q<=100,000, which is the number of the operations.
    Next Q lines, each line contains three integers X, Y, 1<=X<=Y<=N, Z, 1<=Z<=3, which defines an operation: change the sticks numbered from X to Y into the metal kind Z, where Z=1 represents the cupreous kind, Z=2 represents the silver kind and Z=3 represents the golden kind.
     

    Output
    For each case, print a number in a line representing the total value of the hook after the operations. Use the format in the example.
     

    Sample Input
    1 10 2 1 5 2 5 9 3
     

    Sample Output
    Case 1: The total value of the hook is 24.
     

    Source
     

    Recommend
    wangye

    题意:告诉了每段区间钩子的值,算钩子总值为多少

    #include<stdio.h>
    #include<string.h>
    #define MAXN 100010
    struct node{
    	int l,r,sum,tag;
    }tree[MAXN<<2];
    void build(int k,int l,int r)
    {
    	tree[k].l=l;tree[k].r=r;
    	tree[k].tag=0;
    	if(l==r)
    	{
    		tree[k].sum=1;
    		return;
    	}
    	int mid=(l+r)>>1;
    	build(k<<1,l,mid);
    	build(k<<1|1,mid+1,r);
    	tree[k].sum=tree[k<<1].sum+tree[k<<1|1].sum;
    }
    void pushup(int k)
    {
    	tree[k].sum=tree[k<<1].sum+tree[k<<1|1].sum;
    }
    void pushdown(int k)
    {
    	tree[k<<1].sum=(tree[k<<1].r-tree[k].l+1)*tree[k].tag;
    	tree[k<<1|1].sum=(tree[k<<1|1].r-tree[k<<1|1].l+1)*tree[k].tag;
    	tree[k<<1].tag=tree[k].tag;
    	tree[k<<1|1].tag=tree[k].tag;
    	tree[k].tag=0;
    }
    void update(int k,int l,int r,int x)
    {
    	if(tree[k].l==l&&tree[k].r==r)
    	{
    		tree[k].sum=x*(tree[k].r-tree[k].l+1);
    		tree[k].tag=x;
    		return;
    	}
    	if(tree[k].tag)
    		pushdown(k);
    	int mid=(tree[k].l+tree[k].r)>>1;
    	if(r<=mid)
    		update(k<<1,l,r,x);
    	else if(l>=mid+1)
    		update(k<<1|1,l,r,x);
    	else
    		{
    			update(k<<1,l,mid,x);
    			update(k<<1|1,mid+1,r,x);
    		}
    	pushup(k);
    }
    int main()
    {
    	int N,T,Q,X,Y,Z,cas;
    	while(~scanf("%d",&T))
    	{
    		cas=0;
    		while(T--)
    		{
    			scanf("%d%d",&N,&Q);
    			build(1,1,N);
    			while(Q--)
    			{
    				scanf("%d %d %d",&X,&Y,&Z);
    				update(1,X,Y,Z);
    			}
    			printf("Case %d: The total value of the hook is %d.
    ",++cas,tree[1].sum);
    		}
    	}
    	return 0;
    }

  • 相关阅读:
    MySQL体系结构
    Java线程池ThreadPoolExecuter:execute()原理
    Java Thread 如何处理未捕获的异常?
    SSL/TSL握手过程详解
    LockSupport HotSpot里park/unpark的实现
    JAVA 对象内存结构
    JAVA 线程状态转换
    Spring源码解析(四)Bean的实例化和依赖注入
    Spring源码解析(五)循环依赖问题
    Spring源码解析(三)BeanDefinition的载入、解析和注册
  • 原文地址:https://www.cnblogs.com/csu-lmw/p/9124420.html
Copyright © 2011-2022 走看看