Nice boat
Time Limit: 30000/15000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 2135 Accepted Submission(s): 963
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.
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 >=0
a_i,x is in the range of int32(C++)
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++)
Output
For 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
Please output a single more space after end of the sequence
Sample Input
1 10 16807 282475249 1622650073 984943658 1144108930 470211272 101027544 1457850878 1458777923 2007237709 10 1 3 6 74243042 2 4 8 16531729 1 3 4 1474833169 2 1 8 1131570933 2 7 9 1505795335 2 3 7 101929267 1 4 10 1624379149 2 2 8 2110010672 2 6 7 156091745 1 2 5 937186357
Sample Output
16807 937186357 937186357 937186357 937186357 1 1 1624379149 1624379149 1624379149
Author
WJMZBMR
Source
// 题意 两个操作 1 把 a , b 区间全部更改成一个数X 2把区间a,b里面大于X的数改成 他们的 gcd
// 最后在M操作后 输出
<pre name="code" class="cpp">#include<stdio.h>
#include<algorithm>
using namespace std;
#define MAXN 100010
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
int tree[MAXN*4];// 这个节点最大数
int add[MAXN*4]; // 记录节点全部为一个数 如果不全为一个数就是0
int gg;
void pushup(int rt)
{
tree[rt]=max(tree[rt<<1],tree[rt<<1|1]);
}
void pushdown(int rt)
{
if(add[rt])
{
add[rt<<1]=add[rt];
add[rt<<1|1]=add[rt];
tree[rt<<1]=add[rt<<1];
tree[rt<<1|1]=add[rt<<1|1];
add[rt]=0;
}
}
int gcd(int a,int b)
{
if(!b) return a;
else return gcd(b,a%b);
}
void build(int l,int r,int rt)
{
add[rt]=0;
if(l==r)
{
scanf("%d",&tree[rt]);
add[rt]=tree[rt];
return ;
}
int m=(l+r)>>1;
build(lson);
build(rson);
pushup(rt);
}
void query(int p,int l,int r,int rt)
{
if(l==r)
{
gg=tree[rt];
return ;
}
pushdown(rt);
int m=(l+r)>>1;
if(p<=m) query(p,lson);
if(p>m) query(p,rson);
}
void update1(int L,int R,int p,int l,int r,int rt)
{
if(L<=l&&R>=r)
{
add[rt]=p;
tree[rt]=p;
return ;
}
pushdown(rt);
int m=(l+r)>>1;
if(L<=m) update1(L,R,p,lson);
if(R>m) update1(L,R,p,rson);
pushup(rt);
}
void update2(int L,int R,int p,int l,int r,int rt)
{
if(L<=l&&R>=r)
{
if(add[rt]>0&&tree[rt]<=p) //如果全为一个数&区间的这个数小于X则直接返回
return ;
if(add[rt]>0&&tree[rt]>p) // 更新
{
add[rt]=gcd(add[rt],p);
tree[rt]=add[rt];
return ;
}
}
pushdown(rt);
int m=(l+r)>>1;
if(L<=m) update2(L,R,p,lson);
if(R>m) update2(L,R,p,rson);
pushup(rt);
}
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n,m,i;
scanf("%d",&n);
build(1,n,1);
scanf("%d",&m);
int op,a,b,h;
for(i=0; i<m; i++)
{
scanf("%d %d %d %d",&op,&a,&b,&h);
if(op==1)
{
update1(a,b,h,1,n,1);
}
else update2(a,b,h,1,n,1);
}
for(i=1; i<=n; i++)
{
query(i,1,n,1);
printf("%d ",gg);
}
printf("\n");
}
return 0;
}
线段树 写了些日子了 还是有点感觉了