PAT甲级 1124 Raffle for Weibo Followers (20 分)

最新推荐文章于 2022-11-09 21:26:16 发布

原创最新推荐文章于 2022-11-09 21:26:16 发布 · 96 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级专栏收录该内容

79 篇文章

订阅专栏

本文介绍了一种用于社交媒体抽奖的程序设计，涉及到输入参数包括转发数、中奖间隔和首个中奖者索引。程序会确保每个中奖者唯一，并按输入顺序输出中奖者名单。对于没有中奖者的情况，程序会提示'Keepgoing...'。示例展示了如何处理重复转发和输出中奖者列表的过程。

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 <unordered_map>
#include <cstdio>

using namespace std;


int main() {
    int M, N, S;
    unordered_map<string, int> map;
    string name;
    scanf("%d %d %d", &M, &N, &S);
    int s = S;
    for (int i = 1; i <= M; ++i) {
        cin >> name;
        if (map[name] == 1)
            S += 1;
        if (i == S and map[name] == 0) {
            cout << name << endl;
            map[name] = 1;
            S += N;
        }
    }
    if (N > M or s > M) {
        puts("Keep going...");
    }
    return 0;
}