K - Spongebob and Joke
来源:互联网 发布:php 数组移除指定元素 编辑:程序博客网 时间:2024/06/05 06:10
K - Spongebob and Joke
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
Submit
Status
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
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
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.
#include<iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;struct node{ int s; int a; int ord;}b[1000010],f[1000010];bool cmp(node a,node b){ return a.s<b.s;}bool cmpord(node a,node b){ return a.ord<b.ord; } int main(){ int n,m,i,j,cnt,ans,flag; while(cin>>n>>m) { for(i=1;i<=n;++i) { cin>>f[i].s; f[i].ord=i; } for(i=1;i<=m;++i) { cin>>b[i].s; b[i].ord=i; } sort(f+1,f+n+1,cmp); sort(b+1,b+n+1,cmp); flag=0; for(i=1;i<=m;++i) { ans=0; for(j=1;j<=n;++j) { if(b[i].s==f[j].s ) { ++ans; b[i].a=f[j].ord; if(ans>1) { flag=1; break; } } } if(ans==0) { break; } } if(ans==0) { cout<<"Impossible"<<endl; } else{ if(flag==1) { cout<<"Ambiguity"<<endl; } else { cout<<"Possible"<<endl; sort(b+1,b+n+1,cmpord); for(i=1;i<=n;++i) { cout<<b[i].a<<' '; } cout<<endl; } } } return 0;}
- K - Spongebob and Joke
- 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
- spark在linux下开发使用程序包下载 tgz
- Sample rate 理解
- hdoj-2060-Snooker
- RHEL6上使用start_udev命令导致网卡down掉
- 你必须了解的Session的本质
- K - Spongebob and Joke
- linux 新建一个管理员用户admin,需要使用的参数()
- Java操作Mongodb(转载)
- angular的http三种请求方式
- Codeforces Round #304 (Div. 2) D 线性筛
- 牛逼哄哄的SLAM技术 即将颠覆哪些领域?
- The Text Splitting
- L - Kefa and Company
- 多态性-运算符重载