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…
题意
给出一个得奖候选人列表,从第S个开始,每N个人得奖,如果遇到一个已经得奖的候选人,则将其得奖资格转移到他的后一个候选人。
思路
按照题意模拟即可,使用一个map来存储获奖者。具体看代码
代码
#include <iostream>
#include <set>
#include <string>
#include <vector>
#define MAX_M 1005
using namespace std;
string forwards[MAX_M];
set<string> winners;
int main() {
// 读取输入
int M, N, S;
cin >> M >> N >> S;
S--;// 将下标转换为从0~N-1
for(int i = 0; i < M; i++){
cin >> forwards[i];
}
if(S >= M){
cout << "Keep going...";
}else{
int i = S;
while (i < M) {
string& nickname = forwards[i];
if(winners.find(nickname) != winners.cend()){// 已经得到过奖品,跳到下一个
i++;
}else{// 输出当前得奖者,将其加入得奖列表,往下找N个人
cout << nickname << endl;
winners.insert(nickname);
i += N;
}
}
}
return 0;
}