結果

問題 No.2179 Planet Traveler
ユーザー ecotteaecottea
提出日時 2023-01-06 22:39:24
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 466 ms / 3,000 ms
コード長 6,821 bytes
コンパイル時間 4,041 ms
コンパイル使用メモリ 235,388 KB
実行使用メモリ 8,448 KB
最終ジャッジ日時 2024-11-30 19:05:11
合計ジャッジ時間 9,449 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 AC 2 ms
5,248 KB
testcase_08 AC 3 ms
5,248 KB
testcase_09 AC 3 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 90 ms
8,448 KB
testcase_12 AC 466 ms
8,320 KB
testcase_13 AC 444 ms
8,320 KB
testcase_14 AC 75 ms
8,320 KB
testcase_15 AC 75 ms
8,320 KB
testcase_16 AC 73 ms
8,320 KB
testcase_17 AC 358 ms
8,448 KB
testcase_18 AC 350 ms
8,320 KB
testcase_19 AC 353 ms
8,320 KB
testcase_20 AC 48 ms
5,248 KB
testcase_21 AC 332 ms
7,936 KB
testcase_22 AC 218 ms
6,400 KB
testcase_23 AC 191 ms
5,888 KB
testcase_24 AC 287 ms
7,296 KB
testcase_25 AC 226 ms
6,400 KB
testcase_26 AC 321 ms
7,680 KB
testcase_27 AC 50 ms
5,248 KB
testcase_28 AC 148 ms
5,376 KB
testcase_29 AC 283 ms
7,296 KB
権限があれば一括ダウンロードができます

ソースコード

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

#ifndef HIDDEN_IN_VS //
//
#define _CRT_SECURE_NO_WARNINGS
//
#include <bits/stdc++.h>
using namespace std;
//
using ll = long long; // -2^63 2^63 = 9 * 10^18int -2^31 2^31 = 2 * 10^9
using pii = pair<int, int>; using pll = pair<ll, ll>; using pil = pair<int, ll>; using pli = pair<ll, int>;
using vi = vector<int>; using vvi = vector<vi>; using vvvi = vector<vvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>;
using vb = vector<bool>; using vvb = vector<vb>; using vvvb = vector<vvb>;
using vc = vector<char>; using vvc = vector<vc>; using vvvc = vector<vvc>;
using vd = vector<double>; using vvd = vector<vd>; using vvvd = vector<vvd>;
template <class T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;
using Graph = vvi;
//
const double PI = acos(-1);
const vi DX = { 1, 0, -1, 0 }; // 4
const vi DY = { 0, 1, 0, -1 };
int INF = 1001001001; ll INFL = 4004004004004004004LL;
double EPS = 1e-12;
//
struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp;
//
#define all(a) (a).begin(), (a).end()
#define sz(x) ((int)(x).size())
#define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x))
#define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x))
#define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");}
#define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 n-1
#define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s t
#define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s t
#define repe(v, a) for(const auto& v : (a)) // a
#define repea(v, a) for(auto& v : (a)) // a
#define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d
#define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a
#define smod(n, m) ((((n) % (m)) + (m)) % (m)) // mod
#define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} //
#define EXIT(a) {cout << (a) << endl; exit(0);} //
//
template <class T> inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; }
template <class T> inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // true
    
template <class T> inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // true
    
//
template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }
template <class T> inline istream& operator>>(istream& is, vector<T>& v) { repea(x, v) is >> x; return is; }
template <class T> inline vector<T>& operator--(vector<T>& v) { repea(x, v) --x; return v; }
template <class T> inline vector<T>& operator++(vector<T>& v) { repea(x, v) ++x; return v; }
// Visual Studio
#ifdef _MSC_VER
#include "local.hpp"
// gcc
#else
inline int popcount(int n) { return __builtin_popcount(n); }
inline int popcount(ll n) { return __builtin_popcountll(n); }
inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; }
inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; }
inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; }
inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_list2D(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
//using mint = modint1000000007;
//using mint = modint998244353;
using mint = modint; // mint::set_mod(m);
istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>;
#endif
//O(log|ok - ng|)
/*
* okQ() ok ng
* ok
*/
template <typename T>
T meguru_search(T ok, T ng, function<bool(T)>& okQ) {
// : https://twitter.com/meguru_comp/status/697008509376835584
// verify : https://atcoder.jp/contests/abc023/tasks/abc023_d
//
while (abs(ok - ng) > 1) {
//
T mid = (ok + ng) / 2;
// OK
if (okQ(mid)) ok = mid;
else ng = mid;
}
return ok;
/* okQ
using T = ll;
function<bool(T)> okQ = [&](T x) {
return true || false;
};
*/
}
//O(n log a)
/*
* a n a^(1/n)
*
*
*/
ll integer_root(ll a, int n) {
// verify : https://atcoder.jp/contests/abc166/tasks/abc166_d
if (a <= 1 || n == 1) return a;
// x^k a a + 1
auto pow = [&](ll x, int k) {
ll v = 1;
rep(i, k) {
if (v > a / x) return a + 1;
v *= x;
}
return v;
};
// x^n <= a
function<bool(ll)> okQ = [&](ll x) {
return pow(x, n) <= a;
};
ll res = meguru_search(1LL, a + 1, okQ);
return res;
}
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n;
cin >> n;
vl x(n), y(n), t(n);
rep(i, n) cin >> x[i] >> y[i] >> t[i];
vvl dist_sq(n, vl(n));
rep(i, n) repi(j, i + 1, n - 1) {
if (t[i] == t[j]) {
ll s = (x[i] - x[j]) * (x[i] - x[j]) + (y[i] - y[j]) * (y[i] - y[j]);
dist_sq[i][j] = s;
}
else {
ll d = 4 * (x[i] * x[i] + y[i] * y[i]) * (x[j] * x[j] + y[j] * y[j]);
ll r = integer_root(d, 2);
ll s = x[i] * x[i] + y[i] * y[i] + x[j] * x[j] + y[j] * y[j] - r;
dist_sq[i][j] = s;
}
}
dumpel(dist_sq);
using T = ll;
function<bool(T)> okQ = [&](T s) {
dsu d(n);
rep(i, n) repi(j, i + 1, n - 1) {
if (dist_sq[i][j] <= s) d.merge(i, j);
}
return d.same(0, n - 1);
};
ll res = meguru_search(INFL, -1LL, okQ);
cout << res << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0