hdu 3645 Code Management System

http://acm.hdu.edu.cn/showproblem.php?pid=3645

　　一道单纯的模拟，不过要非常仔细的读题，否则必然会有各种各样的错误！区域赛的模拟题就是有难度，差点又卡我一个晚上了。。。。囧！

　　给点自己debug用的数据：

Sample in:
2
Alice 1 3
[2010/07/18 12:00:00] SYNC
[2010/07/18 12:01:00] MODIFY 1
[2010/07/18 12:05:00] SUBMIT
Bob 2 3
[2010/07/18 12:00:01] SYNC
[2010/07/18 12:01:30] MODIFY 1
[2010/07/18 12:06:00] SUBMIT
2
Alice 1 3
[2010/07/18 12:05:01] SYNC
[2010/07/18 12:05:30] MODIFY 1
[2010/07/18 12:06:00] SUBMIT
Bob 2 3
[2010/07/18 12:00:01] SYNC
[2010/07/18 12:01:30] MODIFY 1
[2010/07/18 12:05:00] SUBMIT
1
Alice 1 8
[2010/07/18 12:00:00] SYNC
[2010/07/18 12:01:00] MODIFY 1
[2010/07/18 12:04:00] SUBMIT
[2010/07/18 12:05:01] MODIFY 1
[2010/07/18 12:05:02] MODIFY 2
[2010/07/18 12:06:00] SUBMIT
[2010/07/18 12:06:01] MODIFY 1
[2010/07/18 12:07:00] SUBMIT
2
Alice 10 2
[2010/07/18 12:10:00] SYNC
[2010/07/18 12:11:00] MODIFY 1
Bob 2 3
[2010/07/18 12:05:01] SYNC
[2010/07/18 12:06:30] MODIFY 1
[2010/07/18 12:07:00] SUBMIT
2
Alice 10 3
[2010/07/18 12:01:00] SYNC
[2010/07/18 12:04:00] SUBMIT
[2010/07/18 12:12:00] SUBMIT
Bob 2 3
[2010/07/18 12:05:01] SYNC
[2010/07/18 12:06:00] SUBMIT
[2010/07/18 12:06:30] MODIFY 1
0


Sample out:
1 [2010/07/18 12:06:00] BY Bob
END
1 [2010/07/18 12:06:00] BY Alice
END
1 [2010/07/18 12:07:00] BY Alice
2 [2010/07/18 12:06:00] BY Alice
END
1 [2010/07/18 12:07:00] BY Bob
END
END

　　总结一下容易错的位置：

1、题目要求的是获得代码要在上一个提交接受以后，也就是说同一个人连续提交两次，后面的一次会被忽略。

2、要注意如果修改了没有提交，那个修改编号的内容不应该输出。

3、提交了一次以后，记得要将修改队列清空。

代码如下：

/*
Auther: Lyon
Problem: hdu 3645
*/

#include <cstdio>
#include <cstring>
#include <cassert>
#include <algorithm>
#include <map>
#include <string>
#include <vector>

using namespace std;
typedef vector<int> vi;

map<string, int> pos;
map<int, int> line;
const char *resetTime = "[0000/00/00 00:00:00]";
int ttEvent, ttLine;

struct Line{
    char timeMark[30];
    int line;
    int id;
}lineInform[50001];

struct Author{
    char name[35];
    int pri;
    char syncTime[30];
    vi modify;
}author[10001];

struct Event{
    char timeMark[30];
    int op;
    int id;
}event[50001];

bool cmpEvent(const Event a, const Event b){
    return strcmp(a.timeMark, b.timeMark) < 0;
}

bool cmpLine(const Line a, const Line b){
    return a.line < b.line;
}

void pre(int n){
    int k;
    char tm1[30], tm2[15], op[10];

    ttEvent = ttLine = 0;
    pos.clear();
    line.clear();

    for (int i = 0; i < n; i++){
        scanf("%s%d%d", author[i].name, &author[i].pri, &k);
        pos[author[i].name] = i;
        author[i].modify.clear();
        while (k--){
            scanf("%s%s%s", tm1, tm2, op);
            strcat(tm1, " ");
            strcat(tm1, tm2);
            strcpy(event[ttEvent].timeMark, tm1);
            if (!strcmp(op, "SYNC")){
                event[ttEvent].op = -1;
            }
            else if (!strcmp(op, "SUBMIT")){
                event[ttEvent].op = -2;
            }
            else{
                assert(!strcmp(op, "MODIFY"));
                scanf("%d", &event[ttEvent].op);
                if (!line.count(event[ttEvent].op)){
                    line[event[ttEvent].op] = ttLine;
                    strcpy(lineInform[ttLine].timeMark, resetTime);
                    lineInform[ttLine++].line = event[ttEvent].op;
                }
            }
            event[ttEvent++].id = i;
        }
    }
    sort(event, event + ttEvent, cmpEvent);
/*
    puts("Debug:");
    for (int i = 0; i < ttEvent; i++){
        printf("%s %d %d\n", event[i].timeMark, event[i].id, event[i].op);
    }
    puts("End Debug");
    puts("");
*/
}

void run(){
    for (int i = 0; i < ttEvent; i++){
        switch (event[i].op){
            case -2:
                {
                    int id = event[i].id;
                    int pri = author[id].pri;

                    for (vi::iterator ii = author[id].modify.begin(); ii != author[id].modify.end(); ii++){
                        int linePos = line[*ii];
                        int lineID = lineInform[linePos].id;

                        //printf("cmp %s %s\n", lineInform[linePos].timeMark, author[id].syncTime);
                        if (strcmp(lineInform[linePos].timeMark, author[id].syncTime) < 0){
                            strcpy(lineInform[linePos].timeMark, event[i].timeMark);
                            lineInform[linePos].id = id;
                        }
                        else if (author[lineID].pri < pri){
                            strcpy(lineInform[linePos].timeMark, event[i].timeMark);
                            lineInform[linePos].id = id;
                        }
                    }
                    strcpy(author[id].syncTime, event[i].timeMark);
                    author[id].modify.clear();
                }
                break;
            case -1:
                {
                    strcpy(author[event[i].id].syncTime, event[i].timeMark);
                    author[event[i].id].modify.clear();
                }break;
            default:
                {
                    author[event[i].id].modify.push_back(event[i].op);
                }

        }
    }
    sort(lineInform, lineInform + ttLine, cmpLine);
}

void print(){
    for (int i = 0; i < ttLine; i++){
        if (strcmp(lineInform[i].timeMark, resetTime)) printf("%d %s BY %s\n", lineInform[i].line, lineInform[i].timeMark, author[lineInform[i].id].name);
    }
    puts("END");
}

int main(){
    int n;

//freopen("in", "r", stdin);
    while (~scanf("%d", &n) && n){
        pre(n);
        run();
        print();
    }

    return 0;
}

——written by Lyon