提出 #65022230

---

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
#define fs first
#define sd second
#define int long long
const int mod = 1e9 + 7;

int powOf(int l, int r)
{
    int c = 0;
    while (l > 0 && l % r == 0)
    {
        l /= r;
        c++;
    }
    return c;
}

int binpow(int n, int x)
{
    if (x == 0)
        return 1;
    int ans = binpow(n, x / 2);
    if (x % 2 == 0)
        return ans * ans;
    else
        return ans * ans * n;
}

int32_t main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int t = 1;
    // cin >> t;
    while (t--)
    {
        int n, m;
        cin >> n >> m;
        map<int, unordered_set<int>> mp;
        unordered_map<int, vector<int>> ingredients;
        for (int i = 0; i < m; i++)
        {
            int k;
            cin >> k;
            for (int j = 0; j < k; j++)
            {
                int a;
                cin >> a;
                mp[i].insert(a);
                ingredients[a].push_back(i);
            }
        }
        unordered_set<int> st;
        vector<int> b(n);
        for (int i = 0; i < n; i++)
        {
            cin >> b[i];
            st.insert(b[i]);
        }

        vector<int> dislike(m);
        vector<bool> eat(m, false);
        for (int i = 0; i < m; i++)
        {
            for (auto it : mp[i])
            {
                if (st.count(it))
                    dislike[i]++;
            }
        }
        int ct = 0;
        for (int i = 0; i < n; i++)
        {
            st.erase(b[i]);
            for (auto it : ingredients[b[i]])
            {
                if (eat[it])
                    continue;

                dislike[it]--;
                if (dislike[it] == 0)
                {
                    ct++;
                    eat[it] = true;
                }
            }
            cout << ct << endl;
        }
    }
    return 0;
}

提出情報

ジャッジ結果