-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.cpp
299 lines (294 loc) · 8.36 KB
/
main.cpp
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
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
using namespace std;
struct unit
{
char name[10];
int lasttime;
int firsttime,nexttime;
}a[10],b[10],c[10],s[10];
int idx=0;
bool cmp(unit a,unit b)//反排
{
if(a.nexttime<b.nexttime)
return true;
else
return false;
}
bool cmp1(unit a,unit b)//正排
{
if(a.firsttime>b.firsttime)
return true;
else
return false;
}
void Apply(struct unit a[],int n)
{
cout << "预约单位 预约时长 开始时间 结束时间" << endl;
int i;
for(i=0;i<n;i++)
scanf("%s %d %d %d",a[i].name,&a[i].lasttime,&a[i].firsttime,&a[i].nexttime);
getchar();
system("CLS");
}
int j=0,k=0;
void Search(struct unit a[],int n,struct unit b[],struct unit c[])//排序筛选函数
{
sort(a,a+n,cmp);
int i,first=0,next=24;
for(i=0;i<n;i++)
{
if(a[i].firsttime>=first&&a[i].nexttime<=next)
{
strcpy(b[j].name,a[i].name);
b[j].lasttime=a[i].lasttime;
b[j].firsttime=a[i].firsttime;
b[j].nexttime=a[i].nexttime;
j++;
first=a[i].nexttime;
}
}
sort(a,a+n,cmp1);
first=0,next=24;
for(i=0;i<n;i++)
{
if(a[i].firsttime>=first&&a[i].nexttime<=next)
{
strcpy(c[k].name,a[i].name);
c[k].lasttime=a[i].lasttime;
c[k].firsttime=a[i].firsttime;
c[k].nexttime=a[i].nexttime;
k++;
next=a[i].firsttime;
}
}
}
/*递归输出n以内所有的子集,其中b表示该节点是否选中,cur为当前下标,初始值0*/
int visit[100];
void print_subset(int n,int *visit,int cur){
int sss[10]={0};
int m=0;
int flag5,flag;
for(int i=0;i<cur;i++)
{
sss[m]=visit[i];
m++;
}
if(m!=0)
{
if(j<k)
{
for(int i=k-1;i>=0;i--)
{
flag5=1;
for(int y=0;y<m;y++)
{
if(s[sss[y]].firsttime==c[i].firsttime&&s[sss[y]].nexttime==c[i].nexttime)
{
printf("%s %d %d %d\n",s[sss[y]].name,s[sss[y]].lasttime,s[sss[y]].firsttime,s[sss[y]].nexttime);
flag5=0;
break;
}
}
if(flag5)
printf("%s %d %d %d\n",c[i].name,c[i].lasttime,c[i].firsttime,c[i].nexttime);
}
}
else if(j>k)
{
for(int i=0;i<j;i++)
{
flag5=1;
for(int y=0;y<m;y++)
{
if(s[sss[y]].firsttime==b[i].firsttime&&s[sss[y]].nexttime==b[i].nexttime)
{
printf("%s %d %d %d\n",s[sss[y]].name,s[sss[y]].lasttime,s[sss[y]].firsttime,s[sss[y]].nexttime);
flag5=0;
break;
}
}
if(flag5)
printf("%s %d %d %d\n",b[i].name,b[i].lasttime,b[i].firsttime,b[i].nexttime);
}
}
else{
for(int i=0;i<j;i++)
{
int flag5=1;
for(int y=0;y<m;y++)
{
if(s[sss[y]].firsttime==b[i].firsttime&&s[sss[y]].nexttime==b[i].nexttime)
{
printf("%s %d %d %d\n",s[sss[y]].name,s[sss[y]].lasttime,s[sss[y]].firsttime,s[sss[y]].nexttime);
flag5=0;
break;
}
}
if(flag5)
printf("%s %d %d %d\n",b[i].name,b[i].lasttime,b[i].firsttime,b[i].nexttime);
}
printf("\n");
for(int i=0,xx=k-1;i<j;i++)
{
if(strcmp(b[i].name,c[xx].name)==0)
flag=0;
else
{
flag=1;break;
}
xx--;
}
if(flag)
{
for(int i=k-1;i>=0;i--)
{
flag5=1;
for(int y=0;y<m;y++)
{
if(s[sss[y]].firsttime==c[i].firsttime&&s[sss[y]].nexttime==c[i].nexttime)
{
printf("%s %d %d %d\n",s[sss[y]].name,s[sss[y]].lasttime,s[sss[y]].firsttime,s[sss[y]].nexttime);
flag5=0;
break;
}
}
if(flag5)
printf("%s %d %d %d\n",c[i].name,c[i].lasttime,c[i].firsttime,c[i].nexttime);
}
}
}
}
printf("\n");
int s=cur?visit[cur-1]+1:0;//定序技巧,避免子集重复
for(int i=s;i<n;i++){
visit[cur]=i;//将新的元素加入子集的第cur个位置
print_subset(n,visit,cur+1);
}
}
int flag2=0;
void SearchSame(struct unit a[],int n,struct unit s[])
{
sort(a,a+n,cmp);
for(int i=0;i<n-1;i++)
{
if(a[i].firsttime==a[i+1].firsttime&&a[i].nexttime==a[i+1].nexttime)
{
strcpy(s[idx].name,a[i+1].name);
s[idx].lasttime=a[i+1].lasttime;
s[idx].firsttime=a[i+1].firsttime;
s[idx].nexttime=a[i+1].nexttime;
idx++;
}
}
if(idx!=1&&s[0].firsttime==s[idx-1].firsttime&&s[0].nexttime==s[idx-1].nexttime)
{
flag2=1;
}
}
int flag1;
void print(struct unit b[],struct unit c[],struct unit s[])//排序筛选输出函数
{
if(j==k)
{
for(int i=0;i<j;i++)
{
printf("%s %d %d %d\n",b[i].name,b[i].lasttime,b[i].firsttime,b[i].nexttime);
}printf("\n");
for(int i=0,xx=k-1;i<j;i++)
{
if(strcmp(b[i].name,c[xx].name)==0)
flag1=0;
else
{
flag1=1;break;
}
xx--;
}
if(flag1)
{
for(int i=k-1;i>=0;i--)
{
printf("%s %d %d %d\n",c[i].name,c[i].lasttime,c[i].firsttime,c[i].nexttime);
}
printf("\n");
}
}
else if(j<k)
{
for(int i=k-1;i>=0;i--)
{
printf("%s %d %d %d\n",c[i].name,c[i].lasttime,c[i].firsttime,c[i].nexttime);
}printf("\n");
}
else
{
for(int i=0;i<j;i++)
{
printf("%s %d %d %d\n",b[i].name,b[i].lasttime,b[i].firsttime,b[i].nexttime);
}printf("\n");
}
}
void flagprint(struct unit b[],struct unit c[],struct unit s[])//重复子集输出函数
{
if(idx==0)
{
return ;//没有重复直接跳出;
}
if(flag2)//集合全是重复元素特殊判定
{
int m=0;
while(m<idx)
{
printf("%s %d %d %d\n",s[m].name,s[m].lasttime,s[m].firsttime,s[m].nexttime);
for(int i=0;i<j;i++)
{
if((b[i].firsttime==s[m].firsttime)&&(b[i].nexttime==s[m].nexttime))
continue;
else
printf("%s %d %d %d\n",b[i].name,b[i].lasttime,b[i].firsttime,b[i].nexttime);
}
m++;
printf("\n");
}
}
int f=1;
for(int i=0;i<j;i++)
{
for(int x=0;x<idx;x++)
{
if(b[i].name==s[x].name)
{
f=0;
break;
}
}
}
if(f)//套用子集打印函数直接是输出
{
print_subset(idx,visit,0);
}
}
int main()
{
cout << "\t\t****************************************" << endl;
cout << "\t\t****************************************" << endl;
cout << "\t\t****** ******" << endl;
cout << "\t\t****** 欢迎进入报告厅管理系统 ******" << endl;
cout << "\t\t****** ******" << endl;
cout << "\t\t****************************************" << endl;
cout << "\t\t****************************************" << endl;
cout << "\t\t请输入预约情况" << endl;
cout << "预约单位总数" << endl;
int n;
scanf("%d",&n);
Apply(a,n);
SearchSame(a,n,s);
Search(a,n,b,c);
print(b,c,s);
flagprint(b,c,s);
return 0;
}