1141 PAT Ranking of Institutions

After each PAT, the PAT Center will announce the ranking of institutions based on their students' performances. Now you are asked to generate the ranklist.

Input Specification:

Each input file contains one test case. For each case, the first line gives a positive integer N (≤), which is the number of testees. Then N lines follow, each gives the information of a testee in the following format:

ID Score School

 

where ID is a string of 6 characters with the first one representing the test level: B stands for the basic level, A the advanced level and T the top level; Score is an integer in [0, 100]; and School is the institution code which is a string of no more than 6 English letters (case insensitive). Note: it is guaranteed that ID is unique for each testee.

Output Specification:

For each case, first print in a line the total number of institutions. Then output the ranklist of institutions in nondecreasing order of their ranks in the following format:

Rank School TWS Ns

 

where Rank is the rank (start from 1) of the institution; School is the institution code (all in lower case); ; TWS is the total weighted score which is defined to be the integer part of ScoreB/1.5 + ScoreA + ScoreT*1.5, where ScoreX is the total score of the testees belong to this institution on level X; and Ns is the total number of testees who belong to this institution.

The institutions are ranked according to their TWS. If there is a tie, the institutions are supposed to have the same rank, and they shall be printed in ascending order of Ns. If there is still a tie, they shall be printed in alphabetical order of their codes.

Sample Input:

10
A57908 85 Au
B57908 54 LanX
A37487 60 au
T28374 67 CMU
T32486 24 hypu
A66734 92 cmu
B76378 71 AU
A47780 45 lanx
A72809 100 pku
A03274 45 hypu

 

Sample Output:

5
1 cmu 192 2
1 au 192 3
3 pku 100 1
4 hypu 81 2
4 lanx 81 2

题意：

　　给出一组PAT考生的信息，通过分析这些信息输出考生所在学校的排名。

思路：

　　构造一个结构体，然后输入，排序，输出。（详细过程键代码）最后一组数据卡到了，看了大佬的代码，发现TWS取整的时候是最后取整，如果在过程中取整的话最后一组数据不能通过。

code：

#include <algorithm>
#include <iostream>
#include <map>
#include <string>
#include <vector>

using namespace std;

struct School {
    int Rank;
    string school;
    double TWS;
    int Ns;
};

bool cmp(School s1, School s2) {
    if (s1.TWS != s2.TWS)
        return s1.TWS > s2.TWS;
    else if (s1.Ns != s2.Ns)
        return s1.school < s2.school;
    else
        return s1.Ns < s2.Ns;
}

string toLower(string str) {
    for (int i = 0; i < str.length(); ++i) str[i] = tolower(str[i]);
    return str;
}

int main() {
    int n;
    cin >> n;
    getchar();
    string inf;
    map<string, School> m;
    map<char, double> s;
    s['B'] = 0.66666667;
    s['A'] = 1.0;
    s['T'] = 1.5;
    for (int i = 0; i < n; ++i) {
        getline(cin, inf);
        string ID = inf.substr(0, 6);
        int pos = 7;
        while (inf[pos] != ' ') pos++;
        int score = stoi(inf.substr(7, pos - 7));
        string school = toLower(inf.substr(pos + 1));
        m[school].school = school;
        m[school].TWS += score * s[ID[0]];
        m[school].Ns += 1;
    }
    vector<School> v;
    for (auto it : m) {
        it.second.TWS = (int)it.second.TWS;
        v.push_back(it.second);
    }
    sort(v.begin(), v.end(), cmp);
    int rank = 1;
    v[0].Rank = rank;
    for (int i = 1; i < v.size(); ++i) {
        rank++;
        if (v[i].TWS == v[i - 1].TWS)
            v[i].Rank = v[i - 1].Rank;
        else
            v[i].Rank = rank;
    }
    cout << v.size() << endl;
    for (int i = 0; i < v.size(); ++i) {
        cout << v[i].Rank << " " << v[i].school << " " << v[i].TWS << " "
             << v[i].Ns << endl;
    }
    return 0;
}

优化了一下cmp函数的写法。

---

PAT应该是加强了测试点的精确度，上一次AC的代码这次值得了5分

重新写了一下代码最后一组数据还是被卡到了。

#include <bits/stdc++.h>

using namespace std;

struct Institution {
    string school;
    double TWS;
    int Ns;
};

string _tolower(string s) {
    for (int i = 0; i < s.length(); ++i) {
        s[i] = tolower(s[i]);
    }
    return s;
}

bool cmp(Institution a, Institution b) {
    if (a.TWS != b.TWS) {
        return a.TWS > b.TWS;
    } else if (a.Ns != b.Ns) {
        return a.Ns < b.Ns;
    } else {
        return a.school < b.school;
    }
}

int main() {
    int n;
    cin >> n;
    map<string, Institution> mp;
    string id, school;
    double score;
    for (int i = 0; i < n; ++i) {
        cin >> id >> score >> school;
        school = _tolower(school);
        mp[school].Ns++;
        if (id[0] == 'B') {
            mp[school].TWS += score * 0.66666667;
        } else if (id[0] == 'A') {
            mp[school].TWS += score;
        } else {
            mp[school].TWS += score * 1.5;
        }
    }
    vector<Institution> v;
    for (auto it : mp) {
        it.second.school = it.first;
        v.push_back(it.second);
    }
    sort(v.begin(), v.end(), cmp);
    cout << v.size() << endl;
    int rank = 1;
    cout << rank << " " << v[0].school << " " << (int)v[0].TWS << " " << v[0].Ns
         << endl;
    for (int i = 1; i < v.size(); ++i) {
        if ((int)v[i].TWS == (int)v[i - 1].TWS) {
            cout << rank << " " << v[i].school << " " << (int)v[i].TWS << " "
                 << v[i].Ns << endl;
        } else {
            rank = i + 1;
            cout << rank << " " << v[i].school << " " << (int)v[i].TWS << " "
                 << v[i].Ns << endl;
        }
    }
    return 0;
}

---

排序前需要对TWS进行取整不然最后一组数据不能通过。