結果

問題 No.1014 competitive fighting
ユーザー haruki_Kharuki_K
提出日時 2020-03-21 00:35:38
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 127 ms / 2,000 ms
コード長 8,370 bytes
コンパイル時間 2,058 ms
コンパイル使用メモリ 185,948 KB
実行使用メモリ 21,920 KB
最終ジャッジ日時 2024-07-07 12:56:05
合計ジャッジ時間 7,972 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
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 118 ms
14,240 KB
testcase_06 AC 117 ms
14,244 KB
testcase_07 AC 114 ms
14,108 KB
testcase_08 AC 116 ms
14,240 KB
testcase_09 AC 118 ms
14,240 KB
testcase_10 AC 127 ms
21,920 KB
testcase_11 AC 69 ms
12,576 KB
testcase_12 AC 116 ms
14,236 KB
testcase_13 AC 54 ms
8,364 KB
testcase_14 AC 47 ms
7,984 KB
testcase_15 AC 58 ms
8,768 KB
testcase_16 AC 4 ms
5,376 KB
testcase_17 AC 21 ms
5,376 KB
testcase_18 AC 93 ms
12,132 KB
testcase_19 AC 113 ms
13,888 KB
testcase_20 AC 37 ms
6,944 KB
testcase_21 AC 82 ms
11,244 KB
testcase_22 AC 67 ms
9,936 KB
testcase_23 AC 26 ms
5,856 KB
testcase_24 AC 28 ms
5,872 KB
testcase_25 AC 8 ms
5,376 KB
testcase_26 AC 80 ms
11,200 KB
testcase_27 AC 20 ms
5,376 KB
testcase_28 AC 23 ms
5,488 KB
testcase_29 AC 3 ms
5,376 KB
testcase_30 AC 112 ms
13,620 KB
testcase_31 AC 86 ms
11,568 KB
testcase_32 AC 2 ms
5,376 KB
testcase_33 AC 6 ms
5,376 KB
testcase_34 AC 59 ms
9,916 KB
testcase_35 AC 79 ms
12,336 KB
testcase_36 AC 53 ms
9,460 KB
testcase_37 AC 3 ms
5,376 KB
testcase_38 AC 48 ms
8,784 KB
testcase_39 AC 25 ms
6,188 KB
testcase_40 AC 46 ms
8,736 KB
testcase_41 AC 31 ms
7,040 KB
testcase_42 AC 71 ms
11,964 KB
testcase_43 AC 6 ms
5,376 KB
testcase_44 AC 64 ms
11,052 KB
testcase_45 AC 38 ms
7,956 KB
testcase_46 AC 8 ms
5,376 KB
testcase_47 AC 23 ms
5,860 KB
testcase_48 AC 57 ms
9,592 KB
testcase_49 AC 4 ms
5,376 KB
testcase_50 AC 70 ms
11,580 KB
testcase_51 AC 40 ms
8,124 KB
testcase_52 AC 4 ms
5,376 KB
testcase_53 AC 116 ms
13,984 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;
#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) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
auto constexpr INF32 = numeric_limits<int32_t>::max()/2-1;
auto constexpr INF64 = numeric_limits<int64_t>::max()/2-1;
auto constexpr INF   = numeric_limits<int>::max()/2-1;
#ifdef LOCAL
#include "debug.hpp"
#define dump(...) cerr << "[" << setw(3) << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl
#define debug if (1)
#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> 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();
}
template <class C, class F> int ppt(C const& v, F f) {
    return partition_point(v.begin(), v.end(), f)-v.begin();
}
// <<<
// >>> reord
void reord_impl(vector<int> const&) { }
template <class T, class... Args>
void reord_impl(vector<int> const& idx, vector<T> &v, Args&&... args) {
    vector<T> t(v.size());
    rep (i,v.size()) t[i] = v[idx[i]];
    swap(v,t);
    reord_impl(idx, forward<Args>(args)...);
}
template <class Comp, class T, class... Args,
          class = decltype(declval<Comp>()(0,0))>
void reord(Comp comp, vector<T> &v, Args&&... args) {
    vector<int> idx(v.size());
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), comp);
    reord_impl(idx, v, args...);
}
template <class T, class... Args>
void reord(vector<T> &v, Args&&... args) {
    vector<int> idx(v.size());
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int i, int j) { return v[i] < v[j]; });
    reord_impl(idx, v, args...);
}
// <<<
// >>> segment tree
template <class Handler>
struct Segtree : Handler {
    using Value = typename Handler::Value;
    using Handler::unit; // () -> Value
    using Handler::merge; // (Value,Value) -> Value

    vector<Value> v; // use v[1..2*cap-1]
    int cap; // // capacity: power of 2
    int n; // original size

    Segtree() {}
    template <class... T> Segtree(T&&... x) { init(forward<T>(x)...); }

    template <class F, class = decltype(declval<F>()(0))>
    void init(int n, F gen)  {
        assert(n >= 0); this->n = n;
        cap = n; //for (cap = 1; cap < n; cap <<= 1) ;;
		v.resize(2*cap, unit());
        for (int i = 0; i < n; i++) v[cap+i] = gen(i);
        for (int i = cap-1; i >= 1; i--) v[i] = merge(v[2*i],v[2*i+1]);
    }
    void init(int n) { init(n, [&](int) { return unit(); }); }
    void init(int n, Value const& x) { init(n, [&](int) { return x; }); }
    void init(vector<Value> const& v) { init(v.size(), [&](int i) { return v[i]; }); }
    int size() const { return n; }

    void set(int i, Value const& x) {
        assert(0 <= i); assert(i < size());
        i += cap; v[i] = x;
        while (i > 1) i >>= 1, v[i] = merge(v[2*i],v[2*i+1]);
    }
    Value operator[](int i) const { return get(i); }
    Value get(int i) const {
        assert(0 <= i); assert(i < size());
        return v[cap + i];
    }
    // [l,r)
    Value get(int l, int r) const {
        assert(0 <= l); assert(l <= r); assert(r <= size());
        Value x = unit(), y = unit();
        for (l += cap, r += cap; l < r; l >>= 1, r >>= 1) {
            if (l&1) x = merge(x, v[l++]);
            if (r&1) y = merge(v[--r], y);
        }
        return merge(x,y);
    }
    vector<Value> dat() const {
        vector<Value> ret(size());
        for (int i = 0; i < size(); i++) ret[i] = get(i);
        return ret;
    }
};
// <<<

struct RangeMinPos {
    using Value = pair<int,int>;
    constexpr static Value unit() { return {INF,INF}; }
    constexpr static Value merge(Value x, Value y) { return min(x,y); }
};
struct RangeMax {
    using Value = int;
    constexpr static Value unit() { return 0; }
    constexpr static Value merge(Value x, Value y) { return max(x,y); }
};

int32_t main() {
    int n; cin >> n;
    vector<int> a(n),b(n),c(n);
    rep (i,n) cin >> a[i] >> b[i] >> c[i];
    rep (i,n) c[i] = b[i]-c[i];

    vector<int> idx(n);
    iota(all(idx),0);
    reord(a,b,c,idx);

    Segtree<RangeMax> dp(n,-1);
    Segtree<RangeMinPos> done(n, [&](int i) { return mp(0LL,i); });
    vector<int> visited(n);
    def (rec, int i) -> void {
        dump(i,visited[i],done[i].fst);
        if (done[i].fst) return;
        if (visited[i]) {
            dp.set(i,INF);
            done.set(i,mp(1LL,i));
            return;
        }
        visited[i] = 1;
        int ub = ubd(a,c[i]);
        dump(i,ub);
        if (i < ub) {
            while (1) {
                auto x = min(done.get(0,i), done.get(i+1,ub));
                if (x.fst) break;
                rec(x.snd);
            }
            dp.set(i, b[i] + max(dp.get(0,i), dp.get(i+1,ub)));
        } else {
            while (1) {
                auto x = done.get(0,ub);
                if (x.fst) break;
                rec(x.snd);
            }
            dp.set(i, b[i] + dp.get(0,ub));
        }
        done.set(i,mp(1LL,i));
    };

    rep (i,n) {
        rec(i);
        debug { cerr << endl; }
    }

    vector<int> ans(n);
    rep (i,n) ans[idx[i]] = dp[i];

    rep (i,n) {
        if (ans[i] >= INF) {
            cout << "BAN\n";
        } else {
            cout << ans[i] << "\n";
        }
    }

    debug {
        dump(dp.dat());
    }

}
0