PAT-2019年春季考试-甲级7-3 Telefraud Detection (25分)

7-3 Telefraud Detection (25分)

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 (≤10³​ , the number of different phone numbers), and M (≤10⁵​​ , 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:

5 15 31
1 4 2
1 5 2
1 5 4
1 7 5
1 8 3
1 9 1
1 6 5
1 15 2
1 15 5
3 2 2
3 5 15
3 13 1
3 12 1
3 14 1
3 10 2
3 11 5
5 2 1
5 3 10
5 1 1
5 7 2
5 6 1
5 13 4
5 15 1
11 10 5
12 14 1
6 1 1
6 9 2
6 10 5
6 11 2
6 12 1
6 13 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:

5 7 8
1 2 1
1 3 1
1 4 1
1 5 1
1 6 1
1 7 1
2 1 1
3 1 1

Sample Output 2:

None

这是我在考场上ac的代码:

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <unordered_map>
#include <set>
#define maxn 1010
using namespace std;
int k, n, m, g[maxn][maxn],father[maxn];
vector<int> sus;
set<int> gang[maxn];
bool isG[maxn];
//unordered_map<int, int> p2g;
int findFather(int x){
	return x == father[x] ? x : father[x] = findFather(father[x]);
}
void Union(int a,int b){
	int faA = findFather(a);
	int faB = findFather(b);
	if (faA < faB)
		father[faB] = father[faA];
	else if (faA>faB)
		father[faA] = father[faB];

}
int main(){
	//freopen("test.txt", "r", stdin);
	cin >> k >> n >> m;
	for (int i = 1; i <= n; i++)
		father[i] = i;
	while (m--)
	{
		int a, b, c;
		cin >> a >> b >> c;
		g[a][b] += c;
	}
	for (int i = 1; i <= n; i++)
	{
		int cnt1 = 0, cnt2 = 0;
		for (int j = 1; j <= n; ++j){
			if (g[i][j] <= 5 && g[i][j] && g[j][i] == 0){
				cnt1++; //打了电话没回
			}
			else if (g[i][j] <= 5 && g[i][j]){
				cnt1++;
				cnt2++; //打了电话回了
			}
		}
		if (cnt1 > k && cnt2*1.0 / (cnt1*1.0) <= 0.2){
			sus.push_back(i);
		}
	}
	if (sus.empty()){
		cout << "None";
		return 0;
	}
	//int index = 0;
	for (int i = 0; i < sus.size(); i++)
	{
		for (int j = i + 1; j < sus.size(); ++j){
			//Union(sus[i], sus[j]);
			int u = sus[i], v = sus[j];
			if (g[u][v] && g[v][u]){
				Union(u, v);
			}
		}
	}
	for (auto e : sus)
	{
		int f = findFather(e);
		gang[f].insert(e);
	}
	//sort(gang, gang + index, cmp);
	for (int i = 0; i < n + 1; i++)
	{
		for (auto j = gang[i].begin(); j != gang[i].end(); ++j){
			if (j != gang[i].begin()) cout << ' ';
			cout << *j;
		}
		if (!gang[i].empty()) cout << '\n';
		
	}
	return 0;
}

欢迎交流！