[ABC262B] Triangle (Easier)

最新推荐文章于 2024-09-27 14:28:55 发布

mekoszc

最新推荐文章于 2024-09-27 14:28:55 发布

阅读量75

点赞数

文章标签：算法

本文链接：https://blog.csdn.net/mekoszc/article/details/134184647

版权

该博客主要讨论如何解决一个图论问题，即在给定的简单无向图中找到所有满足特定条件的三元组(a, b, c)：a < b < c，且存在边连接a到b，b到c，c到a。通过邻接矩阵来存储图的边，并使用暴力枚举方法找出所有这样的三元环。示例输入和输出展示了具体的应用情况。

摘要由CSDN通过智能技术生成

Problem Statement

You are given a simple undirected graph with $N$ vertices and $M$ edges. The vertices are numbered $1, \dots, N$, and the $i$-th $(1 \leq i \leq M)$ edge connects Vertex $U_i$ and Vertex $V_i$.

Find the number of tuples of integers $a, b, c$ that satisfy all of the following conditions:

$1 \leq a \lt b \lt c \leq N$
There is an edge connecting Vertex $a$ and Vertex $b$.
There is an edge connecting Vertex $b$ and Vertex $c$.
There is an edge connecting Vertex $c$ and Vertex $a$.

Constraints

$3 \leq N \leq 100$
$1 \leq M \leq \frac{N(N - 1)}{2}$
$1 \leq U_i \lt V_i \leq N \, (1 \leq i \leq M)$
$(U_i, V_i) \neq (U_j, V_j) \, (i \neq j)$
All values in input are integers.

Input

Input is given from Standard Input in the following format:

$N$ $M$
$U_1$ $V_1$
$\vdots$
$U_M$ $V_M$

Output

Print the answer.

Sample Input 1

Sample Output 1

$(a, b, c) = (1, 4, 5), (2, 3, 5)$ satisfy the conditions.

Sample Input 2

3 1
1 2

Sample Output 2

Sample Input 3

用邻接矩阵存边，暴力枚举三个数，用邻接矩阵判断他们是否成三元环。

#include<cstdio>
const int N=105;
int n,m,u,v,e[N][N],cnt;
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&u,&v);
		e[u][v]=e[v][u]=1;
	}
	for(int i=1;i<n;i++)
		for(int j=i+1;j<n;j++)
			for(int k=j+1;k<=n;k++)
				if(e[i][j]&&e[j][k]&&e[i][k])
					++cnt;
	printf("%d",cnt); 
}