【POJ】2886 Who Gets the Most Candies?

移动题目相当麻烦。

#include <stdio.h>
#include <string.h>

#define MAXN 500005
#define lson l, mid, rt<<1
#define rson mid+1, r, rt<<1|1

int RPrime[] = {
    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,MAXN
};

int fact[] = {
    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
};

typedef struct {
    int l, r;
    int sum;
} node_st;

node_st nums[MAXN<<2];
char names[MAXN][11];
int val[MAXN];

void build(int l, int r, int rt) {
    int mid;

    nums[rt].sum = r - l + 1;
    nums[rt].l = l;
    nums[rt].r = r;
    if (l == r) return;
    mid = (l+r)>>1;
    build(lson);
    build(rson);
}

int query(int k, int rt) {
    nums[rt].sum--;
    if (nums[rt].l == nums[rt].r)
        return nums[rt].l;

    if (nums[rt<<1].sum >= k)
        return query(k, rt<<1);
    else {
        k -= nums[rt<<1].sum;
        return query(k, rt<<1|1);
    }
}

int main() {
    int n, m, index;
    int i, j, max;

    while (scanf("%d %d", &n, &m) != EOF) {
        for (i=1; i<=n; ++i)
            scanf("%s %d", names[i], &val[i]);
        i = 0;
        while (RPrime[i] <= n)
            ++i;
        j = RPrime[i-1];
        max = fact[i-1];
        build(1, n, 1);
        --m;
        for (i=1; i<=j; ++i) {
            index = query(m+1, 1);
            if (i == j)
                break;
            --n;
            if (val[index] > 0)
                m = (m+val[index]-1)%n;
            else
                m = ((m+val[index])%n + n)%n;
        }
        printf("%s %d
", names[index], max);
    }

    return 0;
}