<p>A transaction is possibly invalid if:</p>

<ul>
	<li>the amount exceeds <code>$1000</code>, or;</li>
	<li>if it occurs within (and including) <code>60</code> minutes of another transaction with the <strong>same name</strong> in a <strong>different city</strong>.</li>
</ul>

<p>You are given an array of strings <code>transaction</code> where <code>transactions[i]</code> consists of comma-separated values representing the name, time (in minutes), amount, and city of the transaction.</p>

<p>Return a list of <code>transactions</code> that are possibly invalid. You may return the answer in <strong>any order</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Output:</strong> [&quot;alice,20,800,mtv&quot;,&quot;alice,50,100,beijing&quot;]
<strong>Explanation:</strong> The first transaction is invalid because the second transaction occurs within a difference of 60 minutes, have the same name and is in a different city. Similarly the second one is invalid too.</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;alice,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;alice,50,1200,mtv&quot;]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> transactions = [&quot;alice,20,800,mtv&quot;,&quot;bob,50,1200,mtv&quot;]
<strong>Output:</strong> [&quot;bob,50,1200,mtv&quot;]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>transactions.length &lt;= 1000</code></li>
	<li>Each <code>transactions[i]</code> takes the form <code>&quot;{name},{time},{amount},{city}&quot;</code></li>
	<li>Each <code>{name}</code> and <code>{city}</code> consist of lowercase English letters, and have lengths between <code>1</code> and <code>10</code>.</li>
	<li>Each <code>{time}</code> consist of digits, and represent an integer between <code>0</code> and <code>1000</code>.</li>
	<li>Each <code>{amount}</code> consist of digits, and represent an integer between <code>0</code> and <code>2000</code>.</li>
</ul>

struct Data {
    string name;
    int time;
    int amt;
    string city;
    bool fail;
};

class Solution {
    unordered_multimap< string, Data* > m_map;
    vector<string> m_ans;
public:
    void add(Data* data) {
        // cout << "reached add for " << data->name << '\n';
        if( data->fail == false) {
            data->fail = true;
            string val;
            val = data->name + ',';
            val += to_string(data->time) + ',';
            val += to_string(data->amt) + ',';
            val += data->city ;
            m_ans.push_back(val);
        }
    }

    vector<string> invalidTransactions(vector<string>& transactions) {
        for(auto &data: transactions) {
            int count = 0;
            string val="";
            Data * store = new Data;
            for(auto &c : data) {
                if( c == ',' ) {
                    count++;
                    if( count == 1 ) {
                        store->name = val;
                    }
                    else if ( count == 2 ) {
                        store->time = stoi(val);
                    }
                    else if( count == 3 ) {
                        store->amt = stoi(val);
                    }
                    val = "";
                    continue;
                }
                val+= c;
            }
            store->city = val;
            store->fail = false;
            if( m_map.find(store->name) != m_map.end() ) {
                auto range = m_map.equal_range(store->name);
                
                for (auto it = range.first; it!=range.second; it++) {
                    // cout << (it->second->city != store->city) <<  "," << abs(it->second->amt - store->amt)  << endl;
                    if(it->second->city != store->city && abs(it->second->time - store->time) <= 60) {
                        add(store);
                        add(it->second);
                    }
                }
            }
            if( store->amt > 1000 ) {
                add(store);
            }
            m_map.insert({store->name,store});
        }
        // for( auto it = m_map.begin(); it!=m_map.end(); it++) {
        //     cout << it->second->name <<',' << it->second->time << ',' << it->second->amt << ',' << it->second->city << '\n';
        // }
        return m_ans;
    }
};
18700