zoukankan      html  css  js  c++  java
  • PAT 1012. The Best Rank

    To evaluate the performance of our first year CS majored students, we consider their grades of three courses only: C - C Programming Language, M - Mathematics (Calculus or Linear Algrbra), and E - English.  At the mean time, we encourage students by emphasizing on their best ranks -- that is, among the four ranks with respect to the three courses and the average grade, we print the best rank for each student.

    For example, The grades of C, M, E and A - Average of 4 students are given as the following:

    StudentID  C  M  E  A
    310101     98 85 88 90
    310102     70 95 88 84
    310103     82 87 94 88
    310104     91 91 91 91
    

    Then the best ranks for all the students are No.1 since the 1st one has done the best in C Programming Language, while the 2nd one in Mathematics, the 3rd one in English, and the last one in average.

    Input

    Each input file contains one test case.  Each case starts with a line containing 2 numbers N and M (<=2000), which are the total number of students, and the number of students who would check their ranks, respectively.  Then N lines follow, each contains a student ID which is a string of 6 digits, followed by the three integer grades (in the range of [0, 100]) of that student in the order of C, M and E.  Then there are M lines, each containing a student ID.

    Output

    For each of the M students, print in one line the best rank for him/her, and the symbol of the corresponding rank, separated by a space.

    The priorities of the ranking methods are ordered as A > C > M > E.  Hence if there are two or more ways for a student to obtain the same best rank, output the one with the highest priority.

    If a student is not on the grading list, simply output "N/A".

    Sample Input

    5 6
    310101 98 85 88
    310102 70 95 88
    310103 82 87 94
    310104 91 91 91
    310105 85 90 90
    310101
    310102
    310103
    310104
    310105
    999999
    

    Sample Output

    1 C
    1 M
    1 E
    1 A
    3 A
    N/A
    

    // 1012pat1.cpp : 定义控制台应用程序的入口点。
    //
    #include <fstream>
    #include <iostream>
    #include <vector>
    #include <map>
    #include <string>
    #include <algorithm>
    using namespace std;
    
    const int INF=0x7fffffff;
    struct Edge
    {
        string id;
        int C,M,E,A;
    };
    
    struct R
    {
        int r;
        char c;
        bool flag;
        R(){r=INF;c='A';flag=false;}
    };
    
    class TA:public binary_function<Edge,Edge,bool>
    {
    public:
        bool operator()(const Edge& lhs,const Edge& rhs) const
        {
            return lhs.A>rhs.A;
        }
    };
    class TC:public binary_function<Edge,Edge,bool>
    {
    public:
        bool operator()(const Edge& lhs,const Edge& rhs) const
        {
            return lhs.C>rhs.C;
        }
    };
    class TM:public binary_function<Edge,Edge,bool>
    {
    public:
        bool operator()(const Edge& lhs,const Edge& rhs) const
        {
            return lhs.M>rhs.M;
        }
    };
    class TE:public binary_function<Edge,Edge,bool>
    {
    public:
        bool operator()(const Edge& lhs,const Edge& rhs) const
        {
            return lhs.E>rhs.E;
        }
    };
    int main()
    {
        int n,m;
        while(cinf>>n>>m)
        {
            Edge temp;
            vector<Edge> vec;
            map<string,R> rp;
            for(int i=1;i<=n;++i)
            {
                cinf>>temp.id>>temp.C>>temp.M>>temp.E;
                rp[temp.id].flag=true;
                temp.A=(temp.C+temp.M+temp.E)/3;
                vec.push_back(temp);
            }
            sort(vec.begin(),vec.end(),TA());
            int rank=1;
            int cnt=1;
            for(vector<Edge>::iterator iter=vec.begin();iter!=vec.end();++iter)
            {
                if((iter+1)!=vec.end())
                {
                    if(iter->A==(iter+1)->A)
                    {
                        ++cnt;
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='A';
                        }
                        if(rp[(iter+1)->id].r>rank)
                        {
                            rp[(iter+1)->id].r=rank;
                            rp[(iter+1)->id].c='A';
                        }
                    }
                    else
                    {
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='A';
                        }
                        rank=rank+cnt;
                        cnt=1;
                    }
                }
                else
                {
                    if(rp[iter->id].r>rank)
                    {
                        rp[iter->id].r=rank;
                        rp[iter->id].c='A';
                    }
                }
            }
            sort(vec.begin(),vec.end(),TC());
            rank=1;
            cnt=1;
            for(vector<Edge>::iterator iter=vec.begin();iter!=vec.end();++iter)
            {
                if((iter+1)!=vec.end())
                {
                    if(iter->C==(iter+1)->C)
                    {
                        ++cnt;
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='C';
                        }
                        if(rp[(iter+1)->id].r>rank)
                        {
                            rp[(iter+1)->id].r=rank;
                            rp[(iter+1)->id].c='C';
                        }
                    }
                    else
                    {
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='C';
                        }
                        rank=rank+cnt;
                        cnt=1;
                    }
                }
                else
                {
                    if(rp[iter->id].r>rank)
                    {
                        rp[iter->id].r=rank;
                        rp[iter->id].c='C';
                    }
                }
            }
            sort(vec.begin(),vec.end(),TM());
            rank=1;
            cnt=1;
            for(vector<Edge>::iterator iter=vec.begin();iter!=vec.end();++iter)
            {
                if((iter+1)!=vec.end())
                {
                    if(iter->M==(iter+1)->M)
                    {
                        ++cnt;
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='M';
                        }
                        if(rp[(iter+1)->id].r>rank)
                        {
                            rp[(iter+1)->id].r=rank;
                            rp[(iter+1)->id].c='M';
                        }
                    }
                    else
                    {
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='M';
                        }
                        rank=rank+cnt;
                        cnt=1;
                    }
                }
                else
                {
                    if(rp[iter->id].r>rank)
                    {
                        rp[iter->id].r=rank;
                        rp[iter->id].c='M';
                    }
                }
            }
            sort(vec.begin(),vec.end(),TE());
            rank=1;
            cnt=1;
            for(vector<Edge>::iterator iter=vec.begin();iter!=vec.end();++iter)
            {
                if((iter+1)!=vec.end())
                {
                    if(iter->E==(iter+1)->E)
                    {
                        ++cnt;
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='E';
                        }
                        if(rp[(iter+1)->id].r>rank)
                        {
                            rp[(iter+1)->id].r=rank;
                            rp[(iter+1)->id].c='E';
                        }
                    }
                    else
                    {
                        if(rp[iter->id].r>rank)
                        {
                            rp[iter->id].r=rank;
                            rp[iter->id].c='E';
                        }
                        rank=rank+cnt;
                        cnt=1;
                    }
                }
                else
                {
                    if(rp[iter->id].r>rank)
                    {
                        rp[iter->id].r=rank;
                        rp[iter->id].c='E';
                    }
                }
            }
            string id;
            for(int i=1;i<=m;++i)
            {
                cinf>>id;
                if(rp[id].flag==true)
                    cout<<rp[id].r<<" "<<rp[id].c<<endl;
                else
                    cout<<"N/A"<<endl;
            }
        }
        return 0;
    }
  • 相关阅读:
    Containers vs Serverless:本质区别是什么?
    博云 x 某农商行 | 银行信息化运维系统升级的最佳实践
    兼容传统应用,蓄力边缘云——博云胖容器解决方案
    使用Bookinfo应用测试Kuma服务网格
    干货 | 博云基于OVS自研容器网络插件在金融企业的落地实践
    开源分布式事务中间件Seata使用指南
    调研 | 5种分布式事务解决方案优缺点对比
    Ambassador,云原生应用的“门神”
    容器网络插件那么多,博云为什么基于OVS深度自研?
    观察 | 边缘云计算的概念理解
  • 原文地址:https://www.cnblogs.com/wwblog/p/3656556.html
Copyright © 2011-2022 走看看