Submission #59163819

---

Source Code Expand

/*
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,sse4.2,popcnt,lzcnt")
*/

#include <bits/stdc++.h>
#define taskname ""
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define i64 long long
#define isz(x) (int)x.size()
using namespace std;

void solve() {
    int n, q;
    cin >> n >> q;
    auto check = [&](int x, int y) -> bool {
        return 0 <= x and x < n and 0 <= y and y < n;
    };
    map<pair<int, int>, int> mp;
    while (q--) {
        int x, y;
        cin >> x >> y;
        --x, --y;
        for (int i = -1; i <= 1; i += 2) for (int j = -1; j <= 1; j += 2) {
            int dx, dy;
            dx = i * 2, dy = j;
            if (check(x + dx, y + dy)) mp[{x + dx, y + dy}] = 0;
            dx = i, dy = j * 2;
            if (check(x + dx, y + dy)) mp[{x + dx, y + dy}] = 0;
        }
        mp[{x, y}] = 0;
    }
    cout << 1ll * n * n - isz(mp) << endl;
}

signed main() {

#ifndef CDuongg
    if (fopen(taskname".inp", "r"))
        assert(freopen(taskname".inp", "r", stdin)), assert(freopen(taskname".out", "w", stdout));
#else
    freopen("bai3.inp", "r", stdin);
    freopen("bai3.out", "w", stdout);
    auto start = chrono::high_resolution_clock::now();
#endif

    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t = 1; //cin >> t;
    while(t--) solve();

#ifdef CDuongg
   auto end = chrono::high_resolution_clock::now();
   cout << "\n"; for(int i = 1; i <= 100; ++i) cout << '=';
   cout << "\nExecution time: " << chrono::duration_cast<chrono::milliseconds> (end - start).count() << "[ms]" << endl;
#endif

}

Submission Info

Judge Result