-
Notifications
You must be signed in to change notification settings - Fork 23
/
1466.cpp
80 lines (76 loc) · 1.08 KB
/
1466.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
#include <iostream>
#include <cstring>
using namespace std;
int relatenum[503],ans,cur,n,maxpossi;
short relatepos[503][503];
bool choose[503];
void f(const int x)
{
if(x>=n)
{
if(cur>ans)ans=cur;
return;
}
if(maxpossi<=ans)return;
if(choose[x])
{
maxpossi--;
f(x+1);
maxpossi++;
}
else if(relatenum[x]==0)
{
cur++;
choose[x]=1;
f(x+1);
choose[x]=0;
cur--;
}
else
{
int i;
bool sta[503];
for(i=0;i<n;i++)
sta[i]=choose[i];
cur++;
choose[x]=1;
for(i=0;i<relatenum[x];i++)
choose[relatepos[x][i]]=1;
f(x+1);
for(i=0;i<n;i++)
choose[i]=sta[i];
cur--;
maxpossi--;
f(x+1);
maxpossi++;
}
}
int main()
{
int i,j,k;
while(cin>>n)
{
for(i=0;i<n;i++)
{
cin>>j;
char buf[5];
cin.getline(buf,5,'(');
cin>>k;
cin.get();
relatenum[i]=0;
choose[i]=0;
for(j=0;j<k;j++)
{
int tmp;
cin>>tmp;
relatepos[i][relatenum[i]]=tmp;
relatenum[i]++;
}
}
ans=cur=0;
maxpossi=n;
f(1);
cout<<ans<<endl;
}
return 0;
}