学习内容

 

Nice boat(多校联合1006)

分类： 线段树 多校联合20142014-07-31 14:31 14人阅读 评论(0) 收藏 举报

Nice boat

Time Limit: 30000/15000 MS (Java/Others)    Memory Limit: 131072/131072 K (Java/Others)
Total Submission(s): 1    Accepted Submission(s): 0

Problem Description

   There is an old country and the king fell in love with a devil. The devil 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 devil. Also, this devil 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, many people died but no one knows why and everyone is fine about that. Meanwhile, the devil 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 should output the final sequence.

 

Input

   The 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 is in the range of int32(C++)

 

Output

   For each test case, output a line with n integers separated by a single space representing the final 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 
这个破题挺坑的，RE了N次。简单线段树，挺好写的
AC代码：
[cpp] view plaincopy
#include<iostream>  
#include<stdio.h>  
#include <algorithm>  
using namespace std;  
struct Node{  
    int left,right;  
    int s;             //这里要是long long的话就会RE   
}a[400100];  
  
void built(int cur,int x,int y){  
    a[cur].left=x;  
    a[cur].right=y;  
    a[cur].s=-1;  
    if(x==y){  
        scanf("%d",&a[cur].s);  
        return;  
    }  
    if(x<y){  
        int mid=(x+y)>>1;  
        built(cur<<1,x,mid);  
        built(cur<<1|1,mid+1,y);  
        if(a[cur<<1].s==a[cur<<1|1].s)  
            a[cur].s=a[cur<<1].s;  
    }  
}  
  
void insert1(int cur,int x,int y,int val){  
    if(a[cur].left==x && a[cur].right==y){  
        a[cur].s=val;  
        return;  
    }  
    if(a[cur].s>=0){  
        a[cur<<1].s=a[cur].s;  
        a[cur<<1|1].s=a[cur].s;  
        a[cur].s=-1;  
    }  
    int mid=(a[cur].left+a[cur].right)>>1;  
    if(y<=mid)  
        insert1(cur<<1,x,y,val);  
    else if(x>mid)  
        insert1(cur<<1|1,x,y,val);  
    else{  
        insert1(cur<<1,x,mid,val);  
        insert1(cur<<1|1,mid+1,y,val);  
    }  
}  
void insert2(int cur,int x,int y,int val){  
    if(a[cur].left==x && a[cur].right==y && a[cur].s>=0){  
        if(a[cur].s>val){  
            a[cur].s=__gcd(a[cur].s,val);  
        }  
        return ;  
    }  
    if(a[cur].s>=0){  
        a[cur<<1].s=a[cur<<1|1].s=a[cur].s;  
        a[cur].s=-1;  
    }  
    int mid=(a[cur].left+a[cur].right)>>1;  
    if(y<=mid)  
        insert2(cur<<1,x,y,val);  
    else if(x>mid)  
        insert2(cur<<1|1,x,y,val);  
    else{  
        insert2(cur<<1,x,mid,val);  
        insert2(cur<<1|1,mid+1,y,val);  
    }  
}  
  
void output(int cur){  
    if(a[cur].s>=0){  
        for(int i=a[cur].left;i<=a[cur].right;i++)  
            printf("%d ",a[cur].s);  
        return ;  
    }  
    output(cur<<1);  
    output(cur<<1|1);  
}  
  
int main(){  
    int Q,T; scanf("%d",&T);  
    while(T--){  
        int n; scanf("%d",&n);  
        built(1,1,n);  
        scanf("%d",&Q);  
        while(Q--){  
            int t,l,r;  
            int x;              //这里要是long long的话就会RE   
            scanf("%d%d%d%d",&t,&l,&r,&x);  
            if(t==1){  
                insert1(1,l,r,x);  
            }  
            else{  
                insert2(1,l,r,x);  
            }  
        }  
        output(1);  
        printf("\n");  
    }  
    return 0;  
}