Who Gets the Most Candies?
| Time Limit: 5000MS |
|
Memory Limit: 131072K |
| 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
————————————————————集训23.2的分割线————————————————————
前言：胡大大给出的练习题。吗，没办法搜别人的题解了。然后努力改写成了胡大大的姿势。
思路：首先分解成若干个子问题：
1. 糖果的个数（第n个出圈的人获得的糖果个数 等同于n的约数的个数）
2. 孩子出圈的过程是一个约瑟夫环游戏，但是初始孩子是第K个，并且由于间隔人数不一定，所以必须模拟
3. 由于数据范围和时限，采用线段树存储孩子们，区间值是孩子数。根据孩子数查询孩子的初始编号
对于问题1：反素数表，暴力打出来即可，但是姿势要对，根据“n = i * j, F[n]有两个约数”的方式暴力。
对于问题2：数下一个孩子的时候一定要细心，从第k个孩子出圈开始，数C[i]个孩子，下一个出圈的孩子是剩下孩子当中他的第几个孩子，（数孩子花了我一个小时，数死早没办法）
对于问题3：由于每次都得到下一个出圈的是第几个孩子，在线段树中利用树状数组的思想去查询。
代码如下：
/*
ID: j.sure.1
PROG:
LANG: C++
*/
/****************************************/
#include
#include
#include
#include
#include
#include
#include
#include
#include
