zoukankan      html  css  js  c++  java
  • HDU-3074 Multiply game

    Multiply game

    Tired of playing computer games, alpc23 is planning to play a game on numbers. Because plus and subtraction is too easy for this gay, he wants to do some multiplication in a number sequence. After playing it a few times, he has found it is also too boring. So he plan to do a more challenge job: he wants to change several numbers in this sequence and also work out the multiplication of all the number in a subsequence of the whole sequence. 
      To be a friend of this gay, you have been invented by him to play this interesting game with him. Of course, you need to work out the answers faster than him to get a free lunch, He he… 

    InputThe first line is the number of case T (T<=10). 
      For each test case, the first line is the length of sequence n (n<=50000), the second line has n numbers, they are the initial n numbers of the sequence a1,a2, …,an, 
    Then the third line is the number of operation q (q<=50000), from the fourth line to the q+3 line are the description of the q operations. They are the one of the two forms: 
    0 k1 k2; you need to work out the multiplication of the subsequence from k1 to k2, inclusive. (1<=k1<=k2<=n) 
    1 k p; the kth number of the sequence has been change to p. (1<=k<=n) 
    You can assume that all the numbers before and after the replacement are no larger than 1 million. 
    OutputFor each of the first operation, you need to output the answer of multiplication in each line, because the answer can be very large, so can only output the answer after mod 1000000007.Sample Input

    1
    6
    1 2 4 5 6 3
    3
    0 2 5
    1 3 7
    0 2 5

    Sample Output

    240
    420

    题意:输入n个数字,m次查询,每次查询三个数 a b c ,a=0时求b~c的乘积 a=1时将下标b的值修改为c
    #include<bits/stdc++.h>
    using namespace std;
    typedef long long ll;
    #define lson l,m,rt<<1
    #define rson m+1,r,rt<<1|1
    const int maxn = 50000+10;
    const int INF = 0x3f3f3f3f;
    const int Mod = 1000000007;
    struct node
    {
        int l,r;
        ll sum;
    } tree[maxn<<2];
    void pushup(int rt)
    {
        tree[rt].sum=(tree[rt<<1].sum*tree[rt<<1|1].sum)%Mod;
    }
    void build(int l,int r,int rt)
    {
        tree[rt].l=l;
        tree[rt].r=r;
        if(l==r)
        {
            scanf("%lld",&tree[rt].sum);
            return;
        }
        int m=(l+r)>>1;
        build(lson);
        build(rson);
        pushup(rt);
    }
    void updata(int rt,int pos, ll c)
    {
        if(tree[rt].l==tree[rt].r)
        {
            tree[rt].sum=c;
            return ;
        }
        int m=(tree[rt].l+tree[rt].r)>>1;
        if(pos<=m)
            updata(rt<<1,pos,c);
        else
            updata(rt<<1|1,pos,c);
        pushup(rt);
    
    }
    ll query(int l,int r,int rt)
    {
        if(tree[rt].l>=l&&tree[rt].r<=r)
        {
            return tree[rt].sum;
        }
        ll ans=1;
        int m=(tree[rt].l+tree[rt].r)>>1;
        if(l<=m)
            ans=ans*query(l,r,rt<<1)%Mod;
        if(r>m)
            ans=ans*query(l,r,rt<<1|1)%Mod;
        return ans;
    
    }
    int main()
    {
        int t,n,m;
        ll a,b,c;
        scanf("%d",&t);
        while(t--)
        {
            scanf("%d",&n);
            build(1,n,1);
            scanf("%d",&m);
            while(m--)
            {
                scanf("%lld %lld %lld",&a,&b,&c);
                if(a)
                {
                    updata(1,b,c);
                }
                else
                    printf("%I64d
    ",query(b,c,1));
            }
        }
    }
    View Code

    PS:摸鱼怪的博客分享,欢迎感谢各路大牛的指点~

  • 相关阅读:
    django添加检查用户名和手机号数量接口
    1.vue发送短信逻辑
    Celery 配置与基本使用 并且用celery 一步发送短信
    递归基础_并查集思想_二叉树最大深度问题
    递归基础_汉诺塔问题_经典的多状态问题_整体法/分两个函数互相递归
    递归基础_全排列+改写_组合数
    递归基础_组合数_输出的各种办法(递归)_(持续更新)
    关于gpu版本的tensorflow+anaconda的一些安装问题(持续更新)
    吴恩达课程笔记_1-1~1-4
    bfs和dfs辨析—基础复习(从stack和queue的角度来理解区别,加深理解,不再模糊)
  • 原文地址:https://www.cnblogs.com/MengX/p/9265512.html
Copyright © 2011-2022 走看看