-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathchef_june3.cpp
More file actions
61 lines (60 loc) · 1.34 KB
/
chef_june3.cpp
File metadata and controls
61 lines (60 loc) · 1.34 KB
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
#include<iostream>
#include<math.h>
#include<vector>
#define test int t;cin>>t;while(t--)
#define loop(i,a,b) for(int i=a;i<b;i++)
using namespace std;
int a[2501][2501];
int main()
{
test
{
long long int cnt =0;
int n,k,len,x;
cin>>n>>k;
vector<int> falsity;
for(int i=0;i<n;i++)
{
cin>>len;
loop(j,0,len)
{
cin>>x;
a[i+1][x]=1;
}
}
loop(i,1,n+1)
{
loop(j,1,k+1)
{
//cout<<a[i][j]<<" ";
if(a[i][j]==0)
falsity.push_back(j);
else
a[i][j]=0;
}
//cout<<endl;
/*for(int q=0;q<falsity.size();q++)
cout<<falsity[q]<<" ";
cout<<"\n";*/
if(falsity.size()==0){
cnt+=n-i;
falsity.clear();
continue;
}
loop(j,i+1,n+1)
{
int q=0;
for(q=0;q<falsity.size();q++)
{
if(a[j][falsity[q]]==0)
break;
}
if(q==falsity.size())
cnt++;
}
falsity.clear();
}
cout<<cnt<<"\n";
}
return 0;
}