POJ2886 Who Gets the Most Candies? 【线段树】+【单点更新】+【模拟】+【反素数】
来源:互联网 发布:facebook代理软件 编辑:程序博客网 时间:2024/05/18 11:07
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
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 2Tom 2Jack 4Mary -1Sam 1
Sample Output
Sam 3
泪奔T_T 这题做了一整个上午才过,主要卡在反素数的打表上,打得时候外层循环用的是maxn/2,导致有一半的因子表没有包含自身,因此错了N次,第二个卡点是一个点出圈后更新下个点的位置时总点数是改变的,第三个卡点就是线段树了,维护信息是区间未出圈的点数,在更新完即将出圈点的具体位置后即可直接插入。
//#define DEBUG#include <stdio.h>#include <string.h>#define maxn 500002#define lson l, mid, rt << 1#define rson mid + 1, r, rt << 1 | 1int tree[maxn << 2], div[maxn], temp;struct Node{char name[12];int mov;} stu[maxn], ans;void countDiv(){int i, j;for(i = 1; i <= maxn; ++i)for(j = i; j <= maxn; j += i)++div[j];}void build(int l, int r, int rt){tree[rt] = r - l + 1;if(l == r) return;int mid = (l + r) >> 1;build(lson);build(rson);}void update(int pos, int rank, int l, int r, int rt){--tree[rt];if(l == r){if(div[rank] > ans.mov){ans.mov = div[rank];strcpy(ans.name, stu[r].name);}temp = stu[r].mov;return;}int mid = (l + r) >> 1;if(tree[rt << 1] >= pos) update(pos, rank, lson);else update(pos - tree[rt << 1], rank, rson);}int getK(int k, int n){if(temp > 0) return (k + temp - 2) % n + 1;return ((k + temp - 1) % n + n) % n + 1;}int main(){#ifdef DEBUGfreopen("..\\stdin.txt", "r", stdin);freopen("..\\stdout.txt", "w", stdout);#endifcountDiv();int n, k, i, rank;while(scanf("%d%d", &n, &k) == 2){build(1, n, 1);for(i = 1; i <= n; ++i)scanf("%s%d", stu[i].name, &stu[i].mov);rank = 1; ans.mov = 0;update(k, rank++, 1, n, 1);while(tree[1]){k = getK(k, tree[1]);update(k, rank++, 1, n, 1);}printf("%s %d\n", ans.name, ans.mov);}return 0;}
- POJ2886 Who Gets the Most Candies? 【线段树】+【单点更新】+【模拟】+【反素数】
- POJ2886 Who Gets the Most Candies? 线段树单点更新+反素数
- poj2886--Who Gets the Most Candies?(线段树+反素数)
- 【POJ2886】Who Gets the Most Candies?-线段树+反素数
- poj2886 Who Gets the Most Candies?反素数+线段树
- POJ2886:Who Gets the Most Candies?(线段树单点更新)
- POJ2886 Who Gets the Most Candies?(反素数+线段树模拟约瑟夫环)
- 线段树单点更新+反素数 poj-2886-Who Gets the Most Candies
- POJ 2886 Who Gets the Most Candies?(线段树单点更新+反素数)
- poj 2886 Who Gets the Most Candies?(线段树单点更新+反素数)真难。。。
- poj 2886 Who Gets the Most Candies? 【线段树单点更新 + 反素数】
- poj2886 Who Gets the Most Candies?(反素数 + 线段树)
- POJ2886-Who Gets the Most Candies?(反素数)
- POJ2886-Who Gets the Most Candies?-模拟约瑟夫环+反素数表(线段树上二分+爆搜打表)
- poj2886 Who Gets the Most Candies? 线段树加反素数
- poj2886 Who Gets the Most Candies?(单点更新+约瑟夫环+素数打表)
- POJ 2886 Who Gets the Most Candies?【线段树单点更新+反素数打表】【好题】
- PKU2886(Who Gets the Most Candies?)线段树+反素数
- .NET连接oracle数据库方式
- swift 问号和叹号的理解
- C# visual studio2010 报表制作一二事
- 本机mac地址
- <<转载>>Druapl的patch补丁文件。
- POJ2886 Who Gets the Most Candies? 【线段树】+【单点更新】+【模拟】+【反素数】
- 一个优秀软件开发人员的必修课:GRASP软件开发模式浅析
- [LeetCode] N-Queens
- Java中Annotation(注释)系列学习笔记(3)
- opencv 2.x学习笔记(四)基本数据类型(二)
- Ubuntu本地uwsgi配Django问题的解决
- 生活编程(四) 学校图书馆简化
- Java中Annotation(注释)系列学习笔记(4)
- 程序员生存定律——成长路上常见的坑