【第22期】观点:IT 行业加班,到底有没有价值?

1025 PAT Ranking

原创 2015年11月19日 14:35:04

Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.

Input Specification:

Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.

Output Specification:

For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:

registration_number final_rank location_number local_rank

The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.

Sample Input:
2
5
1234567890001 95
1234567890005 100
1234567890003 95
1234567890002 77
1234567890004 85
4
1234567890013 65
1234567890011 25
1234567890014 100
1234567890012 85
Sample Output:
9
1234567890005 1 1 1
1234567890014 1 2 1
1234567890001 3 1 2
1234567890003 3 1 2
1234567890004 5 1 4
1234567890012 5 2 2
1234567890002 7 1 5
1234567890013 8 2 3

1234567890011 9 2 4

#include<iostream>
#include<vector>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<vector>
using namespace std;
struct student{
	char ID[15];
	int grade;
	int location;
	int location_rank;
};
bool cmp(const student&stu1,const student&stu2){
	if(stu1.grade == stu2.grade){
		if(strcmp(stu1.ID,stu2.ID) > 0){
			return true;
		}else{
			return false;
		}
	}else{
		return stu1.grade < stu2.grade;
	}
}
int main(){
	for(int n;scanf("%d",&n)!=EOF;){
		vector<student>vec_all;
		for(int i = 1;i <= n;i++){
			int k;
			scanf("%d",&k);
			vector<student>vec_local;
			while(k--){
				student temp;
				scanf("%s%d",temp.ID,&temp.grade);
				vec_local.push_back(temp);
			}
			sort(vec_local.begin(),vec_local.end(),cmp);
			//grade_flag 用于记录上一个学生的成绩,flag用于记录上一个学生的排名,成绩相同的学生排名一样。
			int grade_flag = vec_local[vec_local.size()-1].grade;
			int flag = 1;
			for(int j = vec_local.size()-1;j >= 0;j--){
				vec_local[j].location = i;
				//如果这个学生和上一个学生的成绩一样,那这个学生的排名和上一个学生的排名一样。
				if(vec_local[j].grade == grade_flag){
					vec_local[j].location_rank = flag;
				}else{
					//如果这个学生的成绩和上一个学生的成绩不一样,那说明他的排名是前面学生的总数+1
					grade_flag = vec_local[j].grade;
					vec_local[j].location_rank = vec_local.size() - j;
					flag = vec_local[j].location_rank;
				}
				vec_all.push_back(vec_local[j]);
			}
		}
		sort(vec_all.begin(),vec_all.end(),cmp);
		printf("%d\n",vec_all.size());
		int grade_flag = vec_all[vec_all.size()-1].grade;
		int flag = 1;
		for(int j = vec_all.size()-1;j >= 0;j--){
			printf("%s ",vec_all[j].ID);
			if(vec_all[j].grade == grade_flag){
				printf("%d ",flag);
			}else{
				grade_flag = vec_all[j].grade;
				flag = vec_all.size() - j;
				printf("%d ",flag);
			}
			printf("%d %d\n",vec_all[j].location,vec_all[j].location_rank);
		}
		
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

1025. PAT Ranking (25)

1025. PAT Ranking (25)Programming Ability Test (PAT) is organized by the College of Computer Science...

Endeca Relevance Ranking(相关度排序)

Endeca Relevance Ranking(相关度排序) Relevance Ranking Module 详解 Exact:(精确匹配)

1025. PAT Ranking (25)

1025. PAT Ranking (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B ...

根据76大细分词性对单词进行归组(一)

词性的重要性不言而喻,尤其是对于自然语言处理来说,哪怕就是记单词,根据词性对单词进行归组也是非常有帮助的。 <h4

1025. PAT Ranking (25)

题目链接:http://www.patest.cn/contests/pat-a-practise/1025 题目: 1025. PAT Ranking (25) 时间限制 ...

pat-1025 PAT Ranking

不同地点一起排序 先组内排序,再全局排序 将小组添加进全局 vector拼接 globallist.insert(globallist.end(),locallist.begin(),locallist.end()); [code="c++"] #include using namespace std; #include #include #include struct Score { string id; int score; int local; int

1025.PAT Ranking (25)

1025.PAT Ranking (25)pat-al-10252017-02-21 每一考场排一次序;所有考生排一次序 /** * pat-al-1025 * 2017-02-21 * Cpp...

ERROR 1025 (HY000): Error on rename of to

刚才又一个一不小心,在Slave上执行了更改数据库schema的操作,结果是这台服务器在mmm_control中的状态就变成了:REPLICATION_FAIL。先通过writer执行了同样的操作,保证服务器正常运行,然后就考虑把这台slave重新拉回到mysql-mmm阵营。 看了一下执行的增量SQL文件,它进行的主要操作有:为一个表A添加三个字段A1、A2、A3,增加一个新表B,为表C增加一个字段C1,其中C1为外键CF1(关键点是:外键的名字和字段的名字相同,假设都为C1</s

1025. PAT Ranking (25)

题目:https://www.patest.cn/contests/pat-a-practise/1025//1025. PAT Ranking (25) #include #include #inc...

PAT1025 PAT Ranking

Sample Input: 2 5 1234567890001 95 1234567890005 100 1234567890003 95 1234567890002 77 1234567890004 85 4 1234567890
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)