UVA 814 The Letter Carrier's Rounds

题目链接：https://vjudge.net/problem/UVA-814

英文题翻译题，模拟题，格式题，好吧，套紫书的题，突然怀疑人生。

#include <set>
#include <map>
#include <cstdio>
#include <vector>
#include <string>
#include <iostream>
using namespace std;
void parse_address(const string& s, string& user, string& mta) {
	int k = s.find('@');
	user = s.substr(0, k);
	mta = s.substr(k+1);
}

int main() {
	int k;
	string s, t, user1, mta1, user2, mta2;
	set<string> addr;
	while(cin >> s && s != "*") {
		cin >> s >> k;
		while(k--) {
			cin >> t;
			addr.insert(t + "@" + s);
		}
	}
	
	while(cin >> s && s != "*") {
		parse_address(s, user1, mta1);
		vector<string> mta;
		map<string, vector<string> > dest;
		set<string> vis;
		while(cin >> t && t != "*") {
			parse_address(t, user2, mta2);
			if(vis.count(t)) continue;
			vis.insert(t);
			if(!dest.count(mta2)) {
				mta.push_back(mta2);
				dest[mta2] = vector<string>();
			}
			dest[mta2].push_back(t);
		}
		getline(cin , t);
		
		string data;
		while(getline(cin, t) && t[0] != '*') 
		data += "     " + t + "\n";
		for(int i = 0; i < mta.size(); i++) {
			string mta2 = mta[i];
			vector<string> users = dest[mta2];
			cout << "Connection between " << mta1 << " and " << mta2<<"\n";
			cout << "     HELO " << mta1 <<"\n     250\n";
			cout << "     MAIL FROM:<" << s << ">\n     250\n";
			bool ok = false;
			for(int i = 0; i < users.size(); i++) {
				cout << "     RCPT TO:<" << users[i] << ">\n";
				if(addr.count(users[i])) {
					ok = true;
					printf("     250\n");
				}
				else printf("     550\n");
			}
			if(ok) {
				cout<< "     DATA\n     354\n" << data << "     .\n     250\n";
			}
			printf("     QUIT\n     221\n");
		}
	}
	return 0;
}