pat 1124. Raffle for Weibo Followers

最新推荐文章于 2024-11-15 10:47:41 发布

原创最新推荐文章于 2024-11-15 10:47:41 发布 · 279 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#PAT Advanced Level

PAT (Advanced Level) 专栏收录该内容

18 篇文章

订阅专栏

原题链接：https://www.patest.cn/contests/pat-a-practise/1124

1124. Raffle for Weibo Followers (20)

时间限制

400 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

John got a full mark on PAT. He was so happy that he decided to hold a raffle（抽奖） for his followers on Weibo -- that is, he would select winners from every N followers who forwarded his post, and give away gifts. Now you are supposed to help him generate the list of winners.

Input Specification:

Each input file contains one test case. For each case, the first line gives three positive integers M (<= 1000), N and S, being the total number of forwards, the skip number of winners, and the index of the first winner (the indices start from 1). Then M lines follow, each gives the nickname (a nonempty string of no more than 20 characters, with no white space or return) of a follower who has forwarded John's post.

Note: it is possible that someone would forward more than once, but no one can win more than once. Hence if the current candidate of a winner has won before, we must skip him/her and consider the next one.

Output Specification:

For each case, print the list of winners in the same order as in the input, each nickname occupies a line. If there is no winner yet, print "Keep going..." instead.

Sample Input 1:

9 3 2
Imgonnawin!
PickMe
PickMeMeMeee
LookHere
Imgonnawin!
TryAgainAgain
TryAgainAgain
Imgonnawin!
TryAgainAgain

Sample Output 1:

PickMe
Imgonnawin!
TryAgainAgain

Sample Input 2:

2 3 5
Imgonnawin!
PickMe

Sample Output 2:

Keep going...

注意每次遇到相同的就取下一个没有被选中的（注意不是直接取下一个）作为选中的，下次计算就从选中的再开始了。。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <map>
#include <vector>
#include <set>
#include <string>

using namespace std;

map<string,int> mp;

int main()
{
    int m,n,s,i,flag=0;
    char str[25];
    scanf("%d%d%d",&m,&n,&s);
    int k=s;
    for(i=1;i<=m;i++)
    {
        scanf("%s",str);
        if(i==s&&mp[str]==1)
            s+=1;
        if(i==s&&mp[str]==0)
        {
            mp[str]=1;
            printf("%s\n",str);
            s+=n;
            flag=1;
        }
    }
    if(!flag)
        printf("Keep going...\n");
    return 0;
}