解題區/解題區 - UVa

UVa 814 - The Letter Carrier's Rounds

contents

  1. 1. Problem
  2. 2. Sample Input
  3. 3. Sample Output
  4. 4. Solution

Problem

模擬郵件發送的協定訊息，給定給一台 mail server 上的使用者名稱，接著發送群組訊息。

每一組發送者，會按照輸入順序的 mail server，將相同的 server 上的使用者統一發送，如果存在不合法的使用者名稱，必須回傳找不到，如果對一個 mail server 中都沒有合法使用者，則忽略此次傳送。

Sample Input

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
MTA London 4 Fiona Paul Heather Nevil
MTA SanFrancisco 3 Mario Luigi Shariff
MTA Paris 3 Jacque Suzanne Maurice
MTA HongKong 3 Chen Jeng Hee
MTA MexicoCity 4 Conrado Estella Eva Raul
MTA Cairo 3 Hamdy Tarik Misa
*
Hamdy@Cairo Conrado@MexicoCity Shariff@SanFrancisco Lisa@MexicoCity
*
Congratulations on your efforts !!
--Hamdy
*
Fiona@London Chen@HongKong Natasha@Paris
*
Thanks for the report!  --Fiona
*
*

Sample Output

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
Connection between Cairo and MexicoCity
     HELO Cairo
     250
     MAIL FROM:<Hamdy@Cairo>
     250
     RCPT TO:<Conrado@MexicoCity>
     250
     RCPT TO:<Lisa@MexicoCity>
     550
     DATA
     354
     Congratulations on your efforts !!
     --Hamdy
     .
     250
     QUIT
     221
Connection between Cairo and SanFrancisco
     HELO Cairo
     250
     MAIL FROM:<Hamdy@Cairo>
     250
     RCPT TO:<Shariff@SanFrancisco>
     250
     DATA
     354
     Congratulations on your efforts !!
     --Hamdy
     .
     250
     QUIT
     221
Connection between London and HongKong
     HELO London
     250
     MAIL FROM:<Fiona@London>
     250
     RCPT TO:<Chen@HongKong>
     250
     DATA
     354
     Thanks for the report!  --Fiona
     .
     250
     QUIT
     221
Connection between London and Paris
     HELO London
     250
     MAIL FROM:<Fiona@London>
     250
     RCPT TO:<Natasha@Paris>
     550
     QUIT
     221

Solution

一個純模擬的題目，關於此類協定可以在計算機網路中學到。

保證寄信者都是合法的，小心每一行的資訊可能很長，用 char array 很容易 buffer overflow。也因此掛了很多 WA。

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
#include <stdio.h>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <map>
#include <set>
#include <vector> 
using namespace std;
set<string> MTA;
int readMTA() {
    string cmd, mta, name;
    int n;
    while (cin >> cmd) {
        if (cmd == "*")	return 1;
        cin >> mta >> n; 
        for (int i = 0; i < n; i++) {
            cin >> name;
            MTA.insert(string(name) + "@" + string(mta));
        }
    }
    return 0;
}
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() {
    string msg;
    readMTA();
    while (cin >> msg) {
        if (msg[0] == '*')	break;	
        vector<string> user, mta, mail;
        set<string> S;
        vector<int>	used;
        string u, m;
        parse_address(msg, u, m);
        user.push_back(u), mta.push_back(m);
        while (cin >> msg && msg[0] != '*') {
            parse_address(msg, u, m);
            if (S.count(u + "@" + m))	continue;
            S.insert(u + "@" + m);
            user.push_back(u), mta.push_back(m);
        }
        while (getchar() != '\n');
        while (getline(cin, msg) && msg[0] != '*')
            mail.push_back(msg);
        used.resize(user.size(), 0);
        for (int i = 1; i < user.size(); i++) {
            if (used[i])	continue;
            printf("Connection between %s and %s\n", mta[0].c_str(), mta[i].c_str());
            printf("     HELO %s\n", mta[0].c_str());
            printf("     250\n");
            printf("     MAIL FROM:<%s@%s>\n", user[0].c_str(), mta[0].c_str());
            printf("     250\n");
            int s = 0;
            for (int j = i; j < user.size(); j++) {
                if (mta[j] == mta[i]) {
                    used[j] = 1;
                    printf("     RCPT TO:<%s@%s>\n", user[j].c_str(), mta[j].c_str());
                    if (MTA.count(user[j] + "@" + mta[j]))
                        printf("     250\n"), s++;
                    else
                        printf("     550\n");
                }
            }
            if (s > 0) {
                printf("     DATA\n");
                printf("     354\n");
                for (int j = 0; j < mail.size(); j++)
                    printf("     %s\n", mail[j].c_str());
                printf("     .\n");
                printf("     250\n");
            }
            printf("     QUIT\n");
            printf("     221\n");
        }
    }
    return 0;
}
/*
MTA London 4 Fiona Paul Heather Nevil
MTA SanFrancisco 3 Mario Luigi Shariff
MTA Paris 3 Jacque Suzanne Maurice
MTA HongKong 3 Chen Jeng Hee
MTA MexicoCity 4 Conrado Estella Eva Raul
MTA Cairo 3 Hamdy Tarik Misa
*
Hamdy@Cairo Conrado@MexicoCity Shariff@SanFrancisco Lisa@MexicoCity
*
Congratulations on your efforts !!
--Hamdy
*
Fiona@London Chen@HongKong Natasha@Paris
*
Thanks for the report!  --Fiona
*
*
*/