pat-a1063. Set Similarity (25)

又卡时。。，用set超时(这里是指后面检查多少个重复用了set)。。set用的是平衡二叉树搜索应该很快。。应该是插入太多了。。

输入时进行去重然后排序。。两个有序的数组判断多少个 重复数字和一共多少个数字就很容易了

#include<cstdio>
#include<algorithm>
#include<set>
using namespace std;
int num[51][10010];
int cn[51];
int main(){
	int n,a,b,t;
	scanf("%d",&n);
	for(int i=1;i<=n;++i){
		set<int> s1;
		scanf("%d",&a);
		int temp=0;
		while(a--){
			scanf("%d",&num[i][temp]);
			if(s1.count(num[i][temp])==0){
				s1.insert(num[i][temp]);
				temp++;
			}
		}
		cn[i]=temp;
		sort(num[i],num[i]+temp);
	}
	scanf("%d",&n);
	while(n--){
		int ans=0,k=0;
		scanf("%d%d",&a,&b);
		int pos1=0,pos2=0;
		while(pos1<cn[a]&&pos2<cn[b]){
			while(pos1<cn[a]&&pos2<cn[b]&&num[a][pos1]==num[b][pos2]){
				pos1++;
				pos2++;
				ans++;
				k++;
			}
			if(pos1<cn[a]&&pos2<cn[b]&&num[a][pos1]<num[b][pos2]){
				while(pos1<cn[a]&&num[a][pos1]<num[b][pos2]){
					k++;
					pos1++;
				}
			}
			else if(pos1<cn[a]&&pos2<cn[b]){
				while(pos2<cn[b]&&num[a][pos1]>num[b][pos2]){
					k++;
					pos2++;
				}
			}
		}
		k+=cn[a]+cn[b]-pos1-pos2;
		printf("%.1f%%\n",100*ans*1.0/k);
	}
	return 0;
} 

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%