CF599B Spongebob and Joke

思路：

模拟，注意特判。

实现：

 #include <iostream>
 #include <cstdio>
 using namespace std;

 int pos[], x[], y[], b[], n, m, tmp;
 int main()
 {
     cin >> n >> m;
     for (int i = ; i <= n; i++)
     {
         scanf("%d", &tmp);
         x[tmp]++;
         pos[tmp] = i;
     }
     for (int i = ; i <= m; i++)
     {
         scanf("%d", &b[i]);
         y[b[i]]++;
     }
     bool f1 = true, f2 = true;
     for (int i = ; i <= n; i++)
     {
         if (y[i] && !x[i])
         {
             f1 = false;
             break;
         }
         if (x[i] >  && y[i])
         {
             f2 = false;
         }
     }
     if (!f1)
         cout << "Impossible" << endl;
     else if (!f2)
         cout << "Ambiguity" << endl;
     else
     {
         cout << "Possible" << endl;
         for (int i = ; i <= m; i++)
         {
             printf("%d ", pos[b[i]]);
         }
         puts("");
     }
     return ;
 }