test/yosupo/closest_pair.test.cpp

• View this file on GitHub
• Last update: 2024-09-28 19:54:09+09:00
• Problem: https://judge.yosupo.jp/problem/closest_pair

Depends on

• 最近点対 (src/Geometry/closest_pair.hpp)
• 点 (src/Geometry/Point.hpp)
• int から long long などのテンプレート (src/Internal/long_traits.hpp)

Code

// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/closest_pair
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
#include <iostream>
#include <vector>
#include "src/Geometry/closest_pair.hpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 using namespace geo;
 int T;
 cin >> T;
 while (T--) {
  int N;
  cin >> N;
  vector<Point<int>> ps(N);
  for (int i= 0; i < N; ++i) cin >> ps[i];
  auto [p0, p1]= closest_pair(ps);
  int ans0= -1, ans1= -1;
  for (int i= N; i--;) {
   if (ps[i] == p0 && ans0 == -1) ans0= i;
   else if (ps[i] == p1 && ans1 == -1) ans1= i;
  }
  cout << ans0 << ' ' << ans1 << '\n';
 }
 return 0;
}

#line 1 "test/yosupo/closest_pair.test.cpp"
// competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/closest_pair
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
#include <iostream>
#include <vector>
#line 3 "src/Geometry/closest_pair.hpp"
#include <algorithm>
#line 3 "src/Geometry/Point.hpp"
#include <fstream>
#include <iomanip>
#include <cmath>
#include <cassert>
#line 2 "src/Internal/long_traits.hpp"
// clang-format off
template<class T>struct make_long{using type= T;};
template<>struct make_long<char>{using type= short;};
template<>struct make_long<unsigned char>{using type= unsigned short;};
template<>struct make_long<short>{using type= int;};
template<>struct make_long<unsigned short>{using type= unsigned;};
template<>struct make_long<int>{using type= long long;};
template<>struct make_long<unsigned>{using type= unsigned long long;};
template<>struct make_long<long long>{using type= __int128_t;};
template<>struct make_long<unsigned long long>{using type= __uint128_t;};
template<>struct make_long<float>{using type= double;};
template<>struct make_long<double>{using type= long double;};
template<class T> using make_long_t= typename make_long<T>::type;
// clang-format on
#line 8 "src/Geometry/Point.hpp"
namespace geo {
using namespace std;
struct Visualizer {
 ofstream ofs;
 Visualizer(string s= "visualize.txt"): ofs(s) { ofs << fixed << setprecision(10); }
 friend Visualizer &operator<<(Visualizer &vis, const string &s) { return vis.ofs << s, vis; }
};
template <class K> int sgn(K x) {
 if constexpr (is_floating_point_v<K>) {
  static constexpr K EPS= 1e-9;
  return x < -EPS ? -1 : x > EPS;
 } else return x < 0 ? -1 : x > 0;
}
template <class K> K err_floor(K x) {
 K y= floor(x);
 if constexpr (is_floating_point_v<K>)
  if (K z= y + 1, w= x - z; 0 <= sgn(w) && sgn(w - 1) < 0) return z;
 return y;
}
template <class K> K err_ceil(K x) {
 K y= ceil(x);
 if constexpr (is_floating_point_v<K>)
  if (K z= y - 1, w= x - z; 0 < sgn(w + 1) && sgn(w) <= 0) return z;
 return y;
}
template <class K> struct Point {
 K x, y;
 Point(K x= K(), K y= K()): x(x), y(y) {}
 Point &operator+=(const Point &p) { return x+= p.x, y+= p.y, *this; }
 Point &operator-=(const Point &p) { return x-= p.x, y-= p.y, *this; }
 Point &operator*=(K a) { return x*= a, y*= a, *this; }
 Point &operator/=(K a) { return x/= a, y/= a, *this; }
 Point operator+(const Point &p) const { return {x + p.x, y + p.y}; }
 Point operator-(const Point &p) const { return {x - p.x, y - p.y}; }
 Point operator*(K a) const { return {x * a, y * a}; }
 Point operator/(K a) const { return {x / a, y / a}; }
 friend Point operator*(K a, const Point &p) { return {a * p.x, a * p.y}; }
 Point operator-() const { return {-x, -y}; }
 bool operator<(const Point &p) const {
  int s= sgn(x - p.x);
  return s ? s < 0 : sgn(y - p.y) < 0;
 }
 bool operator>(const Point &p) const { return p < *this; }
 bool operator<=(const Point &p) const { return !(p < *this); }
 bool operator>=(const Point &p) const { return !(*this < p); }
 bool operator==(const Point &p) const { return !sgn(x - p.x) && !sgn(y - p.y); }
 bool operator!=(const Point &p) const { return sgn(x - p.x) || sgn(y - p.y); }
 Point operator!() const { return {-y, x}; }  // rotate 90 degree
 friend istream &operator>>(istream &is, Point &p) { return is >> p.x >> p.y; }
 friend ostream &operator<<(ostream &os, const Point &p) { return os << "(" << p.x << ", " << p.y << ")"; }
 friend Visualizer &operator<<(Visualizer &vis, const Point &p) { return vis.ofs << p.x << " " << p.y << "\n", vis; }
};
template <class K> make_long_t<K> dot(const Point<K> &p, const Point<K> &q) { return make_long_t<K>(p.x) * q.x + make_long_t<K>(p.y) * q.y; }
// left turn: > 0, right turn: < 0
template <class K> make_long_t<K> cross(const Point<K> &p, const Point<K> &q) { return make_long_t<K>(p.x) * q.y - make_long_t<K>(p.y) * q.x; }
template <class K> make_long_t<K> norm2(const Point<K> &p) { return dot(p, p); }
template <class K> long double norm(const Point<K> &p) { return sqrt(norm2(p)); }
template <class K> make_long_t<K> dist2(const Point<K> &p, const Point<K> &q) { return norm2(p - q); }
template <class T, class U> long double dist(const T &a, const U &b) { return sqrt(dist2(a, b)); }
enum CCW { COUNTER_CLOCKWISE, CLOCKWISE, ONLINE_BACK, ONLINE_FRONT, ON_SEGMENT };
ostream &operator<<(ostream &os, CCW c) { return os << (c == COUNTER_CLOCKWISE ? "COUNTER_CLOCKWISE" : c == CLOCKWISE ? "CLOCKWISE" : c == ONLINE_BACK ? "ONLINE_BACK" : c == ONLINE_FRONT ? "ONLINE_FRONT" : "ON_SEGMENT"); }
template <class K> CCW ccw(const Point<K> &p0, const Point<K> &p1, const Point<K> &p2) {
 Point a= p1 - p0, b= p2 - p0;
 int s;
 if constexpr (is_floating_point_v<K>) s= sgn(sgn(cross(a, b) / sqrt(norm2(a) * norm2(b))));
 else s= sgn(cross(a, b));
 if (s) return s > 0 ? COUNTER_CLOCKWISE : CLOCKWISE;
 if (K d= dot(a, b); sgn(d) < 0) return ONLINE_BACK;
 else return sgn(d - norm2(a)) > 0 ? ONLINE_FRONT : ON_SEGMENT;
}
template <class K> struct Line;
template <class K> struct Segment;
template <class K> class Polygon;
template <class K> struct Convex;
template <class K> struct Affine {
 K a00= 1, a01= 0, a10= 0, a11= 1;
 Point<K> b;
 Point<K> operator()(const Point<K> &p) const { return {a00 * p.x + a01 * p.y + b.x, a10 * p.x + a11 * p.y + b.y}; }
 Line<K> operator()(const Line<K> &l);
 Segment<K> operator()(const Segment<K> &s);
 Polygon<K> operator()(const Polygon<K> &p);
 Convex<K> operator()(const Convex<K> &c);
 Affine operator*(const Affine &r) const { return {a00 * r.a00 + a01 * r.a10, a00 * r.a01 + a01 * r.a11, a10 * r.a00 + a11 * r.a10, a10 * r.a01 + a11 * r.a11, (*this)(r)}; }
 Affine &operator*=(const Affine &r) { return *this= *this * r; }
};
template <class K> Affine<K> translate(const Point<K> &p) { return {1, 0, 0, 1, p}; }
}
#line 5 "src/Geometry/closest_pair.hpp"
namespace geo {
template <class K> pair<Point<K>, Point<K>> closest_pair(vector<Point<K>> ps) {
 using L= make_long_t<K>;
 int n= ps.size();
 assert(n >= 2);
 sort(ps.begin(), ps.end(), [](const Point<K> &p, const Point<K> &q) { return p.y < q.y; });
 vector<Point<K>> memo(n);
 pair<Point<K>, Point<K>> ret= {ps[0], ps[1]};
 L best= dist2(ps[0], ps[1]), tmp;
 auto rec= [&](auto &rec, int l, int r) -> void {
  if (r - l == 1) return;
  int m= (l + r) / 2;
  K y= ps[m].y, d;
  rec(rec, l, m), rec(rec, m, r), inplace_merge(ps.begin() + l, ps.begin() + m, ps.begin() + r);
  for (int i= l, cnt= 0; i < r; ++i) {
   if (d= ps[i].y - y; L(d) * d >= best) continue;
   for (int j= cnt; j--;) {
    if (d= ps[i].x - memo[j].x, tmp= L(d) * d; tmp >= best) break;
    if (d= ps[i].y - memo[j].y, tmp+= L(d) * d; best > tmp) best= tmp, ret= {ps[i], memo[j]};
   }
   memo[cnt++]= ps[i];
  }
 };
 return rec(rec, 0, n), ret;
}
}
#line 7 "test/yosupo/closest_pair.test.cpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 using namespace geo;
 int T;
 cin >> T;
 while (T--) {
  int N;
  cin >> N;
  vector<Point<int>> ps(N);
  for (int i= 0; i < N; ++i) cin >> ps[i];
  auto [p0, p1]= closest_pair(ps);
  int ans0= -1, ans1= -1;
  for (int i= N; i--;) {
   if (ps[i] == p0 && ans0 == -1) ans0= i;
   else if (ps[i] == p1 && ans1 == -1) ans1= i;
  }
  cout << ans0 << ' ' << ans1 << '\n';
 }
 return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-13	all_same_00	AC	93 ms	4 MB
g++-13	example_00	AC	6 ms	4 MB
g++-13	fix_near_grid_00	AC	171 ms	18 MB
g++-13	fix_near_grid_01	AC	171 ms	18 MB
g++-13	max_colinear_00	AC	134 ms	18 MB
g++-13	max_colinear_01	AC	131 ms	18 MB
g++-13	max_random_00	AC	181 ms	18 MB
g++-13	max_random_01	AC	114 ms	18 MB
g++-13	max_random_02	AC	138 ms	18 MB
g++-13	max_random_03	AC	164 ms	18 MB
g++-13	max_random_04	AC	178 ms	18 MB
g++-13	max_random_05	AC	114 ms	18 MB
g++-13	max_random_06	AC	144 ms	18 MB
g++-13	max_random_07	AC	163 ms	18 MB
g++-13	mid_random_00	AC	135 ms	4 MB
g++-13	mid_random_01	AC	112 ms	4 MB
g++-13	mid_random_02	AC	122 ms	4 MB
g++-13	near_circle_00	AC	142 ms	18 MB
g++-13	near_circle_01	AC	141 ms	18 MB
g++-13	near_grid_00	AC	175 ms	18 MB
g++-13	near_grid_01	AC	175 ms	18 MB
g++-13	small_random_00	AC	120 ms	4 MB
g++-13	small_random_01	AC	94 ms	4 MB
g++-13	small_random_02	AC	98 ms	4 MB
g++-13	small_random_03	AC	100 ms	4 MB
g++-13	small_random_04	AC	120 ms	4 MB
g++-13	small_random_05	AC	94 ms	4 MB
g++-13	small_random_06	AC	97 ms	4 MB
g++-13	small_random_07	AC	99 ms	4 MB
clang++-18	all_same_00	AC	100 ms	4 MB
clang++-18	example_00	AC	6 ms	4 MB
clang++-18	fix_near_grid_00	AC	171 ms	18 MB
clang++-18	fix_near_grid_01	AC	172 ms	18 MB
clang++-18	max_colinear_00	AC	144 ms	18 MB
clang++-18	max_colinear_01	AC	142 ms	18 MB
clang++-18	max_random_00	AC	176 ms	18 MB
clang++-18	max_random_01	AC	126 ms	18 MB
clang++-18	max_random_02	AC	139 ms	18 MB
clang++-18	max_random_03	AC	156 ms	18 MB
clang++-18	max_random_04	AC	173 ms	18 MB
clang++-18	max_random_05	AC	127 ms	18 MB
clang++-18	max_random_06	AC	139 ms	18 MB
clang++-18	max_random_07	AC	155 ms	18 MB
clang++-18	mid_random_00	AC	134 ms	4 MB
clang++-18	mid_random_01	AC	108 ms	4 MB
clang++-18	mid_random_02	AC	121 ms	4 MB
clang++-18	near_circle_00	AC	158 ms	18 MB
clang++-18	near_circle_01	AC	159 ms	18 MB
clang++-18	near_grid_00	AC	174 ms	18 MB
clang++-18	near_grid_01	AC	177 ms	18 MB
clang++-18	small_random_00	AC	120 ms	4 MB
clang++-18	small_random_01	AC	93 ms	4 MB
clang++-18	small_random_02	AC	96 ms	4 MB
clang++-18	small_random_03	AC	98 ms	4 MB
clang++-18	small_random_04	AC	120 ms	4 MB
clang++-18	small_random_05	AC	92 ms	4 MB
clang++-18	small_random_06	AC	96 ms	4 MB
clang++-18	small_random_07	AC	98 ms	4 MB

Back to top page