1153 Decode Registration Card of PAT (25)

原创已于 2025-01-12 11:44:35 修改 · 944 阅读

21 ·

CC 4.0 BY-SA版权

文章标签：

#pat考试

于 2025-01-12 11:39:34 首次发布

PAT刷题专栏收录该内容

173 篇文章

订阅专栏

A registration card number of PAT consists of 4 parts:

the 1st letter represents the test level, namely, T for the top level, A for advance and B for basic;
the 2nd - 4th digits are the test site number, ranged from 101 to 999;
the 5th - 10th digits give the test date, in the form of yymmdd;
finally the 11th - 13th digits are the testee's number, ranged from 000 to 999.

Now given a set of registration card numbers and the scores of the card owners, you are supposed to output the various statistics according to the given queries.

Input Specification:

Each input file contains one test case. For each case, the first line gives two positive integers N (≤104) and M (≤100), the numbers of cards and the queries, respectively.

Then N lines follow, each gives a card number and the owner's score (integer in [0,100]), separated by a space.

After the info of testees, there are M lines, each gives a query in the format Type Term, where

Type being 1 means to output all the testees on a given level, in non-increasing order of their scores. The corresponding Term will be the letter which specifies the level;
Type being 2 means to output the total number of testees together with their total scores in a given site. The corresponding Term will then be the site number;
Type being 3 means to output the total number of testees of every site for a given test date. The corresponding Term will then be the date, given in the same format as in the registration card.

Output Specification:

For each query, first print in a line Case #: input, where # is the index of the query case, starting from 1; and input is a copy of the corresponding input query. Then output as requested:

for a type 1 query, the output format is the same as in input, that is, CardNumber Score. If there is a tie of the scores, output in increasing alphabetical order of their card numbers (uniqueness of the card numbers is guaranteed);
for a type 2 query, output in the format Nt Ns where Nt is the total number of testees and Ns is their total score;
for a type 3 query, output in the format Site Nt where Site is the site number and Nt is the total number of testees at Site. The output must be in non-increasing order of Nt's, or in increasing order of site numbers if there is a tie of Nt.

If the result of a query is empty, simply print NA.

Sample Input:

8 4
B123180908127 99
B102180908003 86
A112180318002 98
T107150310127 62
A107180908108 100
T123180908010 78
B112160918035 88
A107180908021 98
1 A
2 107
3 180908
2 999

Sample Output:

Case 1: 1 A
A107180908108 100
A107180908021 98
A112180318002 98
Case 2: 2 107
3 260
Case 3: 3 180908
107 2
123 2
102 1
Case 4: 2 999
NA

题目大意：给出一组学生的准考证号和成绩，准考证号包含了等级(乙甲顶)，考场号，日期，和个人编号信息，并有三种查询方式.
查询一：给出考试等级，找出该等级的考生，按照成绩降序，若成绩相同按准考证升序排序
查询二：给出考场号，统计该考场的考生数量和总得分
查询三：给出考试日期，查询改日期下所有考场的考试人数，按照人数降序，人数相同按考场号升序排序
分析：分别按照三种查询分别进行存储，模拟即可。

按照查询一的要求，创建A、B、T三个数组，对应存储不同考试等级的考生信息；

按照查询二的要求，创建一个大小为1000的数组，数组中每一个元素存储考场中有多少人，以及该考场的总分；

按照查询三的要求，创建一个大小为100000的数组，其中先存储对应日期的考生考场号。在输出时，先创建一个大小为1000的数组，计算对应考场的总人数，再按照要求输出。

#include<algorithm>
#include <iostream>
#include  <cstdlib>
#include  <cstring>
#include   <string>
#include   <vector>
#include   <cstdio>
#include    <queue>
#include    <stack>
#include    <ctime>
#include    <cmath>
#include      <map>
#include      <set>
#define INF 0xffffffff
#define db1(x) cout<<#x<<"="<<(x)<<endl
#define db2(x,y) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<endl
#define db3(x,y,z) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<endl
#define db4(x,y,z,r) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<", "<<#r<<"="<<(r)<<endl
#define db5(x,y,z,r,w) cout<<#x<<"="<<(x)<<", "<<#y<<"="<<(y)<<", "<<#z<<"="<<(z)<<", "<<#r<<"="<<(r)<<", "<<#w<<"="<<(w)<<endl
using namespace std;

typedef struct node//按考场存分数，对应查询1
{
    string ss;
    int score;
}node;

bool cmp(node a,node b)
{
    if(a.score!=b.score)return a.score>b.score;
    return a.ss<b.ss;
}

void print_1(node *num,int len)
{
    if(len==0)printf("NA\n");
    for(int i=0;i<len;++i)
        cout<<num[i].ss<<' '<<num[i].score<<endl;
    return;
}

vector<int>times[1000005];//不同考试时间，对应查询3
typedef struct naxx
{
    int cnt,score;
}naxx;

bool cmp3(naxx a,naxx b)
{
    if(a.cnt!=b.cnt)return a.cnt>b.cnt;
    return a.score<b.score;
}

int main(void)
{
    #ifdef test
    freopen("in.txt","r",stdin);
    //freopen("in.txt","w",stdout);
    clock_t start=clock();
    #endif //test

    int n,m;scanf("%d%d",&n,&m);
    int la,lb,lt;la=lb=lt=0;

    node level_a[n+5],level_b[n+5],level_t[n+5];//不同等级考试，对应查询1

    int num[1010][2];//不同考场，对应查询2
    for(int i=0;i<=1000;++i)num[i][0]=num[i][1]=0;

    for(int i=0;i<n;++i)
    {
        string s;int a;cin>>s>>a;

        switch(s[0])//按照等级存储
        {
            case 'A':level_a[la].ss=s,level_a[la].score=a,la++;break;
            case 'B':level_b[lb].ss=s,level_b[lb].score=a,lb++;break;
            case 'T':level_t[lt].ss=s,level_t[lt].score=a,lt++;break;
        }

        int temp=(s[1]-'0')*100+(s[2]-'0')*10+(s[3]-'0');//按照考场存储
        num[temp][0]++,num[temp][1]+=a;

        int temp3=0;
        for(int j=4;j<=9;++j)temp3=temp3*10+s[j]-'0';
        times[temp3].push_back(temp);
    }
    sort(level_a,level_a+la,cmp);
    sort(level_b,level_b+lb,cmp);
    sort(level_t,level_t+lt,cmp);

    for(int q=1;q<=m;++q)
    {
        int a;char s[15];scanf("%d%s",&a,s);
        printf("Case %d: %d %s\n",q,a,s);
        if(a==1)
        {
            if(s[0]=='A')print_1(level_a,la);
            else if(s[0]=='B')print_1(level_b,lb);
            else print_1(level_t,lt);
        }
        else if(a==2)
        {
            int temp=(s[0]-'0')*100+(s[1]-'0')*10+(s[2]-'0');
            if(num[temp][0]==0)printf("NA\n");
            else printf("%d %d\n",num[temp][0],num[temp][1]);
        }
        else
        {
            int temp=0;
            for(int i=0;s[i];++i)temp=temp*10+s[i]-'0';
            if(times[temp].size()==0)printf("NA\n");
            else
            {
                naxx sum[1010];
                for(int i=0;i<=1000;++i)sum[i].cnt=0,sum[i].score=i;
                int x=times[temp].size();
                for(int i=0;i<x;++i)
                    sum[times[temp][i]].cnt++;
                sort(sum,sum+1000,cmp3);
                for(int i=0;i<=1000;++i)
                {
                    if(sum[i].cnt==0)break;
                    printf("%d %d\n",sum[i].score,sum[i].cnt);
                }
            }
        }
    }

    #ifdef test
    clockid_t end=clock();
    double endtime=(double)(end-start)/CLOCKS_PER_SEC;
    printf("\n\n\n\n\n");
    cout<<"Total time:"<<endtime<<"s"<<endl;        //s为单位
    cout<<"Total time:"<<endtime*1000<<"ms"<<endl;    //ms为单位
    #endif //test
    return 0;
}