2646808_ac_8375ms_176k.cc

北大大牛代码 1240道题的原代码 超级权威

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

int mark[2001];

int main()
{
	int t, cas;
	int n, m, i, r;
	int a, b, flag;

	scanf("%d",&t);
	cas = 1;
	while (t--)
	{
		printf("Scenario #%d:\n",cas++);
		scanf("%d%d",&n,&m);
		memset(mark,-1,sizeof(int)*(n+1));
		flag = r = 0;
		for (i = 0; i < m; i++)
		{
			scanf("%d%d",&a,&b);
			if (!flag)
			{
				if(mark[a]==mark[b]&&mark[a]==-1)
				{
					mark[a] = r;
					mark[b] = r+1;
					r+=2;
					continue;
				}
				if (mark[a]==-1||mark[b]==-1)
				{
					if (mark[a]==-1)
					{
						if (mark[b]%2)
						{
							mark[a] = mark[b]-1;
						} 
						else
						{
							mark[a] = mark[b]+1;
						}
					} 
					else
					{
						if (mark[a]%2)
						{
							mark[b] = mark[a]-1;
						} 
						else
						{
							mark[b] = mark[a]+1;
						}
					}
					continue;
				}
				if (mark[a]==mark[b])
				{
					flag = 1;
					continue;
				}
				int s = 1, c = 1, tt;
				if (mark[a]%2)
				{
					s = -1;
				}
				if (mark[b]%2)
				{
					c = -1;
				}
				tt = mark[b];
				for (int j = 0; j < n; j++)
				{
					if (mark[j]==tt)
					{
						mark[j] = mark[a]+s;
					}
					if (mark[j]==tt+c)
					{
						mark[j] = mark[a];
					}
				}
			}
		}
		if (flag)
		{
			printf("Suspicious bugs found!\n\n");
		} 
		else
		{
			printf("No suspicious bugs found!\n\n");
		}
	}
	return 0;
}