# 中国海洋大学第四届朗讯杯高级组 Super Phyllis

Super Phyllis

## 题目描述

Phyllis works for a large, multi-national corporation. She moves from department to department where her job is to uncover and remove any redundancies inherent in the day-to-day activities of the workers. And she is quite good at her job.

During her most recent assignment, she was given the following chart displaying the chain of commandwithin the department:

Whenever anyone needs to send a report to their bosses, they use the above chart, sending one report along each arrow. Phyllis realized almost instantly that there were redundancies here. Specifically, since D sends a report to B and B sends a report to A, there\'s really no need for D to send a report to A directly, since it will be summarized in the report B sends to A. Thus the connection from D to A can be removed. If there had also been a connection from C to B, then the connections from D to B and C to A could have been removed as well.

Phyllis would like your help with this. Given a description of a chart like the one above, she would like a program that identifies all connections that can be removed from the chart.

## 输入

The first line of each test case will contain a positive integer m indicating the number of connections in the chart. Following that will be m lines each containing two strings s1 s2 indicating that there is a connection from employee s1 to his/her boss s2. In any test case there will be no more than 200 employees listed and no connection will appear more than once. A line containing a single 0 will terminate the input.

## 输出

For each test case, output the number of connections that should be removed followed by a list of the deleted connections in lexicographic order. Connection s1 s2 should be represented by the string s1,s2.

## 示例输入

5
D B
D C
D A
B A
C A
6
D B
D C
D A
C B
B A
C A
1
Danny Tessa
0

## 示例输出

Case 1: 1 D,A
Case 2: 3 C,A D,A D,B
Case 3: 0

## 来源

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <queue>
#include <string>
#include <map>
#define MAXN 205
using namespace std;
map<string,int> mp1;
map<int,string> mp2;
bool gl[MAXN][MAXN];
int n,cnt;
int d[MAXN];
string ans[20000];
void bfs(int v)
{
memset(d,0,sizeof(d));
queue<int> que;
que.push(v);
d[v]=1;
while(!que.empty())
{
int tmp=que.front();
que.pop();
for(int i=1; i<=n; ++i)
if(gl[tmp][i])
{
if(!d[i])
{
d[i]=d[tmp]+1;
que.push(i);
}
else
{
if(d[i]==2&&gl[v][i])
{
string str=mp2[v]+","+mp2[i];
ans[cnt].clear();
ans[cnt++]=str;
gl[v][i]=false;
}
}
}
}
}
int main()
{
int m,kase=0;
while(cin>>m&&m)
{
string a,b;
memset(gl,0,sizeof(gl));
mp1.clear();
mp2.clear();
n=0;
for(int i=0; i<m; ++i)
{
cin>>a>>b;
if(!mp1[a])
{
++n;
mp1[a]=n;
mp2[n]=a;
}
if(!mp1[b])
{
++n;
mp1[b]=n;
mp2[n]=b;
}
gl[mp1[a]][mp1[b]]=true;
}
cnt=0;
for(int i=1; i<=n; ++i)
bfs(i);
sort(ans,ans+cnt);
cout<<"Case "<<++kase<<": "<<cnt;
for(int i=0; i<cnt; ++i)
cout<<" "<<ans[i];
cout<<endl;
}
return 0;
}


12-06 1124

12-01 1833

12-01 1777

#### 中国海洋大学910高级程序设计回忆.docx

2017年11月17日 14KB 下载

12-19 375

11-05 1206

11-27 916

#### 2012年中国海洋大学考研真题910高级程序设计

2013年11月14日 9.98MB 下载

12-17 1411