> #include<stdio.h>
> 
> struct Node
> {
> 	int p,val;
> 	Node *next;
> 	Node(int _p,int _v){next=NULL;p=_p;val=_v;}
> };
> 
> struct List
> {
> 	Node *head;
> 	int flag;
> 	List(){head=new Node(0,0);}
> 	void set(){head->next=NULL;}
> 	void Insert(int p,int v)
> 	{
> 		Node *t=new Node(p,v);
> 		t->next=head->next;
> 		head->next=t;
> 	}
> }list[200200];
> 
> int queue[200200][3];
> 
> int main()
> {
> 	int T;
> 	while(scanf("%d", &T)!=EOF)
> 	{
> 		int ca = 1;
> 		for( ca=1; ca<=T; ca++ )
> 		{
> 			printf("Case %d: ", ca);
> 			int n,m,s;
> 			scanf("%d%d%d", &n, &m, &s);
> 			while( s >= n || s < 0 )
> 				printf("!!");
> 			int i;
> 			for( i=0; i<=n; i++ )
> 			{
> 				list[i].set();
> 				list[i].flag = 0;
> 			}
> 			while( m -- )
> 			{
> 				int a,b;
> 				scanf("%d%d", &a, &b);
> 				while( a >= n || a < 0 || b >= n || b < 0 )
> 				{
> 					printf("11");
> 				}
> 				list[a].Insert(b,0);
> 				list[b].Insert(a,0);
> 			}
> 			int l,r;
> 			l = 0;
> 			r = 0;
> 			queue[r][1] = 0;
> 			queue[r++][0] = s;
> 			list[s].flag = 1;
> 			int flag = 0;
> 			while( l < r )
> 			{
> 				int time = queue[l][1];
> 				int cur = queue[l++][0];
> 				Node * temp = list[cur].head->next;
> 				while( temp != NULL )
> 				{
> 					int t = temp->p;
> 					if( list[t].flag != 0 )
> 					{
> 						if( list[t].flag != ((time+1)%2) + 1)
> 							flag = 1;
> 					}
> 					else
> 					{
> 						queue[r][0] = t;
> 						queue[r++][1] = time+1;
> 						list[t].flag = ((time+1)%2) + 1;
> 					}
> 					temp = temp->next;
> 				}
> 			}
> 			if( r == n && flag == 1 )
> 				printf("YES\n");
> 			else
> 				printf("NO\n");
> 		}
> 	}
> 	return 0;
> }

• 我用for( i=0; i< m; i++ ),还是RE..... (0) 054100532 2008-09-27 21:01:21
  • 那我不知道了……这道题折腾死我们了……郁闷啊 (0) ACM06Louty 2008-09-27 21:06:32
    • 有越界数据....(0 <= u, v < N). 这个不对的... (0) 054100532 2008-09-27 21:19:36
      • 这个好像我们检查过的啊，没问题的啊…… (0) ACM06Louty 2008-09-27 21:21:38
        • 但是我的确是改了这个就AC了啊 (0) 054100532 2008-09-27 21:23:06
          • 还有这样竟然会返回RE的.... (46) 054100532 2008-09-27 21:25:20