Six Degrees of Cowvin Bacon poj 2131(floyd)
2016-06-27 10:45
375 查看
问题描述
The cows have been making movies lately, so they are ready to play a variant of the famous game "Six Degrees of Kevin Bacon".
The game works like this: each cow is considered to be zero degrees of separation (degrees) away from herself. If two distinct cows have been in a movie together, each is considered to be one 'degree' away from the other. If a two cows have never worked together
but have both worked with a third cow, they are considered to be two 'degrees' away from each other (counted as: one degree to the cow they've worked with and one more to the other cow). This scales to the general case.
The N (2 <= N <= 300) cows are interested in figuring out which cow has the smallest average degree of separation from all the other cows. excluding herself of course. The cows have made M (1 <= M <= 10000) movies and it is guaranteed that some relationship
path exists between every pair of cows.
输入
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each input line contains a set of two or more space-separated integers that describes the cows appearing in a single movie. The first integer is the number of cows participating in the described movie, (e.g., Mi); the subsequent Mi integers
tell which cows were.
输出
* Line 1: A single integer that is 100 times the shortest mean degree of separation of any of the cows.
样例输入
样例输出
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int INF=999999999;
int ma[302][302];
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++)
ma[i][j]=INF;
for(int i=1;i<=m;i++)
{
int k;
scanf("%d",&k);
int tem[302];
for(int j=1;j<=k;j++)
{
scanf("%d",&tem[j]);
}
for(int j=1;j<=k;j++)
for(int l=j+1;l<=k;l++)
ma[tem[j]][tem[l]]=ma[tem[l]][tem[j]]=1;
}
for(int k=1;k<=n;k++)
for(int j=1;j<=n;j++)
for(int i=1;i<=n;i++)
ma[i][j]=min(ma[i][k]+ma[j][k],ma[i][j]);
int ans=INF;
for(int i=1;i<=n;i++)
{
int ans1=0;
for(int j=1;j<=n;j++)
{
if(i!=j)
{
ans1+=ma[i][j];
}
}
ans=min(ans,ans1);
}
printf("%d\n",ans*100/(n-1));
}
}
The cows have been making movies lately, so they are ready to play a variant of the famous game "Six Degrees of Kevin Bacon".
The game works like this: each cow is considered to be zero degrees of separation (degrees) away from herself. If two distinct cows have been in a movie together, each is considered to be one 'degree' away from the other. If a two cows have never worked together
but have both worked with a third cow, they are considered to be two 'degrees' away from each other (counted as: one degree to the cow they've worked with and one more to the other cow). This scales to the general case.
The N (2 <= N <= 300) cows are interested in figuring out which cow has the smallest average degree of separation from all the other cows. excluding herself of course. The cows have made M (1 <= M <= 10000) movies and it is guaranteed that some relationship
path exists between every pair of cows.
输入
* Line 1: Two space-separated integers: N and M
* Lines 2..M+1: Each input line contains a set of two or more space-separated integers that describes the cows appearing in a single movie. The first integer is the number of cows participating in the described movie, (e.g., Mi); the subsequent Mi integers
tell which cows were.
输出
* Line 1: A single integer that is 100 times the shortest mean degree of separation of any of the cows.
样例输入
4 2 3 1 2 3 2 3 4
样例输出
100
#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
using namespace std;
const int INF=999999999;
int ma[302][302];
int main()
{
int n,m;
while(scanf("%d%d",&n,&m)!=EOF)
{
for(int i=0;i<=n;i++)
for(int j=0;j<=n;j++)
ma[i][j]=INF;
for(int i=1;i<=m;i++)
{
int k;
scanf("%d",&k);
int tem[302];
for(int j=1;j<=k;j++)
{
scanf("%d",&tem[j]);
}
for(int j=1;j<=k;j++)
for(int l=j+1;l<=k;l++)
ma[tem[j]][tem[l]]=ma[tem[l]][tem[j]]=1;
}
for(int k=1;k<=n;k++)
for(int j=1;j<=n;j++)
for(int i=1;i<=n;i++)
ma[i][j]=min(ma[i][k]+ma[j][k],ma[i][j]);
int ans=INF;
for(int i=1;i<=n;i++)
{
int ans1=0;
for(int j=1;j<=n;j++)
{
if(i!=j)
{
ans1+=ma[i][j];
}
}
ans=min(ans,ans1);
}
printf("%d\n",ans*100/(n-1));
}
}
相关文章推荐
- HTML5不支持标签和新增标签详解
- 【每周一读】——你的孤独,虽败犹荣
- Win7(WinDbg) + VMware(Win7) 双机调试环境搭建之三
- android-Camera.Size
- jquery获取select 选中的options
- android string.xml 中显示特殊符号
- 关于cocos2dx客户端程序的自动更新解决方案
- 设计模式
- 大数据平台设计
- Hikari java数据库连接池实战
- 51nod 1013 3的幂的和
- 下拉放大及回弹效果
- Hibernate 1.1
- 使用DFSClient实现 hadoop上传文件功能,采用使用输入输出流实现 Hadoop 版本2.7.0
- Android EditText输入格式设置
- rip路由协议
- js计算类型转换
- 学习Javascript闭包(Closure)
- C#学校班级自动升级实现代码
- 数据库设计(5/9):存储过程名称