2 seconds
256 megabytes
standard input
standard output
One day student Vasya was sitting on a lecture and mentioned a string s1s2... sn, 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 si and sj 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 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 ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the edges of the graph G. It is guaranteed, that there are no multiple edges, that is any pair of vertexes appear in this list no more than once.
In the first line print "Yes" (without the quotes), if the string s Petya is interested in really exists and "No" (without the quotes) otherwise.
If the string s exists, then print it on the second line of the output. The length of s must be exactly n, it must consist of only letters "a", "b" and "c" only, and the graph built using this string must coincide with G. If there are multiple possible answers, you may print any of them.
2 1
1 2
Yes
aa
4 3
1 2
1 3
1 4
No
In the first sample you are given a graph made of two vertices with an edge between them. So, these vertices can correspond to both the same and adjacent letters. Any of the following strings "aa", "ab", "ba", "bb", "bc", "cb", "cc" meets the graph's conditions.
In the second sample the first vertex is connected to all three other vertices, but these three vertices are not connected with each other. That means that they must correspond to distinct letters that are not adjacent, but that is impossible as there are only two such letters: a and c.
这题特别容易错！！！！！！！！！
颠覆了我的人生观！！！！！！！！
我的OI之路啊！！！！！！！！！！
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int G[][];
int n,m;
int ans[];
bool Solve(int node)
{
bool ok=true;
for(int i=;i<=n;i++)
if(G[node][i]){
if(ans[i]){
if(ans[node]==ans[i])return false;
}
else
ans[i]=-ans[node],ok&=Solve(i);
}
return ok;
}
void print()
{
printf("Yes\n");
for(int i=;i<=n;i++)
printf("%c",'b'+ans[i]);
printf("\n");
}
int main()
{
scanf("%d%d",&n,&m);
memset(ans,,sizeof(ans));
for(int i=;i<=n;i++)
for(int j=;j<=n;j++)
if(i!=j)
G[i][j]=;
for(int i=;i<=m;i++)
{
int x,y;
scanf("%d%d",&x,&y);
G[x][y]=;
G[y][x]=;
} int flag=;
for(int i=;i<=n;i++)
for(int j=;j<=n;j++)
if(G[i][j]&&!ans[i]){
ans[i]=;
if(!Solve(i))
flag=;
}
for(int i=;i<=n;i++)
for(int j=;j<=n;j++)
if(!G[i][j]&&(ans[i]-ans[j]==||ans[i]-ans[j]==-)){
flag=;
}
if(flag)
print();
else
puts("No"); return ;
}