Codeforces Round #332 (Div. 2) B. Spongebob and Joke

原创 2015年11月21日 14:12:52
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.


题意:有数列f[n], b[m], a[m],f[ a[i] ] = b[i](1<= i <=m),已知n,m, f[n], b[m]。求a[m],有多重可能输出Ambiguity, 不能求出输出Impossible,只有一种可能输出Possible和数列a[m]

三个输出就有三种情况。
情况一:Impossible
b[m]数列有的数,f[n]没有
情况二:Ambiguity
b[m]数列有的数,f[n]全都有且其中有一个至少有两个
情况三:Possible
b[m]数列有的数,f[n]都有且f[n]中只有一个

当时做时以为,b[m]中的数x出现的次数大于f[n]中出现的次数就是Impossible,没有仔细考虑。
#include
#include
#include
#include
using namespace std;

const int N = 100001;

int f[N];
int b[N];
int a[N];

struct node
{
    int i;  
    int n;  
}flag[N];   //flag[i].n 表示i出现的个数,flag[i].i表示i最后出现的位置


int main(void)
{
    int n, m;
    while(~scanf("%d%d", &n, &m))
    {
        int i;
        int ans = 0;
        memset(flag, 0, sizeof(flag));
        for(i = 1; i <= n; i++)
        {
            scanf("%d", &f[i]);
            flag[ f[i] ].i = i;
            flag[ f[i] ].n++;
        }

        for(i = 1; i <= m; i++)
        {
            scanf("%d", &b[i]);
            if( flag[ b[i] ].n == 0)
            {
                ans = 1;
            }
        }
        if(ans)          printf("Impossible\n");
        else
        {
            for(i = 1; i <= m; i++)
            {
                a[i] = flag[ b[i] ].i;
                if(flag[ b[i] ].n > 1) ans = 1;
            }
            if(ans) printf("Ambiguity\n");
            else
            {

                printf("Possible\n");
                for(i = 1; i <= m; i++) printf("%d ", a[i]);
                printf("\n");
            }
        }
    }
    return 0;
}

版权声明:本文为博主原创文章,未经博主允许不得转载。

Codeforces Round #332 (Div. 2)_B. Spongebob and Joke

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...

Codeforces Round #332 (Div. 2) B. Spongebob and Joke

Codeforces Round #332 (Div. 2) C. Spongebob and Joke Vector

【Codeforces Round 332 (Div 2)B】【扭转题意 位置映射】Spongebob and Joke 给b[]中的每个数找f[]中的位置

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...

【Codeforces Round 332 (Div 2)D】【数学 公式推导】Spongebob and Squares 正方形数量恰好为x个的所有大矩形

D. Spongebob and Squares time limit per test 2 seconds memory limit per test 256 megabyt...

Codeforces Round #332 (Div. 2) D. Spongebob and Squares详解

Codeforces Round #332 (Div. 2) D. Spongebob and Squares

Codeforces Round #332 (Div. 2) D. Spongebob and Squares

Spongebob is already tired trying to reason his weird actions and calculations, so he simply asked y...

Codeforces #332 B. Spongebob and Joke (思路)

题意: 给定长度为n的序列f,长度为m的序列b,且fai=b[i],求长度为m的序列给定长度为n的序列f, 长度为m的序列b, 且f_{a_i}=b[i], 求长度为m的序列 多解输出Amb...
  • lwt36
  • lwt36
  • 2015年11月21日 03:15
  • 313

Codeforces 599B: Spongebob and Joke(技巧,规律)

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...
  • zugofn
  • zugofn
  • 2016年07月22日 00:28
  • 127

codeforces 599B Spongebob and Joke

B. Spongebob and Joketime limit per test:2 secondsmemory limit per test:256 megabytesinput:standard ...
  • FTQOOO
  • FTQOOO
  • 2015年11月26日 21:31
  • 372

Codeforces 599 B Spongebob and Joke

传送门: http://codeforces.com/problemset/problem/599/B 题意: 给出序列f[i]和f[a[i]],要求还原序列a[i]不就是记录一下ans[f[i...
  • yp_2013
  • yp_2013
  • 2016年01月17日 11:19
  • 340
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces Round #332 (Div. 2) B. Spongebob and Joke
举报原因:
原因补充:

(最多只允许输入30个字)