Poj 1250 simulation questions

Source: Internet
Author: User

Finally, I encountered a simple question on poj. It's not easy .. Simulation, you can easily water over .. Question:

Tanning Salon
Time limit:1000 ms   Memory limit:10000 K
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 MERs, if any, lost ed away. Use the exact format shown below.

Sample Input

2 ABBAJJKZKZ3 GACCBDDBAGEE3 GACCBGDDBAEE1 ABCBCA0

Sample output

All customers tanned successfully.1 customer(s) walked away.All customers tanned successfully.2 customer(s) walked away.

AC code:

#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;}

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.