Nice boat

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

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 >=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
 
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表示把一段区间内的数变成x,2表示把一段区间内的数如果这个数大于x则变为这个数与x的最小公约数,否则不变。最后输出变化后的一组数。

【题目分析】

这题和其他线段树有一些区别,这题是在所有的处理结束后才全部输出。
我们在每个结点中加一个flag标记该区间内的数字是否都是同一个,如果区间是同一个数的话我们就可以进行批处理,这将会大大降低时间复杂度。
再用一个temp来存储该结点的val,然后在pushdown函数将temp的值一层一层的传递下去。
这里的temp既起到了该结点是否已经向下更新的作用(相当于lazy),又起到了记录子节点需要更新的值的作用。
temp只有在val的值改变的时候才改变。

//Memory   Time
// 5376K 651MS
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<iomanip>
#include<string>
#include<climits>
#include<cmath>
#define MAX 100100
#define LL long long
using namespace std;
int n,m;
int ans;
int num[MAX];
struct Tree
{
int l,r;
bool flag;
int val,temp;
};
Tree tree[MAX<<2]; int gcd(int x,int y)
{
return y?gcd(y,x%y):x;
} void pushup(int x)
{
int tmp=x<<1;
tree[x].val=max(tree[tmp].val,tree[tmp+1].val);
tree[x].flag=(tree[tmp].val==tree[tmp+1].val&&tree[tmp].flag&&tree[tmp+1].flag);
} void pushdown(int x)
{
if(tree[x].temp==-1)return;
int tmp=x<<1;
int mid=(tree[x].l+tree[x].r)>>1;
tree[tmp].val=tree[tmp+1].val=tree[tmp].temp=tree[tmp+1].temp=tree[x].temp;
tree[x].temp=-1;
} void build(int l,int r,int x)
{
tree[x].flag=0;
tree[x].temp=-1;
tree[x].l=l,tree[x].r=r;
if(l==r)
{
scanf("%d",&tree[x].val);
tree[x].flag=1;
return;
}
int tmp=x<<1;
int mid=(l+r)>>1;
build(l,mid,tmp);
build(mid+1,r,tmp+1);
pushup(x);
} void update(int l,int r,int num,int x)
{
if(r<tree[x].l||l>tree[x].r)return;
if(l<=tree[x].l&&r>=tree[x].r)
{
tree[x].flag=1;
tree[x].val=num;
tree[x].temp=num;
return;
}
pushdown(x);
int tmp=x<<1;
int mid=(tree[x].l+tree[x].r)>>1;
if(r<=mid)
update(l,r,num,tmp);
else if(l>mid)
update(l,r,num,tmp+1);
else
{
update(l,mid,num,tmp);
update(mid+1,r,num,tmp+1);
}
pushup(x);
} void change(int l,int r,int num,int x)
{
if(r<tree[x].l||l>tree[x].r)return;
if(tree[x].flag&&tree[x].val<=num)return;
if(l<=tree[x].l&&r>=tree[x].r&&tree[x].flag)
{
tree[x].val=gcd(tree[x].val,num);
tree[x].temp=tree[x].val;
return;
}
pushdown(x);
int tmp=x<<1;
int mid=(tree[x].l+tree[x].r)>>1;
if(r<=mid)
change(l,r,num,tmp);
else if(l>mid)
change(l,r,num,tmp+1);
else
{
change(l,mid,num,tmp);
change(mid+1,r,num,tmp+1);
}
pushup(x);
} void query(int l,int r,int k,int x)
{
if(k<tree[x].l||k>tree[x].r)return;
if(tree[x].flag)
{
ans=tree[x].val;
return;
}
pushdown(x);
int tmp=x<<1;
int mid=(tree[x].l+tree[x].r)>>1;
if(k<=mid)
query(l,mid,k,tmp);
else
query(mid+1,r,k,tmp+1);
} int main()
{
int T;
int t,l,r,num;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
build(1,n,1);
scanf("%d",&m);
while(m--)
{
scanf("%d %d %d %d",&t,&l,&r,&num);
if(t==1)
update(l,r,num,1);
else
change(l,r,num,1);
}
for(int i=1;i<=n;i++)
{
ans=0;
query(1,n,i,1);
printf("%d ",ans);
}
puts("");
}
return 0;
}

  


【解法二】

这题不知道出题人怎么搞的,数据弱爆了,直接暴力还比线段树还快。

当然也不是单纯的暴力,从后往前搜,用一个数组prime来记录需要求gcd的值,遇到type=1就退出,最后来求一下gcd即可。

//Memory   Time
// 2232K 250MS
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<stack>
#include<iomanip>
#include<string>
#include<climits>
#include<cmath>
#define MAX 100100
#define LL long long
using namespace std;
int T,n,q;
int num[MAX];
int t[MAX],l[MAX],r[MAX],x[MAX];
int prime[MAX];
int gcd(int x,int y)
{
return y?gcd(y,x%y):x;
}
int main()
{
// freopen("cin.txt","r",stdin);
// freopen("cout.txt","w",stdout);
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
for(int i=1;i<=n;++i)
scanf("%d",&num[i]);
scanf("%d",&q);
for(int i=1;i<=q;++i)
scanf("%d %d %d %d",&t[i],&l[i],&r[i],&x[i]);
for(int i=1;i<=n;++i)
{
int tp=num[i];
int index=-1;
for(int j=q;j>=1;--j)
{
if(i>=l[j]&&i<=r[j])
{
if(t[j]==1)
{
tp=x[j];
break;
}
else prime[++index]=x[j];
}
}
for(int j=index;j>=0;--j)
{
if(tp>prime[j])
tp=gcd(tp,prime[j]);
}
printf("%d ",tp);
}
puts("");
}
return 0;
}

  

线段树 + 区间更新 ----- HDU 4902 : Nice boat的更多相关文章

  1. 线段树-区间更新-HDU 1689

    #include <iostream> #include <cstdio> #include <string> #include <cstring> # ...

  2. HDU 4902 Nice boat 2014杭电多校训练赛第四场F题(线段树区间更新)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=4902 解题报告:输入一个序列,然后有q次操作,操作有两种,第一种是把区间 (l,r) 变成x,第二种是 ...

  3. HDU 5023 A Corrupt Mayor's Performance Art(线段树区间更新)

    题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=5023 解题报告:一面墙长度为n,有N个单元,每个单元编号从1到n,墙的初始的颜色是2,一共有30种颜色 ...

  4. hdu 4031 attack 线段树区间更新

    Attack Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)Total Subm ...

  5. hdu 3966(树链剖分+线段树区间更新)

    传送门:Problem 3966 https://www.cnblogs.com/violet-acmer/p/9711441.html 学习资料: [1]线段树区间更新:https://blog.c ...

  6. HDU.1556 Color the ball (线段树 区间更新 单点查询)

    HDU.1556 Color the ball (线段树 区间更新 单点查询) 题意分析 注意一下pushdown 和 pushup 模板类的题还真不能自己套啊,手写一遍才行 代码总览 #includ ...

  7. HDU 1556 Color the ball(线段树区间更新)

    Color the ball 我真的该认真的复习一下以前没懂的知识了,今天看了一下线段树,以前只会用模板,现在看懂了之后,发现还有这么多巧妙的地方,好厉害啊 所以就应该尽量搞懂 弄明白每个知识点 [题 ...

  8. HDU 1698 线段树 区间更新求和

    一开始这条链子全都是1 #include<stdio.h> #include<string.h> #include<algorithm> #include<m ...

  9. (简单) HDU 1698 Just a Hook , 线段树+区间更新。

    Description: In the game of DotA, Pudge’s meat hook is actually the most horrible thing for most of ...

随机推荐

  1. ubuntu 14.04安装mysql数据库

    1. apt-get install mysql-server mysql-client 输入root的密码: 确认root的密码: 2. 连接测试是否成功:mysql –hlocalhost –ur ...

  2. php分享十五:php的命令行操作

    一:像命令行传参数方法: 1: 使用$argc $argv 用法: /usr/local/php/bin/php ./getopt.php 123  456 2:使用getopt函数() http:/ ...

  3. Nginx(四):压缩功能详解

    gzip (GNU-ZIP) 是一种压缩技术.经过 gzip 压缩后页面大小可以变为原来的 30%甚至更小. 这样,用户浏览页面的时候速度会快得多.  gzip 的压缩页面需要浏览器和服务器双方都支持 ...

  4. Spring Security教程(六):自定义过滤器进行认证处理

    这里接着上篇的自定义过滤器,这里主要的是配置自定义认证处理的过滤器,并加入到FilterChain的过程. 在我们自己不在xml做特殊的配置情况下,security默认的做认证处理的过滤器为Usern ...

  5. 【Android教程】Android用户系统管理

    原文:http://android.eoe.cn/topic/android_sdk Android用户迷恋于在自己的设备上安装他们所喜欢的应用.让您的应用受用户喜欢的一种方法就是让它个性化.Andr ...

  6. 运行jar乱码问题

    请使用 1.java -jar  -Dfile.encoding=utf-8 dapao.jar 2.请使用URLDecode,URLEncode 3.请使用unicode编码格式 bat运行当前目录 ...

  7. k8s相关文档

    kube-dns组件架构区别看这个就够了 http://cizixs.com/2017/04/11/kubernetes-intro-kube-dns kubed-dns设置细节看这个就够了 http ...

  8. Java 必须掌握的 12 种 Spring 常用注解!

    1.声明bean的注解 @Component 组件,没有明确的角色 @Service 在业务逻辑层使用(service层) @Repository 在数据访问层使用(dao层) @Controller ...

  9. Shell脚本判断内容为None的方式

    1.判断变量 read -p "input a word :" word if [ ! -n "$word" ] ;then echo "you ha ...

  10. HTML中Zen Coding

    嵌套运算符 嵌套运算符用于以缩写的方式安排元素在生成文档树中的位置:将其放在内部或成为相邻的元素. 子: > 可以使用 > 运算符指定嵌套元素在另一个元素内部: div>ul> ...