ZOJ-1236

时间效率要求比较高的模拟，逻辑上也要比较清晰的思路，竟然1A了，有点小惊喜，哈哈，虽然时间要6s多。。不要在意这些细节。。说下我的思路吧，模拟每天的情况，周期为每个牛周期的最小公倍数，如果中间有牛被吃掉了，那周期就要以剩下牛的周期最小公倍数重新开始计算，如果在大周期内没有牛被吃掉了，那么循环就结束了，接下来也没有牛会被吃掉，另一种情况就是所有牛被吃光了，注意代码一定要细心。。

#include<cstdio>
#include<cstring>

using namespace std;

namespace
{
	int gcd(int a, int b)
	{
		if (!a)
			return b;
		return gcd(b % a, a);
	}

	int lcm(int a, int b)
	{
		return a * b / gcd(a, b);
	}

	int length(int *mp)
	{
		int res = 1;
		for (int i = 1; i <= 10; i++)
			if (mp[i])
				res = lcm(res, i);
		return res;
	}
}

int main()
{
	int T, a[1000][10], c[1000], mp[11];
	bool eat[1000];
	scanf("%d", &T);
	while (T--)
	{
		int N;
		scanf("%d", &N);
		memset(mp, 0, sizeof(mp));
		memset(eat, 0, sizeof(eat));
		for (int i = 0; i < N; i++)
		{
			scanf("%d", &c[i]);
			mp[c[i]]++;
			for (int j = 0; j < c[i]; j++)
				scanf("%d", &a[i][j]);
		}
		bool end = false;
		int day = 0, eated = 0;
		while (!end)
		{
			int dd, len = length(mp);
			for (dd = 0; dd < len; dd++)
			{
				int minn = 300, count = 0, eatindex = -1;
				for (int i = 0; i < N; i++)
				{
					if (eat[i])
						continue;

					int index = day % c[i];
					if (a[i][index] < minn)
					{
						minn = a[i][index];
						count = 1;
						eatindex = i;
					}
					else if (a[i][index] == minn)
						count++;
				}
				day++;
				if (count == 1)
				{
					eated++;
					eat[eatindex] = true;
					mp[c[eatindex]]--;
					break;
				}
			}
			if (dd == len)
			{
				day -= len;
				end = true;
			}
			if (eated == N)
				end = true;
		}
		printf("%d %d\n", N - eated, day);
	}
	return 0;
}