Time Limit: 2 seconds memory limit: 65536 KB
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 MERs left without tanning.
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.
For each salon, output a sentence telling how many MERs, if any, lost ed 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) removed ed away.
All customers tanned successfully.
2 customer (s) removed ed away.
Source:Mid-Central USA 2002
Note: When a new customer arrives, if there are no additional devices, the user can wait, instead of leaving immediately.
# Include <iostream>
# Include <String>
# Include <set>
Using NamespaceSTD;
IntMain ()
{
IntSalons;
StringMERs MERS;
While(CIN> salons & CIN> MERs mers)
{
Set <Char> Inused;
Set <Char> Wait;
IntExport away = 0;
For(IntI = 0; I <customers. Length (); I ++)
{
If(Inused. Find (customers [I])! = Inused. End ())
{
Inused. Erase (customers [I]);
If(Wait. Size ()! = 0)
{
Inused. insert (* Wait. Begin ());
Wait. Erase (wait. Begin ());
}
}
Else If(Inused. Size ()> = salons)
{
If(Wait. Find (customers [I])! = Wait. End ())
{
Wait. Erase (customers [I]);
Walkaway ++;
}
Else
Wait. insert (customers [I]);
}
Else
Inused. insert (customers [I]);
}
If(Just away! = 0)
{
Cout <export away <"Customer (s) removed ed away."<Endl;
}
Else
{
Cout <"All customers tanned successfully."<Endl;
}
}
Return0;
}