Submission #73387840

---

Source Code Expand

#include <bits/stdc++.h>
#include <unordered_set>

using namespace std;

using ll = long long;
using Graph = vector<vector<int>>;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rep1(i, n) for (int i = 1; i <= (int)(n); i++)
#define all(v) v.begin(), v.end()
const int INF = 1 << 30;

const int dx[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, 1, -1};

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<vector<string>> labo(n);
    vector<unordered_set<string>> st(n);
    rep(i, n) {
        int m;
        cin >> m;
        rep(j, m) {
            string w;
            cin >> w;
            st[i].emplace(w);
            labo[i].push_back(w);
        }
    }
    int ans = 0;
    rep(i, n - 1) {
        for (int j = i + 1; j < n; j++) {
            int cnt = 0;
            for (auto& str : labo[i]) {
                if (st[j].count(str) == 1) {
                    cnt++;
                }
            }
            if (cnt >= k) {
                ans++;
            }
        }
    }
    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result