PAT刷题记录-A1032

PAT A1032

#include<cstdio>
#include<algorithm>
#include<iostream>

using namespace std;

const int MAXN=10001;
	
int main(){
	int s[MAXN];
	int a[MAXN],b[MAXN];
	int sa,sb,n,i,j,h;
	char k;
	scanf("%d %d %d",&sa,&sb,&n);
	for(i=0;i<n;i++){
		scanf("%d %c %d",&j,&k,&h);
		s[j]=h;
	}
	i=0;
	do{
		a[i++]=sa;
		sa=s[sa];
	}while(sa!=-1);
	j=0;
	do{
		b[j++]=sb;
		sb=s[sb];
	}while(sb!=-1);
	a[i]=-1;
	b[j]=-1;
	h=0;
	while(i>=0 && j>=0){
		if(a[i]==b[j]){
			h=a[i];
		}else{
			break;
		}
		i--;
		j--;
	}
	if(h!=-1) printf("%05d\n",h);
	else printf("%d\n",h);
	return 0;
}