Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // не работает
- #include <algorithm>
- #include <iostream>
- #include <set>
- #include <string>
- #include <utility>
- #include <vector>
- #include <map>
- using namespace std;
- const int MAX_RESULT_DOCUMENT_COUNT = 5;
- string ReadLine() {
- string s;
- getline(cin, s);
- return s;
- }
- int ReadLineWithNumber() {
- int result = 0;
- cin >> result;
- ReadLine();
- return result;
- }
- vector<string> SplitIntoWords(const string& text) {
- vector<string> words;
- string word;
- for (const char c : text) {
- if (c == ' ') {
- if (!word.empty()) {
- words.push_back(word);
- word.clear();
- }
- } else {
- word += c;
- }
- }
- if (!word.empty()) {
- words.push_back(word);
- }
- return words;
- }
- struct Document {
- int id;
- int relevance;
- };
- class SearchServer {
- public:
- void SetStopWords(const string& text) {
- for (const string& word : SplitIntoWords(text)) {
- stop_words_.insert(word);
- }
- }
- void AddDocument(int document_id, const string& document) {
- const vector<string> words = SplitIntoWordsNoStop(document);
- for (string word:words){
- word_to_documents_[word].insert(document_id);
- }
- }
- vector<Document> FindTopDocuments(const string& raw_query) const {
- const QueryContent query_words = ParseQuery(raw_query);
- auto matched_documents = FindAllDocuments(query_words);
- sort(matched_documents.begin(), matched_documents.end(),
- [](const Document& lhs, const Document& rhs) {
- return lhs.relevance > rhs.relevance;
- });
- if (matched_documents.size() > MAX_RESULT_DOCUMENT_COUNT) {
- matched_documents.resize(MAX_RESULT_DOCUMENT_COUNT);
- }
- return matched_documents;
- }
- private:
- map<string, set<int>> word_to_documents_;
- struct QueryContent {
- set<string> pluswords;
- set<string> minuswords;
- };
- set<string> stop_words_;
- bool IsStopWord(const string& word) const {
- return stop_words_.count(word) > 0;
- }
- vector<string> SplitIntoWordsNoStop(const string& text) const {
- vector<string> words;
- for (const string& word : SplitIntoWords(text)) {
- if (!IsStopWord(word)) {
- words.push_back(word);
- }
- }
- return words;
- }
- QueryContent ParseQuery(const string& text) const {
- QueryContent query_words;
- for (const string& word : SplitIntoWordsNoStop(text)) {
- if (word[0]!='-') query_words.pluswords.insert(word);
- else {
- query_words.minuswords.insert(word.substr(1));
- }
- }
- return query_words;
- }
- vector<Document> FindAllDocuments(const QueryContent query_words) const {
- map <int,int> document_to_relevance;
- vector<Document> matched_documents;
- for (const auto& qwr_wrd : query_words.pluswords)
- {
- if (!word_to_documents_.at(qwr_wrd).empty())
- {
- for (int id:word_to_documents_.at(qwr_wrd))
- {
- document_to_relevance[id]++;
- }
- }
- }
- for (const auto& qwr_mwrd : query_words.minuswords)
- {
- if (!word_to_documents_.at(qwr_mwrd).empty())
- {
- for (int id:word_to_documents_.at(qwr_mwrd))
- {
- document_to_relevance.erase(id);
- }
- }
- }
- for (pair<int,int> dctorlv:document_to_relevance)
- {
- matched_documents.push_back({dctorlv.first,dctorlv.second});
- }
- return matched_documents;
- }
- };
- SearchServer CreateSearchServer() {
- SearchServer search_server;
- search_server.SetStopWords(ReadLine());
- const int document_count = ReadLineWithNumber();
- for (int document_id = 0; document_id < document_count; ++document_id) {
- search_server.AddDocument(document_id, ReadLine());
- }
- return search_server;
- }
- int main() {
- const SearchServer search_server = CreateSearchServer();
- const string query = ReadLine();
- for (const auto& [document_id, relevance] : search_server.FindTopDocuments(query)) {
- cout << "{ document_id = "s << document_id << ", "
- << "relevance = "s << relevance << " }"s << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement