CF623A Graph and String 【题解】

题目描述

One day student Vasya was sitting on a lecture and mentioned a string $s_1{s}_2...s_n$, consisting of letters “a”, “b” and “c” that was written on his desk. As the lecture was boring, Vasya decided to complete the picture by composing a graph G with the following properties:

• G has exactly n vertices, numbered from 1 to n .
• For all pairs of vertices i and j , where i≠j , there is an edge connecting them if and only if characters $s_i$ and $s_j$ are either equal or neighbouring in the alphabet. That is, letters in pairs “a”-“b” and “b”-“c” are neighbouring, while letters “a”-“c” are not.
  Vasya painted the resulting graph near the string and then erased the string. Next day Vasya’s friend Petya came to a lecture and found some graph at his desk. He had heard of Vasya’s adventure and now he wants to find out whether it could be the original graph G , painted by Vasya. In order to verify this, Petya needs to know whether there exists a string s , such that if Vasya used this s s he would produce the given graph G .

输入输出格式

输入格式：

The first line of the input contains two integers n and m — the number of vertices and edges in the graph found by Petya, respectively.

Each of the next m lines contains two integers $u_i$ and $v_i$ $(1<$