被坑水题——Codeforces Round #408 (Div. 2)

来源：互联网发布：2017中国大数据50强编辑：程序博客网时间：2024/06/05 07:22

Zane the wizard is going to perform a magic show shuffling the cups.

There are n cups, numbered from 1 to n, placed along the x-axis on a table that has m holes on it. More precisely, cup i is on the table at the position x = i.

The problematic bone is initially at the position x = 1. Zane will confuse the audience by swapping the cups k times, the i-th time of which involves the cups at the positions x = ui and x = vi. If the bone happens to be at the position where there is a hole at any time, it will fall into the hole onto the ground and will not be affected by future swapping operations.

Do not forget that Zane is a wizard. When he swaps the cups, he does not move them ordinarily. Instead, he teleports the cups (along with the bone, if it is inside) to the intended positions. Therefore, for example, when he swaps the cup at x = 4 and the one at x = 6, they will not be at the position x = 5 at any moment during the operation.

$\text{[math]}$

Zane’s puppy, Inzane, is in trouble. Zane is away on his vacation, and Inzane cannot find his beloved bone, as it would be too exhausting to try opening all the cups. Inzane knows that the Codeforces community has successfully helped Zane, so he wants to see if it could help him solve his problem too. Help Inzane determine the final position of the bone.

Input

The first line contains three integers n, m, and k (2 ≤ n ≤ 106, 1 ≤ m ≤ n, 1 ≤ k ≤ 3·105) — the number of cups, the number of holes on the table, and the number of swapping operations, respectively.

The second line contains m distinct integers h1, h2, ..., hm (1 ≤ hi ≤ n) — the positions along the x-axis where there is a hole on the table.

Each of the next k lines contains two integers ui and vi (1 ≤ ui, vi ≤ n, ui ≠ vi) — the positions of the cups to be swapped.

Output

Print one integer — the final position along the x-axis of the bone.

Examples
input
7 3 43 4 61 22 55 77 1
output
1
input
5 1 221 22 4
output
2

Note

In the first sample, after the operations, the bone becomes at x = 2, x = 5, x = 7, and x = 1, respectively.

In the second sample, after the first operation, the bone becomes at x = 2, and falls into the hole onto the ground.

反思：一开始思维定势认为交换时骨头一定从左边数字到右边数字

//#pragma comment(linker, "/STACK:1024000000,1024000000")#include <cstdio>#include <cstring>#include <cmath>//#include <cctype>#include <queue>#include <vector>#include <string>#include <stack>#include <set>#include <map>//#include <sstream>#include <iostream>#include <bitset>#include <algorithm>using namespace std;#define MP make_pair#define PB push_back#define mst(a,b) memset((a),(b),sizeof(a))#define TEST cout<<"*************************"<<endl#define rep(s,n,up) for(int i = (s); i < (n); i+=(up))#define per(n,e,down) for(int i = (n); i >= (e); i-=(down))#define rep1(s,n,up) for(int j = (s); j < (n); j+=(up))#define per1(n,e,down) for(int j = (n); j >= (e); j-=(down))typedef long long LL;typedef unsigned long long uLL;typedef pair<int, int> Pii;typedef vector<int> Vi;typedef vector<Pii> Vii;const int inf = 0x3f3f3f3f;const LL INF = (1uLL << 63) - 1;const double Pi = acos(-1.0);const int maxn = (1 << 16) + 7;const uLL Hashmod = 29050993;const double esp=1e-6;//#define localbool hole[1000005];int main() {#ifdef local    freopen("input.txt", "r", stdin);    //freopen("output.txt","w",stdout);#endif    //ios::sync_with_stdio(0);    //cin.tie();    LL n,m,k;    mst(hole,0);    scanf("%lld%lld%lld",&n,&m,&k);    while(m--){        LL i;        scanf("%lld",&i);        hole[i]=1;    }    LL s,e,bone=1;    while(k--){        scanf("%lld%lld",&s,&e);        if(!hole[bone]&&s==bone)            bone=e;    }    printf("%lld\n",bone);    return 0;}

后来看了CF上的MY SUBMISSIONS-SOURCE才知道自己考虑不佳

//#pragma comment(linker, "/STACK:1024000000,1024000000")#include <cstdio>#include <cstring>#include <cmath>//#include <cctype>#include <queue>#include <vector>#include <string>#include <stack>#include <set>#include <map>//#include <sstream>#include <iostream>#include <bitset>#include <algorithm>using namespace std;#define MP make_pair#define PB push_back#define mst(a,b) memset((a),(b),sizeof(a))#define TEST cout<<"*************************"<<endl#define rep(s,n,up) for(int i = (s); i < (n); i+=(up))#define per(n,e,down) for(int i = (n); i >= (e); i-=(down))#define rep1(s,n,up) for(int j = (s); j < (n); j+=(up))#define per1(n,e,down) for(int j = (n); j >= (e); j-=(down))typedef long long LL;typedef unsigned long long uLL;typedef pair<int, int> Pii;typedef vector<int> Vi;typedef vector<Pii> Vii;const int inf = 0x3f3f3f3f;const LL INF = (1uLL << 63) - 1;const double Pi = acos(-1.0);const int maxn = (1 << 16) + 7;const uLL Hashmod = 29050993;const double esp=1e-6;//#define localbool hole[1000005];int main() {#ifdef local    freopen("input.txt", "r", stdin);    //freopen("output.txt","w",stdout);#endif    //ios::sync_with_stdio(0);    //cin.tie();    int n,m,k;    mst(hole,0);    scanf("%d%d%d",&n,&m,&k);    while(m--){        int i;        scanf("%d",&i);        hole[i]=1;    }    int s,e,bone=1;    while(k--){        scanf("%d%d",&s,&e);        if(!hole[bone])        {            if(s==bone)                bone=e;            else if(e==bone)                bone=s;        }    }    printf("%d\n",bone);    return 0;}

ACM路上的渣渣将第一次BLOG献给被坑水题

0 0

2017中国大数据50强

原创粉丝点击

热门问题 老师的惩罚人脸识别我在镇武司摸鱼那些年重生之率土为王我在大康的咸鱼生活盘龙之生命进化天生仙种凡人之先天五行春回大明朝姑娘不必设防，我是瞎子昂科威价格表 kewei 昂科威尺寸昂科威吧昂科威配件价格表新昂科威科昂威昂克威昂科威参数昂科威参数配置昂科威20t论坛上海通用昂科威昂科威2016款昂科威价位昂科威售价昂科威按键功能图解昻科威昂科威2017款价格昂科威28t 昂克威报价及图片昂科威配置昂科威报价昂科威车怎么样科学发展观科学手抄报科学观走近科学科学演讲稿科学小制作科学素质科学制作科学计数法走进科学科学共同体计算机科学科学网科学英文科学论文科学回奶科学计数科学的英文

被坑水题——Codeforces Round #408 (Div. 2)

B. Find The Bone