<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:
    vector<string> invalidTransactions(vector<string>& transactions) {
        map<string, vector<int> > mp;
        int n = transactions.size();
        struct trans{
            string name;
            int time;
            int amount;
            string city;
            trans(string s){
                int cnt = 0;
                name = "";
                city = "";
                time = amount = 0;
                for(auto c: s){
                    if(c == ',')cnt++;
                    else if(cnt == 0)name+=c;
                    else if(cnt == 1){
                        time*=10;
                        time +=c-'0';
                    }
                    else if(cnt == 2){
                        amount*=10;
                        amount += c-'0';
                    }
                    else city += c;
                    
                }
            }
        };
        vector<trans*> a(n);
        for(int i=0;i<n;i++){
            a[i] = new trans(transactions[i]);
            cout<<a[i]->name<<" "<<a[i]->time<<" "<<a[i]->amount<<" "<<a[i]->city<<endl;
            mp[a[i]->name].push_back(i);
        }
        set<int> ans;
        for(auto &[name, vec]: mp){
            for(int i=0;i<vec.size();i++){
                if(a[vec[i]]->amount >= 1000)ans.insert(vec[i]);
                for(int k=i+1;k<vec.size();k++){
                    if(abs(a[vec[i]]->time - a[vec[k]]->time)<=60 && a[vec[i]]->city != a[vec[k]]->city){
                        ans.insert(vec[i]);
                        ans.insert(vec[k]);
                    }
                }
            }
        }
        vector<string> ret;
        for(auto x: ans){
            ret.push_back(transactions[x]);
        }
        return ret;
    }
};
17100