题目链接:http://acm.tju.edu.cn/toj/showp1923.html
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 1299 Accepted Runs: 749
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 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. |
Source: Mid-Central USA 2002
水题,自己也比较水,调了好久测试用例才调通。。。
#include <stdio.h>
#include <iostream>
#include <string.h>
using namespace std;
int main(){
int n;
string a;
char room[21];
while(~scanf("%d",&n),n){
int leaveNumber=0;
int rooms=n;
string b="#";
memset(room,'#',sizeof(room));
cin>>a;
for(int i=0;i<a.length();i++){
int tmp=1;
for(int j=0;j<b.length();j++)
if(b[j]==a[i])
{tmp=0;break;}
if(!tmp)
continue;
if(!rooms){
for(int j=0;j<n;j++)
if(a[i]==room[j]){
rooms++;
room[j]='#';
tmp=0;
break;
}
if(tmp){
b+=a[i];
leaveNumber++;
continue;
}
}
for(int j=0;j<n;j++)
if(a[i]==room[j]){
rooms++;
room[j]='#';
tmp=0;
break;
}
if(tmp){
rooms--;
for(int j=0;j<n;j++)
if(room[j]=='#'){
room[j]=a[i];
//cout<<room<<endl;
break;
}
}
}
if(!leaveNumber)
printf("All customers tanned successfully.\n");
else
printf("%d customer(s) walked away.\n",leaveNumber);
}
}