L1-020. 帅到没朋友

#include <iostream>
#include <cstdio>
#include <string>
#include <set>
#include <vector>

using namespace std;

int main(void){
  set<int> s1,s2,s3;
  vector<int> ans;
  int n;
  cin>>n;
  for(int i = 0; i < n; i++){
    int num;
    cin>>num;
    for(int j = 0; j < num; j++){
      int id;
      cin>>id;
      if(num != 1){
        s1.insert(id);
      }
    }
  }
  int k;
  cin>>k;
  for(int i = 0; i < k; i++){
    int id;
    cin>>id;
    if(s1.count(id) == 0 && s3.count(id) == 0){
      s3.insert(id);
      ans.push_back(id);
    }
  }
  if(ans.size() != 0){
    for(int i = 0; i < ans.size(); i++){
      if(i == ans.size() - 1){
        printf("%05d\n",ans[i]);
      }
      else{
        printf("%05d ",ans[i]);
      }
    }
  }
  else{
    cout<<"No one is handsome"<<endl;
  }
  
  return 0;
} 

猜你喜欢

转载自blog.csdn.net/gyh0730/article/details/80246055