zoukankan      html  css  js  c++  java
  • 1025 PAT Ranking (25)(25 point(s))

    problem

    Programming Ability Test (PAT) is organized by the College of Computer Science and Technology of Zhejiang University. Each test is supposed to run simultaneously in several places, and the ranklists will be merged immediately after the test. Now it is your job to write a program to correctly merge all the ranklists and generate the final rank.
    
    Input Specification:
    
    Each input file contains one test case. For each case, the first line contains a positive number N (<=100), the number of test locations. Then N ranklists follow, each starts with a line containing a positive integer K (<=300), the number of testees, and then K lines containing the registration number (a 13-digit number) and the total score of each testee. All the numbers in a line are separated by a space.
    
    Output Specification:
    
    For each test case, first print in one line the total number of testees. Then print the final ranklist in the following format:
    
    registration_number final_rank location_number local_rank
    
    The locations are numbered from 1 to N. The output must be sorted in nondecreasing order of the final ranks. The testees with the same score must have the same rank, and the output must be sorted in nondecreasing order of their registration numbers.
    
    Sample Input:
    
    2
    5
    1234567890001 95
    1234567890005 100
    1234567890003 95
    1234567890002 77
    1234567890004 85
    4
    1234567890013 65
    1234567890011 25
    1234567890014 100
    1234567890012 85
    Sample Output:
    
    9
    1234567890005 1 1 1
    1234567890014 1 2 1
    1234567890001 3 1 2
    1234567890003 3 1 2
    1234567890004 5 1 4
    1234567890012 5 2 2
    1234567890002 7 1 5
    1234567890013 8 2 3
    1234567890011 9 2 4
    

    tip

    answer

    #include <cstdio>
    #include <algorithm>
    #include <vector>
    using namespace std;
    struct student {
        long long int no;
        int score, finrank, loca, locarank;
    };
    bool cmp1(student a, student b) {
        return a.score != b.score ? a.score > b.score : a.no < b.no;
    }
    int main() {
        int n, m;
        scanf("%d", &n);
        vector<student> fin;
        for(int i = 1; i <= n; i++) {
            scanf("%d", &m);
            vector<student> v(m);
            for(int j = 0; j < m; j++) {
                scanf("%lld %d", &v[j].no, &v[j].score);
                v[j].loca = i;
            }
            sort(v.begin(), v.end(), cmp1);
            v[0].locarank = 1;
            fin.push_back(v[0]);
            for(int j = 1; j < m; j++) {
                v[j].locarank = (v[j].score == v[j - 1].score) ? (v[j - 1].locarank) : (j + 1);
                fin.push_back(v[j]);
            }
        }
        sort(fin.begin(), fin.end(), cmp1);
        fin[0].finrank = 1;
        for(int j = 1; j < fin.size(); j++)
            fin[j].finrank = (fin[j].score == fin[j - 1].score) ? (fin[j - 1].finrank) : (j + 1);
        printf("%d
    ", fin.size());
        for(int i = 0; i < fin.size(); i++)
            printf("%013lld %d %d %d
    ", fin[i].no, fin[i].finrank, fin[i].loca, fin[i].locarank);
        return 0;
    }
    

    experience

    • 就是道简单的模拟题,能不能快一点做完?
  • 相关阅读:
    python爬虫简单实现,并在java中调用python脚本,将数据保存在json文件中
    封闭类
    对象的复制和数据类成员的解构
    数据类
    Git 标签
    Git 查看提交历史
    [精]Oracle APEX 5.0 入门教程(一) Form表单
    UISearchbar去除背景色的方法,适合iOS5/6/7/8.0beta
    哈希表——线性探測法、链地址法、查找成功、查找不成功的平均长度
    《Android源代码设计模式解析与实战》读书笔记(二十一)
  • 原文地址:https://www.cnblogs.com/yoyo-sincerely/p/9339029.html
Copyright © 2011-2022 走看看