problem-solving/BOJ_11505.cpp at main · junhee-won/problem-solving · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
//21 10 05

#include <iostream>
using namespace std;
const int MAX = 1000000+1;
const long long divided = 1000000007;

long long arr[MAX];
long long tree[MAX*4];
int n, m, k;

void init_tree(int node, int start, int finish)
{
    if (start==finish)
    {
        tree[node] = arr[start];
        return;
    }
    int mid=(start+finish)/2;
    init_tree(node*2,start,mid);
    init_tree(node*2+1,mid+1,finish);
    tree[node]=(tree[node*2]*tree[node*2+1])%divided;
}

void Update_tree(int node, int start, int finish, int index, long long num)
{
    if (index<start||index>finish)
        return;
    if (start==finish&&start==index)
    {
        tree[node]=num;
        return;
    }
    int mid =(start+finish)/2;
    Update_tree(node*2,start,mid,index,num);
    Update_tree(node*2+1,mid+1,finish,index,num);
    tree[node]=(tree[node*2]*tree[node*2+1])%divided;
}

long long Times_seg(int node, int start, int finish, int seg_left, int seg_right)
{
    if(seg_right<start||seg_left>finish)
        return 1;
    if(seg_left<=start&&seg_right>=finish)
        return tree[node];
    int mid=(start+finish)/2;
    return (Times_seg(node*2,start,mid,seg_left,seg_right)
            *Times_seg(node*2+1,mid+1,finish,seg_left,seg_right))%divided;
}

int main(void)
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin>>n>>m>>k;
    for (int i=1; i<=n; i++)
    {
        cin>>arr[i];
    }

    init_tree(1,1,n);

    for (int i=0; i<m+k;i++)
    {
        long long a,b;
        long long c;
        cin>>a>>b>>c;

        if (a==1)
            Update_tree(1,1,n,b,c);
        else
            cout<<Times_seg(1,1,n,b,c)<<"\n";
    }

    return 0;
}