結果

問題 No.1739 Princess vs. Dragoness (& AoE)
ユーザー commy
提出日時 2022-09-11 03:25:26
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 248 ms / 3,000 ms
コード長 2,465 bytes
コンパイル時間 707 ms
コンパイル使用メモリ 83,084 KB
最終ジャッジ日時 2025-02-07 04:12:59
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 40
権限があれば一括ダウンロードができます
コンパイルメッセージ
In file included from /usr/include/c++/13/iostream:41,
                 from main.cpp:2:
In member function ‘std::basic_ostream<_CharT, _Traits>::__ostream_type& std::basic_ostream<_CharT, _Traits>::operator<<(long long int) [with _CharT = char; _Traits = std::char_traits<char>]’,
    inlined from ‘void print(const T&, const Ts& ...) [with T = long long int; Ts = {}]’ at main.cpp:26:85,
    inlined from ‘int main()’ at main.cpp:77:10:
/usr/include/c++/13/ostream:204:25: warning: ‘ans’ may be used uninitialized [-Wmaybe-uninitialized]
  204 |       { return _M_insert(__n); }
      |                ~~~~~~~~~^~~~~
main.cpp: In function ‘int main()’:
main.cpp:46:25: note: ‘ans’ was declared here
   46 |     ll l = 0, r = h[0], ans;
      |                         ^~~

ソースコード

diff #
プレゼンテーションモードにする

#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>
#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;
// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on
int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    ll n, a, b, x, y;
    cin, n, a, b, x, y;
    const vector<ll> h = [&]() {
        vector<ll> h(n);
        rep(i, 0, n) {
            cin, h[i];
        }
        sort(h.rbegin(), h.rend());
        return h;
    }();
    ll l = 0, r = h[0], ans;
    while (l <= r) {
        ll aa = a;
        ll mid = (l + r) / 2;
        auto hp = h;
        rep(i, 0, n) {
            hp[i] = max(0LL, hp[i] - mid);
        }
        rep(i, 0, n) {
            ll cnt = hp[i] / x;
            cnt = min(aa, cnt);
            aa -= cnt;
            hp[i] -= x * cnt;
            chmax(hp[i], 0LL);
        }
        sort(hp.rbegin(), hp.rend());
        rep(i, 0, min(n, aa)) {
            hp[i] = 0;
        }
        ll rest = 0;
        rep(i, 0, n) {
            rest += hp[i];
        }
        if (rest <= y * b) {
            ans = mid;
            r = mid - 1;
        } else {
            l = mid + 1;
        }
    }
    print(ans);
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0