結果

問題 No.2769 Number of Rhombi
ユーザー noya2noya2
提出日時 2024-05-31 22:10:07
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,036 ms / 5,000 ms
コード長 5,169 bytes
コンパイル時間 3,565 ms
コンパイル使用メモリ 263,728 KB
実行使用メモリ 42,496 KB
最終ジャッジ日時 2024-05-31 22:10:37
合計ジャッジ時間 27,676 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
6,812 KB
testcase_01 AC 2 ms
6,812 KB
testcase_02 AC 2 ms
6,944 KB
testcase_03 AC 386 ms
33,280 KB
testcase_04 AC 399 ms
30,848 KB
testcase_05 AC 349 ms
22,528 KB
testcase_06 AC 462 ms
27,648 KB
testcase_07 AC 643 ms
33,408 KB
testcase_08 AC 604 ms
34,176 KB
testcase_09 AC 686 ms
35,584 KB
testcase_10 AC 699 ms
37,760 KB
testcase_11 AC 732 ms
39,680 KB
testcase_12 AC 764 ms
40,960 KB
testcase_13 AC 783 ms
41,856 KB
testcase_14 AC 805 ms
42,240 KB
testcase_15 AC 808 ms
42,240 KB
testcase_16 AC 783 ms
42,496 KB
testcase_17 AC 821 ms
42,368 KB
testcase_18 AC 841 ms
42,368 KB
testcase_19 AC 840 ms
42,496 KB
testcase_20 AC 870 ms
42,496 KB
testcase_21 AC 855 ms
42,368 KB
testcase_22 AC 867 ms
42,368 KB
testcase_23 AC 1,036 ms
42,368 KB
testcase_24 AC 2 ms
6,944 KB
testcase_25 AC 818 ms
41,728 KB
testcase_26 AC 776 ms
42,240 KB
testcase_27 AC 805 ms
42,368 KB
testcase_28 AC 821 ms
42,368 KB
testcase_29 AC 889 ms
42,496 KB
testcase_30 AC 834 ms
42,368 KB
testcase_31 AC 764 ms
40,832 KB
testcase_32 AC 619 ms
34,048 KB
testcase_33 AC 665 ms
34,048 KB
testcase_34 AC 679 ms
36,864 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"
namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(vector<T> &v){
    sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

pll arg(ll x, ll y){
    if (x == 0) return pll(0,1);
    if (x < 0) return arg(-x,-y);
    ll g = gcd_fast(x,y);
    x /= g;
    y /= g;
    return pll(x,y);
}

pll rot90(pll xy){
    return arg(xy.second, -xy.first);
}

void solve(){
    int n; in(n);
    vector<pll> a(n); in(a);
    rep(i,n) a[i].first *= 2, a[i].second *= 2;
    using ppp = pair<pll,pll>;
    map<ppp,ll> mp;
    rep(i,n-1) repp(j,i+1,n){
        ll x = a[i].first - a[j].first;
        ll y = a[i].second - a[j].second;
        ll mx = (a[i].first + a[j].first) / 2;
        ll my = (a[i].second + a[j].second) / 2;
        mp[ppp(arg(x,y),pll(mx,my))]++;
    }
    ll ans = 0;
    for (auto [xymxmy, cnt] : mp){
        auto [xy, mxmy] = xymxmy;
        auto nxy = rot90(xy);
        ppp nkey(nxy,mxmy);
        if (mp.contains(nkey)){
            ans += mp[nkey] * cnt;
        }
    }
    out(ans/2);
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}
0