Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "pch.h"
- #include <iostream>
- #include <string>
- #include <map>
- #include <set>
- #include <vector>
- #include <algorithm>
- #include <chrono>
- using namespace std;
- using namespace std::chrono;
- int main() {
- map<string, set<string>> words;
- int q;
- cin >> q;
- for (int i = 0; i < q; i++) {
- string comand;
- cin >> comand;
- if (comand == "ADD") {
- auto start = steady_clock::now();
- string s1, s2;
- cin >> s1 >> s2;
- words[s1].insert(s2);
- words[s2].insert(s1);
- auto finish = steady_clock::now();
- cout << "ADD" << duration_cast<milliseconds>(finish - start).count() << "ms" << endl;
- }
- else if (comand == "COUNT") {
- auto start = steady_clock::now();
- string s;
- cin >> s;
- cout << words[s].size() << endl;
- auto finish = steady_clock::now();
- cout << "COUNT" << duration_cast<milliseconds>(finish - start).count() << "ms" << endl;
- }
- else if (comand == "CHECK") {
- auto start = steady_clock::now();
- string s1, s2;
- cin >> s1 >> s2;
- if (words[s1].count(s2) == 0) {
- cout << "NO" << endl;
- }
- else {
- cout << "YES" << endl;
- }
- auto finish = steady_clock::now();
- cout << "CHECK" << duration_cast<milliseconds>(finish - start).count() << "ms" << endl;
- }
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement