Submission #5928690

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using LL  = long long;
using VI  = vector<LL>;
using VVI = vector<VI>;
using VB  = vector<bool>;
using VS  = vector<string>;
using PII = pair<LL, LL>;
using VP  = vector<PII>;
#define PB           push_back
#define MP           make_pair
#define SZ(a)        LL((a).size())
#define EACH(x, c)   for (auto x : (c))
#define ALL(c)       (c).begin(), (c).end()
#define REVERSE(c)   reverse(ALL(c))
#define SORT(c)      stable_sort(ALL(c))
#define RSORT(c)     stable_sort((c).rbegin(), (c).rend())
#define FSORT(c)     stable_sort(ALL(c), [] (auto& x, auto& y) {return x.first < y.first;});
#define FRSORT(c)    stable_sort(ALL(c), [] (auto& x, auto& y) {return x.first > y.first;});
#define SSORT(c)     stable_sort(ALL(c), [] (auto& x, auto& y) {return x.second < y.second;});
#define SRSORT(c)    stable_sort(ALL(c), [] (auto& x, auto& y) {return x.second > y.second;});
#define FOR(i, a, b) for (LL i = (a); i < (b); ++i)
#define REP(i, n)    FOR(i, 0, n)
#define $(x) {cout << #x << " = " << (x) << endl;}

LL calc(PII& x, PII& y, VP& X) {
    LL dx = y.first - x.first;
    LL dy = y.second - x.second;
    //$(dx);
    //$(dy);
    unordered_set<string> Y;
    EACH(e, X) {
        string s = to_string(e.first) + "," + to_string(e.second);
        Y.insert(s);
    }
    LL ret = 0;
    EACH(e, X) {
        LL nx = e.first + dx;
        LL ny = e.second + dy;
        //$(nx);
        //$(ny);
        string q = to_string(nx) + "," + to_string(ny);
        if (Y.count(q) != 0) {
            ret++;
        }
    }
    return ret;
}
        

int main() {
    LL N;
    cin >> N;
    VP X(N);
    REP(i, N) {
        LL x, y;
        cin >> x >> y;
        X[i] = MP(x, y);
    }

    LL ans = N;
    REP(i, N - 1) {
        for (LL j = i + 1; j < N; ++j) {
            LL tmp = N - calc(X[i], X[j], X);
            /*$(i);
            $(j);
            $(tmp);*/
            if (ans > tmp) ans = tmp;
        }
    }
    cout << ans << endl;
	
    return 0;
}

Submission Info

Judge Result