[OpenJudge-NOI]List stl

代码

#include <cstdio>
#include <iostream>
#include <cstring>
#include <list>
#include <map>
using namespace std;

map<int,list<int> > m;

int n,x,y;
char op[10000];
int main(){
    scanf("%d",&n);
    while(n--){
        scanf("%s",op);
        if(strcmp(op,"new")==0){
            scanf("%d",&x);
            m.insert(map<int,list<int> >::value_type(x,list<int>()));
        }
        if(strcmp(op,"add")==0){
            scanf("%d%d",&x,&y);
            m[x].push_back(y);
        }
        if(strcmp(op,"merge")==0){
            scanf("%d%d",&x,&y);
            m[x].merge(m[y]);
            //m[y].clear();
        }
        if(strcmp(op,"unique")==0){
            scanf("%d",&x);
            m[x].sort();
            m[x].unique();
        }
        if(strcmp(op,"out")==0){
            scanf("%d",&x);
            m[x].sort();
            list<int>::iterator it;
            for(it=m[x].begin();it!=m[x].end();it++){
                printf("%d ",*it);
            }
            printf("\n");
        }
    }
}