1124 Raffle for Weibo Followers (20 分)

原创于 2021-12-08 20:07:29 发布 · 129 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pta #算法 #c++

算法同时被 3 个专栏收录

401 篇文章

订阅专栏

c++代码

360 篇文章

订阅专栏

PTA甲级

91 篇文章

订阅专栏

本文详细介绍了如何使用C++实现一个抽奖算法，该算法根据给定的转发数、获奖者间隔和起始获奖者索引来确定获奖者名单。在处理过程中，确保每个用户只能中奖一次，如果当前选中用户已中奖，则跳过并选择下一个。通过示例输入和输出，展示了算法的正确性和实用性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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...

结尾无空行

简单题，只需要搞清楚中奖的原理就好了，定义一个 map 存储是否中过奖了，一个 string 的数组存放姓名。
如果第一个中奖的人是大于总人数的，说明要输出 keep going。。。
否则，首先让中奖的人 map 为 true，如果已经是 true 了就加 1，否则加 n 直到 s 的值大于 m，输出所有的中奖的人

#include<iostream>
#include<bits/stdc++.h>
#include<string>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<deque>
#include<unordered_set>
#include<unordered_map>
#include<cctype>
#include<algorithm>
#include<stack>
using namespace std;
int m, n, s;
map<string, bool> mp;
int main() {
	cin >> m >> n >> s;
	string ss[m + 1];
	for (int i = 1; i <= m; i++) {
		cin >> ss[i];
	}
	if (s > m) {
		cout << "Keep going..." << endl;
	} else {
		while (s <= m) {
			if (mp[ss[s]]) {
				s++;
				continue;
			} else {
				mp[ss[s]] = true;
				cout << ss[s] << endl;
				s += n;
			}
		}
	}
	return 0;
}