PAT2019春7-3 Telefraud Detection （25 分）

最新推荐文章于 2022-08-31 22:58:39 发布

Brielleqqqqqqjie

最新推荐文章于 2022-08-31 22:58:39 发布

阅读量1.1k

点赞数

分类专栏： PAT甲级

本文链接：https://blog.csdn.net/qq_41562704/article/details/88084425

版权

PAT甲级专栏收录该内容

159 篇文章

订阅专栏

Telefraud（电信诈骗） remains a common and persistent problem in our society. In some cases, unsuspecting victims lose their entire life savings. To stop this crime, you are supposed to write a program to detect those suspects from a huge amount of phone call records.

A person must be detected as a suspect if he/she makes more than K short phone calls to different people everyday, but no more than 20% of these people would call back. And more, if two suspects are calling each other, we say they might belong to the same gang. A makes a short phone call to B means that the total duration of the calls from A to B is no more than 5 minutes.

Input Specification:

Each input file contains one test case. For each case, the first line gives 3 positive integers K (≤500, the threshold（阈值） of the amount of short phone calls), N (≤103, the number of different phone numbers), and M (≤105, the number of phone call records). Then M lines of one day's records are given, each in the format:

caller receiver duration

where caller and receiver are numbered from 1 to N, and duration is no more than 1440 minutes in a day.

Output Specification:

Print in each line all the detected suspects in a gang, in ascending order of their numbers. The gangs are printed in ascending order of their first members. The numbers in a line must be separated by exactly 1 space, and there must be no extra space at the beginning or the end of the line.

If no one is detected, output None instead.

Sample Input 1:

Sample Output 1:

3 5
6

Note: In sample 1, although 1 had 9 records, but there were 7 distinct receivers, among which 5 and 15 both had conversations lasted more than 5 minutes in total. Hence 1 had made 5 short phone calls and didn't exceed the threshold 5, and therefore is not a suspect.

Sample Input 2:

Sample Output 2:

None

本题在考场上有一个四分的测试点没过，出考场别人告诉我是total duration，这辈子都记住total了，就像这辈子都对狼人杀有阴影了o(╥﹏╥)o，马大哈的毛病必须改改了，题目都不好好看，回来后来我改成总时长，不能提交不知道是不是对的（不过应该也没大问题了）看个思路就好。

解题思路：先读题！好好读，看到gang那个单词的时候，我条件反射想到并查集，后来证实了证实，其次由题目发现本题对caller和receiver有区别，即为有向图，而不是无向图。

首先为了先得到suspects的值，我将每个人与他人的电话总时间小于等于5的都存储下来，在去找人数小于等于k的，并且回拨人数不超过他拨出去的20%，最后再用并查集将suspects进行分类。

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int e[1005][1005], k, n, m, father[1005];
const int inf = 0x7fffffff;
int findfather(int x){
	int a = x;
	while(x != father[x])
		x = father[x];
	while(a != x){
		int z = father[a];
		father[a] = x;
		a = z;
	}
	return x;
}
void Union(int a, int b){
	int faa = findfather(a), fab = findfather(b);
	if(faa != fab){
	  father[fab] = min(faa, fab);
	  father[faa] = min(faa, fab);
	}
}
int main(){
	scanf("%d %d %d", &k, &n, &m);
	vector<int>num[n + 1], suspect;
	fill(e[0], e[0] + 1005 * 1005, inf);
	for(int i = 0; i < m; ++ i){
		int a, b, temp;
		scanf("%d %d %d", &a, &b, &temp);
		if(e[a][b] == inf)
			e[a][b] = 0;
		e[a][b] += temp;
	}
	for(int i = 1; i <= n; ++ i)
		for(int j = 1; j <= n; ++ j)
			if(e[i][j] <= 5)
				num[i].push_back(j); 
	for(int i = 1; i <= n; ++ i){
		int len = num[i].size(), cnt = 0;
		if(len <= k)
			continue;
		for(int j = 0; j < num[i].size(); ++ j)
			if(e[num[i][j]][i] < inf)
				++ cnt;
		if(cnt <= (int) (0.2 * len))
			suspect.push_back(i);
	}
	if(suspect.size() == 0)
		printf("None\n");
	else{
		for(int i = 1; i <= n; ++ i)
			father[i] = i;
		for(int i = 0; i < suspect.size(); ++ i)
			for(int j = i + 1; j < suspect.size(); ++ j)
				if(e[suspect[i]][suspect[j]] < inf && e[suspect[j]][suspect[i]] < inf)
					Union(suspect[i], suspect[j]);
		vector<int>ans[n + 1];
		for(int i = 0; i < suspect.size(); ++ i)
			ans[findfather(suspect[i])].push_back(suspect[i]);
		for(int i = 1; i <= n; ++ i){
			if(ans[i].size() != 0){
				sort(ans[i].begin(), ans[i].end());
				for(int j = 0; j < ans[i].size(); ++ j){
					if(j != 0)
						printf(" ");
					printf("%d",ans[i][j]);
				}
				printf("\n");
			}
		}
	}
}