TOJ 1923. Tanning Salon
来源:互联网 发布:python爬虫 美国赚钱 编辑:程序博客网 时间:2024/04/27 13:37
头大的一题,不知道是哪里错了,也不知道应该怎么理解,网上的代码在这组数据的结果不一样
2 ABCDBACD
不知道如果一个顾客来了发现满了就算他离开时有空位还算离开还是不算
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 Input2 ABBAJJKZKZ3 GACCBDDBAGEE3 GACCBGDDBAEE1 ABCBCA0Sample Output
All customers tanned successfully.1 customer(s) walked away.All customers tanned successfully.2 customer(s) walked away.
#include<iostream>using namespace std;const int MAX = 60; int main(){ int n, i, id, ans; char str[MAX]; bool vis[MAX], tan[MAX]; while(cin >> n && n){ memset(vis, 0, sizeof(vis)); memset(tan, 0, sizeof(tan)); cin >> str; ans = 0; for(i = 0; i < strlen(str); i ++){ id = str[i] - 'A'; if(!vis[id]){ vis[id] = true; if(n > 0){ n --; tan[id] = true; }else ans ++; }else{ if(tan[id]) n ++; } } if(ans == 0)printf("All customers tanned successfully.\n"); else printf("%d customer(s) walked away.\n", ans); } return 0;}
- TOJ 1923. Tanning Salon
- TOJ 1923.Tanning Salon
- Tanning Salon
- Tanning Salon
- poj 1250&Toj 1932 Tanning Salon【巧妙模拟】
- ZOJ 1405 Tanning Salon
- POJ-1250-Tanning Salon
- POJ 1250 Tanning Salon
- poj 1250(Tanning Salon)
- zoj 1405 Tanning Salon
- poj 1250 Tanning Salon
- POJ 1250 tanning salon
- ZOJ 1405 Tanning Salon
- 1250 Tanning Salon
- zoj 1405 Tanning Salon
- zoj 1405 Tanning Salon
- ZOJ 1405 Tanning Salon
- POJ 1250 Tanning Salon
- 小白装Ubuntu之问题记录与解决(win7下安装Ubuntu13.04)
- Longest Substring Without Repeating Characters
- HDOJ 题目1575 Tr A(矩阵相乘,二分)
- Codeforces Round #261 (Div. 2) C. Pashmak and Buses
- 杭电 1013 Digital Roots (字符串数组)
- TOJ 1923. Tanning Salon
- CONNECT BY LEVEL
- Monkey and Banana
- 【Android开发-8】生命周期,Activity中打开另外一个Activity
- 字符串算法回忆~
- UVA519
- Java线程(篇外篇):阻塞队列BlockingQueue
- 程序员应该学会放松,更应该努力前行
- 深入剖析BackgroundWorker类