pat 1032 sharing



#include <iostream>
#include <cstdio>
using namespace std;
const int maxn =100010;
struct Node
{
 char data;
 int next;
 bool flag;
}node[maxn];

/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int main(int argc, char** argv) {
 for(int i=0;i<maxn;i++)
 {
  node[i].flag=false;
 }
 int s1,s2,n;
 scanf("%d%d%d",&s1,&s2,&n);
 int address,next;
 char data;
 for(int i=0;i<n;i++)
 {
  scanf("%d %c %d",&address,&data,&next);
  node[address].data=data;
  node[address].next=next;
 }
 for(int p=s1;p!=-1;p=node[p].next)
 {
  node[p].flag=true;
 }
 int p;
 for(p=s2;p!=-1;p=node[p].next)
 {
  if(node[p].flag==true)
   break;
 }
 if(p!=-1)
  printf("%05d\n",p);
 else
  printf("-1\n");
 return 0;
}

猜你喜欢

转载自blog.csdn.net/qq_37802644/article/details/79586118
今日推荐