2014 Multi-University Training Contest 4

1006

hdu4902

 #include <iostream>
 #include<stdio.h>
 #include<vector>
 #include<queue>
 #include<stack>
 #include<string.h>
 #include<algorithm>
 using namespace std;
 #define LL long long
 #define N 100010
 #define lcm(a,b) (a*b/gcd(a,b))
 int gcd(int a,int b)
 {
     if(b>a)swap(a,b);
     return b==?a:gcd(b,a%b);
 }
 int s[N<<],lz[N<<],a[N],f[N<<];
 void up(int w)
 {
     s[w] = max(s[w<<],s[w<<|]);
     if(s[w<<]==s[w<<|]&&f[w<<]&&f[w<<|])
         f[w] = ;
     else f[w] = ;
 }
 void build(int l,int r,int w)
 {
     lz[w] = -;
     f[w] = ;
     if(l==r)
     {
         s[w] =  a[l];
         f[w] = ;
         return ;
     }
     int m = (l+r)>>;
     build(l,m,w<<);
     build(m+,r,w<<|);
     up(w);
 }
 void down(int w,int m)
 {
     if(lz[w]!=-)
     {
         s[w<<] = s[w<<|] = lz[w<<] = lz[w<<|] = lz[w];
         lz[w] = -;
     }
 }
 void update(int a,int b,int d,int l,int r,int w)
 {
     if(a<=l&&b>=r)
     {
         if(s[w]>d)
         {
             if(f[w]==)
             {
                 s[w] = lz[w] = gcd(s[w],d);
                 return ;
             }
             if(l==r)
             {
                 s[w] = gcd(s[w],d);
                 return ;
             }
             down(w,r-l+);
             int m = (l+r)>>;
             update(a,b,d,l,m,w<<);
             update(a,b,d,m+,r,w<<|);
             up(w);
         }
         return ;
     }
     down(w,r-l+);
     int m = (l+r)>>;
     if(a<=m)
         update(a,b,d,l,m,w<<);
     if(b>m)
         update(a,b,d,m+,r,w<<|);
     up(w);
 }
 void change(int a,int b,int d,int l,int r,int w)
 {
     if(a<=l&&b>=r)
     {
         lz[w] = d;
         s[w] = d;
         f[w] = ;
         return ;
     }
     down(w,r-l+);
     int m = (l+r)>>;
     if(a<=m)
         change(a,b,d,l,m,w<<);
     if(b>m)
         change(a,b,d,m+,r,w<<|);
     up(w);
 }
 int query(int p,int l,int r,int w)
 {
     if(l==r)
     {
         return s[w];
     }
     down(w,r-l+);
     int m = (l+r)>>;
     if(p<=m) return query(p,l,m,w<<);
     else return query(p,m+,r,w<<|);
 }
 int main()
 {
     int n,i;
     int t;
     cin>>t;
     while(t--)
     {
         scanf("%d",&n);
         for(i = ; i<= n ;i++)
             scanf("%d",&a[i]);
         build(,n,);
         int m;
         scanf("%d",&m);
         while(m--)
         {
             int x,y,z,d;
             scanf("%d%d%d%d",&d,&x,&y,&z);
             if(d==)
             {
                 change(x,y,z,,n,);
             }
             else if(d==)
                 update(x,y,z,,n,);
         }
         for(i =  ; i<=n; i++)
             printf("%d ",query(i,,n,));
         puts("");
     }
     return ;
 }