結果

問題 No.2438 Double Least Square
ユーザー ecottea
提出日時 2023-08-20 04:35:04
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 173 ms / 2,000 ms
コード長 13,974 bytes
コンパイル時間 4,469 ms
コンパイル使用メモリ 263,020 KB
最終ジャッジ日時 2025-02-16 11:50:03
ジャッジサーバーID
(参考情報)
judge2 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 30
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:363:83: warning: ISO C++ says that these are ambiguous, even though the worst conversion for the first is better than the worst conversion for the second:
  363 |                                         double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
      |                                                                                   ^
main.cpp:235:14: note: candidate 1: ‘Frac<T> Frac<T>::operator*(T) const [with T = __int128]’
  235 |         Frac operator*(T c) const { Frac a = *this; return a *= c; }
      |              ^~~~~~~~
main.cpp:363:83: note: candidate 2: ‘operator*(double, __gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type {aka long long int})’ (built-in)
  363 |                                         double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
      |                                                                                   ^
main.cpp:363:83: warning: ISO C++ says that these are ambiguous, even though the worst conversion for the first is better than the worst conversion for the second:
main.cpp:238:21: note: candidate 1: ‘Frac<__int128> operator-(__int128, const Frac<__int128>&)’
  238 |         friend Frac operator-(T c, const Frac& a) { return Frac(c) - a; }
      |                     ^~~~~~~~
main.cpp:363:83: note: candidate 2: ‘operator-(__gnu_cxx::__alloc_traits<std::allocator<long long int>, long long int>::value_type {aka long long int}, double)’ (built-in)
  363 |                                         double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
      |                                                                                   ^
main.cpp:363:87: warning: ISO C++ says that these are ambiguous, even though the worst conversion for the first is better than the worst conversion for the second:
  363 |                                         double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
    

ソースコード

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 vvvvi = vector<vvvi>;
using vl = vector<ll>; using vvl = vector<vl>; using vvvl = vector<vvl>; using vvvvl = vector<vvvl>;
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 = 4004004003104004004LL; // (int)INFL = 1010931620;
double EPS = 1e-15;
//
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);} //
#define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) //
//
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> inline T get(T set, int i) { return (set >> i) & T(1); }
//
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; }
#endif //
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#ifdef _MSC_VER
#include "localACL.hpp"
#endif
//using mint = modint1000000007;
using mint = modint998244353;
//using mint = modint; // mint::set_mod(m);
namespace atcoder {
inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; }
inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; }
}
using vm = vector<mint>; using vvm = vector<vm>; using vvvm = vector<vvm>; using vvvvm = vector<vvvm>;
#endif
#ifdef _MSC_VER // Visual Studio
#include "local.hpp"
#else // gcc
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; }
inline int msb(__int128 n) { return (n >> 64) != 0 ? (127 - __builtin_clzll((ll)(n >> 64))) : n != 0 ? (63 - __builtin_clzll((ll)(n))) : -1; }
#define gcd __gcd
#define dump(...)
#define dumpel(v)
#define dump_list(v)
#define dump_mat(v)
#define input_from_file(f)
#define output_to_file(f)
#define Assert(b) { if (!(b)) while (1) cout << "OLE"; }
#endif
//
/*
* Frac<T>() : O(1)
* 0
*
* Frac<T>(T num) : O(1)
* num
*
* Frac<T>(T num, T dnm) : O(1)
* num / dnm
*
* a == b, a != b, a < b, a > b, a <= b, a >= b : O(1)
*
*
* a + b, a - b, a * b, a / b : O(1)
*
* 使
*
* reduction() : O(log min(num, dnm))
*
*
* together(Frac& a, Frac& b) : O(log min(a.dnm, b.dnm))
* a b
*
* T floor() : O(1)
* floor
*
* T ceil() : O(1)
* ceil
*/
template <class T = ll>
struct Frac {
// verify : https://atcoder.jp/contests/abc057/tasks/abc057_d
//
T num, dnm;
//
Frac() : num(0), dnm(1) {}
Frac(T num) : num(num), dnm(1) {}
Frac(T num_, T dnm_) : num(num_), dnm(dnm_) {
// verify : https://atcoder.jp/contests/abc244/tasks/abc244_h
Assert(dnm != 0);
if (dnm < 0) { num *= -1; dnm *= -1; }
}
//
Frac(const Frac& b) = default;
Frac& operator=(const Frac& b) = default;
//
operator double() const { return (double)num / dnm; }
//
bool operator==(const Frac& b) const {
//
if (dnm == b.dnm) return num == b.num;
return num * b.dnm == b.num * dnm;
}
bool operator!=(const Frac& b) const { return !(*this == b); }
bool operator<(const Frac& b) const {
// verify : https://atcoder.jp/contests/abc308/tasks/abc308_c
//
if (dnm == b.dnm) return num < b.num;
return (num * b.dnm < b.num * dnm);
}
bool operator>=(const Frac& b) const { return !(*this < b); }
bool operator>(const Frac& b) const { return b < *this; }
bool operator<=(const Frac& b) const { return !(*this > b); }
//
bool operator==(T b) const { return num == b * dnm; }
bool operator!=(T b) const { return num != b * dnm; }
bool operator<(T b) const { return num < b * dnm; }
bool operator>=(T b) const { return num >= b * dnm; }
bool operator>(T b) const { return num > b * dnm; }
bool operator<=(T b) const { return num <= b * dnm; }
friend bool operator==(T a, const Frac& b) { return a * b.dnm == b.num; }
friend bool operator!=(T a, const Frac& b) { return a * b.dnm != b.num; }
friend bool operator<(T a, const Frac& b) { return a * b.dnm < b.num; }
friend bool operator>=(T a, const Frac& b) { return a * b.dnm >= b.num; }
friend bool operator>(T a, const Frac& b) { return a * b.dnm > b.num; }
friend bool operator<=(T a, const Frac& b) { return a * b.dnm <= b.num; }
//
Frac& operator+=(const Frac& b) {
// verify : https://www.codechef.com/problems/ARCTR
//
if (dnm == b.dnm) num += b.num;
else { num = num * b.dnm + b.num * dnm; dnm *= b.dnm; }
return *this;
}
Frac& operator-=(const Frac& b) {
// verify : https://www.codechef.com/problems/ARCTR
//
if (dnm == b.dnm) num -= b.num;
else { num = num * b.dnm - b.num * dnm; dnm *= b.dnm; }
return *this;
}
Frac& operator*=(const Frac& b) { num *= b.num; dnm *= b.dnm; return *this; }
Frac& operator/=(const Frac& b) {
// verify : https://atcoder.jp/contests/abc301/tasks/abc301_g
Assert(b.num != 0);
num *= b.dnm; dnm *= b.num;
if (dnm < 0) { num *= -1; dnm *= -1; }
return *this;
}
Frac operator+(const Frac& b) const { Frac a = *this; return a += b; }
Frac operator-(const Frac& b) const { Frac a = *this; return a -= b; }
Frac operator*(const Frac& b) const { Frac a = *this; return a *= b; }
Frac operator/(const Frac& b) const { Frac a = *this; return a /= b; }
Frac operator-() const { return Frac(*this) *= Frac(-1); }
//
Frac& operator+=(T c) { num += dnm * c; return *this; }
Frac& operator-=(T c) { num -= dnm * c; return *this; }
Frac& operator*=(T c) { num *= c; return *this; }
Frac& operator/=(T c) {
Assert(c != T(0));
dnm *= c;
if (dnm < 0) { num *= -1; dnm *= -1; }
return *this;
}
Frac operator+(T c) const { Frac a = *this; return a += c; }
Frac operator-(T c) const { Frac a = *this; return a -= c; }
Frac operator*(T c) const { Frac a = *this; return a *= c; }
Frac operator/(T c) const { Frac a = *this; return a /= c; }
friend Frac operator+(T c, const Frac& a) { return a + c; }
friend Frac operator-(T c, const Frac& a) { return Frac(c) - a; }
friend Frac operator*(T c, const Frac& a) { return a * c; }
friend Frac operator/(T c, const Frac& a) { return Frac(c) / a; }
//
void reduction() {
// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h
auto g = gcd(abs(num), abs(dnm));
num /= g; dnm /= g;
}
// a b
friend void together(Frac& a, Frac& b) {
// verify : https://atcoder.jp/contests/abc229/tasks/abc229_h
T dnm = a.dnm / gcd(a.dnm, b.dnm) * b.dnm;
a.num *= dnm / a.dnm; a.dnm = dnm;
b.num *= dnm / b.dnm; b.dnm = dnm;
}
// floor
T floor() const {
// verify : https://www.codechef.com/problems/LINEFIT?tab=statement
if (num >= 0) return num / dnm;
else return -((-num + dnm - 1) / dnm);
}
// ceil
T ceil() const {
// verify : https://www.codechef.com/problems/LINEFIT?tab=statement
if (num >= 0) return (num + dnm - 1) / dnm;
else return -((-num) / dnm);
}
#ifdef _MSC_VER
friend ostream& operator<<(ostream& os, const Frac& a) { os << a.num << '/' << a.dnm; return os; }
#endif
};
#ifdef _MSC_VER
#define __int128 ll //
#endif
int main() {
// input_from_file("input.txt");
// output_to_file("output.txt");
int n; ll h;
cin >> n >> h;
vl x(n), y(n);
rep(i, n) cin >> x[i] >> y[i];
if (n <= 2) EXIT(0);
vector<pair<Frac<__int128>, int>> uid(n), vid(n);
rep(i, n) {
uid[i] = { Frac<__int128>(2 * y[i] - h, x[i]), i };
vid[i] = { Frac<__int128>(h, x[i]), i };
}
uid.push_back({ Frac<__int128>(-INF, 1), -1 });
vid.push_back({ Frac<__int128>(-INF, 1), -1 });
sort(all(uid));
sort(all(vid));
//repi(i, 1, n) cerr << "(" << (double)uid[i].first << "," << uid[i].second << ") ";
//cerr << endl;
//repi(i, 1, n) cerr << "(" << (double)vid[i].first << "," << vid[i].second << ") ";
//cerr << endl;
vi tp0(n, 0); double res = (double)INFL;
rep(i, n + 1) {
auto [u, id] = uid[i];
if (id != -1) {
tp0[id] ^= 1;
}
auto tp(tp0);
// a0 + a1 a = 0, b0 + b1 b = 0
ll a0 = 0, a1 = 0, b0 = 0, b1 = 0;
rep(id, n) {
if (tp[id] == 0) {
a1 += 2 * x[id] * x[id];
a0 += -2 * x[id] * y[id] + 2 * h * x[id];
}
else {
b1 += 2 * x[id] * x[id];
b0 += -2 * x[id] * y[id];
}
}
rep(j, n + 1) {
auto [v, id] = vid[j];
dump("---", i, (double)u, j, (double)v, "---");
if (id != -1) {
if (tp[id] == 0) {
a1 -= 2 * x[id] * x[id];
a0 -= -2 * x[id] * y[id] + 2 * h * x[id];
b1 += 2 * x[id] * x[id];
b0 += -2 * x[id] * y[id];
}
else {
a1 += 2 * x[id] * x[id];
a0 += -2 * x[id] * y[id] + 2 * h * x[id];
b1 -= 2 * x[id] * x[id];
b0 -= -2 * x[id] * y[id];
}
tp[id] ^= 1;
}
dump("tp:", tp);
if (a1 == 0) {
Frac<__int128> a(0, 1), b(-b0, b1);
double val = 0;
rep(k, n) {
double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
double val_b = pow((double)(y[k] - b * x[k]), 2.);
val += min(val_a, val_b);
}
dump("val:", val);
chmin(res, val);
continue;
}
if (b1 == 0) {
Frac<__int128> a(-a0, a1), b(0, 1);
double val = 0;
rep(k, n) {
double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
double val_b = pow((double)(y[k] - b * x[k]), 2.);
val += min(val_a, val_b);
}
dump("val:", val);
chmin(res, val);
continue;
}
Frac<__int128> a(-a0, a1), b(-b0, b1);
dump("a:", (double)a, "b:", (double)b);
bool ok = true;
if (i >= 0 && uid[i].first > b + a) ok = false;
if (i < n && uid[i + 1].first < b + a) ok = false;
if (j >= 0 && vid[j].first > b - a) ok = false;
if (j < n && vid[j + 1].first < b - a) ok = false;
if (!ok) continue;
double val = 0;
rep(k, n) {
double val_a = pow((double)(y[k] - a * x[k] - h), 2.);
double val_b = pow((double)(y[k] - b * x[k]), 2.);
val += min(val_a, val_b);
}
dump("val:", val);
chmin(res, val);
}
}
cout << (double)res << endl;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0