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.
题意：给你n个点，和m条边，并且每个点只有三种选择，abc，如果两个字母是相等或相邻则表示他们 之间是有一条边，要你从他给你的边中，找一个符合要求的字母组合。
思路：贪心，假如给你一个点他与所有的顶点都有一条边，你会从，abc中你会取哪个字母，如果存在这样的点，你选a的话，就表示取余的点中不可能有c，同理选c也一样。
所以我们会选b，那么剩下那些未确定的点只有两种可能，a c，那么只要找一个未确定的点，给他a，那么与他有边的点肯定是a，无边的点是c，最后从的得到的字串判断下符合
要求即可。
1 #include<stdio.h> 2 #include<algorithm> 3 #include<iostream> 4 #include<string.h> 5 #include<stdlib.h> 6 #include<vector> 7 #include<queue> 8 using namespace std; 9 void bi(int x,int y);10 vector<int>my[600];11 queue<int>que;12 char aa[600];13 bool flag[600][600];14 int check(int p);15 int main(void)16 {17 int n,i,j,k,p,q;18 while(scanf("%d %d",&p,&q)!=EOF)19 {20 for(i=0; i<600; i++)21 {22 my[i].clear();23 }24 memset(aa,0,sizeof(aa));25 memset(flag,0,sizeof(flag));26 int xx,yy;27 for(i=0; i<q; i++)28 {29 scanf("%d %d",&xx,&yy);30 flag[xx][yy]=true;31 flag[yy][xx]=true;32 my[xx].push_back(yy);33 my[yy].push_back(xx);34 }35 for(i=1;i<=p;i++)36 {37 if(my[i].size()==p-1)38 {39 aa[i]='b';40 }41 }42 for(i=1;i<=p;i++)43 {44 if(aa[i]=='\0')45 {46 break;47 }48 }49 aa[i]='a';int cc=i;50 if(cc!=p+1)51 {for(i=1;i<=p;i++)52 {53 if(flag[cc][i]&&aa[i]=='\0')54 {55 aa[i]='a';56 }57 else if(aa[i]=='\0')58 {59 aa[i]='c';60 }61 }}if(check(p)==1)62 {printf("Yes\n");63 for(i=1;i<=p;i++)64 printf("%c",aa[i]);65 printf("\n");66 }67 else printf("No\n");68 }return 0;69 }70 71 int check(int p)72 {73 int i,j,k,q;74 for(i=1;i<=p;i++)75 {76 for(j=i+1;j<=p;j++)77 {78 if((abs(aa[i]-aa[j])<=1&&!flag[i][j])||(abs(aa[i]-aa[j])==2&&flag[i][j]))79 {80 return 0;81 }82 }83 }84 return 1;
85 }