#1053043 (C++23) No.3058 Deque and Brackets

• 問題: No.3058 Deque and Brackets
• ユーザー: 横山緑
• 提出日時: 2025-03-14 23:20:03
• 言語: C++23 (gcc 13.3.0 + boost 1.87.0)
• 結果: RE
• 実行時間: -
• コード長: 8,197 bytes
• コンパイル時間: 4,446 ms
• コンパイル使用メモリ: 288,776 KB
• 実行使用メモリ: 40,932 KB
• 最終ジャッジ日時: 2025-03-14 23:20:25
• 合計ジャッジ時間: 11,494 ms
• ジャッジサーバーID （参考情報）: judge1 / judge3

ファイルパターン	結果
sample	AC * 1 RE * 1
other	AC * 1 WA * 5 RE * 16

ソースコード

#line 2 "template.hpp"
// #pragma GCC target("avx2")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;
// https://xn--kst.jp/blog/2019/08/29/cpp-comp/
// debug methods
// usage: debug(x,y);
// vector 出力できるように修正
template <typename T>
ostream& debug_print(ostream& os, const vector<T>& v) {
    os << "[";
    for (size_t i = 0; i < v.size(); ++i) {
        os << v[i];
        if (i < v.size() - 1) os << ", ";
    }
    os << "]";
    return os;
}
template <typename T>
ostream& debug_print(ostream& os, const T& var) {
    os << var;
    return os;
}
#define CHOOSE(a) CHOOSE2 a
#define CHOOSE2(a0, a1, a2, a3, a4, x, ...) x
#define debug_1(x1) { cout << #x1 << ": "; debug_print(cout, x1) << endl; }
#define debug_2(x1, x2) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << endl; }
#define debug_3(x1, x2, x3) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << endl; }
#define debug_4(x1, x2, x3, x4) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << endl; }
#define debug_5(x1, x2, x3, x4, x5) { cout << #x1 << ": "; debug_print(cout, x1) << ", " << #x2 << ": "; debug_print(cout, x2) << ", " << #x3 << ": "; debug_print(cout, x3) << ", " << #x4 << ": "; debug_print(cout, x4) << ", " << #x5 << ": "; debug_print(cout, x5) << endl; }

#ifdef LOCAL
#define debug(...) CHOOSE((__VA_ARGS__, debug_5, debug_4, debug_3, debug_2, debug_1, ~))(__VA_ARGS__)
#else
#define debug(...)
#endif

using ll = long long;
using vl = vector<ll>;
using vll = vector<vl>;
using P = pair<ll, ll>;
#define all(v) v.begin(), v.end()
template <typename T> inline bool chmax(T &a, T b) {
    return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
    return ((a > b) ? (a = b, true) : (false));
}
#define rep1(i, n) for(ll i = 1; i <= ((ll)n); ++i)
// https://trap.jp/post/1224/
template <class... T> constexpr auto min(T... a) {
    return min(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> constexpr auto max(T... a) {
    return max(initializer_list<common_type_t<T...>>{a...});
}
template <class... T> void input(T &...a) { (cin >> ... >> a); }
template <class T> void input(vector<T> &a) {
    for(T &x : a)
        cin >> x;
}
void print() { cout << '\n'; }
template <class T, class... Ts> void print(const T &a, const Ts &...b) {
    cout << a;
    (cout << ... << (cout << ' ', b));
    cout << '\n';
}
void print(const string &s) {
    cout << s << '\n';
}
template <class Container, typename = void>
struct is_container : std::false_type {};
template <class Container>
struct is_container<Container, std::void_t<decltype(std::declval<Container>().begin()), decltype(std::declval<Container>().end())>> : std::true_type {};
template <class Container>
typename enable_if<is_container<Container>::value>::type print(const Container& x) {
    if (!x.empty()) {
        auto it = x.begin();
        for (; it != prev(x.end()); ++it) {
            cout << *it << " ";
        }
        cout << *it << "\n";  // 最後の要素を出力して改行
    }
}
#define INT(...)                                                               \
    int __VA_ARGS__;                                                           \
    input(__VA_ARGS__)
#define LL(...)                                                                \
    long long __VA_ARGS__;                                                     \
    input(__VA_ARGS__)
#define STR(...)                                                               \
    string __VA_ARGS__;                                                        \
    input(__VA_ARGS__)
#define REP1(a) for(ll i = 0; i < a; i++)
#define REP2(i, a) for(ll i = 0; i < a; i++)
#define REP3(i, a, b) for(ll i = a; i < b; i++)
#define REP4(i, a, b, c) for(ll i = a; i < b; i += c)
#define overload4(a, b, c, d, e, ...) e
#define rep(...) overload4(__VA_ARGS__, REP4, REP3, REP2, REP1)(__VA_ARGS__)

ll inf = 3e18;
vl dx = {1, -1, 0, 0};
vl dy = {0, 0, 1, -1};
#line 2 "/home/y_midori/cp/04_yukicoder/460/c.cpp"
// #include <atcoder/all>
// using namespace atcoder;
// using mint = modint998244353;
#line 3 "data_structure/segtree.hpp"

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
    ll n;
    vector<S> v;
    segtree(ll n_) : segtree(vector<S>(n_, e())) {}
    segtree(const vector<S> &v_) : n(v_.size()) {
        v = vector<S>(2 * n, e());
        rep(i, n) v[n + i] = v_[i];
        for(ll i = n - 1; i >= 0; i--) {
            v[i] = op(v[i << 1], v[i << 1 | 1]);
        }
    }
    void set(ll x, S p) {
        assert(0 <= x && x < n);
        x += n;
        v[x] = p;
        while(x > 1) {
            x >>= 1;
            v[x] = op(v[x << 1], v[x << 1 | 1]);
        }
    }
    S prod(ll l, ll r) const {
        assert(0 <= l && l <= r && r <= n);
        S pl(e()), pr(e());
        l += n, r += n;
        while(l < r) {
            if(l & 1) {
                pl = op(pl, v[l]);
            }
            if(r & 1) {
                pr = op(v[r - 1], pr);
            }
            l = (l + 1) >> 1;
            r >>= 1;
        }
        return op(pl, pr);
    }
    S get(ll x) const { return v[n + x]; }
};
#line 6 "/home/y_midori/cp/04_yukicoder/460/c.cpp"
// P : |cost| , idx
P op(P a, P b) {
    if(a.first < b.first) {
        return a;
    } else if(a.first > b.first) {
        return b;
    } else {
        return {a.first, max(a.second, b.second)};
    }
}
P e() {
    return {inf, -inf};
}
void solve() {
    INT(n);
    n *= 2;
    vector<segtree<P, op, e>> seg(2, segtree<P, op, e>(2 * n));
    vector<char> c(n);
    vl l(n), r(n);
    ll ans = 0;
    rep(i, n) {
        ll li = n - 1 - i, ri = n + i;
        input(c[i], l[i], r[i]);
        ans += r[i];
        if(l[i] < r[i] or (l[i] == r[i] and c[i] == ')')) {
            debug(i, c[i] == ')', ri);
            seg[c[i] == ')'].set(ri, {r[i] - l[i], i});
        } else {
            seg[c[i] == ')'].set(li, {l[i] - r[i], i});
        }
    }
    ans = 0;
    // rep(i, n) {
    //     ll li = n - 1 - i, ri = n + i;
    //     if(seg[c[i] == ')'].get(li).second != -inf) {
    //         ans += l[i];
    //     } else
    //         ans += r[i];
    //     debug(i, ans);
    // }
    ll cur = 0;
    for(int i = n - 1; i >= 0; i--) {
        ll li = n - 1 - i, ri = n + i;
        if(seg[c[i] == ')'].get(li).second == -inf)
            continue;
        cur += (c[i] == '(' ? +1 : -1);
        if(cur < 0) {
            assert(c[i] == ')');
            auto p = seg[0].prod(ri + 1, 2 * n);
            if(p.first < abs(l[i] - r[i])) {
                seg[0].set(n + p.second, e());
                p.first *= -1;
                seg[0].set(n - 1 - p.second, p);
            } else {
                seg[1].set(li, e());
                seg[1].set(ri, {-abs(l[i] - r[i]), i});
            }
        }
    }
    ans = 0;
    rep(i, n) {
        ll li = n - 1 - i, ri = n + i;
        if(seg[c[i] == ')'].get(li).second != -inf) {
            ans += l[i];
        } else
            ans += r[i];
        debug(ans);
    }
    print(ans);
    // for(int i = 0; i < n; i++) {
    //     ll li = n - 1 - i, ri = n + i;
    //     if(seg[c[i] == ')'].get(li).second == -inf)
    //         continue;
    //     cur += (c[i] == '(' ? +1 : -1);
    //     if(cur < 0) {
    //         assert(c[i] == ')');
    //         auto p = seg[0].prod(ri + 1, 2 * n);
    //         if(p.first < abs(l[i] - r[i])) {
    //             seg[0].set(n + p.second, e());
    //             p.first *= -1;
    //             seg[0].set(n - 1 - p.second, p);
    //         } else {
    //             seg[1].set(li, e());
    //             seg[1].set(ri, {-abs(l[i] - r[i]), i});
    //         }
    //     }
    // }
}
int main() {
    ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    cout << std::setprecision(16);
    int t = 1;
    rep(_, t) {
        solve();
    }
}