AcWing 1516. 共享
原题链接
简单
作者:
沈子楚
,
2023-08-04 22:47:38
,
所有人可见
,
阅读 74
//链表
#include<bits/stdc++.h>
using namespace std;
const int MAX_N = 100010;
int ne[MAX_N];
int main() {
int head1, head2, n;
cin >> head1 >> head2 >> n;
for (int i = 0; i < n; i++) {
int addr, nextAddr;
char data;
cin >> addr >> data >> nextAddr;
ne[addr] = nextAddr;
}
int i = head1, j = head2;
if (i != -1 && j != -1) {
while (i != j) {
if (i == -1) i = head2;
if (j == -1) j = head1;
i = ne[i];
j = ne[j];
}
}
if (i == -1 || j == -1) puts("-1");
else printf("%05d\n", i);
return 0;
}