CP-Algorithms Library

This documentation is automatically generated by competitive-verifier/competitive-verifier

View the Project on GitHub cp-algorithms/cp-algorithms-aux

:heavy_check_mark: Closest Pair of Points (verify/geometry/closest_pair.test.cpp)

Depends on

Code

// @brief Closest Pair of Points
#define PROBLEM "https://judge.yosupo.jp/problem/closest_pair"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
#include "cp-algo/geometry/closest_pair.hpp"
#include <bits/stdc++.h>

using namespace std;
using namespace cp_algo::geometry;
using point = point_t<int64_t>;

void solve() {
    int n;
    cin >> n;
    cp_algo::big_vector<point> r(n);
    for(auto &it: r) {
        it.read();
    }
    auto [a, b] = closest_pair(r);
    cout << a << ' ' << b << "\n";
}

signed main() {
    //freopen("input.txt", "r", stdin);
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t = 1;
    cin >> t;
    while(t--) {
        solve();
    }
}
Traceback (most recent call last):
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj_resolve/resolver.py", line 181, in resolve
    bundled_code = language.bundle(path, basedir=basedir)
                   ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus.py", line 252, in bundle
    bundler.update(path)
  File "/home/runner/.local/lib/python3.12/site-packages/competitive_verifier/oj/verify/languages/cplusplus_bundle.py", line 327, in update
    assert len(lines) == len(uncommented_lines)
           ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
AssertionError

Test cases

Env Name Status Elapsed Memory
g++ all_same_00 :heavy_check_mark: AC 54 ms 4 MB
g++ example_00 :heavy_check_mark: AC 4 ms 4 MB
g++ fix_near_grid_00 :heavy_check_mark: AC 270 ms 38 MB
g++ fix_near_grid_01 :heavy_check_mark: AC 314 ms 19 MB
g++ max_colinear_00 :heavy_check_mark: AC 260 ms 21 MB
g++ max_colinear_01 :heavy_check_mark: AC 287 ms 21 MB
g++ max_random_00 :heavy_check_mark: AC 655 ms 57 MB
g++ max_random_01 :heavy_check_mark: AC 45 ms 11 MB
g++ max_random_02 :heavy_check_mark: AC 382 ms 34 MB
g++ max_random_03 :heavy_check_mark: AC 575 ms 52 MB
g++ max_random_04 :heavy_check_mark: AC 355 ms 28 MB
g++ max_random_05 :heavy_check_mark: AC 45 ms 11 MB
g++ max_random_06 :heavy_check_mark: AC 577 ms 52 MB
g++ max_random_07 :heavy_check_mark: AC 411 ms 21 MB
g++ mid_random_00 :heavy_check_mark: AC 271 ms 4 MB
g++ mid_random_01 :heavy_check_mark: AC 249 ms 4 MB
g++ mid_random_02 :heavy_check_mark: AC 260 ms 4 MB
g++ near_circle_00 :heavy_check_mark: AC 304 ms 30 MB
g++ near_circle_01 :heavy_check_mark: AC 263 ms 23 MB
g++ near_grid_00 :heavy_check_mark: AC 255 ms 21 MB
g++ near_grid_01 :heavy_check_mark: AC 287 ms 20 MB
g++ small_random_00 :heavy_check_mark: AC 89 ms 4 MB
g++ small_random_01 :heavy_check_mark: AC 70 ms 4 MB
g++ small_random_02 :heavy_check_mark: AC 72 ms 4 MB
g++ small_random_03 :heavy_check_mark: AC 70 ms 4 MB
g++ small_random_04 :heavy_check_mark: AC 90 ms 4 MB
g++ small_random_05 :heavy_check_mark: AC 72 ms 4 MB
g++ small_random_06 :heavy_check_mark: AC 69 ms 4 MB
g++ small_random_07 :heavy_check_mark: AC 70 ms 4 MB
Back to top page