[NOIP2016 普及组] 海港

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
//用两个队列来维护船到港的时间和每个乘客所在的船（船到港的时间作为标志）和对应的国籍
//每有一艘新船到港，检验第一个队列队头是否在时间范围之内，如果否就出队，并在第二个队列中将该船乘客出队 
//然后让新船上的乘客入队，并hash记录国籍，将国籍和船籍入第二个队列 
const int N=1e5+10;
int n;
queue<int> liyue;
queue< pair<int,int> > harbour;
int shiptime[5*N],shipmen[5*N];
long long h[5*N];
int ans=0;
int main()
{
	scanf("%d",&n);
	scanf("%d%d",&shiptime[1],&shipmen[1]);
	liyue.push(shiptime[1]);
	for(int j=1;j<=shipmen[1];++j)
	{
		int x;
		scanf("%d",&x);
		if(h[x]==0) ++ans;
		h[x]++;
		harbour.push(make_pair(shiptime[1],x));
	}
	printf("%d\n",ans);
	for(int i=2;i<=n;++i)
	{
		scanf("%d%d",&shiptime[i],&shipmen[i]);
		liyue.push(shiptime[i]);
		
		while(!liyue.empty()&&shiptime[i]-liyue.front()>=86400)
		{
			while(!harbour.empty()&&harbour.front().first==liyue.front()) 
			{
				int x=harbour.front().second;
				h[x]--;
				if(h[x]==0) --ans;
				if(!harbour.empty()) harbour.pop();
			}
			if(!liyue.empty()) liyue.pop();
		}
		for(int j=1;j<=shipmen[i];++j)
		{
			int x;
			scanf("%d",&x);
			if(h[x]==0) h[x]=1,++ans;
			else h[x]++;
			harbour.push(make_pair(shiptime[i],x));
		}
		printf("%d\n",ans);
	}
	return 0;
}