結果

問題 No.973 余興
ユーザー haruki_Kharuki_K
提出日時 2020-11-16 13:00:59
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 5,650 bytes
コンパイル時間 2,441 ms
コンパイル使用メモリ 213,660 KB
実行使用メモリ 202,524 KB
最終ジャッジ日時 2023-09-30 07:15:59
合計ジャッジ時間 39,843 ms
ジャッジサーバーID
(参考情報)
judge14 / judge12
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 852 ms
202,336 KB
testcase_01 AC 853 ms
202,376 KB
testcase_02 AC 874 ms
202,284 KB
testcase_03 AC 865 ms
202,132 KB
testcase_04 AC 864 ms
202,388 KB
testcase_05 WA -
testcase_06 WA -
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 AC 847 ms
194,648 KB
testcase_11 AC 351 ms
74,864 KB
testcase_12 AC 355 ms
74,936 KB
testcase_13 WA -
testcase_14 AC 348 ms
74,336 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 AC 9 ms
8,092 KB
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 WA -
testcase_22 AC 17 ms
11,168 KB
testcase_23 AC 12 ms
9,668 KB
testcase_24 AC 11 ms
9,676 KB
testcase_25 AC 6 ms
5,940 KB
testcase_26 AC 9 ms
8,048 KB
testcase_27 AC 20 ms
12,476 KB
testcase_28 WA -
testcase_29 AC 12 ms
9,320 KB
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 1,121 ms
201,492 KB
testcase_35 AC 1,115 ms
202,304 KB
testcase_36 WA -
testcase_37 WA -
testcase_38 AC 1,137 ms
201,604 KB
testcase_39 WA -
testcase_40 AC 2 ms
4,376 KB
testcase_41 AC 2 ms
4,376 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 WA -
testcase_44 AC 2 ms
4,376 KB
testcase_45 WA -
testcase_46 AC 1,100 ms
202,376 KB
testcase_47 WA -
testcase_48 AC 1,146 ms
202,376 KB
testcase_49 WA -
testcase_50 AC 1,090 ms
201,024 KB
testcase_51 WA -
testcase_52 WA -
testcase_53 AC 1,082 ms
198,872 KB
testcase_54 AC 1,094 ms
202,476 KB
testcase_55 AC 1,093 ms
202,392 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 rng(x,l,r) begin(x) + (l), begin(x) + (r)
#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, class Comp> struct pque : priority_queue<T, vector<T>, Comp> {
    vector<T> &data() { return this->c; }
    void clear() { this->c.clear(); }
};
template <class T> using pque_max = pque<T, less<T>>;
template <class T> using pque_min = pque<T, greater<T>>;
template <class T, class = typename T::iterator, enable_if_t<!is_same<T, string>::value, int> = 0>
ostream& operator<<(ostream& os, T const& a) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, size_t N, enable_if_t<!is_same<T, char>::value, int> = 0>
ostream& operator<<(ostream& os, const T (&a)[N]) { bool f = true; for (auto const& x : a) os << (f ? "" : " ") << x, f = false; return os; }
template <class T, class = decltype(begin(declval<T&>())), class = typename enable_if<!is_same<T, string>::value>::type>
istream& operator>>(istream& is, T &a) { for (auto& x : a) 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(begin(v), end(v), x)-begin(v); }
template <class C, class T> int ubd(C const& v, T const& x) { return upper_bound(begin(v), end(v), x)-begin(v); }
const int dx[] = { 1,0,-1,0,1,-1,-1,1 };
const int dy[] = { 0,1,0,-1,1,1,-1,-1 };
constexpr int popcnt(ll x) { return __builtin_popcountll(x); }
// [a,b]
template <class Int> Int rand(Int a, Int b) { static mt19937_64 mt{random_device{}()}; return uniform_int_distribution<Int>(a,b)(mt); }
i64 irand(i64 a, i64 b) { return rand<i64>(a,b); }
u64 urand(u64 a, u64 b) { return rand<u64>(a,b); }
// <<<

int32_t main() {
    int n, x; cin >> n >> x;
    vector<int> a(n); cin >> a;

    vector<int> right(n), left(n + 1);
    {
        int r = 0;
        int sum = 0;
        rep (l,n) {
            while (r < n && sum + a[r] <= x) sum += a[r++];
            right[l] = r;
            if (l < r) sum -= a[l];
        }
    }
    {
        int l = 0;
        int sum = 0;
        repR (r,n+1) {
            while (l-1 >= 0 && sum + a[l-1] <= x) sum += a[--l];
            left[r] = l;
            if (l < r) sum -= a[r-1];
        }
    }

    auto win = make_v<bool, 2>(n + 1, n + 1);
    auto lsum = make_v<i32, 2>(n + 2, n + 2);
    auto rsum = make_v<i32, 2>(n + 2, n + 2);
    rep (len,n+1) rep (l,n-len+1) {
        int r = l + len;
        if (len == 0) {
            win[l][r] = false;
            continue;
        }
        int cnt = 0;
        cnt += lsum[l+1][r] - lsum[min(right[l], r) + 1][r];
        cnt += rsum[l][r] - rsum[l][max(left[r], l)];
        if (cnt > 0) win[l][r] = true;
        lsum[l][r] = lsum[l+1][r] + (not win[l][r]);
        rsum[l][r+1] = rsum[l][r] + (not win[l][r]);
    }

    cout << (win[0][n] ? "A" : "B") << endl;
}
0