Submission #27103510

---

Source Code Expand

#include <algorithm>
#include <bits/stdc++.h>
#include <cmath>
#include <iostream>
#include <map>
#include <math.h>
#include <set>
#include <string>
#include <tuple>
#include <vector>
using namespace std;

#define rep(i, o) for (int i = 0; i < (o); ++i)
#define REP(i, a, b) for (int i = (int)(a); (i) < (int)(b); i++)
#define NUM 1e5

typedef long long ll;
typedef unsigned long long ull;

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll c, ll d) { return c / gcd(c, d) * d; }

const int MOD = 1000000007;

template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}

template <class T>
bool chmin(T &a, const T &b)
{
    if (a > b)
    {
        a = b;
        return 1;
    }
    return 0;
}


int main() {
    ll n;
    cin >> n;

    vector<ll> l(n);
    vector<vector<ll>> a(n);
    rep(i, n) {
      cin >> l[i];
      ll m = l[i];
      rep(j, m) {
        ll k = 0;
        cin >> k;
        a[i].push_back(k);
      }
    }
    sort(a.begin(), a.end());
    ll ans = 0;
    rep(i, n) {
      if (i > 0 && a[i] == a[i-1]) {
        continue;
      }
      ans++;
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result