poj -- 2886 约瑟夫问题（线段树）

http://poj.org/problem?id=2886

 

 

 

Who Gets the Most Candies?Time Limit: 5000MS Memory Limit: 131072K
Total Submissions: 4140 Accepted: 1117
Case Time Limit: 2000MS


Description

N children are sitting in a circle to play a game.

The children are numbered from 1 to N in clockwise order. Each of them has a card with a non-zero integer on it in his/her hand. The game starts from the K-th child, who tells all the others the integer on his card and jumps out of the circle. The integer on his card tells the next child to jump out. Let A denote the integer. If A is positive, the next child will be the A-th child to the left. If A is negative, the next child will be the (−A)-th child to the right.

The game lasts until all children have jumped out of the circle. During the game, the p-th child jumping out will get F(p) candies where F(p) is the number of positive integers that perfectly divide p. Who gets the most candies?

Input
There are several test cases in the input. Each test case starts with two integers N (0 < N ≤ 500,000) and K (1 ≤ K ≤ N) on the first line. The next N lines contains the names of the children (consisting of at most 10 letters) and the integers (non-zero with magnitudes within 108) on their cards in increasing order of the children’s numbers, a name and an integer separated by a single space in a line with no leading or trailing spaces.

Output

Output one line for each test case containing the name of the luckiest child and the number of candies he/she gets. If ties occur, always choose the child who jumps out of the circle first.

Sample Input
4 2
Tom 2
Jack 4
Mary -1
Sam 1

Sample Output
Sam 3

 

题意：N个人，首先从K开始出局，K更新为当前人身上的数字，继续数K个人。如果是负的就倒着数。

直到所有人出局。

第P个出局的人会得到F[P]个糖果，F[P]表示P的约数的个数，例如 6的约数有 1 2 3 6，所以F[6]=4

 

解法：线段树

 

线段树节点保存a,b区间以及[a,b]区间中剩余的人数。 

 

每次算出要出局的人在剩余人中的位置。 然后将其出局。重复N次，更多细节请看代码。

 

CODE1:

 

//1891MS #include<iostream> using namespace std; #define maxn 500002 int F[maxn]; struct data { int i,ans; bool operator >(data t) { if(t.ans==ans) return i<t.i; return ans>t.ans; } }ans[maxn]; char num[maxn][11]; int K[maxn]; int n,k,index,who,nextwho; //index=第几回合,who=从谁开始,netxtwho,从左往右第几个 struct node { int l,r,sum; }tree[maxn*3]; void build(int t,int l,int r) { tree[t].l=l; tree[t].r=r; tree[t].sum=r-l+1; if(r>l) { int mid=(l+r)>>1; build(t+t,l,mid); build(t+t+1,mid+1,r); } } void quary(int t,int sum) { if(tree[t].l==tree[t].r) { k=K[tree[t].r]; //更新 ans[tree[t].r].ans=F[index]; ans[tree[t].r].i=index; int k2=K[tree[t].r]; if(k2>0) who=nextwho; else { who=nextwho-1; if(tree[1].sum!=1&&who==-1) { who=tree[1].sum-2; } } } else { if(sum>tree[t+t].sum) quary(t+t+1,sum-tree[t+t].sum); else quary(t+t,sum); } tree[t].sum--; } int main() { int i,j; for(i=1;i<500001;i++) { for(j=1;j*i<500001;j++) { F[i*j]++; } } while(scanf("%d%d",&n,&k)!=EOF) { for (i=0;i<n;i++) scanf("%s %d",num[i],&K[i]); who=0; build(1,0,n-1); for (i=0;i<n;i++) { index=i+1; if(k>0) { nextwho=(k+who-1)%tree[1].sum; } else { k++; k+=who; k%=tree[1].sum; if(k<0) nextwho=tree[1].sum+k; else nextwho=k; } quary(1,nextwho+1); } data Max=ans[0]; k=0; // for (i=0;i<n;i++) // { // printf("%s %d %d/n",num[i],ans[i].ans,ans[i].i); // } for(i=1;i<n;i++) { if(ans[i]>Max) { Max=ans[i]; k=i; } } printf("%s %d/n",num[k],Max.ans); } }

 

CODE2:

//反素数打表 //1294MS #include<iostream> #include <algorithm> using namespace std; #define maxn 500005 int F[35][2]={498960,200,332640,192,277200,180,221760,168,166320,160,110880,144,83160,128,55440,120,50400,108,45360,100,27720,96,25200,90,20160,84,15120,80,10080,72,7560,64,5040,60,2520,48,1680,40,1260,36,840,32,720,30,360,24,240,20,180,18,120,16,60,12,48,10,36,9,24,8,12,6,6,4,4,3,2,2,1,1}; struct data { int i,ans; bool operator >(data t) { if(t.ans==ans) return i<t.i; return ans>t.ans; } }ans[maxn]; char num[maxn][12]; int K[maxn]; int n,k,index,who,nextwho; //index=第几回合,who=从谁开始,netxtwho,从左往右第几个 struct node { int l,r,sum; }tree[maxn*3]; void build(int t,int l,int r) { tree[t].l=l; tree[t].r=r; tree[t].sum=r-l+1; if(r>l) { int mid=(l+r)>>1; build(t+t,l,mid); build(t+t+1,mid+1,r); } } void quary(int t,int sum) { if(tree[t].l==tree[t].r) { k=K[tree[t].r]; //更新 int p = 0; while(index<F[p][0]) p++; ans[tree[t].r].ans=F[p][1]; ans[tree[t].r].i=index; int k2=K[tree[t].r]; if(k2>0) who=nextwho; else { who=nextwho-1; if(tree[1].sum!=1&&who==-1) { who=tree[1].sum-2; } } } else { if(sum>tree[t+t].sum) quary(t+t+1,sum-tree[t+t].sum); else quary(t+t,sum); } tree[t].sum--; } int main() { int i,j; while(scanf("%d%d",&n,&k)!=EOF) { for (i=0;i<n;i++) scanf("%s %d",num[i],&K[i]); who=0; build(1,0,n-1); for (i=0;i<n;i++) { index=i+1; if(k>0) { nextwho=(k+who-1)%tree[1].sum; } else { k++; k+=who; k%=tree[1].sum; if(k<0) nextwho=tree[1].sum+k; else nextwho=k; } quary(1,nextwho+1); } data Max=ans[0]; k=0; // for (i=0;i<n;i++) // { // printf("%s %d %d/n",num[i],ans[i].ans,ans[i].i); // } for(i=1;i<n;i++) { if(ans[i]>Max) { Max=ans[i]; k=i; } } printf("%s %d/n",num[k],Max.ans); } }