poj 1250&Toj 1932 Tanning Salon【巧妙模拟】

本文深入探讨了AI音视频处理领域中的关键技术——视频分割与语义识别,通过详细解释这些技术的工作原理、应用案例以及最新发展,为读者提供了一次全面的技术之旅。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

Tanning Salon
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 8063 Accepted: 4319

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.

有n个位置,很多人依次去被服务,第一次出现代表俩,第二次出现代表走,请问经过一系列操作,一共多少顾客没得到服务。


这道题要求比较简单,不过题目不太严谨,题目中,如果有空位,排队等待的人是不会被服务的,然后自己多想了,wa.......

事实上,应该可以考虑复杂些的.... 

个人比较巧妙的做法是用不同的数字来代替每个人不同的状态,这样容易分情况处理!


#include<stdio.h>
#include<string.h>
int main()
{
	int n;
	//freopen("shuju.txt","r",stdin);
	while(scanf("%d",&n),n)
	{
		int x[26],ch,cnt=0,bed=0;
		memset(x,-1,sizeof(x));
		//-1是还没来过,1是进行了服务,0是在等待中 
		getchar();
		while((ch=getchar())!='\n')
		{
			int tp=ch-'A';
			if(x[tp]==-1)//没来过 
			{
				x[tp]=0;//等一下 
				if(bed<n)//还有床位,就 
				{
					x[tp]=1;
					++bed;
				}
			}
			else if(x[tp]==0)//已经在等待中.. 
			{
				x[tp]=-1;
				++cnt;
			}
			else//服务中 
			{
				x[tp]=-1;
				--bed;
			}
		}
		if(cnt)
		{
			printf("%d customer(s) walked away.\n",cnt);
			continue;
		}
		printf("All customers tanned successfully.\n");
	}
	return 0;
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值