Spongebob and Joke
来源:互联网 发布:淘宝店铺投诉怎么投诉 编辑:程序博客网 时间:2024/05/22 08:07
Description
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 sequence f1, 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.
Input
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).
Output
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".
Sample Input
3 33 2 11 2 3
Possible3 2 1
3 31 1 11 1 1
Ambiguity
3 31 2 13 3 3
Impossible
Hint
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.
3 4
1 2 3
1 2 3 3
输出的是
1 2 3 3
#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#define Max 100001int b[Max]; int ji[Max];struct node{int shu,n;}s[Max];int main(){int n,m;scanf("%d%d",&n,&m);for(int i=1;i<=n;i++){scanf("%d",&s[i].shu);s[s[i].shu ].n =i;ji[s[i].shu ]++;}int sum=0,sun=0;for(int i=1;i<=m;i++){scanf("%d",&b[i]);if(ji[b[i]] ==1)sum++;if(ji[b[i]]>1)sun++;}if(sun+sum<m)printf("Impossible\n");else if(sun>0) printf("Ambiguity\n"); else { printf("Possible\n"); for(int i=1;i<=m;i++) { printf("%d ",s[b[i]].n ); } }return 0;}
- Spongebob and Joke
- K - Spongebob and Joke
- Spongebob and Joke
- 【codeforce】Spongebob and Joke
- 599B 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
- CF-599B - Spongebob and Joke
- 【CodeForces】[599B]Spongebob and Joke
- Spongebob and Joke(记录数据地址)
- CodeForces 599B Spongebob and Joke
- CodeForces 599B Spongebob and Joke【思维】
- 【 CodeForces 599B 】 Spongebob and Joke
- codeforce 599 B Spongebob and Joke
- 资源一:计算机视觉,机器学习方面的论文和算法代码
- 字符串验证Java工具类(未测试)
- 函数参数压栈从右到左
- 卷积神经网络(CNN)的参数优化方法
- 7 月21日_linux兴趣小组讲座:静态链接库&&系统编程基础(1)
- Spongebob and Joke
- 为RecyclerView添加item的点击事件(转载)
- java 下载网络中在文件 (未测试)
- 0721
- linux命令技巧--找出jar包中class的全路径名
- [LeetCode] 50. Pow(x, n)
- 像翻书一样,翻过每一张超级表格
- JVM垃圾回收机制
- mtu设置--解决部分网站打不开的问题