結果

問題 No.1211 円環はお断り
ユーザー haruki_Kharuki_K
提出日時 2020-09-03 15:55:17
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 327 ms / 2,000 ms
コード長 5,284 bytes
コンパイル時間 5,095 ms
コンパイル使用メモリ 205,784 KB
実行使用メモリ 36,116 KB
最終ジャッジ日時 2023-08-15 12:59:36
合計ジャッジ時間 9,395 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,376 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 1 ms
4,504 KB
testcase_06 AC 2 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 1 ms
4,380 KB
testcase_10 AC 2 ms
4,376 KB
testcase_11 AC 1 ms
4,380 KB
testcase_12 AC 2 ms
4,376 KB
testcase_13 AC 144 ms
20,204 KB
testcase_14 AC 227 ms
25,552 KB
testcase_15 AC 212 ms
25,140 KB
testcase_16 AC 314 ms
35,404 KB
testcase_17 AC 25 ms
5,968 KB
testcase_18 AC 190 ms
22,680 KB
testcase_19 AC 22 ms
5,864 KB
testcase_20 AC 31 ms
7,012 KB
testcase_21 AC 27 ms
6,660 KB
testcase_22 AC 154 ms
20,872 KB
testcase_23 AC 183 ms
23,804 KB
testcase_24 AC 97 ms
14,872 KB
testcase_25 AC 7 ms
4,376 KB
testcase_26 AC 227 ms
26,972 KB
testcase_27 AC 99 ms
14,968 KB
testcase_28 AC 237 ms
27,576 KB
testcase_29 AC 166 ms
22,332 KB
testcase_30 AC 230 ms
28,616 KB
testcase_31 AC 87 ms
13,400 KB
testcase_32 AC 284 ms
32,820 KB
testcase_33 AC 316 ms
35,832 KB
testcase_34 AC 327 ms
35,848 KB
testcase_35 AC 308 ms
36,116 KB
testcase_36 AC 300 ms
35,928 KB
testcase_37 AC 314 ms
36,028 KB
testcase_38 AC 139 ms
35,920 KB
testcase_39 AC 163 ms
36,068 KB
testcase_40 AC 255 ms
35,952 KB
testcase_41 AC 1 ms
4,376 KB
testcase_42 AC 2 ms
4,380 KB
権限があれば一括ダウンロードができます

ソースコード

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) begin(x), end(x)
#define allR(x) rbegin(x), rend(x)
#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,k; cin >> n >> k;
    vector<int> a(n); cin >> a;

    int ma = sumof(all(a))/k;

    auto check = [&](int x) -> bool {
        if (x > ma) return false;

        const int LG = 20;
        static auto to = make_v<int,2>(LG,n);
        static auto len = make_v<int,2>(LG,n);

        int r = 0, sum = 0;
        rep (l,n) {
            while (sum < x) sum += a[r%n], r++;
            to[0][l] = r%n;
            len[0][l] = r-l;
            sum -= a[l];
        }
        dump(to[0]);

        rep (i,LG-1) rep (j,n) {
            to[i+1][j] = to[i][to[i][j]];
            len[i+1][j] = len[i][to[i][j]] + len[i][j];
        }

        rep (i,n) {
            int pos = i, sum = 0;
            rep (j,LG) if (k>>j&1) {
                sum += len[j][pos];
                pos = to[j][pos];
            }
            if (sum <= n) return true;
        }
        return false;
    };

    int l = 0, r = 1e15;
    while (l+1 < r) {
        int m = (l+r)/2;
        (check(m) ? l : r) = m;
    }
    cout << l << endl;

}
0