这个题贴代码是为了反思的。。。比赛交的时候就TLE,赛后一直TLE,后来被某神指点后才发现自己把字符串定义在结构体里面,每次拷贝一个字符串,不TL才怪
哎。。。丢死了。。。TL的代码还是不贴了
#include <stdio.h>
#include <string.h>
#include <algorithm>
using namespace std;
typedef struct
{
int id;
//char s[50];
int sum;
int rk;
int min;
int max;
}team;
typedef struct
{
int a;
int b;
}vs;
team a[25],b[25];
vs d[15];
char name[25][50];
int n,m,ct;
int cmp(team a,team b)
{
return a.sum>b.sum;
}
int su[25];
int ans[25];
int dfs(int cur)
{
// memcpy(sum,kk,(sizeof kk[0])*n);
if(cur==ct)
{
for(int i=0;i<n;i++)
b[i]=a[i];
for(int i=0;i<ct;i++)
{
int u=d[i].a;
int v=d[i].b;
if(ans[i]==-1)
{
b[u].sum+=3;
}
if(ans[i]==0)
{
b[u].sum+=1;
b[v].sum+=1;
}
if(ans[i]==1)
{
b[v].sum+=3;
}
}
sort(b,b+n,cmp);
b[0].rk=1;
if(b[0].rk<b[0].min) b[0].min=b[0].rk;
if(b[0].rk>b[0].max) b[0].max=b[0].rk;
for(int i=1;i<n;i++)
{
if(b[i].sum==b[i-1].sum)
b[i].rk=b[i-1].rk;
else
b[i].rk=i+1;
if(b[i].rk<b[i].min) b[i].min=b[i].rk;
if(b[i].rk>b[i].max) b[i].max=b[i].rk;
}
for(int i=0;i<n;i++)
{
a[b[i].id].max=b[i].max;
a[b[i].id].min=b[i].min;
}
// for(int i=0;i<n;i++)
// printf("%d %s %d\n",a[i].id,a[i].s,a[i].sum);
return 0;
}
for(int i=-1;i<=1;i++)
{
ans[cur]=i;
dfs(cur+1);
}
}
int find(char *s)
{
for(int i=0;i<n;i++)
{
if(strcmp(name[i],s)==0)
return i;
}
}
int main()
{
char t1[35],t2[35],k[10];
int x,y,f=0;
while(scanf("%d%d",&n,&m)==2)//
{
if(!n&&!m)break;
if(f)printf("\n");
f=1;
ct=0;
for(int i=0;i<n;i++)
{
scanf("%s",name[i]);
a[i].id=i;
//memset(a[i].vs,0,sizeof(a[i].vs));
a[i].sum=0;
a[i].min=n+1;
a[i].max=0;
}
for(int i=0;i<m;i++)
{
scanf("%s%s%s%d%d",t1,k,t2,&x,&y);
t2[strlen(t2)-1]='\0';
int f1=find(t1);
int f2=find(t2);
if(x==-1&&y==-1)
{
d[ct].a=f1;
d[ct].b=f2;
ct++;
}
else
{
if(x>y)
{
a[f1].sum+=3;
}
else if(x==y)
{
a[f1].sum+=1;
a[f2].sum+=1;
}
else
{
a[f2].sum+=3;
}
}
}
dfs(0);
for(int i=0;i<n;i++)
{
printf("Team %s can finish as high as",name[i]);
if(a[i].min==1)printf(" 1st ");
else if(a[i].min==2)printf(" 2nd ");
else if(a[i].min==3)printf(" 3rd ");
else printf(" %dth ",a[i].min);
printf("place and as low as");
if(a[i].max==1)printf(" 1st ");
else if(a[i].max==2)printf(" 2nd ");
else if(a[i].max==3)printf(" 3rd ");
else printf(" %dth ",a[i].max);
printf("place.\n");
}
}
return 0;
}