test/cpv/library-checker-geo/closest_pair.cpp
| Line | Branch | Exec | Source |
|---|---|---|---|
| 1 | // competitive-verifier: PROBLEM https://judge.yosupo.jp/problem/closest_pair | ||
| 2 | #include "../../../src/geo2d/min_dis_ps/lib.hpp" | ||
| 3 | #include "../../../src/io/container/lib.hpp" | ||
| 4 | |||
| 5 | using namespace tifa_libs; | ||
| 6 | using point_t = point<i64>; | ||
| 7 | |||
| 8 | 366399 | void solve() { | |
| 9 | u32 n; | ||
| 10 |
1/2✓ Branch 1 taken 366399 times.
✗ Branch 2 not taken.
|
366399 | std::cin >> n; |
| 11 |
1/2✓ Branch 1 taken 366399 times.
✗ Branch 2 not taken.
|
366399 | vec<point_t> vp(n); |
| 12 | 366399 | std::cin >> vp; | |
| 13 | 366399 | auto [l, r] = min_dis_Ps(vp); | |
| 14 |
4/8✓ Branch 1 taken 366399 times.
✗ Branch 2 not taken.
✓ Branch 4 taken 366399 times.
✗ Branch 5 not taken.
✓ Branch 7 taken 366399 times.
✗ Branch 8 not taken.
✓ Branch 10 taken 366399 times.
✗ Branch 11 not taken.
|
366399 | std::cout << l << ' ' << r << '\n'; |
| 15 | 366399 | } | |
| 16 | |||
| 17 | 29 | int main() { | |
| 18 |
1/2✓ Branch 2 taken 29 times.
✗ Branch 3 not taken.
|
29 | std::cin.tie(nullptr)->std::ios::sync_with_stdio(false); |
| 19 | u32 t; | ||
| 20 |
1/2✓ Branch 1 taken 29 times.
✗ Branch 2 not taken.
|
29 | std::cin >> t; |
| 21 |
3/4✓ Branch 1 taken 366399 times.
✗ Branch 2 not taken.
✓ Branch 3 taken 366399 times.
✓ Branch 4 taken 29 times.
|
366428 | while (t--) solve(); |
| 22 | 29 | return 0; | |
| 23 | } | ||
| 24 |