結果
問題 | No.2009 Drunkers' Contest |
ユーザー | srtubaki |
提出日時 | 2022-07-15 22:26:58 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 67 ms / 2,000 ms |
コード長 | 5,358 bytes |
コンパイル時間 | 2,125 ms |
コンパイル使用メモリ | 205,560 KB |
実行使用メモリ | 18,896 KB |
最終ジャッジ日時 | 2023-09-10 03:05:06 |
合計ジャッジ時間 | 7,270 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 2 ms
4,376 KB |
testcase_11 | AC | 1 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 2 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,376 KB |
testcase_15 | AC | 3 ms
4,376 KB |
testcase_16 | AC | 2 ms
4,376 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 3 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,376 KB |
testcase_20 | AC | 3 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 3 ms
4,380 KB |
testcase_23 | AC | 3 ms
4,380 KB |
testcase_24 | AC | 60 ms
9,468 KB |
testcase_25 | AC | 60 ms
9,456 KB |
testcase_26 | AC | 60 ms
9,432 KB |
testcase_27 | AC | 60 ms
9,432 KB |
testcase_28 | AC | 61 ms
9,380 KB |
testcase_29 | AC | 61 ms
9,420 KB |
testcase_30 | AC | 60 ms
9,424 KB |
testcase_31 | AC | 60 ms
9,436 KB |
testcase_32 | AC | 60 ms
9,500 KB |
testcase_33 | AC | 61 ms
9,328 KB |
testcase_34 | AC | 55 ms
9,464 KB |
testcase_35 | AC | 55 ms
9,432 KB |
testcase_36 | AC | 56 ms
9,376 KB |
testcase_37 | AC | 55 ms
9,440 KB |
testcase_38 | AC | 55 ms
9,424 KB |
testcase_39 | AC | 56 ms
9,316 KB |
testcase_40 | AC | 55 ms
9,432 KB |
testcase_41 | AC | 56 ms
9,376 KB |
testcase_42 | AC | 56 ms
9,312 KB |
testcase_43 | AC | 56 ms
9,372 KB |
testcase_44 | AC | 66 ms
18,564 KB |
testcase_45 | AC | 67 ms
18,896 KB |
testcase_46 | AC | 52 ms
18,116 KB |
testcase_47 | AC | 45 ms
18,568 KB |
testcase_48 | AC | 45 ms
18,160 KB |
testcase_49 | AC | 45 ms
17,888 KB |
testcase_50 | AC | 46 ms
17,828 KB |
testcase_51 | AC | 46 ms
18,764 KB |
testcase_52 | AC | 43 ms
14,072 KB |
testcase_53 | AC | 51 ms
14,276 KB |
testcase_54 | AC | 50 ms
14,384 KB |
testcase_55 | AC | 45 ms
10,060 KB |
testcase_56 | AC | 45 ms
9,700 KB |
testcase_57 | AC | 48 ms
13,908 KB |
ソースコード
#pragma region template #include <bits/stdc++.h> using namespace std; // clang-format off using ll = long long; using vl = vector<ll>; using vvl = vector<vl>; using ld = long double; using vld = vector<ld>; using vvld = vector<vld>; using pll = pair<ll, ll>; using vpll = vector<pll>; using vvpll = vector<vpll>; using vb = vector<bool>; using vvb = vector<vector<bool>>; using vs = vector<string>; using mll = map<ll, ll>; template <class T> using V = vector<T>; template <class T> using VV = V<V<T>>; template <class T> using VVV = V<VV<T>>; template <class T> using max_heap = priority_queue<T>; template <class T> using min_heap = priority_queue<T, vector<T>, greater<T>>; constexpr ll inf = 3001001000100100100LL; #define endl '\n' #define _overload(_1, _2, _3, name, ...) name #define rep(...) _overload(__VA_ARGS__, _rep, _rep2,)(__VA_ARGS__) #define repc(...) _overload(__VA_ARGS__, _repc, _repc2,)(__VA_ARGS__) #define repr(...) _overload(__VA_ARGS__, _repr, _repr2,)(__VA_ARGS__) #define reprc(...) _overload(__VA_ARGS__, _reprc, _reprc2,)(__VA_ARGS__) #define _rep(i,k,n) for(ll i=(k) , i##_xxxx=(n); i < i##_xxxx; ++i) #define _repc(i,k,n) for(ll i=(k) , i##_xxxx=(n); i <=i##_xxxx; ++i) #define _repr(i,k,n) for(ll i=(n)-1, i##_xxxx=(k); i >=i##_xxxx; --i) #define _reprc(i,k,n) for(ll i=(n) , i##_xxxx=(k); i >=i##_xxxx; --i) #define _rep2(i,n) _rep(i,0,n) #define _repc2(i,n) _repc(i,1,n) #define _repr2(i,n) _repr(i,0,n) #define _reprc2(i,n) _reprc(i,1,n) #define rall(o) rbegin(o), rend(o) #define all(o) begin(o), end(o) template <class C> ll sz(const C& c) { return static_cast<ll>(c.size()); } template <class T> bool chmax(T& m, const T& v){ if (m < v){ m = v; return true; } return false; } template <class T> bool chmin(T& m, const T& v){ if (v < m){ m = v; return true; } return false; } template <class T> T cdiv(const T& a, const T& b){ return (a + b - 1) / b; } template <class T> T rdiv(const T& a, const T& b){ return (a + b / 2) / b; } template <class T, class S> string join(const T& v, const S& sep ){ stringstream ss; bool f = false; for (const auto& e : v){ if (f) ss << sep; f = true; ss << e;} return ss.str(); } template <class T, class S, class... U> string join(const T& v, const S& sep, const U& ...args){ stringstream ss; bool f = false; for (const auto& c : v){ if (f) ss << sep; f = true; ss << join(c, args...); } return ss.str(); } template <class T> ostream& operator<<(ostream& os, const vector<T>& seq){ os << '[' << join(seq, ",") << ']'; return os; } template <class T> ostream& operator<<(ostream& os, const vector<vector<T>>& seq){ os << '[' << join(seq, ",\n ") << ']'; return os; } template <class T> ostream& operator<<(ostream& os, const deque<T>& seq){ os << '[' << join(seq, ",") << ']'; return os; } template <class T> ostream& operator<<(ostream& os, const set<T>& seq){ os << '{' << join(seq, ",") << '}'; return os; } template <class T , class TH> ostream& operator<<(ostream& os, const unordered_set<T, TH>& seq){ os << '{' << join(seq, ",") << '}'; return os; } template <class TK, class TV> ostream& operator<<(ostream& os, const map<TK, TV>& seq){ os << '{'; bool f = false; for (const auto& e : seq){ if (f) os << ','; f = true; os << e.first << ":" << e.second; } os << '}'; return os; } template <class T1, class T2> ostream& operator<<(ostream& os, const pair<T1, T2>& pa){ os << '(' << pa.first << ',' << pa.second << ')'; return os; } #if LOCAL #define debug(...) _debug(__VA_ARGS__, __LINE__) #else #define debug(...) #endif void print() { std::cout << '\n'; } template <class S> void print(const S& a){ std::cout << a << '\n'; } template <class S> void _debug(const S& a){ std::cerr << "(L:" << std::setw(3) << a << ")\n"; } template <class S, class... T> void print(const S& a, const T&... args){ std::cout << a << ' '; print(args...); } template <class S, class... T> void _debug(const S& a, const T&... args){ std::cerr << a << ' '; _debug(args...); } struct setup_main { setup_main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); std::cout << fixed << setprecision(15); } } setup_main_; // clang-format on #pragma endregion void solve(ll N, const vector<ll>& A, const vector<ll>& B) { vl sumA(N + 1, 0); rep(i, N) sumA[i + 1] = sumA[i] + A[i]; vl sumB(N + 1, 0); rep(i, N) sumB[i + 1] = sumB[i] + B[i]; // [{x,i}...] vector<pair<ld, ll>> X; X.push_back({inf, N}); repr(i, N) { ll a = A[i], b = B[i]; ld x = sqrt((ld)a / b); while (X.back().first < x) { X.pop_back(); ll j = X.back().second; a = sumA[j] - sumA[i], b = sumB[j] - sumB[i]; x = sqrt((ld)a / b); } X.emplace_back(x, i); } { ld ans = 0; ld x = 1; rep(i, N) { if (X.back().second == i) { chmax(x, X.back().first); X.pop_back(); } ans += A[i] / x + B[i] * x; } print(ans); } } int main() { int N; cin >> N; vector<ll> A(N), B(N); rep(i, N) { cin >> A[i]; } rep(i, N) { cin >> B[i]; } solve(N, A, B); }