关闭

POJ 1250 模拟题

993人阅读 评论(0) 收藏 举报

     终于在POJ上碰到一道简单题,,不容易啊。。模拟,可以轻松水过。。题目:

Tanning Salon
Time Limit: 1000MS   Memory Limit: 10000K
Total Submissions: 5582   Accepted: 3052

Description

Tan Your Hide, Inc., owns several coin-operated tanning salons. Research has shown that if a customer arrives and there are no beds available, the customer will turn around and leave, thus costing the company a sale. Your task is to write a program that tells the company how many customers left without tanning. 

Input

The input consists of data for one or more salons, followed by a line containing the number 0 that signals the end of the input. Data for each salon is a single line containing a positive integer, representing the number of tanning beds in the salon, followed by a space, followed by a sequence of uppercase letters. Letters in the sequence occur in pairs. The first occurrence indicates the arrival of a customer, the second indicates the departure of that same customer. No letter will occur in more than one pair. Customers who leave without tanning always depart before customers who are currently tanning. There are at most 20 beds per salon. 

Output

For each salon, output a sentence telling how many customers, if any, walked away. Use the exact format shown below. 

Sample Input

2 ABBAJJKZKZ
3 GACCBDDBAGEE
3 GACCBGDDBAEE
1 ABCBCA
0

Sample Output

All customers tanned successfully.
1 customer(s) walked away.
All customers tanned successfully.
2 customer(s) walked away.
ac代码:

#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
int numbed,visted[30];
int main(){
	//freopen("11.txt","r",stdin);
	while(scanf("%d",&numbed),numbed){
	  memset(visted,0,sizeof(visted));
	  string ss;
	  cin>>ss;
	  int num=numbed;
	  int sum=0;
	  int len=ss.size();
	  for(int i=0;i<len;++i){
		  if(visted[ss[i]-'A']==2)
			  continue;
		  else if(num<=0&&!visted[ss[i]-'A']){sum++;visted[ss[i]-'A']=2;}
		  else if(!visted[ss[i]-'A']&&num){
		    visted[ss[i]-'A']=1;
			num--;
		  }
		  else if(visted[ss[i]-'A']){
		    num++;
		  }
	  }
	  if(sum==0)printf("All customers tanned successfully.\n");
	  else printf("%d customer(s) walked away.\n",sum);
	}
  return 0;
}


1
0

猜你在找
【直播】机器学习&数据挖掘7周实训--韦玮
【套餐】系统集成项目管理工程师顺利通关--徐朋
【直播】3小时掌握Docker最佳实战-徐西宁
【套餐】机器学习系列套餐(算法+实战)--唐宇迪
【直播】计算机视觉原理及实战--屈教授
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之矩阵--黄博士
【套餐】微信订阅号+服务号Java版 v2.0--翟东平
【直播】机器学习之凸优化--马博士
【套餐】Javascript 设计模式实战--曾亮
查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:611361次
    • 积分:10781
    • 等级:
    • 排名:第1488名
    • 原创:414篇
    • 转载:2篇
    • 译文:0篇
    • 评论:119条
    最新评论