結果
問題 | No.2769 Number of Rhombi |
ユーザー |
|
提出日時 | 2024-06-01 10:13:25 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,893 ms / 5,000 ms |
コード長 | 2,260 bytes |
コンパイル時間 | 8,422 ms |
コンパイル使用メモリ | 336,396 KB |
実行使用メモリ | 81,664 KB |
最終ジャッジ日時 | 2024-12-21 15:42:25 |
合計ジャッジ時間 | 61,974 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>#include <atcoder/all>using namespace std;using namespace atcoder;istream &operator>>(istream &is, modint &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint &a) { return os << a.val(); }istream &operator>>(istream &is, modint998244353 &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint998244353 &a) { return os << a.val(); }istream &operator>>(istream &is, modint1000000007 &a) { long long v; is >> v; a = v; return is; }ostream &operator<<(ostream &os, const modint1000000007 &a) { return os << a.val(); }typedef long long ll;typedef vector<vector<int>> Graph;typedef pair<int, int> pii;typedef pair<ll, ll> pll;#define FOR(i,l,r) for (int i = l;i < (int)(r); i++)#define rep(i,n) for (int i = 0;i < (int)(n); i++)#define all(x) x.begin(), x.end()#define rall(x) x.rbegin(), x.rend()#define my_sort(x) sort(x.begin(), x.end())#define my_max(x) *max_element(all(x))#define my_min(x) *min_element(all(x))template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }const int INF = (1<<30) - 1;const ll LINF = (1LL<<62) - 1;const int MOD = 998244353;const int MOD2 = 1e9+7;const double PI = acos(-1);vector<int> di = {1,0,-1,0};vector<int> dj = {0,1,0,-1};#ifdef LOCAL# include <debug_print.hpp># define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)#else# define debug(...) (static_cast<void>(0))#endifint main(){cin.tie(0);ios_base::sync_with_stdio(false);int N; cin >> N;vector<ll> x(N), y(N);rep(i, N) cin >> x[i] >> y[i];using P = tuple<ll, ll, ll, ll>;map<P, ll> mp;rep(i, N)rep(j, N)if(i != j){ll xm = x[i] + x[j];ll ym = y[i] + y[j];ll dx = x[i] - x[j];ll dy = y[i] - y[j];ll g = __gcd(abs(dx), abs(dy));dx /= g;dy /= g;mp[P{xm, ym, dx, dy}]++;}ll ans = 0;for(auto &[dat, val] : mp){auto [xm, ym, dx, dy] = dat;if(mp.count(P{xm, ym, dy, -dx})) ans += mp[P{xm, ym, dy, -dx}] * val;}cout << ans / 4 << endl;}