結果

問題 No.2355 Unhappy Back Dance
ユーザー Kude
提出日時 2023-06-16 22:40:56
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 4,384 bytes
コンパイル時間 2,589 ms
コンパイル使用メモリ 229,240 KB
最終ジャッジ日時 2025-02-14 06:46:03
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 28 WA * 9
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
struct Vec {
using etype = long long; // type of elements
using ptype = __int128; // type of product results
etype x = 0, y = 0;
constexpr Vec operator-() const { return {-x, -y}; }
friend constexpr Vec operator+(const Vec& a, const Vec& b) { return {a.x + b.x, a.y + b.y}; }
friend constexpr Vec operator-(const Vec& a, const Vec& b) { return {a.x - b.x, a.y - b.y}; }
friend constexpr ptype operator*(const Vec& a, const Vec& b) { return (ptype)a.x * b.y - (ptype)a.y * b.x; }
template <class T, enable_if_t<is_integral_v<T>>* = nullptr>
friend constexpr Vec operator*(T c, const Vec& a) { return {c * a.x, c * a.y}; }
template <class T, enable_if_t<is_integral_v<T>>* = nullptr>
friend constexpr Vec operator*(const Vec& a, T c) { return c * a; }
template <class T, enable_if_t<is_integral_v<T>>* = nullptr>
friend constexpr Vec operator/(const Vec& a, T c) { return {a.x / c, a.y / c}; }
Vec& operator+=(const Vec& a) { x += a.x; y += a.y; return *this; }
Vec& operator-=(const Vec& a) { x -= a.x; y -= a.y; return *this; }
template <class T, enable_if_t<is_integral_v<T>>* = nullptr>
Vec& operator*=(T c) { x *= c; y *= c; return *this; }
friend constexpr bool operator==(const Vec& a, const Vec& b) { return a.x == b.x && a.y == b.y; }
friend constexpr bool operator!=(const Vec& a, const Vec& b) { return !(a == b); }
constexpr int quadrant() const { return y > 0 ? (x > 0 ? 0 : 1) : y < 0 ? (x < 0 ? 2 : 3) : (x > 0 ? 0 : x < 0 ? 2 : -1); }
friend constexpr bool operator<(const Vec& a, const Vec& b) {
int qa = a.quadrant(), qb = b.quadrant();
if (qa != qb) return qa < qb;
ptype p1 = (ptype)a.x * b.y, p2 = (ptype)a.y * b.x;
return p1 > p2 || (p1 == p2 && (a.x != 0 ? abs(a.x) < abs(b.x) : abs(a.y) < abs(b.y)));
}
friend constexpr bool operator>(const Vec& a, const Vec& b) { return b < a; }
friend constexpr bool operator<=(const Vec& a, const Vec& b) { return !(b < a); }
friend constexpr bool operator>=(const Vec& a, const Vec& b) { return !(a < b); }
constexpr int ccw(const Vec& u, const Vec& v) const { ptype p = (u - *this) * (v - *this); return p > 0 ? 1 : p < 0 ? -1 : 0; }
static constexpr bool intersects(const Vec& a, const Vec& b, const Vec& c, const Vec& d) { return a.ccw(b, c) * a.ccw(b, d) <= 0 && c.ccw(d, a) * c
      .ccw(d, b) <= 0; }
constexpr bool parallel_to(const Vec& a) const { return (ptype)x * a.y == (ptype)y * a.x; }
constexpr ptype dot(const Vec& a) const { return (ptype)x * a.x + (ptype)y * a.y; }
constexpr ptype norm2() const { return (ptype)x * x + (ptype)y * y; }
constexpr bool is_zero() const { return x == 0 && y == 0; }
constexpr Vec normalize() const {
etype g = gcd(x, y);
return *this / g;
}
constexpr Vec rot90() const { return {-y, x}; }
// exclusive
constexpr bool in_between(const Vec& a, const Vec& b) const {
Vec x = a - *this, y = b - *this;
return x.parallel_to(y) && x.dot(y) < 0;
}
friend std::ostream& operator<< (std::ostream& os, const Vec& t) { return os << t.x << ' ' << t.y; }
friend std::istream& operator>> (std::istream& os, Vec& t) { return os >> t.x >> t.y; }
};
} int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n;
cin >> n;
vector<Vec> v(n);
for(auto& vi: v) cin >> vi;
int ans = 0;
rep(i, n) {
static vector<Vec> d;
d.clear();
rep(j, n) if (j != i) {
d.push_back((v[j] - v[i]).normalize());
}
sort(all(d));
int mx = 1;
for(int i = 0; i < n - 1;) {
int j = i + 1;
while(j < n - 1 && d[j] == d[i]) j++;
chmax(mx, j - i);
i = j;
}
ans += mx - 1;
}
cout << ans << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0