結果

問題 No.5008 [Cherry Alpha] Discrete Pendulum with Air Resistance
ユーザー hitonanodehitonanode
提出日時 2022-10-14 23:43:03
言語 C++23
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,067 ms / 2,000 ms
コード長 12,943 bytes
コンパイル時間 2,280 ms
実行使用メモリ 6,952 KB
スコア 1,425,655,095,285,286
最終ジャッジ日時 2022-10-14 23:45:06
合計ジャッジ時間 62,980 ms
ジャッジサーバーID
（参考情報） 		judge8 / judge10
純コード判定しない問題か言語
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,018 ms
5,192 KB
testcase_01 AC 1,006 ms
5,216 KB
testcase_02 AC 1,011 ms
5,304 KB
testcase_03 AC 1,017 ms
5,224 KB
testcase_04 AC 1,001 ms
5,160 KB
testcase_05 AC 1,014 ms
5,176 KB
testcase_06 AC 1,000 ms
5,104 KB
testcase_07 AC 1,046 ms
5,224 KB
testcase_08 AC 1,027 ms
5,108 KB
testcase_09 AC 996 ms
5,112 KB
testcase_10 AC 1,006 ms
5,228 KB
testcase_11 AC 998 ms
5,216 KB
testcase_12 AC 1,047 ms
5,204 KB
testcase_13 AC 1,002 ms
5,156 KB
testcase_14 AC 994 ms
5,224 KB
testcase_15 AC 1,045 ms
5,296 KB
testcase_16 AC 1,011 ms
5,216 KB
testcase_17 AC 1,035 ms
5,176 KB
testcase_18 AC 1,018 ms
5,216 KB
testcase_19 AC 992 ms
5,228 KB
testcase_20 AC 1,015 ms
5,208 KB
testcase_21 AC 1,055 ms
5,172 KB
testcase_22 AC 998 ms
5,220 KB
testcase_23 AC 1,029 ms
5,180 KB
testcase_24 AC 1,061 ms
5,160 KB
testcase_25 AC 1,004 ms
5,208 KB
testcase_26 AC 1,047 ms
5,300 KB
testcase_27 AC 1,038 ms
5,156 KB
testcase_28 AC 1,008 ms
5,160 KB
testcase_29 AC 1,067 ms
5,160 KB
testcase_30 AC 1,034 ms
5,160 KB
testcase_31 AC 1,025 ms
5,112 KB
testcase_32 AC 1,041 ms
5,112 KB
testcase_33 AC 1,050 ms
5,212 KB
testcase_34 AC 1,021 ms
5,172 KB
testcase_35 AC 1,015 ms
5,296 KB
testcase_36 AC 1,022 ms
5,176 KB
testcase_37 AC 1,008 ms
5,148 KB
testcase_38 AC 998 ms
5,224 KB
testcase_39 AC 1,022 ms
5,224 KB
testcase_40 AC 984 ms
5,112 KB
testcase_41 AC 1,035 ms
5,160 KB
testcase_42 AC 1,027 ms
5,100 KB
testcase_43 AC 1,009 ms
5,216 KB
testcase_44 AC 1,010 ms
5,172 KB
testcase_45 AC 1,016 ms
6,952 KB
testcase_46 AC 1,035 ms
5,192 KB
testcase_47 AC 1,011 ms
6,952 KB
testcase_48 AC 1,017 ms
5,292 KB
testcase_49 AC 1,000 ms
6,948 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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 <numeric>
#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, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
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; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
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; }
#if __cplusplus >= 201703L
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 << ')'; }
#endif
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

struct Pendulum {
    int b;  // 初期振幅
    int m;  // 最小振幅
    int e;  // 減衰振幅
    std::vector<int> init;
    Pendulum() = default;
    Pendulum(int b_, int m_, int e_) : b(b_), m(m_), e(e_) {
        assert(1 <= m and m <= b);
        assert(1 <= e);
        init.push_back(0);
        for (int dir = 1, a = b_; a > m or dir < 0; dir = -dir, a = max(m, a - e)) {
            for (int t = 1; t <= a; ++t) init.push_back(dir * t);
            for (int t = a - 1; t >= 0; --t) init.push_back(dir * t);
        }
    }
    int get(int t) const {
        assert(t >= 0);
        if (t < int(init.size())) return init.at(t);
        int md = (t - init.size() + 1) % (m * 4);
        if (md < m) return md;
        if (md < m * 3) return m * 2 - md;
        return md - m * 4;
    }
};
constexpr int maxb = 8;
vector<vector<vector<Pendulum>>> pendulums(maxb + 1);

const Pendulum& get_pendulum(const tuple<int, int, int> &bme) {
    return pendulums.at(std::get<0>(bme)).at(std::get<1>(bme)).at(std::get<2>(bme));
}

struct Input {
    int n;
    vector<int> T;
    vector<int> U;
    Input() = default;

    template <class OStream>
    Input(OStream &os) {
        int k;
        os >> n >> k;
        T.resize(k), U.resize(k);
        os >> T >> U;
    }
} instance;

struct State {
    vector<tuple<int, int, int>> sol;
    vector<double> t_mat;
    double tsum;

    double Coeff = 1e7 / (25 * 49 * 50);

    double teval() const { return tsum * Coeff; }

    vector<int> uxs;
    double ueval;

    inline int f(int k, int i, int j) const noexcept { return (k * 50 + i) * 50 + j; }
    inline int g(int k, int i) const noexcept { return k * 50 + i; }

    State(const vector<tuple<int, int, int>> &sol_) : sol(sol_), t_mat(50 * 50 * 50), tsum(0), uxs(50 * 50), ueval(0) {
        REP(k, 50) {
            int t = instance.T.at(k);
            REP(i, 50) REP(j, i) {
                int xi = get_pendulum(sol[i]).get(t), bi = std::get<0>(sol[i]);
                int xj = get_pendulum(sol[j]).get(t), bj = std::get<0>(sol[j]);
                double v = double(abs(xi - xj)) / (bi + bj);
                t_mat.at(f(k, i, j)) = t_mat.at(f(k, j, i)) = v;
                tsum += v;
            }
        }
        REP(k, 50) {
            int t = instance.U.at(k);
            constexpr int INF = 1 << 30;
            int xlo = INF, xhi = -INF;
            REP(i, 50) {
                int x = get_pendulum(sol[i]).get(t);
                uxs.at(g(k, i)) = x;
                chmin(xlo, x);
                chmax(xhi, x);
            }
            ueval += roundl(1e7 / sqrt((xhi - xlo) * 0.05 + 1)) * 0.02;
        }
    }

    double eval() const { return teval() * ueval; }

    double calc_improve(int i, tuple<int, int, int> bme_i) const {
        double tsum_diff = 0;
        REP(k, 50) {
            int t = instance.T.at(k);
            REP(j, 50) {
                if (i == j) continue;
                int xi = get_pendulum(bme_i).get(t), bi = std::get<0>(bme_i);
                int xj = get_pendulum(sol[j]).get(t), bj = std::get<0>(sol[j]);
                double v = double(abs(xi - xj)) / (bi + bj);
                tsum_diff += v - t_mat.at(f(k, i, j));
            }
        }
        double uev = 0;
        REP(k, 50) {
            int t = instance.U.at(k);
            int xlo = get_pendulum(bme_i).get(t), xhi = xlo;
            REP(j, 50) {
                if (i == j) continue;
                int x = get_pendulum(sol[j]).get(t);
                // uxs.at(g(k, i)) = x;
                chmin(xlo, x);
                chmax(xhi, x);
            }
            uev += roundl(1e7 / sqrt((xhi - xlo) * 0.05 + 1)) * 0.02;
        }
        return (tsum + tsum_diff) * Coeff * uev - eval();
    }
};

plint evaluate_plint(const Input &in, const vector<tuple<int, int, int>> &bmes) {
    const int n = bmes.size();
    lint rett = 0, retu = 0;
    for (int t : in.T) {
        double tmp = 0;
        REP(i, bmes.size()) {
            int xi = get_pendulum(bmes[i]).get(t), bi = std::get<0>(bmes[i]);
            REP(j, i) {
                int xj = get_pendulum(bmes[j]).get(t), bj = std::get<0>(bmes[j]);
                tmp += double(abs(xi - xj)) / (bi + bj);
            }
        }
        tmp = tmp * 2e7 / (n * (n - 1));
        rett += roundl(tmp);
    }
    rett = roundl(1.0 * rett / in.T.size());
    for (int u : in.U) {
        constexpr int INF = 1 << 30;
        int xhi = -INF, xlo = INF;
        for (const auto &bme : bmes) {
            int x = get_pendulum(bme).get(u);
            chmax(xhi, x);
            chmin(xlo, x);
        }
        double tmp = 1e7 / sqrtl((xhi - xlo) * 0.05 + 1);
        retu += roundl(tmp);
    }
    retu = roundl(1.0 * retu / in.U.size());
    return {rett, retu};
}

double evaluate_d(const Input &in, const vector<tuple<int, int, int>> &bmes) {
    auto p = evaluate_plint(in, bmes);
    return 1.0 * p.first * p.second;
}

template <class OStream>
void dump(OStream &os, const vector<tuple<int, int, int>> &bmes) {
    for (auto [b, m, e] : bmes) os << b << ' ' << m << ' ' << e << endl;
}

uint32_t rand_int() // XorShift random integer generator
{
    static uint32_t x = 123456789, y = 362436069, z = 521288629, w = 88675123;
    uint32_t t = x ^ (x << 11);
    x = y;
    y = z;
    z = w;
    return w = (w ^ (w >> 19)) ^ (t ^ (t >> 8));
}
double rand_double() { return (double)rand_int() / UINT32_MAX; }


int main() {
    vector<tuple<int, int, int>> bmes, sol;

    FOR(b, 1, maxb + 1) {
        pendulums.at(b).resize(b + 1);
        FOR(m, 1, b + 1) {
            pendulums.at(b).at(m).resize(max(2, b - m + 1));
            FOR(e, 1, max(1, b - m) + 1) {
                pendulums.at(b).at(m).at(e) = Pendulum(b, m, e);
                bmes.emplace_back(b, m, e);
            }
        }
    }
    // dbg(bmes);
    REP(t, 50) sol.emplace_back(bmes.at(rand_int() % bmes.size()));
    instance = Input(cin);

    State state(sol);
    REP(_, 5000) {
        int i = rand_int() % 50;
        auto bme = bmes.at(rand_int() % bmes.size());  // FIXME
        if (state.calc_improve(i, bme) > 0) {
            sol.at(i) = bme;
            state = State(sol);
            dbg(state.eval());
        }
    }
    dump(cout, sol);
}
0