spin

#include<iostream>
#include<fstream>
using namespace std;
int main()
{
	ifstream fin ("spin.in");
	ofstream fout ("spin.out");
	int i,j,k;
	int time=0;
	int speed[6]={0};
	int gapcount[15]={0};
	int gap[6][15][3]={0};
	int tmpgap[6][15][3]={0};
	int tmpgapcount[15]={0};
	bool b=true;
	for(i=1;i<=5;i++)
	{
		fin>>speed[i];
		fin>>tmpgapcount[i];
		for(k=1;k<=tmpgapcount[i];k++)
		{
			fin>>tmpgap[i][k][1];
			int param2=0;
			fin>>param2;
			if(param2+tmpgap[i][k][1]>=360)
				tmpgap[i][k][2]=param2+tmpgap[i][k][1]-360;
			else 
				tmpgap[i][k][2]=param2+tmpgap[i][k][1];
		}
	}
	for(i=1;i<=5;i++)
	{
		for(j=1;j<=tmpgapcount[i];j++)
		{
			gap[i][j][1]=tmpgap[i][j][1];
			gap[i][j][2]=tmpgap[i][j][2];
			gapcount[i]=tmpgapcount[i];
		}
	}
	int t=0;
	int q=0;
	for(i=1;i<=5;i++)
	{
		int count=0;
		for(j=1;j<=gapcount[i];j++)
		{
			if(gap[i][j][2]<gap[i][j][1])
			{
				gap[i][gapcount[i]+(++count)][1]=0;
				gap[i][gapcount[i]+(count)][2]=gap[i][j][2];
				gap[i][j][2]=360;
			}
		}
		gapcount[i]+=count;
	}
	while(b)
	{
		for(i=1;i<=5;i++)//求當前時刻每個缺口的起始角度和結束角度
		{
			int count=0;
			int change=time*speed[i];
			for(j=1;j<=gapcount[i];j++)
			{
				gap[i][j][1]+=change;
				gap[i][j][2]+=change;
				if(gap[i][j][1]/360)
					gap[i][j][1]%=360;
				if(gap[i][j][2]/360)
					gap[i][j][2]%=360;
				if(gap[i][j][2]<gap[i][j][1])
				{
					gap[i][gapcount[i]+(++count)][1]=0;
					gap[i][gapcount[i]+(count)][2]=gap[i][j][2];
					gap[i][j][2]=360;
				}
			}
			gapcount[i]+=count;
		}
		//檢查當前時刻是否有空隙
		for(i=1;i<=4;i++)
		{
			for(j=i+1;j<=5;j++)
			{
				//考察輪子i的每個缺口
				for(k=1;k<=gapcount[i];k++)
				{
					//考察輪子j的每個缺口
					for(q=1;q<=gapcount[j];q++)
					{
						if(((gap[i][k][2]>=gap[j][q][1] && gap[j][q][2]>=gap[i][k][1])|| (gap[i][k][2]>=gap[j][q][1] && gap[j][q][2]>=gap[i][k][1])||(gap[i][k][2]>=gap[j][q][2] && gap[i][k][1]<=gap[j][q][1])||(gap[i][k][2]<=gap[j][q][2] && gap[i][k][1]>=gap[j][q][1])) && (gap[i][k][1]!=gap[i][k][2] && gap[j][q][1]!=gap[j][q][2]))
						{
							t++;
							break;
						}
					}
					if(q<=gapcount[j])
					{
					   // cout<<k<<' '<<q<<endl;
						break;
					}
				}
			}
		}
		//復原
		for(i=1;i<=5;i++)
		{
			for(j=1;j<=gapcount[i];j++)
			{
				gap[i][j][1]=tmpgap[i][j][1];
				gap[i][j][2]=tmpgap[i][j][2];
				gapcount[i]=tmpgapcount[i];
			}
		}
		if(t>=10)
		{
			b=false;
			fout<<time<<endl;
			return 0;
		}
		t=0;
		if(time>500)
		{
			fout<<"none"<<endl;
			return 0;
		}
		time++;
	}
	return 0;
}