codeforces 246 D. Colorful Graph (set)

最新推荐文章于 2020-03-29 11:34:00 发布

原创最新推荐文章于 2020-03-29 11:34:00 发布 · 972 阅读

0 ·

CC 4.0 BY-SA版权

STL 专栏收录该内容

30 篇文章

订阅专栏

本篇介绍了一个图论问题的解决方法，给定一个无向图，每个顶点都有一个颜色，任务是找到一种颜色，使得该颜色的顶点拥有最多的不同邻接颜色。文章详细解释了输入格式、解决问题的思路及代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

D. Colorful Graph

You've got an undirected graph, consisting of n vertices and m edges. We will consider the graph's vertices numbered with integers from 1 to n. Each vertex of the graph has a color. The color of the i-th vertex is an integer c_i.

Let's consider all vertices of the graph, that are painted some colork. Let's denote a set of such as V(k). Let's denote the value of theneighbouring color diversity for color k as the cardinality of the set Q(k) = {c_u : c_u ≠ k and there is vertex v belonging to set V(k)such that nodes v and u are connected by an edge of the graph}.

Your task is to find such color k, which makes the cardinality of setQ(k) maximum. In other words, you want to find the color that has the most diverse neighbours. Please note, that you want to find such color k, that the graph has at least one vertex with such color.

Input

The first line contains two space-separated integers n, m (1 ≤ n, m ≤ 10⁵) — the number of vertices end edges of the graph, correspondingly. The second line contains a sequence of integersc₁, c₂, ..., c_n (1 ≤ c_i ≤ 10⁵) — the colors of the graph vertices. The numbers on the line are separated by spaces.

Next m lines contain the description of the edges: the i-th line contains two space-separated integers a_i, b_i (1 ≤ a_i, b_i ≤ n; a_i ≠ b_i) — the numbers of the vertices, connected by the i-th edge.

It is guaranteed that the given graph has no self-loops or multiple edges.

Output

Print the number of the color which has the set of neighbours with the maximum cardinality. It there are multiple optimal colors, print the color with the minimum number. Please note, that you want to find such color, that the graph has at least one vertex with such color.

Example

Input

6 6
1 1 2 3 5 8
1 2
3 2
1 4
4 3
4 5
4 6

Output

Input

Output

n个顶点，各有一个颜色，可以相同，m条边，问相邻的颜色最多的颜色号码是多少

code：

#include <iostream>
#include<cstdio>
#include<set>
#include<cstring>
using namespace std;
set<int>s[100010];
int co[100010];
bool vis[100010];
int main()
{
    int n,m,x,y;
    scanf("%d%d",&n,&m);
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++)
    {
        s[i].clear();
        scanf("%d",&co[i]);
        vis[co[i]]=1;
    }
    for(int i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        {
            if(co[x]!=co[y])
            {
                s[co[x]].insert(co[y]);
                s[co[y]].insert(co[x]);
            }
        }
    }
    int maxn=-1,ans;
    for(int i=1;i<100001;i++)
    {
        if(vis[i]&&maxn<(int)s[i].size())
        {
            maxn=(int)s[i].size();
            ans=i;
        }
    }
    printf("%d\n",ans);
    return 0;
}