题目链接
这道题不算特别难,但特别容易掉进陷阱里面。
《算法笔记》里面的参考代码如下:
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=10010;
struct Stu{
int id;
int score[6];
bool flag;
int score_all;
int solve;
}stu[maxn];
int n,k,m;
int full[6];
bool cmp(Stu a, Stu b){
if (a.score_all!=b.score_all) return a.score_all>b.score_all;
else if (a.solve!=b.solve) return a.solve>b.solve;
else return a.id<b.id;
}
void init(){
for (int i=1; i<=n; i++){
stu[i].id=i;
stu[i].score_all=0;
stu[i].solve=0;
stu[i].flag=false;
memset(stu[i].score, -1, sizeof (stu[i].score));
}
}
int main(){
scanf("%d %d %d",&n,&k,&m);
init();
for (int i=1; i<=k; i++){
scanf("%d",&full[i]);
}
int u_id,p_id,score_obtained;
for (int i=0; i<m; i++){
scanf("%d %d %d",&u_id,&p_id,&score_obtained);
if (score_obtained!=-1){
stu[u_id].flag=true;
}
if (score_obtained==-1 && stu[u_id].score[p_id]==-1){
stu[u_id].score[p_id]=0;
}
if (score_obtained==full[p_id] && stu[u_id].score[p_id]<full[p_id]){
stu[u_id].solve++;
}
if (score_obtained>stu[u_id].score[p_id]){
stu[u_id].score[p_id]=score_obtained;
}
}
for (int i=1; i<=n; i++){
for (int j=1; j<=k; j++){
if (stu[i].score[j]!=-1){
stu[i].score_all+=stu[i].score[j];
}
}
}
sort(stu+1,stu+n+1, cmp);
int r=1;
for (int i=1; i<=n && stu[i].flag==true; i++){
if (i>1 && stu[i].score_all!=stu[i-1].score_all){
r=i;
}
printf("%d %05d %d",r,stu[i].id, stu[i].score_all);
for (int j=1; j<=k; j++){
if (stu[i].score[j]==-1){
printf(" -");
}else {
printf(" %d",stu[i].score[j]);
}
}
printf("\n");
}
}
其实挺好的,但是思路还是不够直观,对于我这种小白,越简单的实现过程,越好。
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct Stu{
int id,rank,pro[10],total,perfect,flag;
Stu(){
for (int i=1; i<10; i++) pro[i]=-2;
total=perfect=flag=0;
}
}stu[10010];
bool cmp(Stu a, Stu b){
if (a.total!=b.total) return a.total>b.total;
else if (a.perfect!=b.perfect) return a.perfect>b.perfect;
else return a.id<b.id;
}
int main(){
int n,k,m;
int p[10];
scanf("%d %d %d",&n, &k, &m);
for (int i=1; i<=k; i++){
scanf("%d",&p[i]);
}
for (int i=1; i<=m; i++){
int id,problem_id, score;
scanf("%d %d %d",&id, &problem_id, &score);
if (score==-1) score=0;
else stu[id].flag=1;
if(stu[id].pro[problem_id]<score){
stu[id].pro[problem_id]=score;
}
}
for (int i=1; i<=n; i++){
stu[i].id=i;
for (int j=1; j<=k; j++){
if (stu[i].pro[j]!=-2){
stu[i].total+=stu[i].pro[j];
}
if (stu[i].pro[j]==p[j]) stu[i].perfect++;
}
}
sort(stu+1,stu+1+n,cmp);
stu[1].rank=1;
for (int i=2; i<=n; i++){
if (stu[i].total==stu[i-1].total) {
stu[i].rank=stu[i-1].rank;
} else {
stu[i].rank=i;
}
}
for (int i=1; i<=n && stu[i].flag; i++){
printf("%d %05d %d",stu[i].rank,stu[i].id,stu[i].total);
for (int j=1; j<=k; j++){
if (stu[i].pro[j]!=-2) printf(" %d",stu[i].pro[j]);
else printf(" -");
}
printf("\n");
}
}
两者其实没啥区别,但我的思路更傻瓜,一步一步来,不容易出错。
另外,本题有两个陷阱:
- 有的考生提交了能通过编译的答案,但是得分是0分,总分也是0分,这个考生就要被输出。(如果提交的所有答案都没通过编译,则不会输出)。这个陷阱,书上有例子说明。
- 第二个陷阱出现在最后一个测试点,有的考生一个答案也没有提交。