CodeForces - 898C Phone Numbers STL

http://codeforces.com/problemset/problem/898/C

题意：给出n个人，以及每个人的号码，如果号码a是另一个号码b的后缀，那么a就要被删除。

题解：STL代码实现，具体看代码实现。

代码：

#include<bits/stdc++.h>
#define debug cout<<"aaa"<<endl
#define d(a) cout<<a<<endl
#define pb push_back
#define mem(a,b) memset(a,b,sizeof(a))
#define LL long long
#define lson l,mid,root<<1
#define rson mid+1,r,root<<1|1
#define MIN_INT (-2147483647-1)
#define MAX_INT 2147483647
#define MAX_LL 9223372036854775807i64
#define MIN_LL (-9223372036854775807i64-1)
using namespace std;

const int N = 20 + 5;
const int M = N * N + 5;
const int mod = 1000000000 + 7;
const int INF = 0x3f3f3f3f;
const double eps = 1e-8;

map<string,vector<string> > mp;
map<string,vector<string> >::iterator it;

int main(){
	int n,num,len1,len2;
	string name,temp,a,b;
	bool flag,fflag;
	vector<string> v;
	vector<string>::iterator it1,it2;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>name>>num;
		for(int j=1;j<=num;j++){
			cin>>temp;
			mp[name].pb(temp);
		}
	}
	for(it=mp.begin();it!=mp.end();it++){
		v=it->second;
		for(it1=v.begin();it1!=v.end();){
			a=*it1;len1=a.length();
			fflag=0;
			for(it2=v.begin();it2!=v.end();it2++){
				if(it1==it2) continue;
				b=(*it2);len2=b.length();
				if(len1>len2) continue;
				flag=1;
				for(int k=0;k<len1;k++){
					if(a[k]!=b[len2-len1+k]){
						flag=0;
						break;
					}
				}
				if(flag){
					fflag=1;
					break;
				}
			}
			if(fflag){
				it1=v.erase(it1);
			}
			else{
				it1++;
			}
		}
		it->second=v;
	}
	cout<<mp.size()<<endl;
	for(it=mp.begin();it!=mp.end();it++){
		cout<<it->first<<" "<<(it->second).size()<<" ";
		for(int i=0;i<(it->second).size();i++){
			cout<<(it->second)[i]<<" ";
		}
		cout<<endl;
	}
	return 0;
}