結果
| 問題 |
No.5008 [Cherry Alpha] Discrete Pendulum with Air Resistance
|
| コンテスト | |
| ユーザー |
 hitonanode
|
| 提出日時 | 2022-10-15 00:04:41 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 1,117 ms / 2,000 ms |
| コード長 | 12,399 bytes |
| コンパイル時間 | 1,912 ms |
| 実行使用メモリ | 5,164 KB |
| スコア | 1,429,724,441,516,302 |
| 最終ジャッジ日時 | 2022-10-15 00:05:54 |
| 合計ジャッジ時間 | 64,908 ms |
|
ジャッジサーバーID （参考情報） |
judge10 / judge14 |
| 純コード判定しない問題か言語 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| 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 >= 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 = 10;
vector<vector<vector<pair<vector<int>, vector<int>>>>> txs_uxs(maxb + 1);
const pair<vector<int>, vector<int>> &get_txs_uxs(const tuple<int, int, int> &bme) {
return txs_uxs.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; }
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) {
REP(i, 50) REP(j, i) {
int xi = get_txs_uxs(sol[i]).first.at(k), bi = std::get<0>(sol[i]);
int xj = get_txs_uxs(sol[j]).first.at(k), 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) {
constexpr int INF = 1 << 30;
int xlo = INF, xhi = -INF;
REP(i, 50) {
int x = get_txs_uxs(sol[i]).second.at(k);
chmin(xlo, x);
chmax(xhi, x);
}
ueval += roundl(1e7 / sqrt((xhi - xlo) * 0.05 + 1)) * 0.02;
}
}
double eval() const { return teval() * ueval; }
pair<double, double> calc_improve(int i, tuple<int, int, int> bme_i) const {
double tsum_diff = 0;
REP(k, 50) {
REP(j, 50) {
if (i == j) continue;
int xi = get_txs_uxs(bme_i).first.at(k), bi = std::get<0>(bme_i);
int xj = get_txs_uxs(sol[j]).first.at(k), 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 xlo = get_txs_uxs(bme_i).second.at(k), xhi = xlo;
REP(j, 50) {
if (i == j) continue;
int x = get_txs_uxs(sol[j]).second.at(k);
chmin(xlo, x);
chmax(xhi, x);
}
uev += roundl(1e7 / sqrt((xhi - xlo) * 0.05 + 1)) * 0.02;
}
return make_pair((tsum + tsum_diff) * Coeff * uev - eval(), uev);
}
void set(int i, tuple<int, int, int> bme_i, double new_uev) {
sol[i] = bme_i;
REP(k, 50) {
REP(j, 50) {
if (i == j) continue;
int xi = get_txs_uxs(bme_i).first.at(k), bi = std::get<0>(bme_i);
int xj = get_txs_uxs(sol[j]).first.at(k), bj = std::get<0>(sol[j]);
double v = double(abs(xi - xj)) / (bi + bj);
tsum += v - t_mat.at(f(k, i, j));
t_mat.at(f(k, i, j)) = t_mat.at(f(k, j, i)) = v;
}
}
ueval = new_uev;
}
};
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() {
instance = Input(cin);
vector<tuple<int, int, int>> bmes, sol;
FOR(b, 1, maxb + 1) {
txs_uxs.at(b).resize(b + 1);
FOR(m, 1, b + 1) {
txs_uxs.at(b).at(m).resize(max(2, b - m + 1));
FOR(e, 1, max(1, b - m) + 1) {
Pendulum pen(b, m, e);
for (int t : instance.T) txs_uxs.at(b).at(m).at(e).first.push_back(pen.get(t));
for (int t : instance.U) txs_uxs.at(b).at(m).at(e).second.push_back(pen.get(t));
bmes.emplace_back(b, m, e);
}
}
}
REP(t, 50) sol.emplace_back(bmes.at(rand_int() % bmes.size()));
State state(sol);
REP(_, 20000) {
int i = rand_int() % 50;
auto bme = bmes.at(rand_int() % bmes.size()); // FIXME
auto imp = state.calc_improve(i, bme);
if (imp.first > 0) {
sol.at(i) = bme;
state.set(i, bme, imp.second);
dbg(state.eval());
}
}
dump(cout, sol);
}