codeforces 599B Spongebob and Joke
2015-11-23 12:46
288 查看
B. Spongebob and Joke
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 test(s)
Input
3 3 3 2 1 1 2 3
Output
Possible 3 2 1
Input
3 3 1 1 1 1 1 1
Output
Ambiguity
Input
3 3 1 2 1 3 3 3
Output
Impossible
Note
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.
#include<cstdio> #include<algorithm> using namespace std; const int maxn=1000005; int vis[maxn][2],a[maxn],ans[maxn]; int main() { int m,n; scanf("%d%d",&n,&m); for(int i=1;i<=n;i++) { scanf("%d",&a[i]); if(vis[a[i]][0]) { vis[a[i]][1]=1;//vis[a[i][1]用来标记这个数已经出现过 continue; } vis[a[i]][0]=i; } int key=1; for(int i=0;i<m;i++) { int t; scanf("%d",&t); if(vis[t][0]) { if(vis[t][1]) key=2; ans[i]=vis[t][0]; } else { key=0; break; } } if(!key) puts("Impossible"); else if(key==2) puts("Ambiguity"); else { puts("Possible"); for(int i=0;i<m;i++) printf("%d ",ans[i]); } return 0; }
相关文章推荐
- c++ error 2064: term does not evaluate to a function taking 1 arguments解决方法
- Swift基础语法--字符串
- 跟我一起写 Makefile(十)
- Android Studio生成和引用aar
- pch文件使用
- [转]iOS 应用内付费(IAP)开发步骤
- 7-IP地址概述与应用
- Android编程实现自定义进度条颜色的方法
- 跟我一起写 Makefile(九)
- 6-交换机的基本原理和配置
- GCD应用
- codeforces 579A Raising Bacteria
- 跟我一起写 Makefile(八)
- 解决被挂起的数据库问题
- 5-办公网络布线
- 用Redis bitmap统计活跃用户、留存
- hdu4006 The kth great number
- jquery 应用
- codeforces 579B Finding Team Member
- 4-网络传输介质