【C++ 】PAT(advanced level)1063. Set Similarity (25)

最新推荐文章于 2024-05-04 16:42:38 发布

artemisrj

最新推荐文章于 2024-05-04 16:42:38 发布

阅读量692

点赞数

CC 4.0 BY-SA版权

分类专栏： C++/C 文章标签： PAT

本文链接：https://blog.youkuaiyun.com/artemisrj/article/details/21103085

C++/C 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一个算法问题，即计算两组整数集合之间的相似度。通过定义相似度为两个集合共有不同元素数量与总的不同元素数量之比，文章提供了一段C++代码实现，该实现读取输入文件中的多个集合，并针对每一对集合计算并输出它们的相似度。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

1063. Set Similarity (25)

时间限制

300 ms

内存限制

32000 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

Given two sets of integers, the similarity of the sets is defined to be N_c/N_t*100%, where N_c is the number of distinct common numbers shared by the two sets, and N_t 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 (<=10⁴) and followed by M integers in the range [0, 10⁹]. 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:

3
3 99 87 101
4 87 101 5 87
7 99 101 18 5 135 18 99
2
1 2
1 3

Sample Output:

50.0%
33.3%

1只过了两个测试点

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<map>
#include<iomanip>
using namespace std;


int main(){
	freopen("in.txt","r",stdin);
	int N,n;
	cin>>N;
	n=N;
	vector<vector<int>> line(N);
	while(n--){
		int cc;
		scanf("%d",&cc);
		while(cc--){
			int temp;
			scanf("%d",&temp);
			line[N-n-1].push_back(temp);
		}
	}
	cin>>N;

	while(N--){
		int same=0,sum=0;
		int a,b;
		scanf("%d%d",&a,&b);
		bool mm[10001]={false},sm[10001]={false},fir[10001]={false};
		int aa=line[a-1].size();
		int bb=line[b-1].size();
		while(aa--){
			int loc=line[a-1][aa];
			if(mm[loc]==false){
				sum++;
				mm[loc]=true;
			}
			fir[loc]=true;
		}
		while(bb--){
			int loc=line[b-1][bb];
			if(mm[loc]==false){
				sum++;
				mm[loc]=true;

			}else{
				if(sm[loc]==false&&fir[loc]){
					same++;
					sm[loc]=true;
				}
			}
		}
		cout<<fixed<<setprecision(1)<<(float)same/(float)sum*100<<"%"<<endl;
	}
	fclose(stdin);
	system("pause");
	return 0;
}