HDU 4902 nice boat (line segment tree)

The line segment tree in multiple schools should not be simple. However, it seems that the data is weak. It turns out that water can be used in the past ,,,

Use a tag to indicate whether the current segment has been updated. If it has been updated, it is 1; otherwise, it is 0.

Pay attention to the output of the last space.

Nice boat Time Limit: 30000/15000 MS (Java/others) memory limit: 131072/131072 K (Java/Others)
Total submission (s): 599 accepted submission (s): 280


Problem descriptionthere is an old country and the king fell in love with a dedevil. the dedevil always asks the king to do some crazy things. although the King used to be wise and beloved by his people. now he is just like a boy in love and can't refuse any request from the dedevil. also, this dedevil is looking like a very cute Loli.

Let us continue our story, z * P (actually you) defeat the 'mengmengda 'party's leader, and the 'mengmengda' party dissolved. z * p becomes the most famous guy among the princess's knight party.

One day, the people in the party find that z * P has died. as what he has done in the past, people just say 'Oh, what a nice boat 'and don't care about why he died.

Since then, since people died but no one knows why and everyone is fine about that. Meanwhile, the dedevil sends her knight to challenge you with algorithm contest.

There is a hard data structure Problem in the contest:

There are n numbers A_1, A_2 ,..., a_n on a line, everytime you can change every number in a segment [L, R] into a number x (type 1), or change every number a_ I in a segment [L, r] Which is bigger than X to gcd (a_ I, x) (Type 2 ).

You shoshould output the final sequence.
Inputthe first line contains an integer T, denoting the number of the test cases.
For each test case, the first line contains a integers n.
The next line contains N integers A_1, A_2,..., a_n separated by a single space.
The next line contains an integer Q, denoting the number of the operations.
The next Q line contains 4 integers t, L, R, X. T Denotes the operation type.

T <= 2, N, q <= 100000
A_ I, x> = 0
A_ I, X is in the range of int32 (C ++) 
Outputfor each test case, output a line with N integers separated by a single space representing the final sequence.
Please output a single more space after end of the sequence 
Sample Input

11016807 282475249 1622650073 984943658 1144108930 470211272 101027544 1457850878 1458777923 2007237709 101 3 6 742430422 4 8 165317291 3 4 14748331692 1 8 11315709332 7 9 15057953352 3 7 1019292671 4 10 16243791492 2 8 21100106722 6 7 1560917451 2 5 937186357

 
Sample output

16807 937186357 937186357 937186357 937186357 1 1 1624379149 1624379149 1624379149 

 
Authorwjmzbmr
Source2014 multi-university training contest 4

#include <stdio.h>#include <string.h>#include <iostream>#include <algorithm>#include <vector>#include <queue>#include <set>#include <map>#include <string>#include <math.h>#include <stdlib.h>#define max( x, y )  ( ((x) > (y)) ? (x) : (y) )#define min( x, y )  ( ((x) < (y)) ? (x) : (y) )#define Mod 1000000007#define LL long longusing namespace std;const int maxn = 100010;struct node{    int l, r;    int flag;    LL x;} f[maxn*4];LL num[maxn];void Bulid(int l, int r, int site){    f[site].l = l;    f[site].r = r;    f[site].flag = 0;    if(l == r)    {        f[site].x = num[l];        f[site].flag = 1;        return;    }    int mid = (l+r)/2;    Bulid(l, mid, site<<1);    Bulid(mid+1, r, site<<1|1);}void Output(int l, int r, int site){    if(l == r)    {        printf("%I64d ",f[site].x);        return;    }    if(f[site].flag)    {        f[site<<1].flag = f[site<<1|1].flag = 1;        f[site<<1].x = f[site<<1|1].x = f[site].x;    }    int mid = (l+r)/2;    Output(l, mid, site<<1);    Output(mid+1, r, site<<1|1);}void Change(int l, int r, LL x, int site){    if(l == f[site].l && r == f[site].r)    {        f[site].x = x;        f[site].flag = 1;        return;    }    if(f[site].flag)    {        f[site<<1].flag = f[site<<1|1].flag = 1;        f[site<<1].x = f[site<<1|1]. x = f[site].x;        f[site].flag = 0;    }    int mid = (f[site].l+f[site].r)/2;    if(r <= mid) Change(l, r, x, site<<1);    else if(l > mid) Change(l, r, x, site<<1|1);    else    {        Change(l, mid, x, site<<1);        Change(mid+1, r, x, site<<1|1);    }}void Updata(int l, int r, LL x, int site){    if(f[site].l == l && f[site].r == r && f[site].flag)    {        if(f[site].x > x)            f[site].x = __gcd(f[site].x, x);        return;    }    if(f[site].flag)    {        f[site<<1].flag = f[site<<1|1].flag = 1;        f[site<<1].x = f[site<<1|1]. x = f[site].x;        f[site].flag = 0;    }    int mid = (f[site].l+f[site].r)/2;    if(r <= mid) Updata(l, r, x, site<<1);    else if(l > mid) Updata(l, r, x, site<<1|1);    else    {        Updata(l, mid, x, site<<1);        Updata(mid+1, r, x, site<<1|1);    }}int main(){    int T;    cin >>T;    int n, m;    while(T--)    {        scanf("%d",&n);        for(int i = 1; i <= n; i++) scanf("%I64d",&num[i]);        Bulid(1, n, 1);        scanf("%d",&m);        int x, l, r;        LL xx;        while(m--)        {            scanf("%d %d %d %I64d",&x, &l, &r, &xx);            if(x == 1) Change(l, r, xx, 1);            else Updata(l, r, xx, 1);        }        Output(1, n, 1);        puts("");    }    return 0;}