結果

問題 No.511 落ちゲー 〜手作業のぬくもり〜
ユーザー PachicobuePachicobue
提出日時 2019-03-15 02:26:46
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,587 ms / 4,000 ms
コード長 14,393 bytes
コンパイル時間 2,605 ms
コンパイル使用メモリ 218,296 KB
実行使用メモリ 11,776 KB
最終ジャッジ日時 2024-05-03 12:46:04
合計ジャッジ時間 9,718 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,376 KB
testcase_02 AC 2 ms
5,376 KB
testcase_03 AC 2 ms
5,376 KB
testcase_04 AC 2 ms
5,376 KB
testcase_05 AC 2 ms
5,376 KB
testcase_06 AC 2 ms
5,376 KB
testcase_07 AC 2 ms
5,376 KB
testcase_08 AC 2 ms
5,376 KB
testcase_09 AC 2 ms
5,376 KB
testcase_10 AC 2 ms
5,376 KB
testcase_11 AC 2 ms
5,376 KB
testcase_12 AC 2 ms
5,376 KB
testcase_13 AC 2 ms
5,376 KB
testcase_14 AC 2 ms
5,376 KB
testcase_15 AC 2 ms
5,376 KB
testcase_16 AC 2 ms
5,376 KB
testcase_17 AC 2 ms
5,376 KB
testcase_18 AC 2 ms
5,376 KB
testcase_19 AC 2 ms
5,376 KB
testcase_20 AC 2 ms
5,376 KB
testcase_21 AC 4 ms
5,376 KB
testcase_22 AC 4 ms
5,376 KB
testcase_23 AC 5 ms
5,376 KB
testcase_24 AC 2 ms
5,376 KB
testcase_25 AC 4 ms
5,376 KB
testcase_26 AC 3 ms
5,376 KB
testcase_27 AC 7 ms
5,376 KB
testcase_28 AC 8 ms
5,376 KB
testcase_29 AC 1,587 ms
11,776 KB
testcase_30 AC 1,287 ms
11,392 KB
testcase_31 AC 758 ms
11,008 KB
testcase_32 AC 297 ms
11,776 KB
testcase_33 AC 198 ms
6,528 KB
testcase_34 AC 320 ms
5,632 KB
testcase_35 AC 663 ms
11,776 KB
testcase_36 AC 653 ms
11,776 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
#pragma GCC diagnostic ignored "-Wsign-compare"
#pragma GCC diagnostic ignored "-Wsign-conversion"
//!===========================================================!//
//!  dP     dP                          dP                    !//
//!  88     88                          88                    !//
//!  88aaaaa88a .d8888b. .d8888b. .d888b88 .d8888b. 88d888b.  !//
//!  88     88  88ooood8 88'  '88 88'  '88 88ooood8 88'  '88  !//
//!  88     88  88.  ... 88.  .88 88.  .88 88.  ... 88        !//
//!  dP     dP  '88888P' '88888P8 '88888P8 '88888P' dP        !//
//!===========================================================!//
using ld = long double;
using ll = long long;
using ull = unsigned long long;
std::mt19937 mt{std::random_device{}()};
template <typename T>
constexpr T INF = std::numeric_limits<T>::max() / 4;
template <typename T>
constexpr T MOD = static_cast<T>(1000000007);
template <typename F>
constexpr F PI() { return 3.1415926535897932385; }
template <typename T, std::size_t N>
std::ostream& operator<<(std::ostream& os, const std::array<T, N>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename T, typename A>
std::ostream& operator<<(std::ostream& os, const std::deque<T, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename K, typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::multimap<K, T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::multiset<T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename K, typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::map<K, T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::pair<T1, T2>& v) { return (os << "<" << v.first << "," << v.second << ">"); }
template <typename T1, typename T2, typename T3>
std::ostream& operator<<(std::ostream& os, const std::priority_queue<T1, T2, T3>& v)
{
    auto q = v;
    os << "[";
    while (not q.empty()) { os << q.top() << ",", q.pop(); }
    return os << "]\n";
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::queue<T1>& v)
{
    auto q = v;
    os << "[";
    while (not q.empty()) { os << q.front() << ",", q.pop(); }
    return os << "]\n";
}
template <typename T, typename C, typename A>
std::ostream& operator<<(std::ostream& os, const std::set<T, C, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& os, const std::stack<T1>& v)
{
    auto q = v;
    os << "[";
    while (not q.empty()) { os << q.top() << ",", q.pop(); }
    return os << "]\n";
}
template <typename K, typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_multimap<K, T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_multiset<T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename K, typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_map<K, T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << "<" << e.first << ": " << e.second << ">,"; }
    return (os << "]" << std::endl);
}
template <typename T, typename H, typename P, typename A>
std::ostream& operator<<(std::ostream& os, const std::unordered_set<T, H, P, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
template <typename T, typename A>
std::ostream& operator<<(std::ostream& os, const std::vector<T, A>& v)
{
    os << "[";
    for (const auto& e : v) { os << e << ","; }
    return (os << "]" << std::endl);
}
#define SHOW(...) (std::cerr << "(" << #__VA_ARGS__ << ") = ("), HogeHogeSansuu(__VA_ARGS__), std::cerr << ")" << std::endl;
void HogeHogeSansuu() { ; }
template <typename T>
void HogeHogeSansuu(const T x) { std::cerr << x; }
template <typename T, typename... Args>
void HogeHogeSansuu(const T x, Args... args) { (std::cerr << x << ", "), HogeHogeSansuu(args...); }
template <typename T>
std::vector<T> Vec(const std::size_t n, T v) { return std::vector<T>(n, v); }
template <class... Args>
auto Vec(const std::size_t n, Args... args) { return std::vector<decltype(Vec(args...))>(n, Vec(args...)); }
template <typename T>
constexpr T PopCount(T v) { return v = (v & 0x5555555555555555ULL) + (v >> 1 & 0x5555555555555555ULL), v = (v & 0x3333333333333333ULL) + (v >> 2 & 0x3333333333333333ULL), v = (v + (v >> 4)) & 0x0F0F0F0F0F0F0F0FULL, static_cast<T>(v * 0x0101010101010101ULL >> 56 & 0x7f); }
template <typename T>
constexpr T log2p1(T v) { return v |= (v >> 1), v |= (v >> 2), v |= (v >> 4), v |= (v >> 8), v |= (v >> 16), v |= (v >> 32), PopCount(v); }
template <typename T>
constexpr bool ispow2(const T v) { return (v << 1) == (T(1) << (log2p1(v))); }
template <typename T>
constexpr T ceil2(const T v) { return ispow2(v) ? v : T(1) << log2p1(v); }
template <typename T>
constexpr T floor2(const T v) { return v == 0 ? T(0) : ispow2(v) ? v : T(1) << (log2p1(v) - 1); }
//!=======================================================================!//
//!  dP                                      .d88888b                     !//
//!  88                                      88.    "'                    !//
//!  88        .d8888b. d888888b dP    dP    'Y88888b. .d8888b. .d8888b.  !//
//!  88        88'  '88    .d8P' 88    88          '8b 88ooood8 88'  '88  !//
//!  88        88.  .88  .Y8P    88.  .88    d8'   .8P 88.  ... 88.  .88  !//
//!  88888888P '88888P8 d888888P '8888P88     Y88888P  '88888P' '8888P88  !//
//!                                   .88                            .88  !//
//!                               d8888P                         d8888P   !//
//!=======================================================================!//
template <typename Base>
class LazySeg
{
public:
    using BaseAlgebra = Base;
    using ValMonoid = typename BaseAlgebra::ValMonoid;
    using OpMonoid = typename BaseAlgebra::OpMonoid;
    using T = typename BaseAlgebra::VT;
    using F = typename BaseAlgebra::OT;
    LazySeg(const std::size_t N, const T initial = ValMonoid::id()) : size(N), half(ceil2(size)), value(half << 1, ValMonoid::id()), action(half << 1, OpMonoid::id())
    {
        if (initial != ValMonoid::id()) {
            std::fill(value.begin() + half, value.end(), initial);
            for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
        }
    }
    template <typename InIt>
    LazySeg(const InIt first, const InIt last) : size(std::distance(first, last)), half(ceil2(size)), value(half << 1, ValMonoid::id()), action(half << 1, OpMonoid::id())
    {
        std::copy(first, last, value.begin() + half);
        for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
    }
    void init(const T initial = ValMonoid::id())
    {
        std::fill(action.begin(), action.end(), OpMonoid::id()), std::fill(value.begin(), value.begin() + half, ValMonoid::id()), std::fill(value.begin() + half, value.end(), initial);
        for (std::size_t i = half - 1; i >= 1; i--) { up(i); }
    }
    T get(const std::size_t a) const { return accumulate(a, a + 1); }
    void set(std::size_t a, const T& val)
    {
        modify(a, a + 1, OpMonoid::id()), value[a += half] = val;
        while (a >>= 1) { up(a); }
    }
    T accumulate(const std::size_t L, const std::size_t R) const
    {
        auto arec = [&](auto&& self, const std::size_t index, const std::size_t left, const std::size_t right) -> T {
            if (L <= left and right <= R) {
                return value[index];
            } else if (right <= L or R <= left) {
                return ValMonoid::id();
            } else {
                return act(action[index], acc(self(self, index << 1, left, (left + right) >> 1), self(self, index << 1 | 1, (left + right) >> 1, right)));
            }
        };
        return arec(arec, 1, 0, half);
    }
    void modify(const std::size_t L, const std::size_t R, const F& f)
    {
        auto mrec = [&](auto&& self, const std::size_t index, const std::size_t left, const std::size_t right) -> void {
            if (L <= left and right <= R) {
                this->update(index, f);
            } else if (right <= L or R <= left) {
            } else {
                this->update(index << 1, action[index]), this->update(index << 1 | 1, action[index]);
                self(self, index << 1, left, (left + right) >> 1), self(self, index << 1 | 1, (left + right) >> 1, right);
                this->up(index), action[index] = OpMonoid::id();
            }
        };
        mrec(mrec, 1, 0, half);
    }
    std::vector<T> data() const
    {
        std::vector<T> ans(size);
        for (std::size_t i = 0; i < size; i++) { ans[i] = get(i); }
        return ans;
    }

private:
    void up(const std::size_t i) { value[i] = acc(value[i << 1], value[i << 1 | 1]); }
    void update(const std::size_t i, const F& f) { value[i] = act(f, value[i]), action[i] = compose(f, action[i]); }
    const std::size_t size, half;
    std::vector<T> value;
    std::vector<F> action;
    const ValMonoid acc{};
    const OpMonoid compose{};
    const BaseAlgebra act{};
};

template <typename T>
std::ostream& operator<<(std::ostream& os, const LazySeg<T>& seg)
{
    os << "[";
    for (const auto& e : seg.data()) { os << e << ","; }
    return (os << "]" << std::endl);
}
//!===============================================================================================!//
//!   888888ba   888888ba  oo             .d88888b                                      dP        !//
//!   88    '8b  88    '8b                88.    "'                                     88        !//
//!  a88aaaa8P' a88aaaa8P' dP 88d888b.    'Y88888b. .d8888b. .d8888b. 88d888b. .d8888b. 88d888b.  !//
//!   88         88   '8b. 88 88'  '88          '8b 88ooood8 88'  '88 88'  '88 88'  '"" 88'  '88  !//
//!   88         88    .88 88 88    88    d8'   .8P 88.  ... 88.  .88 88       88.  ... 88    88  !//
//!   dP         88888888P dP dP    dP     Y88888P  '88888P' '88888P8 dP       '88888P' dP    dP  !//
//!===============================================================================================!//
template <typename C, typename X, typename InIt>
std::vector<std::size_t> PBinSearch(C& checker, const InIt first, const InIt last, const X inf, const X sup)
{
    const std::size_t Q = (std::size_t)(std::distance(first, last));
    std::vector<std::size_t> ans(Q, sup);
    using QInt = std::pair<std::pair<X, X>, std::size_t>;
    std::queue<QInt> qs;
    for (std::size_t i = 0; i < Q; i++) { qs.push({{inf, sup}, i}); }
    for (X pos = inf; not qs.empty();) {
        std::vector<QInt> nqs;
        const auto qint = qs.front();
        qs.pop();
        const X l = qint.first.first, r = qint.first.second, m = (l + r) / 2;
        const std::size_t q = qint.second;
        if (r - l <= 1) {
            ans[q] = r;
        } else {
            if (m < pos) { checker.init(inf), pos = inf; }
            for (; pos < m; pos++) { checker.advance(); }
            qs.push(checker.check(*std::next(first, q)) ? QInt{{l, m}, q} : QInt{{m, r}, q});
        }
    }
    return ans;
}
//!=====================================================================!//
//!  8888ba.88ba  oo                    888888ba  dP                    !//
//!  88  '8b  '8b                       88    '8b 88                    !//
//!  88   88   88 dP 88d888b.          a88aaaa8P' 88 dP    dP .d8888b.  !//
//!  88   88   88 88 88'  '88 88888888  88        88 88    88 Y8ooooo.  !//
//!  88   88   88 88 88    88           88        88 88.  .88       88  !//
//!  dP   dP   dP dP dP    dP           dP        dP '88888P' '88888P'  !//
//!=====================================================================!//
template <typename VX = ll, typename OX = ll>
struct Min_Plus
{
    using VT = VX;
    struct ValMonoid
    {
        VT operator()(const VT& a, const VT& b) const { return std::min(a, b); }
        static constexpr VT id() { return INF<VT>; }
    };
    using OT = OX;
    struct OpMonoid
    {
        OT operator()(const OT& a, const OT& b) const { return a + b; }
        static constexpr OT id() { return 0; }
    };
    VT operator()(const OT& f, const VT& x) const { return f + x; }
};
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    int N, W;
    ll H;
    std::cin >> N >> W >> H;
    std::vector<int> a(N), x(N);
    std::vector<ll> b(N);
    for (int i = 0; i < N; i++) { std::cin >> a[i] >> b[i] >> x[i], x[i]--; }
    struct Checker
    {
        Checker(const std::vector<int>& a, const std::vector<ll>& b, const std::vector<int>& x, const int W, const ll H) : a{a}, x{x}, b{b}, W{W}, H{H}, cnt(-1), seg(W, 0LL) {}
        void init(int inf) { cnt = inf, seg.init(0LL); }
        void advance() { cnt++, seg.modify(x[cnt], x[cnt] + a[cnt], b[cnt]); }
        bool check(int ind) const { return seg.get(ind) >= H; }
        const std::vector<int>&a, &x;
        const std::vector<ll>& b;
        const int W;
        const ll H;
        int cnt;
        LazySeg<Min_Plus<ll, ll>> seg;
    };
    std::vector<int> X(W);
    std::iota(X.begin(), X.end(), 0);
    Checker checker(a, b, x, W, H);
    const auto ans = PBinSearch<Checker, int>(checker, X.begin(), X.end(), -1, N);
    ll A = 0, B = 0;
    for (int i = 0; i < W; i++) { (ans[i] % 2 == 0 ? A : B)++; }
    std::cout << (A == B ? "DRAW" : A > B ? "A" : "B") << std::endl;
    return 0;
}
0