CodeForces 599B Spongebob and Joke
来源:互联网 发布:java软件编程学习班 编辑:程序博客网 时间:2024/05/27 20:21
题意:给你n个f[i],m个b[i],然后问你能不能找到m个a[i],使得b[i]=f[a[i]]
思路:暴力存一下这个数在f[i]中出现了多少次,如果没出现就输出impossilbe,如果出现多次,就多解,如果出现一次就输出这个数。
#include<bits\stdc++.h>using namespace std;const int maxn = 100005;int a[maxn],f[maxn],b[maxn];vector<int>q[maxn];int main(){int n,m;scanf("%d%d",&n,&m);for (int i = 0;i<n;i++)scanf("%d",&f[i]);for (int i = 0;i<m;i++)scanf("%d",&b[i]);for (int i = 0;i<n;i++)q[f[i]].push_back(i);int flag = 0;for (int i = 0;i<m;i++){if(q[b[i]].size()==0)return puts("Impossible");if(q[b[i]].size()>1)flag=1;}if(flag==1)return puts("Ambiguity");puts("Possible");for (int i = 0;i<m;i++)printf("%d ",q[b[i]][0]+1);printf("\n");}
0 0
- Codeforces 599B Spongebob and Joke 【水题】
- codeforces 599B Spongebob and Joke
- Codeforces 599 B Spongebob and Joke
- CodeForces 599B Spongebob and Joke
- CodeForces 599B A - Spongebob and Joke
- 【CodeForces】[599B]Spongebob and Joke
- CodeForces 599B Spongebob and Joke
- CodeForces 599B Spongebob and Joke【思维】
- 【 CodeForces 599B 】 Spongebob and Joke
- 599B Spongebob and Joke
- 【CodeForces】599B - Spongebob and Joke(STL)
- 【CodeForces】599B - Spongebob and Joke(STL)
- Codeforces 599B: Spongebob and Joke(技巧,规律)
- 【Codeforces】-599B-Spongebob and Joke(思维)
- Codeforces 299 B Spongebob and Joke
- CF-599B - Spongebob and Joke
- codeforce 599 B Spongebob and Joke
- Codeforces #332 B. Spongebob and Joke (思路)
- C#反射机制来获取类 属性的描述
- C++ 引用和指针的区别
- java总结(基础知识-面试)
- 解决mariadb识别字母大小敏感问题
- 好好和h5沟通!几种常见的hybrid通信方式
- CodeForces 599B Spongebob and Joke
- HDU-4635-Strongly connected(强连通分量)
- 获取 request 中 json 数据
- This version of the rendering library is more recent than your version of ADT plug-in. Please update
- Spark性能优化指南——高级篇
- javaScript和H5开发神器之WebStrom
- Android开发之 混淆加固和反编译
- “百度搜索框提示”代码
- 【基础】Oracle 表空间和数据文件