提出 #65016914

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define lowbit(x) (x&(-x))
#define ull unsigned long long 
#define pii pair<int,int>
using namespace std;
const string yes="Yes\n",no="No\n";
const int N = 1000005,inf = 2e18,mod=1000000007;
int qpow(int x,int y=mod-2,int mo=mod,int res=1){
    for(;y;(x*=x)%=mo,y>>=1)if(y&1)(res*=x)%=mo;
    return res;
}
int jie[N],invjie[N];
int C(int n,int m){return n>=m&&m>=0?jie[n]*invjie[m]%mod*invjie[n-m]%mod:0;}
void main_init(){
    int n=N-1;jie[0]=1;for(int i=1;i<=n;i++)jie[i]=jie[i-1]*i%mod;
    invjie[n]=qpow(jie[n]);for(int i=n-1;~i;i--)invjie[i]=invjie[i+1]*(i+1)%mod;
}
int n,m;
int k[300005];
vector<int>a[300005];
vector<int>p[300005];
int b[300005];
int cnt[300005];
int ans;
void solve(){
    cin>>n>>m;
    for(int i=1;i<=m;i++){
        cin>>k[i];
        for(int j=1;j<=k[i];j++){
            int x;cin>>x;
            // a[i].push_back(x);
            p[x].push_back(i);
        }
    }
    for(int i=1;i<=n;i++){
        cin>>b[i];
        for(auto x:p[b[i]]){
            cnt[x]++;
            if(cnt[x]==k[x])ans++;
        }
        cout<<ans<<endl;
    }

}
signed main(){
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    cout<<fixed<<setprecision(12);main_init();
    int t=1;
    //cin>>t;
    while (t--)solve();
}

提出情報

ジャッジ結果