-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDCS1_B190513CS_HADIF_1.c
81 lines (76 loc) · 1.08 KB
/
DCS1_B190513CS_HADIF_1.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
#include<stdio.h>
int n;
void color(int[n][n], int[], char[], int);
int degree(int[], int[]);
int main()
{
int i, j, m, a, b, av;
scanf("%d%d", &n, &m);
int G[n][n], r[n];
char C[n];
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
G[i][j]=0;
r[i]=1;
C[i]='#';
}
for(i=0;i<m;i++)
{
scanf("%d%d", &a, &b);
G[a][b]=1;
G[b][a]=1;
}
av = n;
color(G, r, C, av);
for(i=0;i<n;i++)
printf("%c\n", C[i]);
return 0;
}
void color(int G[n][n], int r[], char C[], int av)
{
int i, j, k;
if(av==1)
{
for(i=n-1;i>=0;i--)
{
if(r[i])
{
C[i] = 'a';
return;
}
}
}
for(i=0;i<n;i++)
{
if(r[i] && C[i]=='#')
{
if(degree(G[i], r)<6)
{
r[i]=0;
color(G, r, C, av-1);
r[i]=1;
int a[6]={1, 1, 1, 1, 1, 1};
for(j=0;j<n;j++)
if(r[j] && G[i][j] && C[j]!='#')
a[C[j]-'a']=0;
for(k=0;k<6;k++)
{
if(a[k])
{
C[i]='a'+k;
return;
}
}
}
}
}
}
int degree(int a[], int r[])
{
int i, c=0;
for(i=0;i<n;i++)
if(r[i] && a[i])
c++;
return c;
}