zoukankan      html  css  js  c++  java
  • CF div2 332 B

    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.

    另开一个数组做一个映射,然后判断该数组里面b[i]是否有值。值大于1则是多解情况,等于0则是无解。

     1 #include <cstdio>
     2 #include <cstring>
     3 #include <iostream>
     4 #include <stack>
     5 #include <queue>
     6 #include <map>
     7 #include <algorithm>
     8 #include <vector>
     9 #include <set>
    10 
    11 using namespace std;
    12 
    13 const int maxn = 1000005;
    14 
    15 typedef long long LL;
    16 
    17 vector<int>G[maxn];
    18 
    19 int f[maxn],a[maxn];
    20 int b[maxn],bb[maxn];
    21 int cnt[maxn];
    22 int ans[maxn];
    23 
    24 
    25 int main()
    26 {
    27     int n,m;
    28     scanf("%d%d",&n,&m);
    29     bool ambiguity=false;
    30     int i;
    31     for(i=0;i<n;i++){
    32         scanf("%d",&f[i]);
    33         a[f[i]]=i+1;
    34         cnt[f[i]]++;
    35     }
    36     for(i=0;i<m;i++){
    37         scanf("%d",&b[i]);
    38         if(cnt[b[i]]==0){
    39             printf("Impossible");
    40             return 0;
    41         }
    42         else if(cnt[b[i]]>1){
    43             ambiguity=true;
    44         }
    45         else if(cnt[b[i]]==1){
    46             ans[i]=a[b[i]];
    47         }
    48     }
    49     if(ambiguity==true){
    50         printf("Ambiguity");
    51         return 0;
    52     }
    53     printf("Possible
    ");
    54     for(i=0;i<m;i++){
    55         printf("%d ",ans[i]);
    56     }
    57     return 0;
    58 }
    View Code
  • 相关阅读:
    Mysql update case
    phpexcel导出excel等比例缩放图片
    phpexcel错误 You tried to set a sheet active by the out of bounds index: 1解决办法
    phpexcel操作
    Java io基础
    java线程基础
    java 集合基础(适用单线程)
    java 泛型深入
    Java反射基础
    Java泛型基础
  • 原文地址:https://www.cnblogs.com/lmlyzxiao/p/4985097.html
Copyright © 2011-2022 走看看