結果

問題 No.68 よくある棒を切る問題 (2)
ユーザー haruki_Kharuki_K
提出日時 2020-07-13 21:47:19
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 611 ms / 5,000 ms
コード長 5,209 bytes
コンパイル時間 1,951 ms
コンパイル使用メモリ 179,312 KB
実行使用メモリ 39,848 KB
最終ジャッジ日時 2024-11-08 09:11:17
合計ジャッジ時間 14,495 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 550 ms
37,612 KB
testcase_01 AC 553 ms
37,716 KB
testcase_02 AC 560 ms
37,464 KB
testcase_03 AC 604 ms
39,716 KB
testcase_04 AC 611 ms
39,656 KB
testcase_05 AC 604 ms
39,848 KB
testcase_06 AC 534 ms
37,140 KB
testcase_07 AC 544 ms
37,360 KB
testcase_08 AC 565 ms
38,524 KB
testcase_09 AC 586 ms
38,968 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function 'int32_t main()':
main.cpp:114:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  114 |         auto [x,i] = pq.top(); pq.pop();
      |              ^

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using i32 = int32_t;
using i64 = int64_t;
using u32 = uint32_t;
using u64 = uint64_t;
#define int ll
#define double ld
#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define rep1(i,n) for (int i = 1; i <= (int)(n); i++)
#define repR(i,n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = (int)(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
template <class Int> auto constexpr inf = numeric_limits<Int>::max()/2-1;
auto constexpr INF32 = inf<int32_t>;
auto constexpr INF64 = inf<int64_t>;
auto constexpr INF   = inf<int>;
#ifdef LOCAL
#include "debug.hpp"
#else
#define dump(...) (void)(0)
#define say(x) (void)(0)
#define debug if (0)
#endif
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { bool f = true; for (auto const& x : v) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T, class U> constexpr bool chmin(T& x, U const& y) { if (x > y) { x = y; return true; } return false; }
template <class T, class U> constexpr bool chmax(T& x, U const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
template <class T> int sz(T const& x) { return x.size(); }
template <class C, class T> int lbd(C const& v, T const& x) {
    return lower_bound(v.begin(), v.end(), x)-v.begin();
}
template <class C, class T> int ubd(C const& v, T const& x) {
    return upper_bound(v.begin(), v.end(), x)-v.begin();
}
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,1,0,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
template <class Int> struct Random {
    mt19937_64 mt{random_device{}()};
    //mt19937_64 mt{(unsigned)time(0)};
    Int a,b; // [a,b]
    Random(Int a, Int b) : a(a), b(b) {}
    Int operator()() { return uniform_int_distribution<Int>(a,b)(mt); }
};
template <class Int> Int rand(Int a, Int b) { // [a,b]
    static mt19937_64 mt{random_device{}()};
    return uniform_int_distribution<Int>(a,b)(mt);
}
// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> L(n); cin >> L;

    vector<double> len;
    vector<int> num;

    int sum = 0;
    vector<int> cnt(n);
    pque_min<pair<double,int>> pq;

    double l = 0, r = 1e10;
    rep (_,100) {
        auto m = (l+r)/2;
        int cnt = 0;
        rep (i,n) cnt += L[i]/m;
        (cnt >= (int)1e6 ? l : r) = m;
    }
    const double init = l;
    rep (i,n) {
        cnt[i] = double(L[i])/init;
        sum += cnt[i];
        if (cnt[i] > 0) pq.emplace(double(L[i])/cnt[i],i);
    }

    while (pq.size()) {
        auto [x,i] = pq.top(); pq.pop();
        len.eb(x);
        num.eb(sum);
        assert(cnt[i] > 0); --cnt[i];
        assert(sum > 0); --sum;
        if (cnt[i] > 0) {
            pq.emplace(double(L[i])/cnt[i], i);
        }
    }
    reverse(all(len));
    reverse(all(num));

    int q; cin >> q;
    while (q--) {
        int k; cin >> k;
        cout << len[lbd(num,k)] << "\n";
    }
}
0