<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>

class Solution {
public:
    pair<pair<string,int>,pair<int,string>> solve(string trans){
        vector<int> comma;
        for(int i=0;i<trans.length();i++){
            if(trans[i]==',')
                comma.push_back(i);
        }
        string name=trans.substr(0,comma[0]);
        int time=stoi(trans.substr(comma[0]+1,comma[1]-comma[0]-1));
        int amount=stoi(trans.substr(comma[1]+1,comma[2]-comma[1]-1));
        string city=trans.substr(comma[2]);
        return {{name,time},{amount,city}};
    }
    vector<string> invalidTransactions(vector<string>& transactions) {
        int n=transactions.size();
        unordered_map<string, vector<pair<pair<int, int>, pair<string,int>>>> ump;
        unordered_set<int> invalid;
        for(int i=0;i<n;i++){
            string t=transactions[i];
            pair<pair<string,int>,pair<int,string>> tr=solve(t);
            string name=tr.first.first;
            int time=tr.first.second;
            int amount=tr.second.first;
            string city=tr.second.second;
            bool flag=false;
            if(ump.find(name)!=ump.end()){
                for(auto m:ump[name]){
                    if(m.second.first!=city && abs(m.first.first-time)<=60){
                        flag=true;
                        invalid.insert(i);
                        invalid.insert(m.second.second);

                    }
                }
            }
            if(!flag && amount>1000){
                invalid.insert(i);
            }
            ump[name].push_back({{time,amount},{city,i}});
        }
        vector<string> res;
        for(auto inv:invalid)
            res.push_back(transactions[inv]);

        return res;
    }
};
19600