玄关求救

#include<bits/stdc++.h>
using namespace std;
priority_queue<double,vector<double>,greater<double> > q;
string cg,qz[10010];
double n,t[10010];
int tim;
int main(){
	cin>>n;
	for(int i=1;i<=n;i++)cg=cg+'0';
	for(int i=1;i<=n;i++){
		qz[i]=cg;
		int x;
		cin>>x>>t[i];
		while(x!=0){
			cin>>x;
			if(x==0)break;
			qz[i][x-1]='1';
		}
		if(qz[i]==cg)q.push(t[i]+i/10000-0.0001);
	}
	while(++tim){
		int LD[110]={0};
		if(int(q.top())!=tim)tim=q.top();
		while(int(q.top())==tim){
			LD[++LD[0]]=(long long)(q.top()*10000)%10000;
			q.pop();
			cout<<q.size()<<endl;
		}
		for(int i=1;i<=n;i++){
			if(qz[i]==cg)continue;
			for(int j=1;j<=LD[0];j++)qz[i][LD[j]-1]='0';
			if(qz[i]==cg)q.push(t[i]+tim+i/10000-0.0001);
		}
		if(q.empty()){
			cout<<tim;
			return 0;
		}
	}
	return 0;
}