pata1063
来源：互联网 发布：linux top命令 编辑：程序博客网 时间：2024/05/16 08:53
1063. Set Similarity (25)
Given two sets of integers, the similarity of the sets is defined to be Nc/Nt*100%, where Nc is the number of distinct common numbers shared by the two sets, and Nt is the total number of distinct numbers in the two sets. Your job is to calculate the similarity of any given pair of sets.
Input Specification:
Each input file contains one test case. Each case first gives a positive integer N (<=50) which is the total number of sets. Then N lines follow, each gives a set with a positive M (<=104) and followed by M integers in the range [0, 109]. After the input of sets, a positive integer K (<=2000) is given, followed by K lines of queries. Each query gives a pair of set numbers (the sets are numbered from 1 to N). All the numbers in a line are separated by a space.
Output Specification:
For each query, print in one line the similarity of the sets, in the percentage form accurate up to 1 decimal place.
Sample Input:33 99 87 1014 87 101 5 877 99 101 18 5 135 18 9921 21 3Sample Output:
50.0%33.3%
在set里面进行使用find函数直接查找，不过要注意背住查找条件
#include<iostream>#include<vector>#include<set>#include<cstdio>using namespace std;typedef double ll;int main(){#ifdef ONLINE_JUDGE #else freopen("in.txt","r",stdin); freopen("out.txt","w",stdout); #endif set<int> s[51];int n;scanf("%d",&n);for(int i=1;i<=n;i++){int t=0;scanf("%d",&t);//set<int> ss;for(int j=0;j<t;j++){int temp=0;scanf("%d",&temp);s[i].insert(temp);}/*for(set<int>::iterator it=s[i].begin();it!=s[i].end();it++){cout<<*it<<' ';}cout<<endl;*//*for(int k=0;k<ss.size();k++){vs[i].push_back(*it);it++;}*/}int k=0;scanf("%d",&k);for(int i=0;i<k;i++){int m,p;scanf("%d%d",&m,&p);//cout<<twosize<<endl;int count=0;ll twosize=s[p].size();for(set<int>::iterator it=s[m].begin();it!=s[m].end();it++){if(s[p].find(*it)!=s[p].end()){count++;//cout<<count<<endl;}else{twosize++;}}//cout<<s[p].end()-1<<endl;//cout<<count<<endl<<s[m].size()<<endl<<s[p].size()<<endl;//cout<<twosize<<endl;/*set<int> sss;for(int j=0;j<vs[p].size();j++){sss.insert(vs[p][j]);}for(int t=0;t<vs[m].size();t++){sss.insert(vs[m][t]);}*/ll up=count;ll down=(twosize);if(down){printf("%.1lf%\n",up/down*100);}else{printf("%.1lf%\n",down);}}}
