Zhejaing university----Head of a Gang
2016-03-29 16:53
591 查看
//Zhejiang university----Head of a Gang
/*
时间限制 1s 内存限制 128M
题目描述:
One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be the total time length of all the phone calls made between
the two persons. A "Gang" is a cluster of more than 2 persons who are related to each other with total relation weight being greater than a given threthold K. In each gang, the one with maximum total weight is the head. Now given a list of phone calls, you
are supposed to find the gangs and the heads.
输入:
For each case, the first line contains two positive numbers N and K (both less than or equal to 1000), the number of phone calls and the weight threthold, respectively. Then N lines follow, each in the following format:
Name1 Name2 Time
where Name1 and Name2 are the names of people at the two ends of the call, and Time is the length of the call. A name is a string of three capital letters chosen from A-Z. A time length is a positive integer which is no more than 1000 minutes.
输出:
For each test case, first print in a line the total number of gangs. Then for each gang, print in a line the name of the head and the total number of the members. It is guaranteed that the head is unique for each gang. The output must be sorted according
to the alphabetical order of the names of the heads.
样例输入:
8 59
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10
8 70
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10
样例输出:
2
AAA 3
GGG 3
0
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct node{
char name[4];//人名
int time;//通话时间
int father;//父节点
int rank;//秩
}Node;
typedef struct head{
char name[4];//头领姓名
int num;//人数
}Head;
Node people[1010];
Head gang[1010];//头领
int num;//总人数
int FindSet(int x){//查询结点属于哪个集合
if(people[x].father != x){
people[x].father = FindSet(people[x].father);
}
return people[x].father;
}
void Union(int x,int y){//合并两结点
x = FindSet(x);
y = FindSet(y);
if(x==y)
return;
if(people[x].rank > people[y].rank){
people[y].father = x;
people[x].rank += people[y].rank;
}else{
if(people[x].rank == people[y].rank){
++people[y].rank;
}
people[x].father = y;
}
}
int compare1(const void *p, const void *q){
Node *p1 = (Node*)p;
Node *q1 = (Node*)q;
return p1->father - q1->father; //升序
}
int compare2(const void *p, const void *q){
Head *p1 = (Head *)p;
Head *q1 = (Head *)q;
return strcmp(p1->name,q1->name);
}
int main(){
int N;
int K;
char name1[4],name2[4];
int time;
int i,j,k;
int pre;
int sum;//总的通话时间
while(scanf("%d%d",&N,&K) != EOF){
num = 0;
while(N-- != 0){
scanf("%s%s%d",name1,name2,&time);
//查询输入姓名是否已经在表中,如果不在,添加进表;否则,更新结点信息
for(i=0;i<num;++i){
if(strcmp(people[i].name,name1) == 0){
break;
}
}
if(i==num){
strcpy(people[i].name,name1);
people[i].time = time;
people[i].father = i;
people[i].rank = 0;
++num;
}else{
people[i].time += time;
}
for(j=0;j<num;++j){
if(strcmp(people[j].name,name2)==0){
break;
}
}
if(j==num){
strcpy(people[j].name,name2);
people[j].time = time;
people[j].father = j;
people[j].rank = 0;
++num;
}else{
people[j].time += time;
}
Union(i,j);//合并结点
}
//最后一次更新各个集合
for(i=0;i<num;++i){
FindSet(i);
}
//按父节点大小排序
qsort(people,num,sizeof(Node),compare1);
i=j=k=0;
//找到各个集合的头领及人数
while(i<num){
strcpy(gang[k].name,people[i].name);
pre = i;
++j;
sum = people[i].time;
while((j<num) && (people[j].father == people[i].father)){
if(people[j].time > people[pre].time){
strcpy(gang[k].name,people[j].name);
pre = j;
}
sum += people[j].time;
++j;
}
if(j - i > 2 && (sum >> 1) > K){
//每个时间在每个人处都加了一遍
//即各个时间被加了两遍
//所以sum >> 1
gang[k].num = j - i;
++k;
}
i = j;
}
printf("%d\n",k);
qsort(gang,k,sizeof(Head),compare2);
for(i=0;i<k;++i){
printf("%s %d\n",gang[i].name,gang[i].num);
}
}
return 0;
}
/*
时间限制 1s 内存限制 128M
题目描述:
One way that the police finds the head of a gang is to check people's phone calls. If there is a phone call between A and B, we say that A and B is related. The weight of a relation is defined to be the total time length of all the phone calls made between
the two persons. A "Gang" is a cluster of more than 2 persons who are related to each other with total relation weight being greater than a given threthold K. In each gang, the one with maximum total weight is the head. Now given a list of phone calls, you
are supposed to find the gangs and the heads.
输入:
For each case, the first line contains two positive numbers N and K (both less than or equal to 1000), the number of phone calls and the weight threthold, respectively. Then N lines follow, each in the following format:
Name1 Name2 Time
where Name1 and Name2 are the names of people at the two ends of the call, and Time is the length of the call. A name is a string of three capital letters chosen from A-Z. A time length is a positive integer which is no more than 1000 minutes.
输出:
For each test case, first print in a line the total number of gangs. Then for each gang, print in a line the name of the head and the total number of the members. It is guaranteed that the head is unique for each gang. The output must be sorted according
to the alphabetical order of the names of the heads.
样例输入:
8 59
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10
8 70
AAA BBB 10
BBB AAA 20
AAA CCC 40
DDD EEE 5
EEE DDD 70
FFF GGG 30
GGG HHH 20
HHH FFF 10
样例输出:
2
AAA 3
GGG 3
0
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
typedef struct node{
char name[4];//人名
int time;//通话时间
int father;//父节点
int rank;//秩
}Node;
typedef struct head{
char name[4];//头领姓名
int num;//人数
}Head;
Node people[1010];
Head gang[1010];//头领
int num;//总人数
int FindSet(int x){//查询结点属于哪个集合
if(people[x].father != x){
people[x].father = FindSet(people[x].father);
}
return people[x].father;
}
void Union(int x,int y){//合并两结点
x = FindSet(x);
y = FindSet(y);
if(x==y)
return;
if(people[x].rank > people[y].rank){
people[y].father = x;
people[x].rank += people[y].rank;
}else{
if(people[x].rank == people[y].rank){
++people[y].rank;
}
people[x].father = y;
}
}
int compare1(const void *p, const void *q){
Node *p1 = (Node*)p;
Node *q1 = (Node*)q;
return p1->father - q1->father; //升序
}
int compare2(const void *p, const void *q){
Head *p1 = (Head *)p;
Head *q1 = (Head *)q;
return strcmp(p1->name,q1->name);
}
int main(){
int N;
int K;
char name1[4],name2[4];
int time;
int i,j,k;
int pre;
int sum;//总的通话时间
while(scanf("%d%d",&N,&K) != EOF){
num = 0;
while(N-- != 0){
scanf("%s%s%d",name1,name2,&time);
//查询输入姓名是否已经在表中,如果不在,添加进表;否则,更新结点信息
for(i=0;i<num;++i){
if(strcmp(people[i].name,name1) == 0){
break;
}
}
if(i==num){
strcpy(people[i].name,name1);
people[i].time = time;
people[i].father = i;
people[i].rank = 0;
++num;
}else{
people[i].time += time;
}
for(j=0;j<num;++j){
if(strcmp(people[j].name,name2)==0){
break;
}
}
if(j==num){
strcpy(people[j].name,name2);
people[j].time = time;
people[j].father = j;
people[j].rank = 0;
++num;
}else{
people[j].time += time;
}
Union(i,j);//合并结点
}
//最后一次更新各个集合
for(i=0;i<num;++i){
FindSet(i);
}
//按父节点大小排序
qsort(people,num,sizeof(Node),compare1);
i=j=k=0;
//找到各个集合的头领及人数
while(i<num){
strcpy(gang[k].name,people[i].name);
pre = i;
++j;
sum = people[i].time;
while((j<num) && (people[j].father == people[i].father)){
if(people[j].time > people[pre].time){
strcpy(gang[k].name,people[j].name);
pre = j;
}
sum += people[j].time;
++j;
}
if(j - i > 2 && (sum >> 1) > K){
//每个时间在每个人处都加了一遍
//即各个时间被加了两遍
//所以sum >> 1
gang[k].num = j - i;
++k;
}
i = j;
}
printf("%d\n",k);
qsort(gang,k,sizeof(Head),compare2);
for(i=0;i<k;++i){
printf("%s %d\n",gang[i].name,gang[i].num);
}
}
return 0;
}
相关文章推荐
- Linux makefile 教程 非常详细,且易懂 http://blog.csdn.net/liang13664759/article/details/1771246
- [AIR] 在 Adobe AIR 中为不同屏幕尺寸的多种设备提供支持
- 两种AIDL用法分析(原)
- Submission Details
- Installation error: INSTALL_FAILED_CONFLICTING_PROVIDER 解决方案
- 人工智能3:通过搜索进行问题求解
- Educational Codeforces Round 10 C. Foe Pairs
- 精华阅读第 10 期 |解开阿尔法狗(AlphaGo)人工智能的画皮
- 精华阅读第 10 期 |解开阿尔法狗(AlphaGo)人工智能的画皮
- HDU 2476 String painter(区间DP)
- kd树 hdu2966 In case of failure
- mongodb Failed: error connecting to db server: no reachable servers
- 70. Climbing Stairs
- kmalloc fail导致系统异常
- Error: Cannot retrieve metalink for repository: epel. Please verify its path and try again
- Error: Cannot retrieve metalink for repository: epel. Please verify its path and try again
- SLF4J: Class path contains multiple SLF4J bindings.
- CodeForces 635D Factory Repairs(树状数组)
- lightoj 1071 - Baker Vai DP
- Codeforces 652C Foe Pairs 【dp】