CF#318 (Div. 2)B. Bear and Three Musketeers 暴力 复杂度分析
来源:互联网 发布:win7服务器端口开放 编辑:程序博客网 时间:2024/06/05 23:56
分析:暴力求解,,关键是分析出复杂度n^2+m*n,而不是看到三层循环就n^3,#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <vector>
#include <queue>
#include <map>
#include <algorithm>
#include <set>
using namespace std;
#define MM(a) memset(a,0,sizeof(a))
typedef long long ll;
typedef unsigned long long ULL;
const int mod = 1000000007;
const double eps = 1e-10;
const int inf = 0x3f3f3f3f;
const int big=50000;
int max(int a,int b) {return a>b?a:b;};
int min(int a,int b) {return a<b?a:b;};
int flag[4005][4005],d[4005];
int main()
{
int n,m,u,v;
while(~scanf("%d %d",&n,&m))
{
memset(flag,0,sizeof(flag));
memset(d,0,sizeof(d));
for(int i=1;i<=m;i++)
{
scanf("%d %d",&u,&v);
flag[u][v]=flag[v][u]=1;
d[u]++;d[v]++;
}
int ans=inf;
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
if(flag[i][j])
for(int k=j+1;k<=n;k++)
if(flag[i][k]&&flag[k][j])
ans=min(ans,d[i]+d[j]+d[k]-6);
printf("%d\n",ans==inf?-1:ans);
}
return 0;
}
- CF#318 (Div. 2)B. Bear and Three Musketeers 暴力 复杂度分析
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2) B. Bear and Three Musketeers(STL_暴力)
- CF#318-B - Bear and Three Musketeers-暴力寻找三元环
- Codeforces Round #318 (Div. 2) B. Bear and Three Musketeers 位运算压缩
- Codeforces Round #318 [RussianCodeCup Thanks-Round] (Div. 2)B Bear and Three Musketeers
- B. Bear and Three Musketeers
- Codeforces Round #318 574B Bear and Three Musketeers(模拟)
- Codeforces Round #318 B - Bear and Three Musketeers
- Codeforces Round #318-(B. Bear and Three Musketeers)
- CodeForces 574B-Bear and Three Musketeers
- Codeforces 574B Bear and Three Musketeers
- Codeforces 574 B. Bear and Three Musketeers
- Bear and Three Musketeers
- Bear and Three Musketeers
- CF574B Bear and Three Musketeers 简单的图,暴力
- Bear and Three Musketeers CodeForces
- Codeforces 574B Bear and Three Musketeers【思维】
- 模拟赛#1补题 CodeForces 574B Bear and Three Musketeers(模拟判环)
- poj 1201 Intervals 线段树+贪心
- hdu 2602 Bone Collector 0-1背包;
- openssl与数字证书的使用
- CF #318 (Div. 2) C. Bear and Poker 唯一分解定理
- 深入理解mybatis原理(五) MyBatis缓存机制的设计与实现
- CF#318 (Div. 2)B. Bear and Three Musketeers 暴力 复杂度分析
- hdu 1421
- poj 3041 Asteroids 二分匹配 匈牙利算法 模板题
- poj 3281 Dining 最大流dinic 模板题
- poj 3469 Dual Core CPU 最大流建图思想 dinic 弧优化很重要
- poj 2135 Farm Tour 最小费用流 spfa优化 16_05_14
- poj 3686 The Windy\'s 最小费用流 建图 16_05_14
- poj 3168 Barn Expansion 平面扫描+线段相交问题
- K最短路问题(A*算法)