题目链接
因为N最大只有26,所以直接跑暴力,发现好像只是个O(N^2)的暴力,还是很快的,然后就直接敲了,直接判断周围没有的颜色,然后直接赋值就可以了。
#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define lowbit(x) ( x&(-x) )
#define pi 3.141592653589793
#define e 2.718281828459045
#define INF 0x3f3f3f3f
#define HalF (l + r)>>1
#define lsn rt<<1
#define rsn rt<<1|1
#define Lson lsn, l, mid
#define Rson rsn, mid+1, r
#define QL Lson, ql, qr
#define QR Rson, ql, qr
#define myself rt, l, r
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
const int maxN = 27;
int N, col[maxN];
bool mp[maxN][maxN], used[maxN];
char s[50];
inline void solve()
{
for(int i=1; i<=N; i++)
{
memset(used, false, sizeof(used));
for(int j=1; j<=N; j++)
{
if(i == j || !mp[i][j]) continue;
used[col[j]] = true;
}
for(int c=1; c<=N; c++)
{
if(!used[c])
{
col[i] = c;
break;
}
}
}
}
inline void init()
{
memset(mp, false, sizeof(mp));
memset(col, 0, sizeof(col));
}
int main()
{
while(scanf("%d", &N) && N)
{
init();
for(int i=1; i<=N; i++)
{
scanf("%s", s + 1);
int len = strlen(s + 1);
for(int j=3; j<=len; j++) mp[i][s[j] - 'A' + 1] = true;
}
solve();
int ans = 1;
for(int i=1; i<=N; i++) ans = max(ans, col[i]);
if(ans == 1) printf("1 channel needed.\n");
else printf("%d channels needed.\n", ans);
}
return 0;
}