uva 814 The Letter Carrier's Rounds

#include<iostream>
#include<cstdio>
#include<set>
#include<vector>
#include<map>
#include<cstring>
using namespace std;
void parse_address(const string &s,string &user,string &mta)
{
    int k=(int)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 <<endl;
            cout << "     HELO " << mta1 << "\n";
            cout << "     250\n";
            cout << "     MAIL FROM:<" << s << ">\n";
            cout << "     250\n";
            bool ok=false;
            for(int j=0;j<users.size();j++)
            {
                cout << "     RCPT TO:<" << users[j] << ">\n";
                if(addr.count(users[j])) { ok = true; cout << "     250\n"; }
                else cout << "     550\n";
            }
            if(ok)
            {
                cout << "     DATA\n";
                cout << "     354\n";
                cout << data;
                cout << "     .\n";
                cout << "     250\n";
            }
            cout << "     QUIT\n";
            cout << "     221\n";
        }
    }
    return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值