7-15 字符串关键字的散列映射 (25分)

#include<bits/stdc++.h>
using namespace std;
int m[10010];
map<string,int> mp;
int sort(string s,int p){
	int len = s.size() - 1;
	stack<int> stk;
	if(len == 0) return (s[0] - 'A') % p;
	if(len == 1) return ((s[0] - 'A')*32+(s[1] - 'A')) % p;
	for(int i = 1;i <= 3;i++)stk.push(s[len--] - 'A');
	int n = 0;
	for(int i = 0;i < 3;i++){
		n = n * 32 + stk.top();
		stk.pop();
	}
	return n % p;
}
int check(int pos,int p){
	if(m[pos] == -1)return pos;
	else {
		int i = 1;
		while(true){
			if(m[(pos + i * i) % p] == -1)return (pos + i * i) % p;
			else if(m[(pos - i * i + p) % p] == -1)return (pos - i * i + p) % p;
			++i;
		}
	}
}
int main(){
	int n,p,key;
	cin>>n>>p;
	queue<int>q;
	for(int i = 0;i < p;i++)m[i] = -1;
	for(int i = 0;i < n;i++){
		string s;
		cin>>s;
		if(mp[s] == 0)mp[s] = key = check(sort(s,p),p);
		else key = mp[s];
		if(i == 0)cout<<key;
		else cout<<" "<<key;
		m[key] = 0;
	}
}