結果
問題 | No.2632 Center of Three Points in Lp Norm |
ユーザー | noya2 |
提出日時 | 2024-02-13 18:10:25 |
言語 | C++23 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,781 bytes |
コンパイル時間 | 3,030 ms |
コンパイル使用メモリ | 251,404 KB |
実行使用メモリ | 6,824 KB |
最終ジャッジ日時 | 2024-09-28 18:35:49 |
合計ジャッジ時間 | 9,724 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 116 ms
6,820 KB |
testcase_01 | AC | 121 ms
6,820 KB |
testcase_02 | AC | 123 ms
6,820 KB |
testcase_03 | AC | 120 ms
6,816 KB |
testcase_04 | AC | 122 ms
6,820 KB |
testcase_05 | AC | 117 ms
6,816 KB |
testcase_06 | AC | 119 ms
6,816 KB |
testcase_07 | AC | 119 ms
6,816 KB |
testcase_08 | WA | - |
testcase_09 | AC | 119 ms
6,816 KB |
testcase_10 | AC | 118 ms
6,816 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 121 ms
6,816 KB |
testcase_16 | AC | 119 ms
6,816 KB |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 126 ms
6,816 KB |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | AC | 119 ms
6,820 KB |
testcase_25 | WA | - |
testcase_26 | AC | 120 ms
6,816 KB |
testcase_27 | AC | 121 ms
6,816 KB |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | AC | 121 ms
6,816 KB |
testcase_32 | AC | 120 ms
6,816 KB |
testcase_33 | AC | 121 ms
6,816 KB |
testcase_34 | WA | - |
testcase_35 | AC | 119 ms
6,820 KB |
testcase_36 | AC | 119 ms
6,820 KB |
testcase_37 | AC | 121 ms
6,820 KB |
ソースコード
/* 雑に 3分探索 in 3分探索 サンプル 1 がそもそも合わない。 */ #line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" using namespace std; #include<bits/stdc++.h> #line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp" namespace noya2 { template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &p){ os << p.first << " " << p.second; return os; } template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &p){ is >> p.first >> p.second; return is; } template <typename T> ostream &operator<<(ostream &os, const vector<T> &v){ int s = (int)v.size(); for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i]; return os; } template <typename T> istream &operator>>(istream &is, vector<T> &v){ for (auto &x : v) is >> x; return is; } void in() {} template <typename T, class... U> void in(T &t, U &...u){ cin >> t; in(u...); } void out() { cout << "\n"; } template <typename T, class... U, char sep = ' '> void out(const T &t, const U &...u){ cout << t; if (sizeof...(u)) cout << sep; out(u...); } template<typename T> void out(const vector<vector<T>> &vv){ int s = (int)vv.size(); for (int i = 0; i < s; i++) out(vv[i]); } struct IoSetup { IoSetup(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); cerr << fixed << setprecision(7); } } iosetup_noya2; } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp" namespace noya2{ const int iinf = 1'000'000'007; const long long linf = 2'000'000'000'000'000'000LL; const long long mod998 = 998244353; const long long mod107 = 1000000007; const long double pi = 3.14159265358979323; const vector<int> dx = {0,1,0,-1,1,1,-1,-1}; const vector<int> dy = {1,0,-1,0,1,-1,-1,1}; const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const string alp = "abcdefghijklmnopqrstuvwxyz"; const string NUM = "0123456789"; void yes(){ cout << "Yes\n"; } void no(){ cout << "No\n"; } void YES(){ cout << "YES\n"; } void NO(){ cout << "NO\n"; } void yn(bool t){ t ? yes() : no(); } void YN(bool t){ t ? YES() : NO(); } } // namespace noya2 #line 1 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp" namespace noya2{ unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){ if (a == 0 || b == 0) return a + b; int n = __builtin_ctzll(a); a >>= n; int m = __builtin_ctzll(b); b >>= m; while (a != b) { int mm = __builtin_ctzll(a - b); bool f = a > b; unsigned long long c = f ? a : b; b = f ? b : a; a = (c - b) >> mm; } return a << min(n, m); } template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(abs(a),abs(b))); } long long sqrt_fast(long long n) { if (n <= 0) return 0; long long x = sqrt(n); while ((x + 1) * (x + 1) <= n) x++; while (x * x > n) x--; return x; } template<typename T> T floor_div(const T n, const T d) { assert(d != 0); return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0); } template<typename T> T ceil_div(const T n, const T d) { assert(d != 0); return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0); } template<typename T> void uniq(vector<T> &v){ sort(v.begin(),v.end()); v.erase(unique(v.begin(),v.end()),v.end()); } template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; } template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; } template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; } } // namespace noya2 #line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp" #define rep(i,n) for (int i = 0; i < (int)(n); i++) #define repp(i,m,n) for (int i = (m); i < (int)(n); i++) #define reb(i,n) for (int i = (int)(n-1); i >= 0; i--) #define all(v) (v).begin(),(v).end() using ll = long long; using ld = long double; using uint = unsigned int; using ull = unsigned long long; using pii = pair<int,int>; using pll = pair<ll,ll>; using pil = pair<int,ll>; using pli = pair<ll,int>; namespace noya2{ /* ~ (. _________ . /) */ } using namespace noya2; #line 2 "c.cpp" const ld dinf = 2e6; void solve(){ ld p; in(p); ld ip = 1/p; using vec = complex<ld>; array<vec,3> ps; rep(i,3){ ld x, y; in(x,y); ps[i] = vec(x,y); } auto dist = [&](int i, vec v){ v -= ps[i]; ld sum = powl(abs(v.real()),p) + powl(abs(v.imag()),p); return powl(sum,ip); }; auto score = [&](vec v){ ld mi = dinf, ma = -dinf; rep(i,3){ ld d = dist(i,v); chmin(mi,d); chmax(ma,d); } return ma-mi; }; ld memo_y; auto fixed_x = [&](ld x){ ld ly = -dinf, ry = dinf; int ytime = 100; while (ytime--){ ld m1 = (ly + ly + ry) / 3; ld m2 = (ly + ry + ry) / 3; ld v1 = score(vec(x,m1)); ld v2 = score(vec(x,m2)); if (v1 < v2){ ry = m2; } else { ly = m1; } } memo_y = ly; return score(vec(x,ly)); }; ld lx = -dinf, rx = dinf; int xtime = 100; while (xtime--){ ld m1 = (lx + lx + rx) / 3; ld m2 = (lx + rx + rx) / 3; ld v1 = fixed_x(m1); ld v2 = fixed_x(m2); if (v1 < v2){ rx = m2; } else { lx = m1; } } cout << fixed << setprecision(15) << lx << ' ' << memo_y << endl; } int main(){ int t = 1; //in(t); while (t--) { solve(); } }