题解

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 1e8 + 5;
int n , m;
vector<int> s[100005];
int vis[100005];
int main(){
	cin >> n;
	for(int i = 0;i < n;i++ ){
		int a;
		cin >> a;
		s[i].push_back(a);
		cin >> a;
		for(int j = 0;j < a;j++){
			int b;
			cin >> b;
			s[i].push_back ( b );
		}
	}
	int _min = s[0][0];
	int ans = 0;
	int l = 0;
	for(int i = 0;i < n;i++){
		while(_min + 86400 <= s[i][0]){
			for(int j = 1;j < s[l].size();j++){
				if(vis[s[l][j]] == 1) ans--;
				vis[s[l][j]]--;
			}
			l++;
			_min = s[l][0];
		}
		for(int j = 1;j < s[i].size();j++){
			if(vis[s[i][j]] == 0) ans++;
			vis[s[i][j]]++;
		}
		cout << ans << endl;
	}
	return 0;
}