Codeforces Round #332 (Div. 2) B. Spongebob and Joke
来源:互联网 发布:叶玉如 知乎 编辑:程序博客网 时间:2024/05/22 11:37
While Patrick was gone shopping, Spongebob decided to play a little trick on his friend. The naughty Sponge browsed through Patrick's personal stuff and found a sequence a1, a2, ..., am of length m, consisting of integers from 1 to n, not necessarily distinct. Then he picked some sequencef1, f2, ..., fn of length n and for each number ai got number bi = fai. To finish the prank he erased the initial sequence ai.
It's hard to express how sad Patrick was when he returned home from shopping! We will just say that Spongebob immediately got really sorry about what he has done and he is now trying to restore the original sequence. Help him do this or determine that this is impossible.
The first line of the input contains two integers n and m (1 ≤ n, m ≤ 100 000) — the lengths of sequences fi and bi respectively.
The second line contains n integers, determining sequence f1, f2, ..., fn (1 ≤ fi ≤ n).
The last line contains m integers, determining sequence b1, b2, ..., bm (1 ≤ bi ≤ n).
Print "Possible" if there is exactly one sequence ai, such that bi = fai for all i from 1 to m. Then print m integers a1, a2, ..., am.
If there are multiple suitable sequences ai, print "Ambiguity".
If Spongebob has made a mistake in his calculations and no suitable sequence ai exists, print "Impossible".
3 33 2 11 2 3
Possible3 2 1
3 31 1 11 1 1
Ambiguity
3 31 2 13 3 3
Impossible
In the first sample 3 is replaced by 1 and vice versa, while 2 never changes. The answer exists and is unique.
In the second sample all numbers are replaced by 1, so it is impossible to unambiguously restore the original sequence.
In the third sample fi ≠ 3 for all i, so no sequence ai transforms into such bi and we can say for sure that Spongebob has made a mistake.
解题报告:Editorial Codeforces Round #332 (Div. 2)
3种情况
1 如果存在b[i] (0<i<m) a数组没有 Impossible
2 除掉Impossible的情况,如果存在b[i] (0<i<m)a数组有多个 Ambiguity
3 除掉Impossible、Ambiguity的情况,其它情况 Possible
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke
- Codeforces Round #332 (Div. 2)_B. Spongebob and Joke
- Codeforces Round #332 (Div. 2)B. Spongebob and Joke(模拟)
- Codeforces Round #332 (Div. 2) 599B Spongebob and Joke(STL)
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke(水题,构造)
- Codeforces Round #332 (Div. 2) B. Spongebob an Joke (水)
- 【Codeforces Round 332 (Div 2)B】【扭转题意 位置映射】Spongebob and Joke 给b[]中的每个数找f[]中的位置
- Codeforces #332 B. Spongebob and Joke (思路)
- Codeforces 599B Spongebob and Joke 【水题】
- Codeforces 299 B Spongebob and Joke
- codeforces 599B Spongebob and Joke
- Codeforces 599 B Spongebob and Joke
- CodeForces 599B Spongebob and Joke
- CodeForces 599B A - Spongebob and Joke
- 使用大图+脚本,生成各种size的app icon和图片素材
- coderforce 595B. Pasha and Phone(容斥原理)
- Ry’s Objective-C Tutorial---Classes
- javax.naming.NamingException: No naming context bound to this class loader
- Ry’s Objective-C Tutorial---Properties
- Codeforces Round #332 (Div. 2) B. Spongebob and Joke
- Codeforces Round #332 (Div. 2) C. Day at the Beach详解
- LintCode-剑指Offer-(140)快速幂
- 使用Xamarin.Forms构建UWP应用
- Ry’s Objective-C Tutorial---Methods
- Ry’s Objective-C Tutorial---Protocols
- Gnome Tetravex
- rman备份还原oracle db
- java第三天