<p>Given a <code>wordlist</code>, we want to implement a spellchecker that converts a query word into a correct word.</p>

<p>For a given <code>query</code> word, the spell checker handles two categories of spelling mistakes:</p>

<ul>
	<li>Capitalization: If the query matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the case in the wordlist.

	<ul>
		<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;YellOw&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;Yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;Yellow&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;yellow&quot;]</code>, <code>query = &quot;yellow&quot;</code>: <code>correct = &quot;yellow&quot;</code></li>
	</ul>
	</li>
	<li>Vowel Errors: If after replacing the vowels <code>(&#39;a&#39;, &#39;e&#39;, &#39;i&#39;, &#39;o&#39;, &#39;u&#39;)</code> of the query word with any vowel individually, it matches a word in the wordlist (<strong>case-insensitive</strong>), then the query word is returned with the same case as the match in the wordlist.
	<ul>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yollow&quot;</code>: <code>correct = &quot;YellOw&quot;</code></li>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yeellow&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
		<li>Example: <code>wordlist = [&quot;YellOw&quot;]</code>, <code>query = &quot;yllw&quot;</code>: <code>correct = &quot;&quot;</code> (no match)</li>
	</ul>
	</li>
</ul>

<p>In addition, the spell checker operates under the following precedence rules:</p>

<ul>
	<li>When the query exactly matches a word in the wordlist (<strong>case-sensitive</strong>), you should return the same word back.</li>
	<li>When the query matches a word up to capitlization, you should return the first such match in the wordlist.</li>
	<li>When the query matches a word up to vowel errors, you should return the first such match in the wordlist.</li>
	<li>If the query has no matches in the wordlist, you should return the empty string.</li>
</ul>

<p>Given some <code>queries</code>, return a list of words <code>answer</code>, where <code>answer[i]</code> is the correct word for <code>query = queries[i]</code>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>
<pre><strong>Input:</strong> wordlist = ["KiTe","kite","hare","Hare"], queries = ["kite","Kite","KiTe","Hare","HARE","Hear","hear","keti","keet","keto"]
<strong>Output:</strong> ["kite","KiTe","KiTe","Hare","hare","","","KiTe","","KiTe"]
</pre><p><strong class="example">Example 2:</strong></p>
<pre><strong>Input:</strong> wordlist = ["yellow"], queries = ["YellOw"]
<strong>Output:</strong> ["yellow"]
</pre>
<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= wordlist.length, queries.length &lt;= 5000</code></li>
	<li><code>1 &lt;= wordlist[i].length, queries[i].length &lt;= 7</code></li>
	<li><code>wordlist[i]</code> and <code>queries[i]</code> consist only of only English letters.</li>
</ul>

void to_lowercase(string &s) {
    ranges::for_each(s, [](char &c) { c = tolower(c); });
}

void remove_vowels(string &s) {
    ranges::replace_if(s, [](char c) {
        switch (c) {
            case 'a':
            case 'e':
            case 'i':
            case 'o':
            case 'u':
                return true;
            default:
                return false;
        }}, '*');
}

struct WordInfo {
    WordInfo() = default;
    WordInfo(const WordInfo &other) = default;
    WordInfo(const string &orig, const string &s, int i) : orig_word{orig}, word{s}, idx{i} {}
    WordInfo &operator=(const WordInfo &other) = default;
    WordInfo &operator=(WordInfo &&other) = default;
    
    
    string orig_word = "";
    string word = "";
    int idx = 0;

    /*bool operator<(const WordInfo &other) const { 
      if (word == other.word) return idx < other.idx;
      return word < other.word;
    }*/
};

/*bool operator<(const WordInfo &w1, const WordInfo &w2) {
    if (w1.word == w2.word) return w1.idx < w2.idx;
    return w1.word < w2.word;
}*/

class Processor {
  private:
    unordered_set<string> exact_matches{};
    vector<WordInfo> caps_matches{};
    vector<WordInfo> vowels_matches{};
    
  public:
    Processor(size_t n) {
        exact_matches.reserve(n);
        caps_matches.reserve(n);
        vowels_matches.reserve(n);
    }    

    void add_word(const string &s, int i) {
        exact_matches.insert(s);
        string temp = s;
        to_lowercase(temp);
        caps_matches.emplace_back(s, temp, i);
        remove_vowels(temp);
        vowels_matches.emplace_back(s, temp, i);
    }
    
    void sort_everything() {
        ranges::sort(caps_matches, [](const WordInfo &w1, const WordInfo &w2) {
    if (w1.word == w2.word) return w1.idx < w2.idx;
    return w1.word < w2.word;});
        ranges::sort(vowels_matches, [](const WordInfo &w1, const WordInfo &w2) {
    if (w1.word == w2.word) return w1.idx < w2.idx;
    return w1.word < w2.word;});
    }
    
    string matches(const string &s) const {
        if (exact_matches.count(s)) return s;
        return matches_caps(s);
    }
    
    string matches_caps(const string &s) const {
        auto temp = s;
        to_lowercase(temp);
        auto it = ranges::lower_bound(caps_matches, temp, {}, [](const auto &wi) {
            return wi.word;
        });
        if (it == ranges::cend(caps_matches) || it->word != temp) return matches_wildcard(s);
        return it->orig_word;
    }
    
    string matches_wildcard(const string &s) const {
        auto temp = s;
        to_lowercase(temp);
        remove_vowels(temp);
        auto it = ranges::lower_bound(vowels_matches, temp, {}, [](const auto &wi) {
            return wi.word;
        });
        if (it == ranges::cend(vowels_matches) || it->word != temp) return "";
        return it->orig_word;
    }
};

class Solution {
public:
    vector<string> spellchecker(vector<string>& wordlist, vector<string>& queries) {
        const int n = size(wordlist), q = size(queries);
        Processor p(n);
        for (int i = 0; i < n; ++i) {
            p.add_word(wordlist[i], i);
        }
        p.sort_everything();
        vector<string> ans(q);
        for (int i = 0; i < q; ++i) {
            ans[i] = p.matches(queries[i]);
        }
        return ans;
    }
};
36700