zoj3710 friends(floyd变形)
来源:互联网 发布:涌泉知恩 编辑:程序博客网 时间:2024/05/21 17:24
Alice lives in the country where people like to make friends. The friendship is bidirectional and if any two person have no less thank friends in common, they will become friends in several days. Currently, there are totallyn people in the country, and m friendship among them. Assume that any new friendship is made only when they have sufficient friends in common mentioned above, you are to tell how many new friendship are made after a sufficiently long time.
Input
There are multiple test cases.
The first lien of the input contains an integer T (about 100) indicating the number of test cases. ThenT cases follow. For each case, the first line contains three integersn, m, k (1 ≤ n ≤ 100, 0 ≤ m ≤ n×(n-1)/2, 0 ≤k ≤n, there will be no duplicated friendship) followed by m lines showing the current friendship. Theith friendship contains two integersui, vi (0 ≤ui, vi <n, ui ≠ vi) indicating there is friendship between personui andvi.
Note: The edges in test data are generated randomly.
Output
For each case, print one line containing the answer.
Sample Input
34 4 20 10 21 32 35 5 20 11 22 33 44 05 6 20 11 22 33 44 02 0
Sample Output
204
大概思路:
1,数学方法?
2,二进制求交集+搜索+减枝?
3,暴力枚举?
大部分人用的floyd思想递推 :
i认识x,j认识x,那么i就有可能和j是朋友 ,找到i认识j的路径(x数)多等于k即可,如果可以认识,我们动态建路即可
对floyd的理解
for(k=1;k<=n;k++)
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(...)...
其中k为最对循环次数,我们可以改成:
while(上一次有更新)
{
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(...)...+标记更新
}
#include<cstdio>#include<cstdlib>#include<iostream>#include<memory.h>using namespace std;bool map[101][101];int n,m,k,ans;void _update(){ ans=0; memset(map,false,sizeof(map));}void _in(){ int x,y; scanf("%d%d%d",&n,&m,&k); for(int i=0;i<m;i++){ scanf("%d%d",&x,&y); map[x][y]=map[y][x]=true;}}void _solve(){bool temp=true;while(temp){temp=false;for(int i=0;i<n;i++) for(int j=i+1;j<n;j++) {if(map[i][j]) continue;int cnt=0; for(int f=0;f<n;f++)if(map[i][f]&&map[j][f]) cnt++; if(cnt>=k) {ans++;map[i][j]=map[j][i]=true;temp=true; } }} printf("%d\n",ans);}int main(){int T;scanf("%d",&T);while(T--){_update();_in();_solve();}}
- zoj3710 friends(floyd变形)
- ZOJ3710 Friends(暴力枚举,模拟)
- ZOJ3710
- UVA10048 Audiophobia (floyd变形)
- floyd 变形
- Ubiquitous Religions(friends变形)
- hdoj 1181 变形课 (floyd)
- hdu1181 变形课(Floyd算法)
- hdu1181 变形课 (Floyd算法)
- HDU 1181 变形记 (DFS / Floyd)
- uva 10048 - Audiophobia(floyd 的变形)
- hdu3631 Shortest Path (floyd 变形)
- POJ 2240 Arbitrage (floyd变形)
- HDU - 4034 Graph (floyd变形)
- POJ - 3660 Cow Contest (floyd变形)
- uva 10048 - Audiophobia(floyd 的变形)
- UVA 10048 Audiophobia(Floyd变形)
- POJ 2253 Frogger (Floyd的变形)
- RxJava 2.x.x Observable 与 Observer 入门分析
- Mycat读写分离与注意事项
- Oauth详解
- java多线程获取结果 Callable和Future
- 排序算法一——冒泡排序
- zoj3710 friends(floyd变形)
- XML
- 套路数学——扫雷
- 浅谈JVM内存模型
- FTP学习2_FTP命令之删除多个文件/删除整个文件夹
- ImportError: No module named win32api解决
- CSRF攻击及预防
- Mysql的优化
- 解决Could not find method android() for arguments问题