結果

問題 No.1014 competitive fighting
ユーザー 👑 hitonanodehitonanode
提出日時 2020-03-20 23:18:53
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 143 ms / 2,000 ms
コード長 9,413 bytes
コンパイル時間 2,379 ms
コンパイル使用メモリ 195,436 KB
実行使用メモリ 15,856 KB
最終ジャッジ日時 2023-09-21 19:21:51
合計ジャッジ時間 9,124 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 1 ms
4,384 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 142 ms
15,708 KB
testcase_06 AC 143 ms
15,720 KB
testcase_07 AC 142 ms
15,676 KB
testcase_08 AC 143 ms
15,708 KB
testcase_09 AC 141 ms
15,620 KB
testcase_10 AC 70 ms
15,580 KB
testcase_11 AC 77 ms
15,856 KB
testcase_12 AC 142 ms
15,748 KB
testcase_13 AC 63 ms
9,068 KB
testcase_14 AC 57 ms
8,648 KB
testcase_15 AC 70 ms
9,532 KB
testcase_16 AC 3 ms
4,384 KB
testcase_17 AC 24 ms
5,368 KB
testcase_18 AC 114 ms
13,424 KB
testcase_19 AC 137 ms
15,376 KB
testcase_20 AC 45 ms
7,324 KB
testcase_21 AC 102 ms
12,380 KB
testcase_22 AC 82 ms
10,724 KB
testcase_23 AC 32 ms
5,920 KB
testcase_24 AC 32 ms
6,356 KB
testcase_25 AC 8 ms
4,376 KB
testcase_26 AC 100 ms
12,128 KB
testcase_27 AC 23 ms
5,332 KB
testcase_28 AC 26 ms
5,652 KB
testcase_29 AC 3 ms
4,380 KB
testcase_30 AC 135 ms
15,104 KB
testcase_31 AC 106 ms
12,812 KB
testcase_32 AC 3 ms
4,380 KB
testcase_33 AC 8 ms
4,376 KB
testcase_34 AC 94 ms
12,112 KB
testcase_35 AC 127 ms
15,260 KB
testcase_36 AC 85 ms
11,472 KB
testcase_37 AC 4 ms
4,380 KB
testcase_38 AC 76 ms
10,480 KB
testcase_39 AC 38 ms
6,872 KB
testcase_40 AC 75 ms
10,528 KB
testcase_41 AC 52 ms
8,156 KB
testcase_42 AC 121 ms
14,712 KB
testcase_43 AC 7 ms
4,384 KB
testcase_44 AC 110 ms
13,752 KB
testcase_45 AC 63 ms
9,204 KB
testcase_46 AC 11 ms
4,380 KB
testcase_47 AC 35 ms
6,564 KB
testcase_48 AC 91 ms
11,816 KB
testcase_49 AC 5 ms
4,376 KB
testcase_50 AC 118 ms
14,236 KB
testcase_51 AC 66 ms
9,488 KB
testcase_52 AC 5 ms
4,380 KB
testcase_53 AC 141 ms
15,632 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 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 chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool chmin(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; }
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;



constexpr lint INF = 2e18;
// Nonrecursive Segment Tree (point-update, range-get)
// - Conditions for operations:
//   - datamerge: [TDATA, TDATA] -> TDATA, e(x, y) == e(y, x)
//   - data2ret: [TDATA, TQUERY] -> TRET
//   - retmerge: [TRET, TRET] -> TRET, g(defaultRET, x) == x, g(x, y) = g(y, x)
//   - commutability f(e(x, y), q) == g(f(x, q), f(y, q))
template<typename TDATA, typename TRET, typename TQUERY>
struct NonrecursiveSegmentTree
{
    int N;
    TRET defaultRET;
    virtual TDATA datamerge(const TDATA &, const TDATA &) = 0;
    virtual TRET data2ret(const TDATA &, const TQUERY &) = 0;
    virtual TRET retmerge(const TRET &, const TRET &) = 0;
    std::vector<TDATA> data;
    inline TDATA& at(int i) { return data[i]; }

    inline void _merge(int i) { at(i) = datamerge(at(i << 1), at((i << 1) + 1)); }
    void initialize(const std::vector<TDATA> &seq, TRET RET_ZERO) {
        N = seq.size();
        defaultRET = RET_ZERO;
        data = seq;
        data.insert(data.end(), seq.begin(), seq.end());
        for (int i = N - 1; i; i--) _merge(i);
    }
    NonrecursiveSegmentTree() = default;
    void update(int pos, const TDATA &x) {
        assert(pos >= 0 and pos < N);
        at(pos + N) = x;
        for (int i = pos + N; i > 1;) i >>= 1, _merge(i);
    }

    // [l, r), 0-indexed
    TRET get(int l, int r, TQUERY query = NULL) {
        assert(l >= 0 and r <= N);
        TRET retl = defaultRET, retr = defaultRET;
        l += N, r += N;
        while (l < r) {
            if (l & 1) retl = retmerge(retl, data2ret(data[l++], query));
            if (r & 1) retr = retmerge(data2ret(data[--r], query), retr);
            l >>= 1, r >>= 1;
        }
        return retmerge(retl, retr);
    }

    template<typename T1, typename T2, typename T3>
    friend std::ostream &operator<<(std::ostream &os, NonrecursiveSegmentTree<T1, T2, T3> s) {
        os << "[SegmentTree (len: " << s.N << ')';
        for (int i = 0; i < s.N; i++) os << s.at(i + s.N) << ',';
        os << "]";
        return os;
    }
};

// Range Maximum Query
// - get: return max(x_l, ..., x_{r - 1})
template <typename T>
struct RangeMaximumQuery : public NonrecursiveSegmentTree<T, T, bool>
{
    using SegTree = NonrecursiveSegmentTree<T, T, bool>;
    T datamerge(const T &vl, const T &vr) override { return std::max(vl, vr); };
    T data2ret(const T &v, const bool &q) override { return v; }
    T retmerge(const T &vl, const T &vr) override { return std::max(vl, vr); };
    RangeMaximumQuery(const std::vector<T> &seq, T defaultmax) : SegTree::NonrecursiveSegmentTree() {
        SegTree::initialize(seq, defaultmax);
    };
};

// Directed graph library to find strongly connected components （強連結成分分解）
// 0-indexed directed graph
// Complexity: O(V + E)
struct DirectedGraphSCC {
    int V; // # of Vertices
    std::vector<std::vector<int>> to, from;
    std::vector<int> used;  // Only true/false
    std::vector<int> vs;
    std::vector<int> cmp;
    int scc_num = -1;

    DirectedGraphSCC(int V = 0) : V(V), to(V), from(V), cmp(V) {}

    void _dfs(int v) {
        used[v] = true;
        for (auto t : to[v]) if (!used[t]) _dfs(t);
        vs.push_back(v);
    }
    void _rdfs(int v, int k) {
        used[v] = true;
        cmp[v] = k;
        for (auto t : from[v]) if (!used[t]) _rdfs(t, k);
    }

    void add_edge(int from_, int to_) {
        assert(from_ >= 0 and from_ < V and to_ >= 0 and to_ < V);
        to[from_].push_back(to_);
        from[to_].push_back(from_);
    }

    // Detect strongly connected components and return # of them.
    // Also, assign each vertex `v` the scc id `cmp[v]` (0-indexed)
    int FindStronglyConnectedComponents() {
        used.assign(V, false);
        vs.clear();
        for (int v = 0; v < V; v++) if (!used[v]) _dfs(v);
        used.assign(V, false);
        scc_num = 0;
        for (int i = (int)vs.size() - 1; i >= 0; i--) if (!used[vs[i]]) _rdfs(vs[i], scc_num++);
        return scc_num;
    }

    // After calling `FindStronglyConnectedComponents()`, generate a new graph by uniting all vertices
    // belonging to the same component(The resultant graph is DAG).
    DirectedGraphSCC GenerateTopologicalGraph() {
        DirectedGraphSCC newgraph(scc_num);
        for (int s = 0; s < V; s++) for (auto t : to[s]) {
            if (cmp[s] != cmp[t]) newgraph.add_edge(cmp[s], cmp[t]);
        }
        return newgraph;
    }
};

int main()
{
    int N;
    cin >> N;
    vector<lint> A(N), B(N), G(N);
    vector<lint> Z;
    REP(i, N) {
        lint a, b, c;
        cin >> a >> b >> c;
        A[i] = a;
        B[i] = b - c;
        G[i] = b;
        Z.push_back(A[i]);
        Z.push_back(B[i]);
    }
    sort(ALL(Z));
    Z.erase(unique(ALL(Z)), Z.end());
    REP(i, N) {
        A[i] = lower_bound(ALL(Z), A[i]) - Z.begin();
        B[i] = lower_bound(ALL(Z), B[i]) - Z.begin();
    }

    vector<pair<lint, plint>> a2bi(N);
    REP(i, N) a2bi[i] = make_pair(A[i], plint(B[i], i));
    sort(ALL(a2bi));
    vector<lint> nx(N);
    REP(i, N) nx[i] = a2bi[i].second.first;
    RangeMaximumQuery<lint> rmq(nx, -1.2e9);
    vector<lint> nxnx(N);

    REP(j, N) {
        lint r = lower_bound(ALL(a2bi), make_pair(a2bi[j].second.first + 1, plint(-1, -1))) - a2bi.begin();
        lint hi;
        if (j < r) hi = max(rmq.get(0, j), rmq.get(j + 1, r));
        else hi = rmq.get(0, r);
        nxnx[a2bi[j].second.second] = hi;
    }
    vector<lint> ret(N);
    lint infhi = INF;
    REP(i, N) if (nxnx[i] >= A[i]) ret[i] = INF, chmin<lint>(infhi, A[i]);

    map<lint, lint> pos2gv;
    pos2gv[-INF] = 0;
    REP(i, N) {
        if (B[i] >= infhi) ret[i] = INF;
    }

    vector<pair<lint, plint>> b2ai(N);
    REP(i, N) b2ai[i] = make_pair(min(B[i], A[i]), plint(A[i], i));
    sort(ALL(b2ai));
    REP(j, b2ai.size()) {
        lint i = b2ai[j].second.second;
        if (ret[i] >= INF) continue;

        lint a = A[i];
        lint b = B[i];
        auto itr = pos2gv.upper_bound(b);
        lint gain = G[i] + prev(itr)->second;

        ret[i] = gain;
        chmax(pos2gv[a], gain);
        itr = pos2gv.lower_bound(a);
        while (next(itr) != pos2gv.end() and next(itr)->second < itr->second) {
            pos2gv.erase(next(itr));
            itr = pos2gv.lower_bound(a);
        }
        if (prev(itr)->second > itr->second) pos2gv.erase(itr);
    }

    for (auto x : ret) {
        if (x < INF) printf("%lld\n", x);
        else puts("BAN");
    }
}
0