ZHONGZHUANH

haha6823981

于 2009-08-15 18:24:00 发布

阅读量280

点赞数

本文链接：https://blog.csdn.net/haha6823981/article/details/4450129

版权

#include<stdio.h>
#include<algorithm>
using namespace std;
int rear,front;
int q[10001];
int map[1000001];
int temp;
int sum;
int xia;
int visit[10001];
int cmp(const void*a,const void*b)
{
return *(int *)a-*(int *)b;
}
int main()
{
bool boo=true;
int i,j;
int id=1;
int e;
int N,M;
int k;
while(1)
{
scanf("%d%d",&N,&M);
if(N==0&&M==0)
break;
sum=0;
xia=0;
for(i=0;i<M;i++)
{
scanf("%d%d",&j,&k);
map[xia++]=(j-1)*(j)/2+k-1;
}
qsort(map,M,sizeof(map[0]),cmp);

    rear=-1;
   memset(visit,0,sizeof(visit));
   front=-1;
   visit[0]=1;
   q[++rear]=0;
   while(front!=rear)
   {
    temp=q[++front];
    for(j=0;j<N;j++)
    {

int high=xia, low=0,mid;
    while(low<=high)
{e=temp*(temp+1)/2+j;
  mid=(high+low)/2;
  if(map[mid]==e)
   boo=false;
  if(map[mid]>e)
   high=mid-1;
  else
   low=mid+1;
}

  if(boo&&visit[j]==0)
     {
      sum++;visit[j]=1;
      q[++rear]=j;
     }
  boo=true;
    }
   }
   printf("case %d: %d/n",id,sum);
id++;
}
return 0;
}

#include<stdio.h>
#include<algorithm>
using namespace std;
int rear,front;
int q[10001];
int map[1000001];
int temp;
int sum;
int xia;
int biaozhi[10000];
int visit[10001];
int cmp(const void*a,const void*b)
{
return *(int *)a-*(int *)b;
}
int main()
{
bool boo=true;
int i,j;
int id=1;
int e;
    int N,M;
int k;
while(1)
{
scanf("%d%d",&N,&M);
if(N==0&&M==0)
break;
sum=0;
xia=0;
int cc,ccc=0,cccc=10000;
for(i=0;i<M;i++)
{
scanf("%d%d",&j,&k);
cc=(j-1)*(j)/2+k-1;
map[xia++]=cc;
if(cc<cccc)
{
   biaozhi[ccc]++;
}
else
{
   ccc++;cccc*=(ccc+1);
   if(ccc!=0)
     biaozhi[ccc]+=biaozhi[ccc-1];
printf("%d",biaozhi[ccc]);
}

}
    rear=-1;
   memset(visit,0,sizeof(visit));
   front=-1;
   visit[0]=1;
   q[++rear]=0;
   while(front!=rear)
   {
    temp=q[++front];
    for(j=0;j<N;j++)
    {

int high=biaozhi[e], low=biaozhi[e-1],mid;
    while(low<=high)
{e=temp*(temp+1)/2+j;
mid=(high+low)/2;
if(map[mid]==e)
   boo=false;
if(map[mid]>e)
   high=mid-1;
else
   low=mid+1;
}

if(boo&&visit[j]==0)
     {
      sum++;visit[j]=1;
      q[++rear]=j;
     }
boo=true;
    }
   }
   printf("case %d: %d/n",id,sum);
id++;
}
return 0;
}