AC on #1#12

#include<bits/stdc++.h>
using namespace std;
int n,t1,n1,nation[100005],ans,book[100005],maxx;
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d%d",&t1,&n1);
		if(t1>86400*i)memset(book,0,sizeof(book));
		for(int j=1;j<=n1;j++){
			scanf("%d",&nation[j]);
			maxx=max(maxx,nation[j]);
			book[nation[j]]=1;
		}
		for(int k=1;k<=maxx;k++){
			if(book[k]==1)ans++;
		}
		printf("%d\n",ans);
	}
	return 0;
}