blob: 182c36fa69cfd8a7b5be87f046d363a167717293 (
plain)
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
|
#include <iostream>
#include <vector>
#include <string>
using std::string;
using std::vector;
using std::cin;
struct Query {
string type, name;
int number;
};
vector<Query> read_queries() {
int n;
cin >> n;
vector<Query> queries(n);
for (int i = 0; i < n; ++i) {
cin >> queries[i].type;
if (queries[i].type == "add")
cin >> queries[i].number >> queries[i].name;
else
cin >> queries[i].number;
}
return queries;
}
void write_responses(const vector<string>& result) {
for (size_t i = 0; i < result.size(); ++i)
std::cout << result[i] << "\n";
}
vector<string> process_queries(const vector<Query>& queries) {
vector<string> result;
// Keep list of all existing (i.e. not deleted yet) contacts.
vector<Query> contacts;
for (size_t i = 0; i < queries.size(); ++i)
if (queries[i].type == "add") {
bool was_founded = false;
// if we already have contact with such number,
// we should rewrite contact's name
for (size_t j = 0; j < contacts.size(); ++j)
if (contacts[j].number == queries[i].number) {
contacts[j].name = queries[i].name;
was_founded = true;
break;
}
// otherwise, just add it
if (!was_founded)
contacts.push_back(queries[i]);
} else if (queries[i].type == "del") {
for (size_t j = 0; j < contacts.size(); ++j)
if (contacts[j].number == queries[i].number) {
contacts.erase(contacts.begin() + j);
break;
}
} else {
string response = "not found";
for (size_t j = 0; j < contacts.size(); ++j)
if (contacts[j].number == queries[i].number) {
response = contacts[j].name;
break;
}
result.push_back(response);
}
return result;
}
int main() {
write_responses(process_queries(read_queries()));
return 0;
}
|
