PAT 1032. Sharing (25)
2014-11-04 22:00
351 查看
//没有想到这道题必须用map,用map后既能不超时也能简单很多~
#include<iostream>
using namespace std;
#include<cstring>
int map[100005];
int vst[100005] = { 0 };
int main(){
memset(map, -1, sizeof(map));
int add1, add2, n;
cin >> add1 >> add2 >> n;
for (int i = 0; i < n; i++){
int a, b; char ch;
cin >> a >> ch >> b;
map[a] = b;
}
int add = add1;
while (add != -1){
vst[add] = 1;
add = map[add];
}
add = add2;
while (add != -1 && !vst[add]){
add = map[add];
}
if (add == -1)
printf("-1");
else
printf("%05d", add);
}
#include<iostream>
using namespace std;
#include<cstring>
int map[100005];
int vst[100005] = { 0 };
int main(){
memset(map, -1, sizeof(map));
int add1, add2, n;
cin >> add1 >> add2 >> n;
for (int i = 0; i < n; i++){
int a, b; char ch;
cin >> a >> ch >> b;
map[a] = b;
}
int add = add1;
while (add != -1){
vst[add] = 1;
add = map[add];
}
add = add2;
while (add != -1 && !vst[add]){
add = map[add];
}
if (add == -1)
printf("-1");
else
printf("%05d", add);
}
相关文章推荐
- PAT1032: Sharing (25)
- PAT 1032. Sharing (25)(求俩个字符串的交点)
- 1032. Sharing (25)-PAT
- 1032. Sharing (25) PAT甲级
- PAT - 甲级 - 1032. Sharing (25)(链表)
- Python实现Pat 1032. Sharing (25)
- PAT (Advanced Level) Practise 1032 Sharing (25)
- 1032. Sharing (25)-PAT甲级真题
- PAT甲级1032. Sharing (25)
- PAT 1032. Sharing (25)
- [PAT]1032. Sharing (25)(Java实现)
- Python实现Pat 1032. Sharing (25)
- PAT 1032. Sharing (25) 链表和栈的运用, 字符的读取
- pat 1032. Sharing (25)
- PAT 1032. Sharing (25)
- 浙大2012上机 PAT 1032. Sharing (25)
- PAT甲级真题及训练集(16)--1032. Sharing (25)
- PAT 1032. Sharing (25)
- PAT 1032. Sharing (25)
- 【C++】PAT(advanced level)1032. Sharing (25)