hdu5071 2014 Asia AnShan Regional Contest B Chat

模拟题：

add的时候出现过的则不再添加

close的时候会影响到top

rotate（Prior、Choose）的时候会影响到top

/*===============================================================
*   Copyright (C) 2014 All rights reserved.
*   
*   File Name: hdu5071.cpp
*   Author:sunshine
*   Created Time: 2014-11-11
*
================================================================*/
#include <map>
#include <queue>
#include <stack>
#include <math.h>
#include <stdio.h>
#include <string.h>
#include <iostream>
#include <algorithm>

using namespace std;

#define SUCCESS puts("success.")
#define EMPTY puts("empty.")
#define INVALID puts("invalid priority.") 
#define SAME puts("same priority.")
#define OUT_OF_RANGE puts("out of range.")
#define NO_SUCH_PERSON puts("no such person.")

const int MAXN = 5005;

struct Node{
    int value;
    long long word_num;
    void set(int t_value){
        value = t_value;
        word_num = 0;
    }
}node[MAXN];

int top_u;// -1 is no top, value is the top number 
int que_size;
map<int,int>M;

void init(){
    top_u = -1;
    que_size = 0;
    M.clear();
}

int find_u_id(int u){
    int u_id = -1;
    for(int i = 0;i < que_size;i ++){
        if(node[i].value == u){
            u_id = i;
            break;
        }
    }
    return u_id;
}

void Rotate(int x){
    if(que_size < x){
        OUT_OF_RANGE;
    }else{
        Node tmp = node[x - 1];
        for(int i = x - 2;i >= 0;i --){
            node[i + 1] = node[i];
        }
        node[0] = tmp;
        SUCCESS;
    }
}

void Prior(){
    if(que_size == 0){
        EMPTY;
    }else{
        int max_value = -1, max_value_id = -1;
        for(int i = 0;i < que_size;i ++){
            if(node[i].value > max_value){
                max_value = node[i].value;
                max_value_id = i;
            }
        }
        Rotate(max_value_id + 1);
    }
}

void Choose(int u){
    if(M[u] == 0){
        INVALID;
    }else{
        int u_id = find_u_id(u);
        Rotate(u_id + 1);
    }
}

void Top(int u){
    if(M[u] == 0){
        INVALID;
    }else{
        top_u = u;
        SUCCESS;
    }
}

void Untop(){
    if(top_u == -1){
        NO_SUCH_PERSON;
    }else{
        top_u = -1;
        SUCCESS;
    }
}

void Add(int u){
    if(M[u] == 1){
        SAME;
    }else{
        M[u] = 1;
        node[que_size ++].set(u);
        SUCCESS;
    }
}

void Close(int u){
    if(M[u] == 0){
        INVALID;
    }else{
        M[u] = 0;
        int u_id = find_u_id(u);
        if(u == top_u) top_u = -1;
        printf("close %d with %I64d.
", u, node[u_id].word_num);
        for(int i = u_id;i < que_size;i ++){
            node[i] = node[i+1];
        }
        que_size --;
    }
}

void Chat(int w){
    if(que_size == 0){
        EMPTY;
    }else{
        if(top_u != -1){
            node[find_u_id(top_u)].word_num += w;
        }else{
            node[0].word_num += w;
        }
        SUCCESS;
    }
}

void Bye(){
    if(que_size == 0) return ;
    int top_id = -1;
    if(top_u != -1){
        top_id = find_u_id(top_u);
        if(top_id != -1 && node[top_id].word_num != 0){
            printf("Bye %d: %I64d
",node[top_id].value, node[top_id].word_num);
        }
    }
    for(int i = 0;i < que_size;i ++){
        if(i == top_id) continue;
        if(node[i].word_num == 0) continue;
        printf("Bye %d: %I64d
",node[i].value, node[i].word_num);
    }    
}

int main(){
    int T, n;
    char command[10];
    scanf("%d",&T);
    while(T --){
        scanf("%d
",&n);
        init();
        for(int i = 1;i <= n;i ++){
            scanf("%s",command);
            printf("Operation #%d: ",i);
            if(0 == strcmp("Prior",command)){
                Prior();
            }else if(0 == strcmp("Untop",command)){
                Untop();
            }else {
                int u;
                scanf("%d",&u);
                if(0 == strcmp("Add",command)){
                    Add(u);
                }else if(0 == strcmp("Close",command)){
                    Close(u);
                }else if(0 == strcmp("Chat",command)){
                    Chat(u);
                }else if(0 == strcmp("Rotate",command)){
                    Rotate(u);
                }else if(0 == strcmp("Choose",command)){
                    Choose(u);
                }else if(0 == strcmp("Top",command)){
                    Top(u);
                }
            }
        }
        Bye();
    }
    return 0;
}