A1032 Sharing (25 分)

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <cctype>
#include <queue>
using namespace std;
int main(){	
	int f1, f2, N;
	int next[100010];
	scanf("%d %d %d", &f1, &f2, &N);
	int temp;
	char ch;
	for(int i = 0; i < N; i++){
		scanf("%d", &temp);
		scanf(" %c %d", &ch, &next[temp]);
	}
	int used[100010];
	memset(used, 0, sizeof(used));
	int ans = -1;
	while(f1 != -1){
		used[f1]++;
		f1 = next[f1];
	}
	while(f2 != -1){
		used[f2]++;
		if(used[f2] >= 2){
			ans = f2; break;
		}
		f2 = next[f2];
	}
	if(ans != -1) printf("%05d\n", ans);
	else printf("-1\n");			
	return 0;
}