答案:<pre class="brush:cpp;toolbar:false">//C语言参考题解
#include <stdio.h>
#include <stdlib.h>
//存储教师信息
struct kb {
int L, T[50], time, room;
} k[10001];
int cmp(const void *a, const void *b) {
return *(int *)a - *(int *)b;
}
int main() {
int N, M, K,all=0;
scanf("%d %d %d", &N, &M, &K);
for (int i = 0; i < N; i++) {
scanf("%d", &k[i].L);
int flag=0,flagg=0;
for (int j = 0; j < k[i].L; j++)
scanf("%d", &k[i].T[j]);
scanf("%d %d", &k[i].time, &k[i].room);
qsort(k[i].T, k[i].L, sizeof(k[0].T[0]), cmp);//每次读入一个教师的不能上课时间段数组之后就排个序,方便用bsearch查找
if (i) {
for (int m = 0; m < i; m++) {
if (k[i].room == k[m].room && k[m].time == k[i].time) {//校验是否存在教室冲突
printf("ERROR: Conflict between %d and %d.\n", i+1, m+1);
flag=1;
all=1;
}
}
}
if(bsearch(&k[i].time,k[i].T,k[i].L,sizeof(k[0].T[0]),cmp)){//校验是否存在时间冲突
printf("ERROR: Conflict with instructor for %d.\n",i+1);
flagg=1;
all=1;
}
if(flag || flagg){//必须先将两个条件都检验一遍才能初始化
k[i].time=-1*i;
k[i].room=-1*i;
}
}
if(!all)
printf("Perfect Arrangement for %d classes!",N);
}</pre><p><br/></p>
这道题暂未补解析。