URAL 1213 Cockroaches! (不同字符串数)
来源:互联网 发布:网络问诊 药店 编辑:程序博客网 时间:2024/05/08 18:42
<span style="font-family: Arial, Helvetica, sans-serif; font-size: 18pt; background-color: rgb(255, 255, 255);">Description</span>
It's well-known that the most tenacious of life species on the Earth are cockroaches. They live everywhere if only there in food. And as far as they are unpretentious in food you can find them absolutely everywhere.
A little Lyosha studies at school on a Space station. During one of the school competitions his class has reached the final. A task of the final contest is to exterminate all the cockroaches in the cargo module within minimal time.
Within the long history of the competitions a unified tactics was worked out. The tactics is as follows: a poison gas is let in one of the module compartments and after that the baffle that separates the compartment from one of the adjacent ones is opened. Cockroaches can't stand the smell of the gas and run to the other compartment. When there's no cockroaches in the treated compartment the baffle is closed. Afterwards analogously the next compartment is treated, and so on. The goal is to move all the cockroaches to the floodgate of the cargo module. Then the outward door is opened and all the cockroaches are engulfed by an open Space.
Lyosha is responsible for programming the control board of the baffles in his team. The baffles are opened slowly, so it's very important to make do with minimal number of baffle openings in order to win in the contest. Your task is to help Lyosha to compute this number.
Input
The first line contains a name of the floodgate compartment. Each of the next lines contains description of one of the baffles — the names of two compartments separated with a dash (-). The last line contains the only symbol "#". There are cockroaches in all the compartments of the module at first. It's possible to get to the floodgate from every compartment of the module passing several baffles. The total number of compartments doesn't exceed 30. The name of a compartment consists of no more than 20 Latin letters and digits. The large and the small letters should be distinguished.
Output
Your program is to output the only number — the minimal amount of baffles that should be opened (and then closed) in order to move all the cockroaches to the floodgate.
Sample Input
GatewayMachinery-GatewayMachinery-ControlControl-CentralControl-EngineCentral-EngineStorage-GatewayStorage-WasteCentral-Waste#
6
题意思大概是用毒气赶各个地方的蟑螂到gateway,求需要打开的最少闸门数。其实就是一个连通图中经过所有顶点的最短的路径的长度。即顶点数减一。
#include <iostream>#include <cstdlib>#include <cstdio>#include <string>#include <set>using namespace std;int main(){// freopen("in", "r", stdin); set<string> room; string in; cin >> in; room.insert(in); while(cin >> in) { if(in.length() == 1 && in[0] == '#') break; string tag; int i = 0; while(in[i] != '-') tag += in[i++]; room.insert(tag); tag.clear(); i++; int len = in.length(); while(i < len) tag += in[i++]; room.insert(tag); } cout << room.size()-1 << endl; return 0;}
0 0
- URAL 1213 Cockroaches! (不同字符串数)
- URAL 2080 Wallet 分块求无修改的区间内不同数的个数
- URAL 1698 自守数
- 字符串专项:Ural 1723
- 字符串专项:Ural 1102
- 字符串专项:Ural 1354
- 字符串专项:Ural 1423
- 不同字符的数量是fibonacci数的子字符串
- Codeforces Round #373 (Div. 2) B. Anatoly and Cockroaches 贪心、字符串
- URAL 1123. Salary 回文数
- URAL 1585. Penguins (字符串)
- B. Anatoly and Cockroaches
- Anatoly and Cockroaches
- URAL 1903 Unidentified Ships 组合数
- URAL 1963 Kite 四边形求对称轴数
- URAL 1903 Unidentified Ships 组合数
- Java中字符串在不同字符编码中所占字节数
- Java中字符串在不同字符编码中所占字节数
- 秦皇岛怎么找富婆包养信息+q303100177
- 邯郸怎么找富婆包养信息+q303100177
- 《程序员必读的职业规划书》试读活动
- freeswitch中文本消息处理流程
- Hbase实战 2.2.7 合并:HBase日常工作
- URAL 1213 Cockroaches! (不同字符串数)
- GoogleProgressBar-master 程序研究过程 2015-5-5
- 《C专家编程》学习笔记1
- C# 获取传入对象的所有属性名称
- .net学习之C#基础提高 1.基础知识
- 运行我的首个mapreduce程序
- poj2912(带权并查集)
- leetcode--3Sum
- VC++ WinMain()函数详解