Submission #65032459

---

Source Code Expand

/**
 *  author  : mahad | github.com/MahadMuhammad
 *  created : Apr-19-2025   05:03:20 PM  CP/atcoder/abc402/C/C.cpp
 **/
#include <bits/stdc++.h>
using namespace std;

#ifdef MAHAD_DEBUG
#include "algo/debug.h"
#else
#define dbg(...) ((void)0)
#define welcome(...) ((void)0)
#endif

int main() {
  ios::sync_with_stdio(false);
#ifndef MAHAD_DEBUG
  cin.tie(nullptr);
#endif

  int N, M;
  cin >> N >> M;

  vector<vector<int>> routine(M);
  vector<int> day(N);
  
  
  for (int mm = 0; mm < M; mm++) {
    int K;
    cin >> K;
    routine[mm].reserve(K);
    for (int kk = 0; kk < K; kk++) {
      int val;
      cin >> val;
      routine[mm].push_back(val);
    }
  }
  
  for (int nn = 0; nn < N; nn++) {
    cin >> day[nn];
  }

  vector<vector<int>> dayToRoutines(N + 1);
  vector<int> requiredDays(M, 0);
  for (int i = 0; i < M; i++) {
    unordered_set<int> uniqueDays;
    for (int d : routine[i]) {
      if (uniqueDays.insert(d).second) {
        dayToRoutines[d].push_back(i);  
    }
    }
    requiredDays[i] = uniqueDays.size();  }
  
  int completedRoutines = 0;
  unordered_set<int> seenDays;
  
  for (int d : day) {
    seenDays.insert(d);
    
    for (int routineIdx : dayToRoutines[d]) {
      requiredDays[routineIdx]--;
      if (requiredDays[routineIdx] == 0) {
        completedRoutines++;
      }
    }
    
    cout << completedRoutines << '\n';
  }

  return 0;
}

Submission Info

Judge Result