Codeforces 599B Spongebob and Joke 【水题】

原创 2015年11月23日 22:05:03

B. Spongebob and Joke
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.



题意:给定一个由n个元素组成的序列f,一个由m个元素组成的序列b(n>=m),问是否唯一存在一个序列a[]使得

对任意的i,都有b[i] = f[a[i]]。


用两个map就可以轻松KO了。



AC代码:


#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <cstdlib>
#include <queue>
#include <stack>
#include <map>
#include <vector>
#define INF 0x3f3f3f3f
#define MAXN 1000000+10
#define MAXM 1010
#define eps 1e-8
#define LL long long
using namespace std;
int f[MAXN], b[MAXN];
map<int, int> fp;
map<int, int> id;
int main()
{
    int n, m;
    scanf("%d%d", &n, &m);
    fp.clear(); id.clear();
    for(int i = 1; i <= n; i++)
        scanf("%d", &f[i]), fp[f[i]]++, id[f[i]] = i;
    int sum = 0, tsum = 0;
    for(int i = 1; i <= m; i++)
    {
        scanf("%d", &b[i]);
        if(fp[b[i]] == 1)
            sum++;
        else if(fp[b[i]] > 1)
            tsum++;
    }
    if(sum + tsum < m)
        printf("Impossible\n");
    else if(tsum > 0)
        printf("Ambiguity\n");
    else
    {
        printf("Possible\n");
        int used = 0;
        for(int i = 1; i <= m; i++)
        {
            if(fp[b[i]] == 1)
            {
                if(used > 0) printf(" ");
                printf("%d", id[b[i]]);
                used++;
            }
        }
        printf("\n");
    }
    return 0;
}



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

CodeForces 599B Spongebob and Joke

K - Spongebob and Joke Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I...
  • yao1373446012
  • yao1373446012
  • 2016年07月21日 17:45
  • 163

【CodeForces】[599B]Spongebob and Joke

记录数字出现次数及坐标 然后读取时判断能不能对应 最后判断输出方式
  • u011493189
  • u011493189
  • 2016年07月21日 16:07
  • 109

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
  • 389

【 CodeForces 599B 】 Spongebob and Joke

Spongebob and JokeTime Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u Sub...
  • MoYuDSheng
  • MoYuDSheng
  • 2016年07月21日 20:41
  • 258

CodeForces 599B Spongebob and Joke

题意:给你n个f[i],m个b[i],然后问你能不能找到m个a[i],使得b[i]=f[a[i]] 思路:暴力存一下这个数在f[i]中出现了多少次,如果没出现就输出impossilbe,如果出现多次...
  • qq_21057881
  • qq_21057881
  • 2016年05月13日 14:28
  • 199

【CodeForces】599B - Spongebob and Joke(STL)

点击打开题目 B. Spongebob and Joke time limit per test 2 seconds memory limit per test 25...
  • wyg1997
  • wyg1997
  • 2016年07月21日 20:41
  • 171

CodeForces 599B Spongebob and Joke【思维】

B. Spongebob and Joke time limit per test 2 seconds memory limit per test 256 megabytes ...
  • A_ice_
  • A_ice_
  • 2016年07月21日 19:17
  • 110

CodeForces 599B A - Spongebob and Joke

A - Spongebob and Joke Time Limit:2000MS     Memory Limit:262144KB     64bit IO Format:%I64d & %I...
  • qq_33406883
  • qq_33406883
  • 2016年05月14日 18:21
  • 246

599B Spongebob and Joke

//599B Spongebob and Joke //题意啊,懂了发现很简单,不懂那就是偏离题目的方向了 //在打乱的背包2中查找原来的背包1的东西 #include #define MAXN 10...
  • Joker_Zgh
  • Joker_Zgh
  • 2016年01月17日 16:54
  • 171

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
  • 139
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces 599B Spongebob and Joke 【水题】
举报原因:
原因补充:

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