結果
問題 | No.5008 [Cherry Alpha] Discrete Pendulum with Air Resistance |
ユーザー |
![]() |
提出日時 | 2022-10-14 23:12:41 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,205 ms / 2,000 ms |
コード長 | 10,657 bytes |
コンパイル時間 | 2,049 ms |
実行使用メモリ | 6,952 KB |
スコア | 1,349,976,373,391,041 |
最終ジャッジ日時 | 2022-10-14 23:13:57 |
合計ジャッジ時間 | 69,256 ms |
ジャッジサーバーID (参考情報) |
judge10 / judge15 |
純コード判定しない問題か言語 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 50 |
ソースコード
#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 >= 201703Ltemplate <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 << ')'; }#endiftemplate <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_LOCALconst 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)#endifstruct 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 = 5;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;template <class OStream>Input(OStream &os) {int k;os >> n >> k;T.resize(k), U.resize(k);os >> T >> U;}};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(t % 2 + 1, 1, 1);Input instance(cin);dbg(instance.T);dbg(instance.U);auto ev = evaluate_plint(instance, sol);double eval_tmp = evaluate_d(instance, sol);REP(_, 1000) {int i = rand_int() % bmes.size(); // FIXMEint j = rand_int() % sol.size(); // FIXMEauto bme = bmes.at(i);swap(sol.at(j), bme);double eval_nxt = evaluate_d(instance, sol);if (chmax(eval_tmp, eval_nxt)) {dbg(eval_tmp);} else {swap(sol.at(j), bme);}}dump(cout, sol);}