PAT 1025 PAT Ranking

#include <cstdio>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <queue>
#include <algorithm>

using namespace std;

class Man {
public:
    char id[];
    int location;
    int score;
    int local_rank;
};

class RankCmp{
public:
    bool operator () (const Man* a, const Man* b) {
        if (a->score > b->score) {
            return true;
        } else if (a->score < b->score) {
            return false;
        }

        return strcmp(a->id, b->id) < ;
    }
};

void do_local_rank(vector<Man*> &v) {
    int len = v.size();
    if (len < ) return;

    int last_score = v[]->score;
    v[]->local_rank = ;

    for (int i=; i<len; i++) {
        Man& cur = *v[i];
        if (cur.score != last_score) {
            cur.local_rank = i + ;
            last_score = cur.score;
        } else {
            cur.local_rank = v[i - ]->local_rank;
        }
    }
}

void print(vector<Man*> &v) {
    int len = v.size();
    for (int i=; i<len; i++) {
        printf("%s %d %d\n", v[i]->id, v[i]->score, v[i]->local_rank);
    }
}

int main() {
    int N, K, total = ;
    scanf("%d", &N);
    vector<vector<Man*> > locations(N);
    Man tmp;

    RankCmp rankcmp;

    for (int i=; i<N; i++) {
        scanf("%d", &K);
        for (int j=; j<K; j++) {
            total++;
            scanf("%s%d", tmp.id, &(tmp.score));
            tmp.location = i + ;
            locations[i].push_back(new Man(tmp));
        }
        sort(locations[i].begin(), locations[i].end(), rankcmp);
        do_local_rank(locations[i]);
    }

    printf("%d\n", total);

    vector<Man*> all;

    for (int i=; i<N; i++) {
        all.insert(all.end(), locations[i].begin(), locations[i].end());
    }

    sort(all.begin(), all.end(), rankcmp);

    int last_rank = , last_score = -;
    for (int i=; i<total; i++) {
        Man& cur = *all[i];
        if (cur.score != last_score) {
            last_score = cur.score;
            last_rank = i + ;
        }
        printf("%s %d %d %d\n", cur.id, last_rank, cur.location, cur.local_rank);
    }
    return ;
}

最后一个全局排序300 * 100 log（300 * 100），如果用优先队列可以变为300 * 100 log（100），提升也不大，可能还是出现下降