Advertisement
Anwar_Rizk

Untitled

May 28th, 2022
52
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.78 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define cout(st) for(auto& i : st) cout << i << " "; cout << "\n"
  5. #define cin_2d(vec, n, m) for(int i=0; i<n; i++) for(int j=0; j<m && cin >> vec[i][j]; j++);
  6. #define cout_2d(vec, r, c) for(int i=0; i<r; i++, cout << "\n") for(int j=0; j<c && cout << vec[i][j] << ""; j++)
  7. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << " : " << s << "\n"
  8. #define matrix(grid, n, m) vector < vector <int> > grid(n, vector <int> (m));
  9. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  10. #define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  11. #define fixed(n) cout << fixed << setprecision(n)
  12. #define Num_of_Digits(n) ((int)log10(n)+1)
  13. #define getline(s) getline(cin >> ws, s)
  14. #define to_decimal(bin) stoll(bin, nullptr, 2)
  15. #define rall(s) s.rbegin(), s.rend()
  16. #define all(s) s.begin(), s.end()
  17. #define sz(x) int(x.size())
  18. #define Pair pair <int, int>
  19. #define fi first
  20. #define se second
  21. #define ll long long
  22. #define PI acos(-1)
  23. #define Mod 1'000'000'007
  24. #define INF 2'000'000'000
  25. #define EPS 1e-9
  26. #define endl cout << "\n";
  27.  
  28. template < typename T = int > istream& operator >> (istream &in, vector < T > &v) {
  29.     for (auto &x: v) in >> x;
  30.     return in;
  31. }
  32.  
  33. template < typename T = int > ostream& operator << (ostream &out, const vector < T > &v) {
  34.     for (const T &x: v) out << x << ' ';
  35.     return out;
  36. }
  37.  
  38. void Anwar_Rizk(){
  39.   ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  40.   #ifndef ONLINE_JUDGE    // Anwar Rizk 🥇🖤
  41.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  42.   #endif
  43. }
  44.  
  45. struct team {
  46.   string name;
  47.   vector < string > members;
  48. };
  49.  
  50. void solve(){
  51.     int n;
  52.     cin >> n;
  53.     vector < team > teams(n), ans;
  54.     for(int i = 0; i < n; i++){
  55.         cin >> teams[i].name;
  56.         for(int j = 0; j < 3; j++){
  57.             string name;
  58.             cin >> name;
  59.             teams[i].members.push_back(name);
  60.         }
  61.     }
  62.     for(int i = 0; i < n; i++){
  63.         bool exist = false;
  64.         for(int j = i + 1; j < n; j++){
  65.             vector < string > temp1, temp2;
  66.             temp1 = teams[i].members;
  67.             temp2 = teams[j].members;
  68.             sort(all(temp1));
  69.             sort(all(temp2));
  70.             if(temp1 == temp2){
  71.                 exist = true;
  72.                 break;
  73.             }
  74.         }
  75.         if(!exist) ans.push_back(teams[i]);
  76.     }
  77.     if(sz(ans) == sz(teams)) cout << "No Changes";
  78.     else {
  79.         cout << sz(ans) << "\n";
  80.         for(int i = 0; i < sz(ans); i++){
  81.             cout << ans[i].name << " ";
  82.             cout << ans[i].members << "\n";
  83.         }
  84.     }
  85. }
  86.  
  87. int main()
  88. {   Anwar_Rizk();
  89.  
  90.     int t = 1;
  91.     //cin >> t;
  92.     while(t--){
  93.       solve();
  94.     }
  95.  
  96.   return 0;
  97. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement