#540193 (C++14) No.833 かっこいい電車

• 問題: No.833 かっこいい電車
• ユーザー: Shuz*
• 提出日時: 2020-08-25 16:17:54
• 言語: C++14 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 72 ms / 2,000 ms
• コード長: 10,293 bytes
• コンパイル時間: 2,662 ms
• コンパイル使用メモリ: 192,220 KB
• 実行使用メモリ: 25,308 KB
• 最終ジャッジ日時: 2024-11-06 11:30:46
• 合計ジャッジ時間: 5,068 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	57 ms; 22,576 KB
testcase_01	AC	8 ms; 19,928 KB
testcase_02	AC	8 ms; 19,712 KB
testcase_03	AC	7 ms; 19,876 KB
testcase_04	AC	7 ms; 19,752 KB
testcase_05	AC	8 ms; 19,824 KB
testcase_06	AC	8 ms; 19,776 KB
testcase_07	AC	8 ms; 19,820 KB
testcase_08	AC	8 ms; 19,888 KB
testcase_09	AC	8 ms; 19,752 KB
testcase_10	AC	55 ms; 22,812 KB
testcase_11	AC	72 ms; 24,288 KB
testcase_12	AC	27 ms; 21,656 KB
testcase_13	AC	20 ms; 20,392 KB
testcase_14	AC	59 ms; 24,212 KB
testcase_15	AC	34 ms; 22,320 KB
testcase_16	AC	30 ms; 23,272 KB
testcase_17	AC	23 ms; 20,116 KB
testcase_18	AC	62 ms; 22,804 KB
testcase_19	AC	29 ms; 22,924 KB
testcase_20	AC	13 ms; 20,800 KB
testcase_21	AC	53 ms; 21,208 KB
testcase_22	AC	43 ms; 24,716 KB
testcase_23	AC	31 ms; 23,024 KB
testcase_24	AC	43 ms; 24,448 KB
testcase_25	AC	58 ms; 22,464 KB
testcase_26	AC	32 ms; 23,448 KB
testcase_27	AC	47 ms; 22,672 KB
testcase_28	AC	34 ms; 21,132 KB
testcase_29	AC	40 ms; 22,088 KB
testcase_30	AC	52 ms; 25,308 KB
testcase_31	AC	50 ms; 22,468 KB

コンパイルメッセージ

main.cpp: In member function 'void link_cut_tree::node::rotr()':
main.cpp:170:17: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  170 |             if (q->lp = rp; rp != nullptr) rp->pp = q;
      |                 ^
main.cpp:172:17: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  172 |             if (pp = r; r != nullptr) {
      |                 ^~
main.cpp: In member function 'void link_cut_tree::node::rotl()':
main.cpp:179:17: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  179 |             if (q->rp = lp; lp != nullptr) lp->pp = q;
      |                 ^
main.cpp:181:17: warning: init-statement in selection statements only available with '-std=c++17' or '-std=gnu++17' [-Wc++17-extensions]
  181 |             if (pp = r; r != nullptr) {
      |                 ^~

ソースコード

#include <bits/stdc++.h>
using namespace std;
//#pragma GCC target("arch=skylake-avx512")

#pragma region template

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define rt(i, n) (i == (ll)(n) -1 ? rt : sp)
#define len(x) ((ll)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define ifn(x) if (not(x))
#define elif else if
#define elifn else ifn
#define fi first
#define se second
#define uniq(x) (sort(all(x)), (x).erase(unique(all(x)), (x).end()))
#define bis(x, y) ((ll)(lower_bound(all(x), y) - (x).begin()))

using graph = vector<vector<ll>>;
template <class T> using wgraph = vector<vector<pair<ll, T>>>;
bool __DIRECTED__ = true;
bool __ZERO_INDEXED__ = false;
istream &operator>>(istream &is, graph &g) {
    ll a, b;
    is >> a >> b;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb(b);
    if (__DIRECTED__ == false) g[b].pb(a);
    return is;
}
template <class T> istream &operator>>(istream &is, wgraph<T> &g) {
    ll a, b;
    T c;
    is >> a >> b >> c;
    if (__ZERO_INDEXED__ == false) a--, b--;
    g[a].pb({b, c});
    if (__DIRECTED__ == false) g[b].pb({a, c});
    return is;
}

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                                                 \
    {                                                                                              \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                                         \
        for (auto &&__i : {__VA_ARGS__}) cerr << "[" << __i << "] ";                               \
        cerr << rt;                                                                                \
    }

#define dump(a, h, w)                                                                              \
    {                                                                                              \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                                            \
        rep(__i, h) {                                                                              \
            rep(__j, w) {                                                                          \
                if (abs(a[__i][__j]) >= INF / 2 and a[__i][__j] <= -INF / 2) cerr << '-';          \
                if (abs(a[__i][__j]) >= INF / 2) cerr << "∞" << sp;                                \
                else                                                                               \
                    cerr << a[__i][__j] << sp;                                                     \
            }                                                                                      \
            cerr << rt;                                                                            \
        }                                                                                          \
        cerr << "]" << rt;                                                                         \
    }

#define vdump(a, n)                                                                                \
    {                                                                                              \
        cerr << __LINE__ << ": " << #a << " = [";                                                  \
        rep(__i, n) {                                                                              \
            if (__i) cerr << sp;                                                                   \
            if (abs(a[__i]) >= INF / 2 and a[__i] <= -INF / 2) cerr << '-';                        \
            if (abs(a[__i]) >= INF / 2) cerr << "∞" << sp;                                         \
            else                                                                                   \
                cerr << a[__i];                                                                    \
        }                                                                                          \
        cerr << "]" << rt;                                                                         \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("Ofast,unroll-loops")

// Math
inline constexpr ll gcd(const ll a, const ll b) { return b ? gcd(b, a % b) : a; }
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

#pragma endregion

struct link_cut_tree {
    struct node {
        node *pp, *lp, *rp;
        ll idx, data;
        node(ll i = 0, ll val = 0) : pp(nullptr), lp(nullptr), rp(nullptr), idx(i), data(val) {}
        bool is_root() { return pp == nullptr or (pp->lp != this and pp->rp != this); }
        void rotr() {
            node *q = pp, *r = q->pp;
            if (q->lp = rp; rp != nullptr) rp->pp = q;
            rp = q, q->pp = this;
            if (pp = r; r != nullptr) {
                if (r->lp == q) r->lp = this;
                if (r->rp == q) r->rp = this;
            }
        }
        void rotl() {
            node *q = pp, *r = q->pp;
            if (q->rp = lp; lp != nullptr) lp->pp = q;
            lp = q, q->pp = this;
            if (pp = r; r != nullptr) {
                if (r->lp == q) r->lp = this;
                if (r->rp == q) r->rp = this;
            }
        }
        void splay() {
            while (not is_root()) {
                node *q = pp;
                if (q->is_root()) q->lp == this ? rotr() : rotl();
                else {
                    node *r = q->pp;
                    if (r->lp == q) {
                        q->lp == this ? q->rotr() : rotl(), rotr();
                    } else {
                        q->rp == this ? q->rotl() : rotr(), rotl();
                    }
                }
            }
        }
    };
    node *expose(node *x) {
        node *rp = nullptr;
        for (node *p = x; p != nullptr; p = p->pp) p->splay(), p->rp = rp, rp = p;
        x->splay();
        return rp;
    }
    void cut(node *c) {
        c->data = get_root(c)->data;
        expose(c);
        node *p = c->lp;
        c->lp = p->pp = nullptr;
        get_root(p)->data = c->idx;
    }
    void cut(node *u, node *v) { expose(u), u->lp == v ? cut(u) : cut(v); }
    void link(node *c, node *p) {
        get_root(p)->data = c->data;
        expose(c), expose(p), c->pp = p, p->rp = c;
    }
    node *get_root(node *x) {
        expose(x);
        while (x->lp != nullptr) x = x->lp;
        x->splay();
        return x;
    }
    node *lca(node *u, node *v) {
        return get_root(u) == get_root(v) ? (expose(u), expose(v)) : nullptr;
    }
    node *make_node(ll idx = 0, ll val = 0) { return new node(idx, val); }
} lct;

struct UshiTree {
    using Type = ll;
    Type unit = 0;
    function<Type(Type, Type)> comb = [](Type left, Type right) { return left + right; };

    static const ll n = 1 << 20;
    vector<Type> node;

    UshiTree() : node(2 * n - 1, unit) {}
    inline void combine(ll a, Type x) {
        ll i = n - 1 + a;
        node[i] = comb(node[i], x);
        while (i != 0) {
            i = (i - 1) / 2;
            node[i] = comb(node[i * 2 + 1], node[i * 2 + 2]);
        }
    }
    inline void update(ll a, Type x) {
        ll i = n - 1 + a;
        node[i] = x;
        while (i != 0) {
            i = (i - 1) / 2;
            node[i] = comb(node[i * 2 + 1], node[i * 2 + 2]);
        }
    }
    inline Type result(ll a, ll b, ll i = 0, ll l = 0, ll r = n) {
        Type res = unit;
        if (b <= l or r <= a) return res;
        if (a <= l and r <= b) {
            return comb(node[i], res);
        } else {
            return comb(result(a, b, i * 2 + 1, l, (l + r) / 2),
                        result(a, b, i * 2 + 2, (l + r) / 2, r));
        }
    }
} seg;

signed main() {
    ll N, Q, A, B;
    scanf("%lld %lld", &N, &Q);
    vector<link_cut_tree::node *> V(N);
    rep(i, N) V[i] = lct.make_node(i, i + 1);
    rep(i, N) scanf("%lld", &A), seg.update(i, A);
    rep(i, Q) {
        scanf("%lld %lld", &A, &B);
        if (A == 1)
            if (lct.get_root(V[B - 1]) != lct.get_root(V[B])) lct.link(V[B], V[B - 1]);
        if (A == 2)
            if (lct.get_root(V[B - 1]) == lct.get_root(V[B])) lct.cut(V[B]);
        if (A == 3) seg.combine(B - 1, 1);
        if (A == 4) {
            ll l = lct.get_root(V[B - 1])->idx, r = lct.get_root(V[B - 1])->data;
            printf("%lld\n", seg.result(l, r));
        }
    }
}