結果

問題 No.1148 土偶Ⅲ
ユーザー sten_sansten_san
提出日時 2023-02-27 12:26:34
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 67 ms / 2,000 ms
コード長 3,672 bytes
コンパイル時間 2,495 ms
コンパイル使用メモリ 210,432 KB
実行使用メモリ 9,704 KB
最終ジャッジ日時 2023-10-12 22:33:24
合計ジャッジ時間 5,473 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge15
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,372 KB
testcase_01 AC 2 ms
4,372 KB
testcase_02 AC 2 ms
4,368 KB
testcase_03 AC 1 ms
4,368 KB
testcase_04 AC 2 ms
4,372 KB
testcase_05 AC 18 ms
5,428 KB
testcase_06 AC 66 ms
9,704 KB
testcase_07 AC 40 ms
7,232 KB
testcase_08 AC 57 ms
8,836 KB
testcase_09 AC 56 ms
8,580 KB
testcase_10 AC 21 ms
5,364 KB
testcase_11 AC 54 ms
8,660 KB
testcase_12 AC 4 ms
4,368 KB
testcase_13 AC 6 ms
4,372 KB
testcase_14 AC 5 ms
4,368 KB
testcase_15 AC 36 ms
6,948 KB
testcase_16 AC 13 ms
4,700 KB
testcase_17 AC 64 ms
9,364 KB
testcase_18 AC 3 ms
4,368 KB
testcase_19 AC 22 ms
5,748 KB
testcase_20 AC 29 ms
6,412 KB
testcase_21 AC 21 ms
5,400 KB
testcase_22 AC 4 ms
4,368 KB
testcase_23 AC 9 ms
4,368 KB
testcase_24 AC 16 ms
4,368 KB
testcase_25 AC 16 ms
4,368 KB
testcase_26 AC 67 ms
5,632 KB
testcase_27 AC 8 ms
4,372 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

#include <atcoder/segtree>

constexpr auto inf = INT_MAX / 4;

int op(int x, int y) {
    return min(x, y);
}
int elem() {
    return inf;
}

using segtree = atcoder::segtree<int, op, elem>;

int main() {
    int n, w; cin >> n >> w;
    auto a = vec<int>(uns, n);
    for (auto &e : a) cin >> e;

    auto acc = vec<int64_t>(uns, n + 1);

    acc[0] = 0;
    for (int i = 0; i < n; ++i) {
        acc[i + 1] = acc[i] + a[i];
    }

    segtree seg([&]() {
        map<int, optional<int>> last;

        auto r = vec<int>(uns, n);
        for (int i = n - 1; 0 <= i; --i) {
            r[i] = last[a[i]].value_or(n); last[a[i]] = i;
        }

        return r;
    }());

    auto check = [&](int m) {
        for (int i = 0; i + m <= n; ++i) {
            if (w < acc[i + m] - acc[i]) {
                continue;
            }
            if (seg.prod(i, i + m) < i + m) {
                continue;
            }
            return true;
        }
        return false;
    };

    int l = 0, r = n + 1;
    while (1 < r - l) {
        int m = l + (r - l) / 2;

        if (check(m)) {
            l = m;
        }
        else {
            r = m;
        }
    }

    cout << l << endl;
}
0