PAT_A1137#Final Grading
Source:
Description:
For a student taking the online course "Data Structures" on China University MOOC (http://www.icourse163.org/), to be qualified for a certificate, he/she must first obtain no less than 200 points from the online programming assignments, and then receive a final grade no less than 60 out of 100. The final grade is calculated by 0 if Gmid−term>Gfinal, or Gfinal will be taken as the final grade G. Here Gmid−term and Gfinal are the student's scores of the mid-term and the final exams, respectively.
The problem is that different exams have different grading sheets. Your job is to write a program to merge all the grading sheets into one.
Input Specification:
Each input file contains one test case. For each case, the first line gives three positive integers: P , the number of students having done the online programming assignments; M, the number of students on the mid-term list; and N, the number of students on the final exam list. All the numbers are no more than 10,000.
Then three blocks follow. The first block contains P online programming scores Gp's; the second one contains M mid-term scores Gmid−term's; and the last one contains N final exam scores Gfinal's. Each score occupies a line with the format:
StudentID Score
, whereStudentID
is a string of no more than 20 English letters and digits, andScore
is a nonnegative integer (the maximum score of the online programming is 900, and that of the mid-term and final exams is 100).
Output Specification:
For each case, print the list of students who are qualified for certificates. Each student occupies a line with the format:
StudentID
Gp Gmid−term Gfinal GIf some score does not exist, output "−" instead. The output must be sorted in descending order of their final grades (G must be rounded up to an integer). If there is a tie, output in ascending order of their
StudentID
's. It is guaranteed that theStudentID
's are all distinct, and there is at least one qullified student.
Sample Input:
6 6 7
01234 880
a1903 199
ydjh2 200
wehu8 300
dx86w 220
missing 400
ydhfu77 99
wehu8 55
ydjh2 98
dx86w 88
a1903 86
01234 39
ydhfu77 88
a1903 66
01234 58
wehu8 84
ydjh2 82
missing 99
dx86w 81
Sample Output:
missing 400 -1 99 99
ydjh2 200 98 82 88
dx86w 220 88 81 84
wehu8 300 55 84 84
Keys:
- 快乐模拟
- map(C++ STL)
- string(C++ STL)
Attention:
- 四舍五入要用round()函数;
- MAXSIZE最多有三倍的1E4;
- 从总分计算公式可以看出来,不参加期末考试,最多拿40分,是不会得到证书的
Code:
/*
Data: 2019-08-07 20:05:38
Problem: PAT_A1137#Final Grading
AC: 32:45 题目大意:
获得证书需要,编程任务不少于200分,总分不少于60分
如果期中>期末分数,则总分=期中*0.4+期末*0.6
反之,总分=期末分数
输入:
第一行给出,完成编程的人数P,参加期中考试的人数M,参加期末考试的人数N,均<=1e4
接下来给出各项分数;id不超过20位
*/
#include<cstdio>
#include<string>
#include<map>
#include<cmath>
#include<vector>
#include<iostream>
#include<algorithm>
using namespace std;
const int M=1e4+;
int pt=;
struct node
{
string id;
int gp,gm,gf,g;
}info[M],temp;
map<string,int> mp;
vector<node> ans; int Hash(string s)
{
if(mp[s]==)
mp[s]=pt++;
return mp[s];
} bool cmp(const node &a, const node &b)
{
if(a.g != b.g)
return a.g > b.g;
else
return a.id < b.id;
} int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("Test.txt", "r", stdin);
#endif // ONLINE_JUDGE int n,m,p;
scanf("%d%d%d", &p,&m,&n);
for(int i=; i<p; i++)
{
temp = node{"",-,-,-,-};
cin >> temp.id >> temp.gp;
if(temp.gp<)
continue;
int pos = Hash(temp.id);
info[pos]=temp;
}
for(int i=; i<m; i++)
{
cin >> temp.id >> temp.gm;
if(mp[temp.id]==)
continue;
int pos = mp[temp.id];
info[pos].gm = temp.gm;
}
for(int i=; i<n; i++)
{
cin >> temp.id >> temp.gf;
if(mp[temp.id]==)
continue;
int pos = mp[temp.id];
info[pos].gf = temp.gf;
if(info[pos].gf >= info[pos].gm)
info[pos].g = info[pos].gf;
else
info[pos].g = (int)round((0.4)*info[pos].gm+(0.6)*info[pos].gf);
if(info[pos].g >= )
ans.push_back(info[pos]);
}
sort(ans.begin(),ans.end(),cmp);
for(int i=; i<ans.size(); i++)
printf("%s %d %d %d %d\n", ans[i].id.c_str(),ans[i].gp,ans[i].gm,ans[i].gf,ans[i].g); return ;
}
/*Data: 2019-08-07 20:05:38Problem: PAT_A1137#Final GradingAC: 32:45
题目大意:获得证书需要,编程任务不少于200分,总分不少于60分如果期中>期末分数,则总分=期中*0.4+期末*0.6反之,总分=期末分数输入:第一行给出,完成编程的人数P,参加期中考试的人数M,参加期末考试的人数N,均<=1e4接下来给出各项分数;id不超过20位*/#include<cstdio>#include<string>#include<map>#include<cmath>#include<vector>#include<iostream>#include<algorithm>using namespace std;const int M=1e4+10;int pt=1;struct node{ string id; int gp,gm,gf,g;}info[M],temp;map<string,int> mp;vector<node> ans;
int Hash(string s){ if(mp[s]==0) mp[s]=pt++; return mp[s];}
bool cmp(const node &a, const node &b){ if(a.g != b.g) return a.g > b.g; else return a.id < b.id;}
int main(){#ifdef ONLINE_JUDGE#else freopen("Test.txt", "r", stdin);#endif // ONLINE_JUDGE
int n,m,p; scanf("%d%d%d", &p,&m,&n); for(int i=0; i<p; i++) { temp = node{"",-1,-1,-1,-1}; cin >> temp.id >> temp.gp; if(temp.gp<200) continue; int pos = Hash(temp.id); info[pos]=temp; } for(int i=0; i<m; i++) { cin >> temp.id >> temp.gm; if(mp[temp.id]==0) continue; int pos = mp[temp.id]; info[pos].gm = temp.gm; } for(int i=0; i<n; i++) { cin >> temp.id >> temp.gf; if(mp[temp.id]==0) continue; int pos = mp[temp.id]; info[pos].gf = temp.gf; if(info[pos].gf >= info[pos].gm) info[pos].g = info[pos].gf; else info[pos].g = (int)round((0.4)*info[pos].gm+(0.6)*info[pos].gf); if(info[pos].g >= 60) ans.push_back(info[pos]); } sort(ans.begin(),ans.end(),cmp); for(int i=0; i<ans.size(); i++) printf("%s %d %d %d %d\n", ans[i].id.c_str(),ans[i].gp,ans[i].gm,ans[i].gf,ans[i].g);
return 0;}
PAT_A1137#Final Grading的更多相关文章
- PAT 1137 Final Grading[一般][排序]
1137 Final Grading(25 分) For a student taking the online course "Data Structures" on China ...
- A1137. Final Grading
For a student taking the online course "Data Structures" on China University MOOC (http:// ...
- PAT A1137 Final Grading (25 分)——排序
For a student taking the online course "Data Structures" on China University MOOC (http:// ...
- PAT 甲级 1137 Final Grading
https://pintia.cn/problem-sets/994805342720868352/problems/994805345401028608 For a student taking t ...
- 1137 Final Grading (25 分)
For a student taking the online course "Data Structures" on China University MOOC (http:// ...
- PAT 1137 Final Grading
For a student taking the online course "Data Structures" on China University MOOC (http:// ...
- PAT甲级——A1137 Final Grading【25】
For a student taking the online course "Data Structures" on China University MOOC (http:// ...
- 1137 Final Grading
题意:排序题. 思路:通过unordered_map来存储考生姓名与其成绩信息结构体的映射,成绩初始化为-1,在读入数据时更新各个成绩,最后计算最终成绩并把符合条件的学生存入vector,再排序即可. ...
- PAT甲级目录
树(23) 备注 1004 Counting Leaves 1020 Tree Traversals 1043 Is It a Binary Search Tree 判断BST,BST的性质 ...
随机推荐
- ASP.NET MVC 源码分析(二) —— 从 IRouteBuilder认识路由构建
我们来看IRouteBuilder的定义: public interface IRouteBuilder { IRouter DefaultHandler { get; set; } IService ...
- MySQL5.7出现无法启动服务等问题
MySQL5.7版本后有点不同,就是没有DATA文件夹.总是莫名其妙出现一些错误.比如连不上数据库了,出现错误 can't connect mysql on localhost,键入 net star ...
- Go语言基础介绍
Go是一个开源的编程语言.Go语言被设计成一门应用于搭载Web服务器,存储集群或类似用途的巨型中央服务器的系统编程语言.目前,Go最新发布版本为1.10. Go语言可以运行在Linux.FreeBSD ...
- keras 与tensorflow 混合使用
keras 与tensorflow 混合使用 tr:nth-child(odd) > td, .table-striped tbody > tr:nth-child(odd) > t ...
- 虚拟化(四):vsphere高可用功能前提-共享存储搭建
虚拟化(一):虚拟化及vmware产品介绍 虚拟化(二):虚拟化及vmware workstation产品使用 虚拟化(三):vsphere套件的安装注意及使用 虚拟化(四):vsphere高可用功能 ...
- android 通用菜单条实现(一)
一.前言介绍 直奔主题啦,非常多Android app都有菜单条.菜单条除了背景图片.图标的不同外,布局基本一致.大致能够分为三部分:菜单条的左側区域.菜单条中间区域.菜单条右側区域. 为了考虑代码的 ...
- CON1023 明明的计划
比赛说明 邀请码:a08f 来源:自出 描述:无 难度:NOIP提高组day1 赛时答疑:私信询问 奖励:无 试题列表 赛题 #A:数学题赛题 #B:明明泡妹子赛题 #C:明明去酒店 U5012 数学 ...
- 修改android系统开机动画
本文转载自:http://blog.csdn.net/u012301841/article/details/51598115 修改android系统开机动画
- 2017 Multi-University Training Contest - Team 2&&hdu 6047 Maximum Sequence
Maximum Sequence Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
- SQL Server 行转列,列转行
一.多行转成一列(并以","隔开) 表名:A 表数据: 想要的查询结果: 查询语句: SELECT name , value = ( STUFF(( SELECT ',' + va ...