POJ 2886 Who Gets the Most Candies?

Who Gets the Most Candies?

题意：

一群小伙伴围成一圈按照1-n编号，给出一个k首先让k-th出圈，接下来给出1-n个人的名字和接下来这些人让从ta数第几个人出队，（正的顺时针，负的逆时针）

F（p）为p的因子个数，求第p个人使得F(p)最大，多个向同时选择p最小。

思路：

用素数筛的方式预处理f[]数组，得出500000以内的35个反素数p[]，（反素数满足条件：F(p[i])<=F(j)] , p[i]=<j<p[i+1]）

再用线段树维护动态数组的删除操作

/**
POJ 2886 Who Gets the Most Candies?
*/
#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<cmath>
#define maxn 500005
#define INF 0x3fffffff
#define ll __int64
using namespace std;
char ch[maxn][15];
int next[maxn];
struct node{
    int l,r;
    int val,sum;
}tr[maxn*4];
void pushup(int rt){
    tr[rt].sum=tr[rt<<1].sum+tr[rt<<1|1].sum;
}
void Build(int rt,int l,int r){
    tr[rt].l=l;
    tr[rt].r=r;
    tr[rt].val=1;
    if(l==r) {
        tr[rt].sum=1;
        return ;
    }
    int mid=(l+r)>>1;
    Build(rt<<1,l,mid);
    Build(rt<<1|1,mid+1,r);
    pushup(rt);
}
int Query(int rt,int num,int org){
    int ans;
    if(tr[rt].l==tr[rt].r){
        tr[rt].val=0;
        tr[rt].sum=0;
        return tr[rt].l;
    }
    if(tr[rt<<1].sum+org>=num)
        ans=Query(rt<<1,num,org);
    else
        ans=Query(rt<<1|1,num,org+tr[rt<<1].sum);
    pushup(rt);
    return ans;
}
int v1[]={1,2,4,6,12,24,36,48,60,120,180,240,360,720,840,1260,1680,2520,5040,7560,10080,15120
        ,20160,25200,27720,45360,50400,55440,83160,110880,166320,221760,277200,332640,498960};
int v2[]={1,2,3,4,6,8,9,10,12,16,18,20,24,30,32,36,40,48,60,64,72,80,84,90,96,100,108,120,
        128,144,160,168,180,192,200};
int index(int num){
    int rt=34;
    while(v1[rt]>num) rt--;
    return rt;
}
int main(){
    int n,m;
    while(~scanf("%d%d",&n,&m)){
        Build(1,1,n);
        for(int i=1;i<=n;i++)
            scanf("%s%d",ch[i],&next[i]);
        int ans=index(n),rt;
        for(int i=1,num=n;i<=v1[ans];i++,num--){
            if(m<0) m=m+num*(-m/(num)+1);
            m%=num;
            if(m==0) m=num;
            rt=Query(1,m,0);
            //cout<<m<<endl;
            if(next[rt]<0) m+=next[rt];
            else{
                m+=next[rt];
                m--;
            }
        }
        printf("%s %d\n",ch[rt],v2[ans]);
    }
    return 0;
}