codeforces 574B 暴力+复杂度分析

最新推荐文章于 2021-06-14 22:54:33 发布

AC_Lee

最新推荐文章于 2021-06-14 22:54:33 发布

阅读量289

点赞数

分类专栏：暴力搜索&图论

本文链接：https://blog.csdn.net/xiaoli_nu/article/details/73557140

版权

搜索&图论同时被 2 个专栏收录

59 篇文章 0 订阅

订阅专栏

暴力

2 篇文章 0 订阅

订阅专栏

题目：

Do you know a story about the three musketeers? Anyway, you will learn about its origins now.

Richelimakieu is a cardinal in the city of Bearis. He is tired of dealing with crime by himself. He needs three brave warriors to help him to fight against bad guys.

There are n warriors. Richelimakieu wants to choose three of them to become musketeers but it's not that easy. The most important condition is that musketeers must know each other to cooperate efficiently. And they shouldn't be too well known because they could be betrayed by old friends. For each musketeer his recognition is the number of warriors he knows, excluding other two musketeers.

Help Richelimakieu! Find if it is possible to choose three musketeers knowing each other, and what is minimum possible sum of their recognitions.

Input

The first line contains two space-separated integers, n and m (3 ≤ n ≤ 4000, 0 ≤ m ≤ 4000) — respectively number of warriors and number of pairs of warriors knowing each other.

i-th of the following m lines contains two space-separated integers ai and bi (1 ≤ ai, bi ≤ n, ai ≠ bi). Warriors ai and bi know each other. Each pair of warriors will be listed at most once.

Output

If Richelimakieu can choose three musketeers, print the minimum possible sum of their recognitions. Otherwise, print "-1" (without the quotes).

Note

In the first sample Richelimakieu should choose a triple 1, 2, 3. The first musketeer doesn't know anyone except other two musketeers so his recognition is 0. The second musketeer has recognition 1 because he knows warrior number 4. The third musketeer also has recognition 1 because he knows warrior 4. Sum of recognitions is 0 + 1 + 1 = 2.

The other possible triple is 2, 3, 4 but it has greater sum of recognitions, equal to 1 + 1 + 1 = 3.

In the second sample there is no triple of warriors knowing each other.

题意本身不重要想到用暴力但是没敢写,,,以为是O(N^3)....

代码：

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int inf = 0x3f3f3f3f;
const int maxn = 4050;

int n,m,d[maxn];
bool g[maxn][maxn];
//一开始以为暴力的话是n^3会超时，后来看了题解原来前两层放上去之后加个剪枝，第三层的复杂度是加上去的而不是乘上去的 
//即剪枝使得复杂度由O(N^3)降为O(N^2+NM) 
int main(){//62 ms	18100 KB
    int x,y;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i){
    	scanf("%d%d",&x,&y);
    	g[x][y]=g[y][x]=1;
		d[x]++;
		d[y]++; 
    }
    int ans=inf;
	for(int i=1;i<=n;++i){
		for(int j=1;j<=n;++j){
			if(g[i][j] && d[i]+d[j]<=inf){//只有M个g[i][j]成立  
				for(int k=1;k<=n;++k){
					if(g[i][k] && g[j][k]){
						ans=min(ans,d[i]+d[j]+d[k]);
					}
				}
			}
		}
	}
	//相当于外面枚举N^2次，对于其中的M次才有第三层for 故复杂度为 O(N^2+M*N) 
	if(ans>=inf) puts("-1");
	else printf("%d\n",ans-6);
    return 0;
}