701B - Cells Not Under Attack - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define ll long long 
#define ii pair<ll,ll>
#define vi vector<int>
#define forn(i,n) for(int i = 0; i < int(n); i++)
#define forsn(i,s,n) for(int i = int(s); i < int(n); i++)
#define all(v) (v).begin(),(v).end()
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL)
#define DBG(x) cerr << #x << " = " << (x) << endl
#define F first
#define S second
#define pb push_back
#define pf push_front
#define mp make_pair
#define el "\n"

int main() {
    FastIO;
    ll n,m;
    cin >> n >> m;
    map<ll, bool> cols;
    map<ll, bool> rows;
    ll r, c;
    ll tot = n*n;
    vector<ll> vec;
    while(m--) {
        bool rt = false, ct = false;
        cin >> r >> c;
        ll pos = (2*n)-1;
        // DBG(pos);

        if(rows.find(r) != rows.end()) {
            pos -= n;
            rt = true;
        } else {
            pos -= cols.size();
        }

        if(cols.find(c) != cols.end()) {
            pos -= n;
            ct = true;
        } else {
            pos-= rows.size();
        }

        if(rt and ct) {
            pos = 0;
        } else if(rt or ct) {
            pos++;
        }
        rows[r] = true;
        cols[c] = true;
        // DBG(pos);
        tot -= pos;
        vec.pb(tot);
    }
    cout << vec[0];
    for(ll i = 1; i < vec.size(); i++) {
        cout << " " << vec[i];
    }
    cout << el;
    return 0;
}