1221. 值班

include

using namespace std;
int main()
{
        int n;cin>>n;
        int check[31]={0};
        while(n--){
                while(1==1){
                        int a;cin>>a;
                        if(a==-1) break;
                        check[a]++;
                }
        }
        for(int i=1;i<=30;i++){
                if(check[i]==0){
                        cout<<"no";return 1e9;
                }
        }
        cout<<"yes";
}

include

include

include

using namespace std;

int main()
{
int n;
cin >> n;
int i;
int a[n * 30];
int j = 0;
int tmp;
for(i = 0; i < n; i++){
while(cin >> tmp){
if(tmp != -1){
a[j] = tmp;
j++;
}
if(tmp == -1){
break;
}
}
}
sort(a, a + j);
int cnt = unique(a, a + j) - a;
if(cnt == 30){
cout << “yes” << endl;
}else{
cout << “no” << endl;
}
return 0;
}

把所有员工的天数dij全部插入一个集合，然后判断set.size()是否等于30即可