Submission #4463015

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define all(x) (x).begin(),(x).end()
#define pb push_back
#define fi first
#define se second
#define dbg(x) cout<<#x" = "<<((x))<<endl
template<class T,class U> ostream& operator<<(ostream& o, const pair<T,U> &p){o<<"("<<p.fi<<","<<p.se<<")";return o;}
template<class T> ostream& operator<<(ostream& o, const vector<T> &v){o<<"[";for(T t:v){o<<t<<",";}o<<"]";return o;}

using P = pair<int,int>;
using E = pair<P,P>;

const int dx[4]={1,-1,0,0};
const int dy[4]={0,0,1,-1};

int main(){
    int n;
    cin >>n;

    set<P> points;
    set<E> edges;
    rep(pp,n){
        int x,y;
        cin >>x >>y;
        vector<P> v;
        for(P d:vector<P>({{0,0},{1,0},{1,1},{0,1}})){
            v.pb({x+d.fi, y+d.se});
        }

        // dbg(v);
        rep(i,4) points.insert(v[i]);
        rep(i,4){
            P p = v[i], q = v[(i+1)%4];
            edges.insert({min(p,q),max(p,q)});
        }
    }

    int v = points.size();
    int e = edges.size();
    int f = n+1;
    // v-e+(f+g) = 2
    int g = 2-v+e-f;
    cout << g << "\n";
    return 0;
}

Submission Info

Judge Result