PAT (Advanced Level) Practise 1124 Raffle for Weibo Followers (20)
2017-03-04 19:13
543 查看
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...
一道简单题,为了方便可以直接使用map来判断重复
#include<map>
#include<set>
#include<ctime>
#include<cmath>
#include<queue>
#include<string>
#include<vector>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<functional>
using namespace std;
#define ms(x,y) memset(x,y,sizeof(x))
#define rep(i,j,k) for(int i=j;i<=k;i++)
#define per(i,j,k) for(int i=j;i>=k;i--)
#define loop(i,j,k) for (int i=j;i!=-1;i=k[i])
#define inone(x) scanf("%d",&x)
#define intwo(x,y) scanf("%d%d",&x,&y)
#define inthr(x,y,z) scanf("%d%d%d",&x,&y,&z)
#define infou(x,y,z,p) scanf("%d%d%d%d",&x,&y,&z,&p)
#define lson x<<1,l,mid
#define rson x<<1|1,mid+1,r
#define mp(i,j) make_pair(i,j)
#define ft first
#define sd second
typedef long long LL;
typedef pair<int, int> pii;
const int low(int x) { return x&-x; }
const int INF = 0x7FFFFFFF;
const int mod = 1e9 + 7;
const int N = 1e5 + 10;
const double eps = 1e-10;
int n, m, s;
string a
;
map<string, int> M;
int main()
{
inthr(n, m, s);
rep(i, 1, n) cin >> a[i];
if (s > n) { puts("Keep going..."); return 0; }
for (int i = s; i <= n;)
{
if (M[a[i]]) { i++; continue; }
M[a[i]] = 1; cout << a[i] << endl; i += m;
}
return 0;
}
相关文章推荐
- 【PAT】【Advanced Level】1124. Raffle for Weibo Followers (20)
- PAT (Advanced Level)1124. Raffle for Weibo Followers (20)
- PAT (Advanced Level) 1124. Raffle for Weibo Followers (20) 解题报告
- PAT 1124. Raffle for Weibo Followers (20)
- PAT_A 1124. Raffle for Weibo Followers (20)
- PAT:1124. Raffle for Weibo Followers (20)
- PAT - 甲级 - 1124. Raffle for Weibo Followers (20)
- PAT 甲级 1124. Raffle for Weibo Followers (20)
- 1124. Raffle for Weibo Followers (20) PAT 甲级&&1069. 微博转发抽奖(20) PAT乙级
- PAT (Advanced Level) 1124. Raffle for Weibo Followers (20)
- PAT 1124. Raffle for Weibo Followers (20) 模拟微博抽奖,Set应用
- PAT甲级 1124. Raffle for Weibo Followers (20)
- PAT-PAT (Advanced Level) Practise 1031. Hello World for U (20) (图形打印) 【二星级】
- pat 1124. Raffle for Weibo Followers
- 1124. Raffle for Weibo Followers (20)
- PAT甲题题解-1124. Raffle for Weibo Followers-模拟,水题
- PAT--1124. Raffle for Weibo Followers
- 1124. Raffle for Weibo Followers (20)
- 1124. Raffle for Weibo Followers (20)
- PAT (Advanced Level) Practise 1031 Hello World for U (20)