1012. The Best Rank (25)暴力枚举 排序
来源:互联网 发布:全国最大数据库 编辑:程序博客网 时间:2024/04/30 19:06
1012. The Best Rank (25)
To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algebra), and E - English. At the mean time, we encourage students by emphasizing on their best ranks -- that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student.
For example, The grades of C, M, E and A - Average of 4 students are given as the following:
StudentID C M E A310101 98 85 88 90310102 70 95 88 84310103 82 87 94 88310104 91 91 91 91
Then the best ranks for all the students are No.1 since the 1st one has done the best in C Programming Language, while the 2nd one in Mathematics, the 3rd one in English, and the last one in average.
Input
Each input file contains one test case. Each case starts with a line containing 2 numbers N and M (<=2000), which are the total number of students, and the number of students who would check their ranks, respectively. Then N lines follow, each contains a student ID which is a string of 6 digits, followed by the three integer grades (in the range of [0, 100]) of that student in the order of C, M and E. Then there are M lines, each containing a student ID.
Output
For each of the M students, print in one line the best rank for him/her, and the symbol of the corresponding rank, separated by a space.
The priorities of the ranking methods are ordered as A > C > M > E. Hence if there are two or more ways for a student to obtain the same best rank, output the one with the highest priority.
If a student is not on the grading list, simply output "N/A".
Sample Input5 6310101 98 85 88310102 70 95 88310103 82 87 94310104 91 91 91310105 85 90 90310101310102310103310104310105999999Sample Output
1 C1 M1 E1 A3 AN/A
提交代码
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<stack>using namespace std;typedef long long ll;const int maxn=1000001;const int inf=9999;int C[maxn];int M[maxn];int E[maxn];double avg[maxn];int n,m;int minid=99999999,maxid=0;void solve(int id,char&c,int &rank){ int numA=1,numC=1,numM=1,numE=1;//假设当前排在第一 ,那么有比他大的,名次就加一 for(int i=minid;i<=maxid;i++)if(i!=id&&avg[i]>avg[id])numA++; for(int i=minid;i<=maxid;i++)if(i!=id&&C[i]>C[id])numC++; for(int i=minid;i<=maxid;i++)if(i!=id&&M[i]>M[id])numM++; for(int i=minid;i<=maxid;i++)if(i!=id&&E[i]>E[id])numE++; if(numA<=numC&&numA<=numM&&numA<=numE) { rank=numA;c='A'; } else if(numC<=numA&&numC<=numM&&numC<=numE) { rank=numC; c='C'; } else if(numM<=numA&&numM<=numC&&numM<=numE) { rank=numM; c='M'; } else if(numE<=numA&&numE<=numC&&numE<=numM) { rank=numE; c='E'; } //printf("(((%d %c)))\n",rank,c);}int main(){ int i,j,k,t; scanf("%d%d",&n,&m); for(i=0;i<n;i++) { int id; scanf("%d",&id); minid=min(id,minid); maxid=max(id,maxid); scanf("%d%d%d",&C[id],&M[id],&E[id]); avg[id]=(C[id]+M[id]+E[id])*1.0/3.0; } for(i=0;i<m;i++) { int id; scanf("%d",&id); if(id<minid||id>maxid){printf("N/A\n");continue;} char c=NULL;int rank0; solve(id,c,rank0); printf("%d %c\n",rank0,c); } return 0;}
- 1012. The Best Rank (25)暴力枚举 排序
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 1012. The Best Rank (25)
- 一套配色完整的Metro风格PSD源文件
- 使用jython和ScriptEngineManager在java中执行python
- 利用QR算法求解矩阵的特征值和特征向量
- 基于xmpp openfire smack 开发(四)单聊
- 01-复杂度2.Maximum Subsequence Sum
- 1012. The Best Rank (25)暴力枚举 排序
- 【HBase基础教程】1、HBase之单机模式与伪分布式模式安装
- nfs:server is not responding,still trying 原因与解决方案
- 数据结构--二叉序树
- emacs配置文件路径
- 大数据博客
- Majority Element
- 从github下载项目到本地
- opencv移植到arm的出现的问题