PAT 1075. PAT Judge (25)
2015-08-15 15:39
393 查看
1075. PAT Judge (25)
The ranklist of PAT is generated from the status list, which shows the scores of the submittions. This time you are supposed to generate the ranklist for PAT.Input Specification:
Each input file contains one test case. For each case, the first line contains 3 positive integers, N (<=104), the total number of users, K (<=5), the total number of problems, and M (<=105), the total number of submittions. It is then assumed that the user id's are 5-digit numbers from 00001 to N, and the problem id's are from 1 to K. The next line contains K positive integers p[i] (i=1, ..., K), where p[i] corresponds to the full mark of the i-th problem. Then M lines follow, each gives the information of a submittion in the following format:
user_id problem_id partial_score_obtained
where partial_score_obtained is either -1 if the submittion cannot even pass the compiler, or is an integer in the range [0, p[problem_id]]. All the numbers in a line are separated by a space.
Output Specification:
For each test case, you are supposed to output the ranklist in the following format:
rank user_id total_score s[1] ... s[K]
where rank is calculated according to the total_score, and all the users with the same total_score obtain the same rank; ands[i] is the partial score obtained for the i-th problem. If a user has never submitted a solution for a problem, then "-" must be printed at the corresponding position. If a user has submitted several solutions to solve one problem, then the highest score will be counted.
The ranklist must be printed in non-decreasing order of the ranks. For those who have the same rank, users must be sorted in nonincreasing order according to the number of perfectly solved problems. And if there is still a tie, then they must be printed in increasing order of their id's. For those who has never submitted any solution that can pass the compiler, or has never submitted any solution, they must NOT be shown on the ranklist. It is guaranteed that at least one user can be shown on the ranklist.
Sample Input:
7 4 20 20 25 25 30 00002 2 12 00007 4 17 00005 1 19 00007 2 25 00005 1 20 00002 2 2 00005 1 15 00001 1 18 00004 3 25 00002 2 25 00005 3 22 00006 4 -1 00001 2 18 00002 1 20 00004 1 15 00002 4 18 00001 3 4 00001 4 2 00005 2 -1 00004 2 0
Sample Output:
1 00002 63 20 25 - 18 2 00005 42 20 0 22 - 2 00007 42 - 25 - 17 2 00001 42 18 18 4 2 5 00004 40 15 0 25 -
#include <iostream> #include <vector> #include <bitset> #include <algorithm> using namespace std; struct User { int id=0; int scores[6]; bitset<6> submit; int num = 0; int totalscore = 0; int rank; bool pass = false; }; bool cmp(const User& u1, const User& u2) { if (u1.totalscore == u2.totalscore&&u1.num == u2.num) return u1.id < u2.id; else if (u1.totalscore == u2.totalscore) return u1.num > u2.num; else return u1.totalscore > u2.totalscore; } User users[10001]; int main() { int UserNum, problemNum, submissionNum; int fullScores[6], full = 0; cin >> UserNum >> problemNum >> submissionNum; for (int i = 1; i <= problemNum; i++) { cin >> fullScores[i]; full += fullScores[i]; } for (int i = 0; i < submissionNum; i++) { int id, problemIndex, score; cin >> id >> problemIndex >> score; if (users[id].id == 0) //first submission to initialize the id users[id].id = id; if (score == fullScores[problemIndex] && score > users[id].scores[problemIndex]) users[id].num++; if (users[id].scores[problemIndex] < score) //submit a higher score and update the score { users[id].totalscore += (score - users[id].scores[problemIndex]); users[id].scores[problemIndex] = score; } if (score != -1) users[id].pass = true; users[id].submit.set(problemIndex); } vector<User> vec; for (int i = 0; i < 10001; i++) { if (users[i].pass) vec.push_back(users[i]); } sort(vec.begin(),vec.end(), cmp); int score = full, rank = 1; for (int i = 0; i < vec.size(); i++) { if (vec[i].totalscore == score) vec[i].rank = rank; else { vec[i].rank = i + 1; rank = i + 1; score = vec[i].totalscore; } } for (int i = 0; i < vec.size(); i++) { printf("%d %.5d %d ", vec[i].rank, vec[i].id, vec[i].totalscore); for (int j = 1; j <= problemNum; j++) { if (vec[i].submit[j]) cout << vec[i].scores[j]; else cout << "-"; if (j < problemNum) cout << " "; else cout << endl; } } }
相关文章推荐
- JavaScript基础学习之-JavaScript权威指南--8.1-8.4函数
- jQuery树形下拉菜单特效代码分享
- JavaScript向php传递json格式数据
- 华为OJ(超长正整数相加)
- 定义字符串的两种方式
- 选择算法
- Ubuntu 初始化Root账户密码
- 两道考研算法设计题- 2010 2013
- [leetcode][dfs] Different Ways to Add Parentheses
- 正则表达式匹配
- [设计模式]-UML类图的各符号含义
- Legal or Not
- iOS面试题3
- Nginx服务器中浏览器本地缓存和虚拟机的相关设置
- asp.net网站图表制作
- POJ 1228 稳定凸包问题
- POJ-3356 AGTC (最短编辑距离问题)
- 神秘代理-Proxy
- hello shell
- iOS面试题2