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

 int fact[] = {
     ,,,,,,,,,,,,,,,,,,,,,,,,,,,,,
     ,,,,,
 };

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

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

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

     nums[rt].sum = r - l + ;
     nums[rt].l = l;
     nums[rt].r = r;
     if (l == r) return;
     mid = (l+r)>>;
     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<<].sum >= k)
         return query(k, rt<<);
     else {
         k -= nums[rt<<].sum;
         return query(k, rt<<|);
     }
 }

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

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

     return ;
 }