zoukankan      html  css  js  c++  java
  • Codeforces Round #332 (Div. 2) B. Spongebob and Joke 模拟

    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.

     题意:

          给你b数组,f数组  ,构造出a数组满足:   bi = fai.  有多组情况输出Ambiguity,一组情况输出它,没有输出impossblie

    题解:

          我们标记f数组,计数找唯一就是了

    //1085422276
    #include<bits/stdc++.h>
    using namespace std;
    
    typedef long long ll;
    #define mem(a) memset(a,0,sizeof(a))
    #define pb push_back
    
    inline ll read()
    {
        ll x=0,f=1;char ch=getchar();
        while(ch<'0'||ch>'9'){
            if(ch=='-')f=-1;ch=getchar();
        }
        while(ch>='0'&&ch<='9'){
            x=x*10+ch-'0';ch=getchar();
        }return x*f;
    }
    //****************************************
    const int N=100000+50;
    #define maxn 100000+5
    
    int H[N],ans[N],c[N],b[N],f[N];
    int main() {
    
        int n=read(),m=read();
        for(int i=1;i<=n;i++) {
            scanf("%d",&f[i]);
            H[f[i]]++;
            c[f[i]]=i;
        }
        for(int i=1;i<=m;i++) {
            scanf("%d",&b[i]);
        }int f=0,siz=0,cool=0;
        for(int i=1;i<=m;i++) {
            if(H[b[i]]>1) f=1;
            if(H[b[i]]==1&&!f) {ans[++siz]=c[b[i]];}
            if(H[b[i]]==0) cool=1;
        }
        if(cool) {
            cout<<"Impossible"<<endl;
        }
        else if(f) {
            cout<<"Ambiguity"<<endl;
        }
        else {
                cout<<"Possible"<<endl;
            for(int i=1;i<=siz;i+=1) {
                cout<<ans[i]<<" ";
            }
        }
        return 0;
    }
    代码
  • 相关阅读:
    14.7.1 重新调整InnoDB系统表空间的大小
    css代码引入方式与基本选择器
    html常用标签
    python数据库操作
    pt-osc使用一则
    mysql优化一则(20170703)
    进程与生产者消费者模型
    面向对象程序设计
    常用模块
    模块与包
  • 原文地址:https://www.cnblogs.com/zxhl/p/4984246.html
Copyright © 2011-2022 走看看