hdu 5071

题目概述

题目太长了，但是不难理解，额实在懒得转述了

时限

1000ms/2000

输入

第一行正整数times，代表数据组数，每组数据第一行正整数N，其后N行，每行一条指令，以及其参数para

限制

1<=times<=10;1<=N<=5000;1<=para<=1e9

输出

按题目要求输出记录日志信息

样例输入

1
18
Prior
Add 1
Chat 1
Add 2
Chat 2
Top 2
Chat 3
Untop
Chat 4
Choose 2
Chat 5
Rotate 2
Chat 4
Close 2
Add 3
Prior
Chat 2
Close 1

样例输出

Operation #1: empty.
Operation #2: success.
Operation #3: success.
Operation #4: success.
Operation #5: success.
Operation #6: success.
Operation #7: success.
Operation #8: success.
Operation #9: success.
Operation #10: success.
Operation #11: success.
Operation #12: success.
Operation #13: success.
Operation #14: close 2 with 8.
Operation #15: success.
Operation #16: success.
Operation #17: success.
Operation #18: close 1 with 11.
Bye 3: 2

讨论

模拟，不过代码规模会异常庞大，考验基本代码力和代码整洁度的时候，另外有些细节需要谨慎，其一，每行最后都有一个英文句号，其二，Top并不需要真的移动位置，只是给予一个特殊地位，这个地位只对Untop,Chat,Close和Bye有影响，对Close体现在同时需要撤除Top地位，其三，Bye需要先对Top的说，然后是对说过话的说，而Close无论是否说过话都要输出，其四，Top失败并不会对之前Top的产生影响，总之，由于代码量巨大，稍不留神就会WA

题解状态

62MS，1656K，3173 B，G++

题解代码

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<list>
#include<map>
#include<set>
using namespace std;
#define INF 0x3f3f3f3f  
#define MAXN 100003
#define memset0(a) memset(a,0,sizeof(a))

set<int>name;//名单 方便快速查找某人是否存在
map<int, long long>words;//说过的单词数 由于参数范围巨大 因而使用long long
list<int>q;//queue 模拟队列 方便增删
char cmd[10];//指令
int top;//置顶者 由于没有优先级为0的 因而以0作为没有置顶者
inline void Add(int para)
{
    if (name.find(para) != name.end()) {
        printf("same priority.\n");//output
        return;
    }
    name.insert(para);
    words[para] = 0;
    q.push_back(para);
    printf("success.\n");//output
}
inline void Close(int para)
{
    if (name.find(para) == name.end()) {
        printf("invalid priority.\n");//output
        return;
    }
    if (para == top)
        top = 0;//需要同时撤销置顶地位
    printf("close %d with %lld.\n", para, words[para]);//output
    q.erase(find(q.begin(), q.end(), para));
    name.erase(para);
    words.erase(para);
}
inline void Chat(int para)
{
    if (q.empty()) {
        printf("empty.\n");//output
        return;
    }
    if (top)
        words[top] += para;
    else
        words[q.front()] += para;
    printf("success.\n");//output
}
inline void Rotate(int para)
{
    if (para<1 || para>q.size()) {
        printf("out of range.\n");//output
        return;
    }
    auto it = q.begin();
    for (int p = 1; p < para; p++)
        ++it;
    q.push_front(*it);
    q.erase(it);
    printf("success.\n");//output
}
inline void Prior()
{
    if (q.empty()) {
        printf("empty.\n");//output
        return;
    }
    auto it = find(q.begin(), q.end(), *name.rbegin());
    q.push_front(*it);
    q.erase(it);
    printf("success.\n");//output
}
inline void Choose(int para)
{
    if (name.find(para) == name.end()) {
        printf("invalid priority.\n");//output
        return;
    }
    auto it = find(q.begin(), q.end(), para);
    q.push_front(*it);
    q.erase(it);
    printf("success.\n");//output
}
inline void Top(int para)
{
    if (name.find(para) == name.end()) {
        printf("invalid priority.\n");//output
        return;
    }
    top = para;//可以看出并没有位置移动操作
    printf("success.\n");//output
}
inline void Untop()
{
    if (!top) {
        printf("no such person.\n");//output
        return;
    }
    top = 0;
    printf("success.\n");//output
}
inline void Bye()
{
    if (top&&words[top]) {
        printf("Bye %d: %lld\n", top, words[top]);//output
        q.erase(find(q.begin(), q.end(), top));
    }
    for (auto it = q.begin(); it != q.end(); it++)
        if (words[*it])
            printf("Bye %d: %lld\n", *it, words[*it]);//output
}
void fun(int N)
{
    for (int p = 0; p < N; p++) {
        scanf("%s", cmd);//input
        printf("Operation #%d: ", p + 1);//output
        int para;//参数
        switch (cmd[0]) {//以单字符匹配方式可以较快解决问题
            case'A':
                scanf("%d", &para);//input
                Add(para);
                break;
            case'C':
                switch (cmd[3]) {
                    case's':
                        scanf("%d", &para);//input
                        Close(para);
                        break;
                    case't':
                        scanf("%d", &para);//input
                        Chat(para);
                        break;
                    case'o':
                        scanf("%d", &para);//input
                        Choose(para);
                        break;
                }
                break;//这个break若忘记 则完成上述三项中任意操作后还会再进行一次Rotate
            case'R':
                scanf("%d", &para);//input
                Rotate(para);
                break;
            case'P':
                Prior();
                break;
            case'T':
                scanf("%d", &para);//input
                Top(para);
                break;
            case'U':
                Untop();
                break;
        }
    }
    Bye();
}
int main(void)
{
    //freopen("vs_cin.txt", "r", stdin);
    //freopen("vs_cout.txt", "w", stdout);

    int times;
    scanf("%d", &times);//input
    while (times--) {
        int N;
        scanf("%d", &N);//input
        fun(N);
        name.clear();
        words.clear();
        q.clear();
        top = 0;
    }
}

EOF