Codeforces Round #271 (Div. 2) F. Ant colony 线段树
2017-07-30 11:50
525 查看
F. Ant colony
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He chooses two numbers l and r (1 ≤ l ≤ r ≤ n) and each pair of ants with indices between l and r (inclusively) will fight. When two ants i and j fight, ant i gets one battle point only if si divides sj (also, ant j gets one battle point only if sj divides si).
After all fights have been finished, Mole makes the ranking. An ant i, with vi battle points obtained, is going to be freed only if vi = r - l, or in other words only if it took a point in every fight it participated. After that, Mole eats the rest of the ants. Note that there can be many ants freed or even none.
In order to choose the best sequence, Mole gives you t segments [li, ri] and asks for each of them how many ants is he going to eat if those ants fight.
Input
The first line contains one integer n (1 ≤ n ≤ 105), the size of the ant colony.
The second line contains n integers s1, s2, ..., sn (1 ≤ si ≤ 109), the strengths of the ants.
The third line contains one integer t (1 ≤ t ≤ 105), the number of test cases.
Each of the next t lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n), describing one query.
Output
Print to the standard output t lines. The i-th line contains number of ants that Mole eats from the segment [li, ri].
Examples
input
output
Note
In the first test battle points for each ant are v = [4, 0, 2, 0, 2], so ant number 1 is freed. Mole eats the ants 2, 3, 4, 5.
In the second test case battle points are v = [0, 2, 0, 2], so no ant is freed and all of them are eaten by Mole.
In the third test case battle points are v = [2, 0, 2], so ants number 3 and 5 are freed. Mole eats only the ant 4.
In the fourth test case battle points are v = [0, 1], so ant number 5 is freed. Mole eats the ant 4.
区间gcd,区间最小值。区间最小值个数
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Mole is hungry again. He found one ant colony, consisting of n ants, ordered in a row. Each ant i (1 ≤ i ≤ n) has a strength si.
In order to make his dinner more interesting, Mole organizes a version of «Hunger Games» for the ants. He chooses two numbers l and r (1 ≤ l ≤ r ≤ n) and each pair of ants with indices between l and r (inclusively) will fight. When two ants i and j fight, ant i gets one battle point only if si divides sj (also, ant j gets one battle point only if sj divides si).
After all fights have been finished, Mole makes the ranking. An ant i, with vi battle points obtained, is going to be freed only if vi = r - l, or in other words only if it took a point in every fight it participated. After that, Mole eats the rest of the ants. Note that there can be many ants freed or even none.
In order to choose the best sequence, Mole gives you t segments [li, ri] and asks for each of them how many ants is he going to eat if those ants fight.
Input
The first line contains one integer n (1 ≤ n ≤ 105), the size of the ant colony.
The second line contains n integers s1, s2, ..., sn (1 ≤ si ≤ 109), the strengths of the ants.
The third line contains one integer t (1 ≤ t ≤ 105), the number of test cases.
Each of the next t lines contains two integers li and ri (1 ≤ li ≤ ri ≤ n), describing one query.
Output
Print to the standard output t lines. The i-th line contains number of ants that Mole eats from the segment [li, ri].
Examples
input
5 1 3 2 4 2 4 1 5 2 5 3 5 4 5
output
4 4 1 1
Note
In the first test battle points for each ant are v = [4, 0, 2, 0, 2], so ant number 1 is freed. Mole eats the ants 2, 3, 4, 5.
In the second test case battle points are v = [0, 2, 0, 2], so no ant is freed and all of them are eaten by Mole.
In the third test case battle points are v = [2, 0, 2], so ants number 3 and 5 are freed. Mole eats only the ant 4.
In the fourth test case battle points are v = [0, 1], so ant number 5 is freed. Mole eats the ant 4.
区间gcd,区间最小值。区间最小值个数
#pragma comment(linker, "/STACK:1024000000,1024000000") #include<iostream> #include<cstdio> #include<cmath> #include<string> #include<queue> #include<algorithm> #include<stack> #include<cstring> #include<vector> #include<list> #include<set> #include<map> #include<bitset> #include<time.h> using namespace std; #define LL long long #define pi (4*atan(1.0)) #define eps 1e-4 #define bug(x) cout<<"bug"<<x<<endl; const int N=1e5+10,M=1e6+10,inf=1e9+7,MOD=1e9+7; const LL INF=1e18+10,mod=1e9+7; struct is { int gcd,minn,num; }; struct SGT { int minn[N<<2],gcd[N<<2],num[N<<2]; void pushup(int pos) { if(minn[pos<<1]==minn[pos<<1|1]) minn[pos]=minn[pos<<1],num[pos]=num[pos<<1]+num[pos<<1|1]; else if(minn[pos<<1]<minn[pos<<1|1]) minn[pos]=minn[pos<<1],num[pos]=num[pos<<1]; else minn[pos]=minn[pos<<1|1],num[pos]=num[pos<<1|1]; gcd[pos]=__gcd(gcd[pos<<1],gcd[pos<<1|1]); } void build(int l,int r,int pos) { if(l==r) { scanf("%d",&minn[pos]); gcd[pos]=minn[pos]; num[pos]=1; return; } int mid=(l+r)>>1; build(l,mid,pos<<1); build(mid+1,r,pos<<1|1); pushup(pos); } is query(int L,int R,int l,int r,int pos) { if(L==l&&r==R)return (is){gcd[pos],minn[pos],num[pos]}; int mid=(l+r)>>1; if(L>mid)return query(L,R,mid+1,r,pos<<1|1); else if(R<=mid)return query(L,R,l,mid,pos<<1); else { is x=query(L,mid,l,mid,pos<<1); is z=query(mid+1,R,mid+1,r,pos<<1|1); int gcd=__gcd(x.gcd,z.gcd); int num,minn=1; if(x.minn==z.minn) minn=x.minn,num=x.num+z.num; else if(x.minn<z.minn) minn=x.minn,num=x.num; else minn=z.minn,num=z.num; return (is){gcd,minn,num}; } } }tree; int main() { int n; scanf("%d",&n); tree.build(1,n,1); int q; scanf("%d",&q); while(q--) { int l,r; scanf("%d%d",&l,&r); is ans=tree.query(l,r,1,n,1); //cout<<ans.minn<<" "<<ans.gcd<<endl; if(ans.minn&&ans.gcd%ans.minn==0)printf("%d\n",r-l+1-ans.num); else printf("%d\n",r-l+1); } return 0; }
相关文章推荐
- Codeforces Round #271 (Div. 2) F. Ant colony(线段树)
- Codeforces Round #271 (Div. 2) F. Ant colony (RMQ or 线段树)
- Codeforces Round #271 (Div. 2)F. Ant colony(线段树)
- Codeforces Round #271 (Div. 2) F Ant colony
- Codeforces Round #271 (Div. 2) F. Ant colony
- Codeforces #284 div1 D. Traffic Jams in the Land 数论 线段树
- Codeforces Round #244 (Div. 2) B. Prison Transfer 线段树rmq
- Codeforces 474 F. Ant colony
- Codeforces Round #275 (Div. 2) D 线段树
- Codeforces Round #209 (Div. 2)-C. Prime Number(set)和D. Pair of Numbers(线段树)
- Codeforces Round #365 (Div. 2) D (线段树)
- Codeforces Round #275 Div.1 B Interesting Array --线段树
- Educational Codeforces Round 33 (Rated for Div. 2) F. Subtree Minimum Query (线段树)
- Ant Colony Optimization For Hackers
- Codeforces Round #179 (Div. 1) A题 线段树
- Codeforces Round 232 Div 1 C On Changing Tree 树状数组 或 线段树
- Codeforces Round #261 (Div. 2)D题(水线段树)
- Codeforces Round #345 (Div. 1) D. Zip-line LIS 离线 离散化 线段树
- Codeforces Round #271 (Div. 2) E 离散化+线段树
- [POI2014]Ant colony