#905999 (C++23) No.2438 Double Least Square

提出ソース

結果

問題	No.2438 Double Least Square
ユーザー	hitonanode
提出日時	2023-08-18 23:36:36
言語	C++23 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,856 bytes
コンパイル時間	2,030 ms
コンパイル使用メモリ	183,824 KB
実行使用メモリ	5,248 KB
最終ジャッジ日時	2024-11-28 11:08:18
合計ジャッジ時間	30,584 ms
ジャッジサーバーID （参考情報）	judge4 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	9 ms 5,248 KB
testcase_01	AC	11 ms 5,248 KB
testcase_02	AC	12 ms 5,248 KB
testcase_03	AC	8 ms 5,248 KB
testcase_04	AC	8 ms 5,248 KB
testcase_05	AC	9 ms 5,248 KB
testcase_06	AC	9 ms 5,248 KB
testcase_07	AC	6 ms 5,248 KB
testcase_08	AC	10 ms 5,248 KB
testcase_09	AC	24 ms 5,248 KB
testcase_10	AC	1,092 ms 5,248 KB
testcase_11	AC	1,082 ms 5,248 KB
testcase_12	WA	-
testcase_13	WA	-
testcase_14	AC	1,065 ms 5,248 KB
testcase_15	AC	1,289 ms 5,248 KB
testcase_16	AC	1,267 ms 5,248 KB
testcase_17	AC	1,298 ms 5,248 KB
testcase_18	AC	1,274 ms 5,248 KB
testcase_19	AC	1,315 ms 5,248 KB
testcase_20	AC	1,540 ms 5,248 KB
testcase_21	AC	1,525 ms 5,248 KB
testcase_22	AC	1,463 ms 5,248 KB
testcase_23	AC	1,523 ms 5,248 KB
testcase_24	AC	1,725 ms 5,248 KB
testcase_25	AC	1,644 ms 5,248 KB
testcase_26	AC	1,532 ms 5,248 KB
testcase_27	AC	1,515 ms 5,248 KB
testcase_28	AC	1,554 ms 5,248 KB
testcase_29	AC	1,544 ms 5,248 KB
testcase_30	AC	10 ms 5,248 KB
testcase_31	AC	8 ms 5,248 KB
testcase_32	AC	15 ms 5,248 KB

権限があれば一括ダウンロードができます

コンパイルメッセージ

main.cpp: In function 'int main()':
main.cpp:131:39: warning: 'best_i2' may be used uninitialized [-Wmaybe-uninitialized]
  131 |         double a2 = tan(pi * (best_i2 + 0.5 + j2 * 2.0 / B) / B / 2);
      |                               ~~~~~~~~^~~~~
main.cpp:118:18: note: 'best_i2' was declared here
  118 |     int best_i1, best_i2;
      |                  ^~~~~~~
main.cpp:130:40: warning: 'best_i1' may be used uninitialized [-Wmaybe-uninitialized]
  130 |         double a1 = -tan(pi * (best_i1 + 0.5 + j1 * 2.0 / B) / B / 2);
      |                                ~~~~~~~~^~~~~
main.cpp:118:9: note: 'best_i1' was declared here
  118 |     int best_i1, best_i2;
      |         ^~~~~~~

ソースコード

raw source code

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <deque>
#include <forward_list>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iostream>
#include <limits>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <optional>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T> bool chmax(T &m, const T q) { return m < q ? (m = q, true) : false; }
template <typename T> bool chmin(T &m, const T q) { return m > q ? (m = q, true) : false; }
const std::vector<std::pair<int, int>> grid_dxs{{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <class T1, class T2> T1 floor_div(T1 num, T2 den) { return (num > 0 ? num / den : -((-num + den - 1) / den)); }
template <class T1, class T2> std::pair<T1, T2> operator+(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first + r.first, l.second + r.second); }
template <class T1, class T2> std::pair<T1, T2> operator-(const std::pair<T1, T2> &l, const std::pair<T1, T2> &r) { return std::make_pair(l.first - r.first, l.second - r.second); }
template <class T> std::vector<T> sort_unique(std::vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <class T> int arglb(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::lower_bound(v.begin(), v.end(), x)); }
template <class T> int argub(const std::vector<T> &v, const T &x) { return std::distance(v.begin(), std::upper_bound(v.begin(), v.end(), x)); }
template <class IStream, class T> IStream &operator>>(IStream &is, std::vector<T> &vec) { for (auto &v : vec) is >> v; return is; }

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec);
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr);
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const pair<T, U> &pa);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec);
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec);
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa);
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp);
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp);
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl);

template <class OStream, class T> OStream &operator<<(OStream &os, const std::vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T, size_t sz> OStream &operator<<(OStream &os, const std::array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
template <class... T> std::istream &operator>>(std::istream &is, std::tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <class OStream, class... T> OStream &operator<<(OStream &os, const std::tuple<T...> &tpl) { os << '('; std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os << ')'; }
template <class OStream, class T, class TH> OStream &operator<<(OStream &os, const std::unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T> OStream &operator<<(OStream &os, const std::unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <class OStream, class T, class U> OStream &operator<<(OStream &os, const std::pair<T, U> &pa) { return os << '(' << pa.first << ',' << pa.second << ')'; }
template <class OStream, class TK, class TV> OStream &operator<<(OStream &os, const std::map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <class OStream, class TK, class TV, class TH> OStream &operator<<(OStream &os, const std::unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl
#define dbgif(cond, x) ((cond) ? std::cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << std::endl : std::cerr)
#else
#define dbg(x) ((void)0)
#define dbgif(cond, x) ((void)0)
#endif


int main() {
    int N, H;
    cin >> N >> H;
    vector<double> X(N), Y(N);
    REP(i, N) cin >> X.at(i) >> Y.at(i);
    dbg(make_tuple(H, X, Y));

    double ans = 1e30;

    auto eval = [&](double a1, double a2) -> double {
        double ret = 0.0;
        REP(i, N) {
            double y1 = abs(a2 * X.at(i) - Y.at(i));
            double y2 = abs(a1 * X.at(i) + H - Y.at(i));
            double m = std::min(y1, y2);
            ret += m * m;
            if (ret > ans) break;
        }
        return ret;
    };

    const int B = 260;
    vector<double> tans(B);
    const double pi = acos(-1);
    REP(b, B) tans.at(b) = tan(pi * (b + 0.5) / B / 2);
    dbg(tans);

    double best_a1, best_a2;
    int best_i1, best_i2;

    int i1lo = 0;
    for (int y : Y) if (y > H) i1lo = -B;

    FOR(i1, i1lo, B) REP(i2, B) {
        double a1 = -tan(pi * (i1 + 0.5) / B / 2), a2 = tans.at(i2);
        if (chmin(ans, eval(a1, a2))) best_a1 = a1, best_a2 = a2, best_i1 = i1, best_i2 = i2;
    }


    FOR(j1, -B, B) FOR(j2, -B, B) {
        double a1 = -tan(pi * (best_i1 + 0.5 + j1 * 2.0 / B) / B / 2);
        double a2 = tan(pi * (best_i2 + 0.5 + j2 * 2.0 / B) / B / 2);
        chmin(ans, eval(a1, a2));
    }

    cout << ans * 0.999995 << '\n';
}

yukicoder

結果

テストケース

コンパイルメッセージ

ソースコード