学步园

<br /> Source Code</p> <p>Problem: 2503 User: zhouxc<br /> Memory: 4316K Time: 344MS<br /> Language: G++ Result: Accepted </p> <p>Source Code<br /> #include "iostream"<br /> #define N 100002<br /> using namespace std;</p> <p>typedef struct Tran{</p> <p> char E[20];<br /> char F[20];<br /> };</p> <p>Tran L[N];<br /> char ch[20];</p> <p>int comp(const void *p1,const void *p2)<br /> {</p> <p> return strcmp((*(Tran*)p1).F,(*(Tran*)p2).F);</p> <p>}</p> <p>char* Binary_Search(char c[],int len)<br /> {<br /> int left,right,middle;<br /> left=0;<br /> right=len-1;<br /> while(left<=right)<br /> {<br /> middle=(left+right)/2;<br /> if(strcmp(c,L[middle].F)>0)<br /> left=middle+1;<br /> else if(strcmp(c,L[middle].F)<0)<br /> right=middle-1;<br /> else<br /> return L[middle].E;<br /> }<br /> return "eh";<br /> } </p> <p>int main()<br /> {<br /> int cunt=0;<br /> while(1)<br /> { </p> <p> ch[0]=getchar();<br /> if(ch[0]=='/n')<br /> break;<br /> scanf("%s%s",ch+1,L[cunt].F);<br /> getchar();<br /> strcpy(L[cunt].E,ch);<br /> cunt++;</p> <p> }<br /> qsort(L,cunt,sizeof(L[0]),comp);<br /> // for(int i=0;i<cunt;i++)<br /> // printf("%s/n",L[i].F);<br /> while(scanf("%s",ch)!=EOF)<br /> printf("%s/n",Binary_Search(ch,cunt));<br /> return 0;<br /> }<br /> Source Code</p> <p>Problem: 2503 User: zhouxc<br /> Memory: 5884K Time: 579MS<br /> Language: G++ Result: Accepted </p> <p>Source Code<br /> #include "iostream"<br /> #include "string.h"<br /> #include "malloc.h"</p> <p>using namespace std;</p> <p>typedef struct BitNode{</p> <p> char str1[11];<br /> char str2[11];<br /> struct BitNode *Left;<br /> struct BitNode *Right;<br /> }BitNode,*BiTree;</p> <p>char ch[11],ch1[11],ch2[11];</p> <p>void Creat(BiTree *T,char *ch1,char *ch2)<br /> {</p> <p> if(*T==NULL)<br /> {<br /> *T=(BitNode*)malloc(sizeof(BitNode));<br /> strcpy((*T)->str1,ch1);<br /> strcpy((*T)->str2,ch2);<br /> (*T)->Left=NULL;<br /> (*T)->Right=NULL;<br /> }<br /> else<br /> {</p> <p> if(strcmp((*T)->str2,ch2)>=0)<br /> Creat(&(*T)->Left,ch1,ch2);<br /> else<br /> Creat(&(*T)->Right,ch1,ch2);<br /> }<br /> } </p> <p>char* Find(BiTree T,char *ch)<br /> {</p> <p> if(T!=NULL)<br /> {<br /> if(strcmp(T->str2,ch)>0)<br /> return Find(T->Left,ch);<br /> else if(strcmp(T->str2,ch)<0)<br /> return Find(T->Right,ch);<br /> else<br /> return T->str1;<br /> }<br /> return "eh";<br /> } </p> <p>int main()<br /> {<br /> BiTree T=NULL;<br /> while(1)<br /> { </p> <p> ch1[0]=getchar();<br /> if(ch1[0]=='/n')<br /> break;<br /> scanf("%s %s",ch1+1,ch2);<br /> getchar();<br /> Creat(&T,ch1,ch2);</p> <p> }<br /> while(scanf("%s",ch)!=EOF)<br /> printf("%s/n",Find(T,ch));<br /> // while(1);<br /> return 0;<br /> }</p> <p>