PAT : 1015. 德才论 (25)

宋代史学家司马光在《资治通鉴》中有一段著名的“德才论”：“是故才德全尽谓之圣人，才德兼亡谓之愚人，德胜才谓之君子，才胜德谓之小人。凡取人之术，苟不得圣人，君子而与之，与其得小人，不若得愚人。”现给出一批考生的德才分数，请根据司马光的理论给出录取排名。输入格式：输入第1行给出3个正整数，分别为：N（<=105），即考生总数；L（>=60），为录取最低分数线，即德分和才分均不低于L的考生才有资格被考虑录取；H（<100），为优先录取线——德分和才分均不低于此线的被定义为“才德全尽”，此类考生按德才总分从高到低排序；才分不到但德分到线的一类考生属于“德胜才”，也按总分排序，但排在第一类考生之后；德才分均低于H，但是德分不低于才分的考生属于“才德兼亡”但尚有“德胜才”者，按总分排序，但排在第二类考生之后；其他达到最低线L的考生也按总分排序，但排在第三类考生之后。随后N行，每行给出一位考生的信息，包括：准考证号、德分、才分，其中准考证号为8位整数，德才分为区间[0, 100]内的整数。数字间以空格分隔。输出格式：输出第1行首先给出达到最低分数线的考生人数M，随后M行，每行按照输入格式输出一位考生的信息，考生按输入中说明的规则从高到低排序。当某类考生中有多人总分相同时，按其德分降序排列；若德分也并列，则按准考证号的升序输出。输入样例：

14 60 80
10000001 64 90
10000002 90 60
10000011 85 80
10000003 85 80
10000004 80 85
10000005 82 77
10000006 83 76
10000007 90 78
10000008 75 79
10000009 59 90
10000010 88 45
10000012 80 100
10000013 90 99
10000014 66 60

输出样例：

12
10000013 90 99
10000012 80 100
10000003 85 80
10000011 85 80
10000004 80 85
10000007 90 78
10000006 83 76
10000005 82 77
10000002 90 60
10000014 66 60
10000008 75 79
10000001 64 90

悲剧如我，先用C写了一遍，发现自己写的冒泡简直就是渣，各种超时，不愧是O(n2)，n大了2倍多，时间一下从1ms变成了173ms。之后不服用java写了一遍，还是超时....果然java的效率还是比较低..

最后无奈只得上网找了一个c++代码，看懂了自己再写了一遍...太惨了...

AC的c++代码，参考别人的，c++真心不太会用，不过很多地方和java有些相似，加了面向对象就是不一样（话说c++真好用...

<pre name="code" class="cpp">#include <cstdio>
#include <vector>
#include <algorithm>

using namespace std;

struct stuScore
{
long examid;
int moralScore;
int abilityScore;
};

inline bool compare (stuScore a, stuScore b)
{
if((a.abilityScore+a.moralScore) != (b.abilityScore+b.moralScore))
return ((a.abilityScore+a.moralScore) > (b.abilityScore+b.moralScore));
else
{
if(a.moralScore != b.moralScore)
return (a.moralScore > b.moralScore);
else
return (a.examid < b.examid);
}
}

inline void printVector(stuScore score)
{
printf("%d %d %d\n", score.examid, score.moralScore, score.abilityScore);
}

int main()
{
vector<stuScore> vectorList[4];
int n,h,l;
scanf("%d %d %d", &n, &l, &h);
stuScore score;
int i, classifyNum=0;
for(i = 0; i < n; i++)
{
scanf("%d %d %d", &score.examid, &score.moralScore, &score.abilityScore);

if(score.moralScore >= h && score.abilityScore >= h)
vectorList[0].push_back(score);
else if(score.moralScore >= h && score.abilityScore >= l)
vectorList[1].push_back(score);
else if(score.moralScore >= score.abilityScore && score.abilityScore >= l)
vectorList[2].push_back(score);
else if(score.moralScore >= l && score.abilityScore >= l)
vectorList[3].push_back(score);
}

int num = 0;
for(i = 0; i < 4; i++)
{
sort(vectorList[i].begin(), vectorList[i].end(), compare);
num += vectorList[i].size();
}

printf("%d\n", num);
for(i = 0; i < 4; i++)
for_each(vectorList[i].begin(), vectorList[i].end(), printVector);

return 0;
}

悲剧的c，看在我写了这么多的份上还是贴进来吧，其实我觉得它还可以再抢救一下，换一个排序算法什么的，或者用链表，append的时候就按排序规则找到正确的位置插进去什么的....追加：果然是排序的锅，我把自己写的排序函数换成了sort，然后把c++的compare函数考进来，就AC了...

<pre name="code" class="cpp">#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <algorithm>

using namespace std;

#define FIRSTSIZES 50
#define ADDSIZE 200

struct stuScore
{
long examid;
int moralScore;
int abilityScore;
};

struct scoreList
{
stuScore *slist;
int length;
int size;
};

inline bool compare (stuScore a, stuScore b)
{
if((a.abilityScore+a.moralScore) != (b.abilityScore+b.moralScore))
return ((a.abilityScore+a.moralScore) > (b.abilityScore+b.moralScore));
else
{
if(a.moralScore != b.moralScore)
return (a.moralScore > b.moralScore);
else
return (a.examid < b.examid);
}
}

/*void swapstuscore(stuScore *a, stuScore *b)
{
long tempid;
int tempmoral;
int tempablity;

tempid = a->examid;
tempmoral = a->moralScore;
tempablity = a->abilityScore;
a->examid = b->examid;
a->moralScore = b->moralScore;
a->abilityScore = b->abilityScore;
b->examid = tempid;
b->moralScore = tempmoral;
b->abilityScore = tempablity;
}*/

void initList(scoreList classifyList[], int size)
{
for(int i = 0; i < size; i++)
{
classifyList[i].length = 0;
classifyList[i].slist = (stuScore *) malloc (FIRSTSIZES * sizeof(stuScore));
classifyList[i].size = FIRSTSIZES;
}
}

void appendList (scoreList *list, long id, int moral, int ability)
{
if(list->length == list->size)
{
list->slist = (stuScore *) realloc (list->slist, (list->size+ADDSIZE) * sizeof(stuScore));
list->size += ADDSIZE;
}

list->slist[list->length].examid = id;
list->slist[list->length].moralScore = moral;
list->slist[list->length].abilityScore = ability;
list->length++;
}

/*void sortList (scoreList *list)
{
for(int i = 0; i < list->length; i++)
{
for(int j = 0; j < list->length-i-1; j++)
{
if((list->slist[j].abilityScore+list->slist[j].moralScore) < (list->slist[j+1].abilityScore+list->slist[j+1].moralScore))
swapstuscore(list->slist+j, list->slist+j+1);
else if((list->slist[j].abilityScore+list->slist[j].moralScore) == (list->slist[j+1].abilityScore+list->slist[j+1].moralScore))
{
if(list->slist[j].moralScore < list->slist[j+1].moralScore)
swapstuscore(list->slist+j, list->slist+j+1);
else if(list->slist[j].moralScore == list->slist[j+1].moralScore)
{
if(list->slist[j].examid > list->slist[j+1].examid)
swapstuscore(list->slist+j, list->slist+j+1);
}
}
}
}
}*/

void printList (scoreList list)
{
for(int i = 0; i < list.length; i++)
printf("%d %d %d\n", list.slist[i].examid, list.slist[i].moralScore, list.slist[i].abilityScore);
}

int main()
{
scoreList classifyList[4];
initList(classifyList, 4);

int n,h,l;
scanf("%d %d %d", &n, &l, &h);

long id;
int moral;
int ability;
int i, classifyNum=0;
for(i = 0; i < n; i++)
{
scanf("%d %d %d", &id, &moral, &ability);

if(moral >= h && ability >= h)
appendList(classifyList, id, moral, ability);
else if(moral >= h && ability >= l)
appendList(classifyList+1, id, moral, ability);
else if(moral >= ability && ability >= l)
appendList(classifyList+2, id, moral, ability);
else if(moral >= l && ability >= l)
appendList(classifyList+3, id, moral, ability);
}

for(i = 0; i < 4; i++)
{
sort(classifyList[i].slist, classifyList[i].slist+classifyList[i].length, compare);
classifyNum += classifyList[i].length;
}

printf("%d\n", classifyNum);
for(i = 0; i < 4; i++)
{
//printf("------------------------------------------\n");
printList(classifyList[i]);
}

return 0;
}