結果

問題 No.973 余興
ユーザー 👑 hitonanodehitonanode
提出日時 2020-01-17 22:39:53
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
WA  
実行時間 -
コード長 4,666 bytes
コンパイル時間 1,694 ms
コンパイル使用メモリ 173,444 KB
実行使用メモリ 101,196 KB
最終ジャッジ日時 2023-09-08 05:15:30
合計ジャッジ時間 48,353 ms
ジャッジサーバーID
（参考情報） 		judge14 / judge13
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 WA -
testcase_01 AC 1,701 ms
101,064 KB
testcase_02 WA -
testcase_03 AC 1,696 ms
100,908 KB
testcase_04 WA -
testcase_05 WA -
testcase_06 AC 1,699 ms
101,060 KB
testcase_07 AC 1,696 ms
101,060 KB
testcase_08 AC 1,694 ms
100,708 KB
testcase_09 AC 1,699 ms
100,928 KB
testcase_10 AC 1,639 ms
97,344 KB
testcase_11 AC 455 ms
38,636 KB
testcase_12 AC 469 ms
38,432 KB
testcase_13 WA -
testcase_14 AC 447 ms
38,144 KB
testcase_15 WA -
testcase_16 WA -
testcase_17 WA -
testcase_18 AC 54 ms
6,168 KB
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 68 ms
6,920 KB
testcase_22 WA -
testcase_23 AC 53 ms
6,196 KB
testcase_24 AC 54 ms
6,128 KB
testcase_25 WA -
testcase_26 WA -
testcase_27 AC 78 ms
7,760 KB
testcase_28 WA -
testcase_29 AC 53 ms
6,352 KB
testcase_30 AC 1,305 ms
101,000 KB
testcase_31 AC 1,303 ms
101,060 KB
testcase_32 AC 1,301 ms
101,180 KB
testcase_33 AC 1,305 ms
101,048 KB
testcase_34 AC 1,269 ms
100,736 KB
testcase_35 AC 1,259 ms
101,000 KB
testcase_36 WA -
testcase_37 AC 1,236 ms
98,364 KB
testcase_38 AC 1,262 ms
100,660 KB
testcase_39 WA -
testcase_40 AC 2 ms
4,376 KB
testcase_41 AC 2 ms
4,380 KB
testcase_42 AC 2 ms
4,380 KB
testcase_43 AC 2 ms
4,376 KB
testcase_44 AC 2 ms
4,380 KB
testcase_45 AC 2 ms
4,376 KB
testcase_46 AC 485 ms
101,000 KB
testcase_47 AC 489 ms
100,948 KB
testcase_48 AC 493 ms
101,044 KB
testcase_49 AC 431 ms
93,284 KB
testcase_50 AC 503 ms
100,140 KB
testcase_51 AC 530 ms
100,996 KB
testcase_52 AC 1,457 ms
100,952 KB
testcase_53 WA -
testcase_54 AC 1,446 ms
100,948 KB
testcase_55 AC 1,449 ms
100,928 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
///// This part below is only for debug, not used /////
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
///// END /////
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds; // find_by_order(), order_of_key()
template<typename TK> using pbds_set = tree<TK, null_type, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename TK, typename TV> using pbds_map = tree<TK, TV, less<TK>, rb_tree_tag, tree_order_statistics_node_update>;
*/

constexpr int LOSE = 1;
constexpr int WIN = 2;

int main()
{
    int N;
    lint X;
    cin >> N >> X;
    vector<lint> A(N);
    cin >> A;

    vector<lint> B(N + 1);
    REP(i, N) B[i + 1] = B[i] + A[i];

    vector<int> lose_lr(N, -1), lose_rl(N + 1, -1);

    vector<vector<int>> win_lose(N + 1, vector<int>(N + 1));
    REP(i, N) win_lose[i][i + 1] = LOSE;
    REP(i, N + 1) win_lose[i][i] = WIN;

    FOR(d, 2, N + 1) {
        REP(l, N - d + 1) {
            bool f = false;
            int r = l + d;
            int i = upper_bound(ALL(B), B[l] + X) - B.begin();

            if (i >= r) f = true;

            if (lose_rl[r] >= 0 and lose_rl[r] <= i) f = true;

            auto j = lower_bound(ALL(B), B[r] - X) - B.begin();
            if (j <= l) f = true;
            if (lose_lr[l] >= 0 and lose_lr[l] >= j) f = true;

            if (f) {
                win_lose[l][r] = WIN;
            } else {
                win_lose[l][r] = LOSE;
                mmax(lose_lr[l], r);
                if (lose_rl[r] < 0) lose_rl[r] = l;
                mmin(lose_rl[r], l);
            }
        }
    }
    cout << (win_lose[0][N] == WIN ? "A" : "B") << endl;
}
0