結果

問題 No.2179 Planet Traveler
ユーザー poyonpoyon
提出日時 2023-01-06 23:28:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 9,282 bytes
コンパイル時間 2,477 ms
コンパイル使用メモリ 212,632 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-11-30 20:22:45
合計ジャッジ時間 9,507 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 2 ms
5,248 KB
testcase_06 AC 2 ms
5,248 KB
testcase_07 WA -
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 4 ms
5,248 KB
testcase_10 AC 3 ms
5,248 KB
testcase_11 WA -
testcase_12 WA -
testcase_13 AC 524 ms
5,248 KB
testcase_14 AC 34 ms
5,248 KB
testcase_15 AC 33 ms
5,248 KB
testcase_16 AC 34 ms
5,248 KB
testcase_17 AC 533 ms
5,248 KB
testcase_18 WA -
testcase_19 AC 531 ms
5,248 KB
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 329 ms
5,248 KB
testcase_23 WA -
testcase_24 AC 432 ms
5,248 KB
testcase_25 AC 340 ms
5,248 KB
testcase_26 AC 467 ms
5,248 KB
testcase_27 WA -
testcase_28 AC 224 ms
5,248 KB
testcase_29 AC 432 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// clang-format off
#ifdef _LOCAL
    #include <pch.hpp>
#else
    #include <bits/stdc++.h>
    #define cerr if (false) cerr
    #define debug_bar
    #define debug(...)
    #define debug2(vv)
    #define debug3(vvv)
#endif

using namespace std;
using ll = long long;
using ld = long double;
using str = string;
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort((c).rbegin(), (c).rend())
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) ((ll)__builtin_popcountll(b))
#define LB(c,v) distance((c).begin(), lower_bound(ALL(c), (v)))
#define UB(c,v) distance((c).begin(), upper_bound(ALL(c), (v)))
#define UQ(c) do { SORT(c); (c).erase(unique(ALL(c)), (c).end()); (c).shrink_to_fit(); } while (0)
#define END(...) do { print(__VA_ARGS__); exit(0); } while (0)
template<class... T> void input(T&... a) { (cin >> ... >> a); }
void print() { cout << '\n'; }
template<class T> void print(const T& a) { cout << a << '\n'; }
template<class P1, class P2> void print(const pair<P1, P2>& a) { cout << a.first << " " << a.second << '\n'; }
template<class T, class... Ts> void print(const T& a, const Ts&... b) { cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T> void cout_line(const vector<T>& ans, int l, int r) { for (int i = l; i < r; i++) { if (i != l) { cout << ' '; } cout << ans[i]; } cout << '\n'; }
template<class T> void print(const vector<T>& a) { cout_line(a, 0, a.size()); }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> T SUM(const vector<T>& A) { return accumulate(ALL(A), T(0)); }
template<class T> vector<T> cumsum(const vector<T>& A, bool offset = false) { int N = A.size(); vector<T> S(N+1, 0); for (int i = 0; i < N; i++) { S[i+1] = S[i] + A[i]; } if (not offset) { S.erase(S.begin()); } return S; }
template<class T> string to_binary(T x, int B = 0) { string s; while (x) { s += ('0' + (x & 1)); x >>= 1; } while ((int)s.size() < B) { s += '0'; } reverse(s.begin(), s.end()); return s; }
template<class F> ll binary_search(const F& is_ok, ll ok, ll ng) { while (abs(ok - ng) > 1) { ll m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class F> double binary_search_real(const F& is_ok, double ok, double ng, int iter = 90) { for (int i = 0; i < iter; i++) { double m = (ok + ng) / 2; (is_ok(m) ? ok : ng) = m; } return ok; }
template<class T> ll len(const vector<T>& a) { return (ll)a.size(); }
ll min(int a, ll b) { return min((ll)a, b); }
ll min(ll a, int b) { return min(a, (ll)b); }
ll max(int a, ll b) { return max((ll)a, b); }
ll max(ll a, int b) { return max(a, (ll)b); }
ll mod(ll x, ll m) { assert(m > 0); return (x % m + m) % m; }
ll ceil(ll a, ll b) { if (b < 0) { return ceil(-a, -b); } assert(b > 0); return (a < 0 ? a / b : (a + b - 1) / b); }
ll floor(ll a, ll b) { if (b < 0) { return floor(-a, -b); } assert(b > 0); return (a > 0 ? a / b : (a - b + 1) / b); }
ll powint(ll x, ll n) { assert(n >= 0); if (n == 0) { return 1; }; ll res = powint(x, n>>1); res *= res; if (n & 1) { res *= x; } return res; }
pair<ll,ll> divmod(ll a, ll b) { assert(b != 0); ll q = floor(a, b); return make_pair(q, a - q * b); }
ll bitlen(ll b) { if (b <= 0) { return 0; } return (64LL - __builtin_clzll(b)); }
ll digitlen(ll n) { assert(n >= 0); if (n == 0) { return 1; } ll sum = 0; while (n > 0) { sum++; n /= 10; } return sum; }
ll msb(ll b) { return (b <= 0 ? -1 : (63 - __builtin_clzll(b))); }
ll lsb(ll b) { return (b <= 0 ? -1 : __builtin_ctzll(b)); }
int a2i(const char& c) { assert(islower(c)); return (c - 'a'); }
int A2i(const char& c) { assert(isupper(c)); return (c - 'A'); }
int d2i(const char& d) { assert(isdigit(d)); return (d - '0'); }
char i2a(const int& i) { assert(0 <= i && i < 26); return ('a' + i); }
char i2A(const int& i) { assert(0 <= i && i < 26); return ('A' + i); }
char i2d(const int& i) { assert(0 <= i && i <= 9); return ('0' + i); }
template<class T> using PQ_max = priority_queue<T>;
template<class T> using PQ_min = priority_queue<T, vector<T>, greater<T>>;
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VC = vector<char>;
using VS = vector<string>;
using VVS = vector<VS>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
const ld EPS = 1e-10;
const ld PI  = acosl(-1.0);
constexpr int inf = (1 << 30) - 1;   // 1073741824 - 1
constexpr ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------

// References:
//   <https://github.com/atcoder/ac-library/blob/v1.4/atcoder/dsu.hpp>
//   <https://en.wikipedia.org/wiki/Disjoint-set_data_structure>

// Disjoint-set data structure (Union Find)
// 
struct dsu {
  public:
    dsu() : N(0) {}
    explicit dsu(int n) : N(n), parent_or_size(n, -1), n_edge(n, 0) {}

    // 辺 (a, b) を張ってマージ成否を返す : amortized O(α(N))
    bool merge(int a, int b) {
        assert(0 <= a && a < N);
        assert(0 <= b && b < N);
        int x = leader(a), y = leader(b);
        if (x == y) { n_edge[x]++; return false; }
        if (-parent_or_size[x] < -parent_or_size[y]) { swap(x, y); }
        parent_or_size[x] += parent_or_size[y];
        parent_or_size[y] = x;
        n_edge[x] += n_edge[y] + 1;
        return true;
    }

    // 頂点 a, b が連結か判定する : amortized O(α(N))
    bool same(int a, int b) {
        assert(0 <= a && a < N);
        assert(0 <= b && b < N);
        return leader(a) == leader(b);
    }

    // 頂点 a の属する連結成分のルートを返す : amortized O(α(N))
    int leader(int a) {
        assert(0 <= a && a < N);
        if (parent_or_size[a] < 0) { return a; }
        return parent_or_size[a] = leader(parent_or_size[a]);
    }

    // 頂点 a が属する連結成分のサイズを返す : amortized O(α(N))
    int size(int a) {
        assert(0 <= a && a < N);
        return -parent_or_size[leader(a)];
    }

    // a が属する連結成分の辺の数を返す : amortized O(α(N))
    int size_e(int a) {
        assert(0 <= a && a < N);
        return n_edge[leader(a)];
    }

    // 「一つの連結成分の頂点番号リスト」のリストを返す : O(N)
    vector<vector<int>> groups() {
        vector<int> leader_buf(N), group_size(N);
        for (int i = 0; i < N; i++) {
            leader_buf[i] = leader(i);
            group_size[leader_buf[i]]++;
        }
        vector<vector<int>> result(N);
        for (int i = 0; i < N; i++) {
            result[i].reserve(group_size[i]);
        }
        for (int i = 0; i < N; i++) {
            result[leader_buf[i]].push_back(i);
        }
        result.erase(
            remove_if(result.begin(), result.end(),
                      [&](const vector<int>& v) { return v.empty(); }),
            result.end());
        return result;
    }

  private:
    int N;
    // [x < 0] -x が連結成分のサイズに対応
    // [0 <= x] x が parent に対応
    vector<int> parent_or_size;
    vector<int> n_edge;
};


uint64_t kth_root_integer(uint64_t a, uint64_t k) {
    if (a == 0 || a == 1 || k == 1) { return a; }
    if (64 <= k) { return 1; }

    auto kth_power_integer = [](uint64_t x, uint64_t k) -> __uint128_t {
        __uint128_t b = 1, m = x;
        while (k) {
            if (k & 1) { b *= m; }
            m *= m;
            k >>= 1;
        }
        return b;
    };

    uint64_t x = pow(a, nextafter(1.0 / k, 0));
    while (kth_power_integer(x + 1, k) <= a) { x++; }

    return x;
}

// clang-format on
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N;
    input(N);
    VLL X(N), Y(N), T(N);
    REP (i, N) { input(X[i], Y[i], T[i]); }

    auto is_ok = [&](ll s) -> bool {
        dsu uf(N);
        REP (i, N) {
            FOR (j, i + 1, N) {
                if (T[i] == T[j]) {
                    ll dx = X[i] - X[j];
                    ll dy = Y[i] - Y[j];
                    if (dx * dx + dy * dy <= s) {
                        uf.merge(i, j);
                    }
                } else {
                    ll z1 = X[i] * X[i] + Y[i] * Y[i];
                    ll z2 = X[j] * X[j] + Y[j] * Y[j];
                    ll sq = kth_root_integer(z1 * z2, 2);
                    if (z1 + z2 - s <= 2 * sq) {
                        uf.merge(i, j);
                    }
                }
            }
        }
        return uf.same(0, N - 1);
    };
    ll ok = 4e9;
    ll ng = -1;
    ll res = binary_search(is_ok, ok, ng);

    print(res);

    return 0;
}
0