#879711 (C++17) No.2311 [Cherry 5th Tune] Cherry Month

提出ソース

結果

問題	No.2311 [Cherry 5th Tune] Cherry Month
ユーザー	heno239
提出日時	2023-06-10 19:33:03
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	439 ms / 4,600 ms
コード長	10,972 bytes
コンパイル時間	2,942 ms
コンパイル使用メモリ	174,200 KB
実行使用メモリ	81,908 KB
最終ジャッジ日時	2024-06-10 23:26:42
合計ジャッジ時間	28,494 ms
ジャッジサーバーID （参考情報）	judge4 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	21 ms 11,776 KB
testcase_01	AC	22 ms 11,648 KB
testcase_02	AC	367 ms 61,884 KB
testcase_03	AC	181 ms 32,896 KB
testcase_04	AC	176 ms 26,624 KB
testcase_05	AC	176 ms 25,984 KB
testcase_06	AC	228 ms 30,336 KB
testcase_07	AC	206 ms 25,856 KB
testcase_08	AC	327 ms 65,664 KB
testcase_09	AC	256 ms 48,000 KB
testcase_10	AC	241 ms 44,544 KB
testcase_11	AC	248 ms 52,096 KB
testcase_12	AC	336 ms 51,072 KB
testcase_13	AC	318 ms 52,480 KB
testcase_14	AC	295 ms 58,240 KB
testcase_15	AC	356 ms 59,264 KB
testcase_16	AC	227 ms 30,976 KB
testcase_17	AC	327 ms 56,960 KB
testcase_18	AC	278 ms 53,504 KB
testcase_19	AC	331 ms 60,544 KB
testcase_20	AC	319 ms 52,352 KB
testcase_21	AC	299 ms 36,992 KB
testcase_22	AC	268 ms 39,040 KB
testcase_23	AC	333 ms 65,408 KB
testcase_24	AC	315 ms 56,448 KB
testcase_25	AC	222 ms 53,632 KB
testcase_26	AC	357 ms 65,792 KB
testcase_27	AC	313 ms 81,908 KB
testcase_28	AC	313 ms 81,896 KB
testcase_29	AC	303 ms 81,908 KB
testcase_30	AC	183 ms 36,096 KB
testcase_31	AC	180 ms 35,968 KB
testcase_32	AC	213 ms 35,968 KB
testcase_33	AC	365 ms 78,720 KB
testcase_34	AC	301 ms 78,464 KB
testcase_35	AC	322 ms 78,592 KB
testcase_36	AC	356 ms 70,400 KB
testcase_37	AC	378 ms 70,144 KB
testcase_38	AC	375 ms 70,528 KB
testcase_39	AC	386 ms 73,216 KB
testcase_40	AC	381 ms 72,832 KB
testcase_41	AC	388 ms 73,344 KB
testcase_42	AC	371 ms 72,448 KB
testcase_43	AC	409 ms 74,112 KB
testcase_44	AC	433 ms 75,648 KB
testcase_45	AC	340 ms 75,520 KB
testcase_46	AC	311 ms 72,064 KB
testcase_47	AC	439 ms 75,776 KB
testcase_48	AC	273 ms 70,656 KB
testcase_49	AC	289 ms 70,784 KB
testcase_50	AC	396 ms 70,784 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
#include<chrono>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
//ll mod = 1;
constexpr ll mod = 998244353;
//constexpr ll mod = 1000000007;
const int mod17 = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;

#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;

using ld = long double;
typedef pair<ld, ld> LDP;
const ld eps = 1e-10;
const ld pi = acosl(-1.0);

template<typename T>
void chmin(T& a, T b) {
    a = min(a, b);
}
template<typename T>
void chmax(T& a, T b) {
    a = max(a, b);
}
template<typename T>
vector<T> vmerge(vector<T>& a, vector<T>& b) {
    vector<T> res;
    int ida = 0, idb = 0;
    while (ida < a.size() || idb < b.size()) {
        if (idb == b.size()) {
            res.push_back(a[ida]); ida++;
        }
        else if (ida == a.size()) {
            res.push_back(b[idb]); idb++;
        }
        else {
            if (a[ida] < b[idb]) {
                res.push_back(a[ida]); ida++;
            }
            else {
                res.push_back(b[idb]); idb++;
            }
        }
    }
    return res;
}
template<typename T>
void cinarray(vector<T>& v) {
    rep(i, v.size())cin >> v[i];
}
template<typename T>
void coutarray(vector<T>& v) {
    rep(i, v.size()) {
        if (i > 0)cout << " "; cout << v[i];
    }
    cout << "\n";
}
ll mod_pow(ll x, ll n, ll m = mod) {
    if (n < 0) {
        ll res = mod_pow(x, -n, m);
        return mod_pow(res, m - 2, m);
    }
    if (abs(x) >= m)x %= m;
    if (x < 0)x += m;
    //if (x == 0)return 0;
    ll res = 1;
    while (n) {
        if (n & 1)res = res * x % m;
        x = x * x % m; n >>= 1;
    }
    return res;
}
//mod should be <2^31
struct modint {
    int n;
    modint() :n(0) { ; }
    modint(ll m) {
        if (m < 0 || mod <= m) {
            m %= mod; if (m < 0)m += mod;
        }
        n = m;
    }
    operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
bool operator<(modint a, modint b) { return a.n < b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
    if (n == 0)return modint(1);
    modint res = (a * a) ^ (n / 2);
    if (n % 2)res = res * a;
    return res;
}

ll inv(ll a, ll p) {
    return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }
modint operator/=(modint& a, modint b) { a = a / b; return a; }
const int max_n = 1 << 20;
modint fact[max_n], factinv[max_n];
void init_f() {
    fact[0] = modint(1);
    for (int i = 0; i < max_n - 1; i++) {
        fact[i + 1] = fact[i] * modint(i + 1);
    }
    factinv[max_n - 1] = modint(1) / fact[max_n - 1];
    for (int i = max_n - 2; i >= 0; i--) {
        factinv[i] = factinv[i + 1] * modint(i + 1);
    }
}
modint comb(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
    if (a < 0 || b < 0 || a < b)return 0;
    return fact[a] * factinv[a - b];
}

ll gcd(ll a, ll b) {
    a = abs(a); b = abs(b);
    if (a < b)swap(a, b);
    while (b) {
        ll r = a % b; a = b; b = r;
    }
    return a;
}
template<typename T>
void addv(vector<T>& v, int loc, T val) {
    if (loc >= v.size())v.resize(loc + 1, 0);
    v[loc] += val;
}
/*const int mn = 2000005;
bool isp[mn];
vector<int> ps;
void init() {
    fill(isp + 2, isp + mn, true);
    for (int i = 2; i < mn; i++) {
        if (!isp[i])continue;
        ps.push_back(i);
        for (int j = 2 * i; j < mn; j += i) {
            isp[j] = false;
        }
    }
}*/

//[,val)
template<typename T>
auto prev_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    if (res == st.begin())return st.end();
    res--; return res;
}

//[val,)
template<typename T>
auto next_itr(set<T>& st, T val) {
    auto res = st.lower_bound(val);
    return res;
}
using mP = pair<modint, modint>;
mP operator+(mP a, mP b) {
    return { a.first + b.first,a.second + b.second };
}
mP operator+=(mP& a, mP b) {
    a = a + b; return a;
}
mP operator-(mP a, mP b) {
    return { a.first - b.first,a.second - b.second };
}
mP operator-=(mP& a, mP b) {
    a = a - b; return a;
}
LP operator+(LP a, LP b) {
    return { a.first + b.first,a.second + b.second };
}
LP operator+=(LP& a, LP b) {
    a = a + b; return a;
}
LP operator-(LP a, LP b) {
    return { a.first - b.first,a.second - b.second };
}
LP operator-=(LP& a, LP b) {
    a = a - b; return a;
}

mt19937 mt(time(0));

const string drul = "DRUL";
string senw = "SENW";
//DRUL,or SENW
//int dx[4] = { 1,0,-1,0 };
//int dy[4] = { 0,1,0,-1 };

//-----------------------------------------

//双対セグ木
//区間更新1点取得に使える
//verified with https://codeforces.com/contest/1555/problem/F

template<typename T>
struct SegT {
private:
    int n;
    vector<T> node;
    T e;
    function<T(T, T)> f;
public:
    SegT(vector<T> ori, T _e, function<T(T, T)> _f) {
        int sz = ori.size();
        e = _e, f = _f;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, _e);
        rep(i, sz) {
            node[i + n - 1] = ori[i];
        }
    }
    SegT(int sz, T _e, function<T(T, T)> _f) {
        e = _e, f = _f;
        n = 1;
        while (n < sz)n <<= 1;
        node.resize(2 * n - 1, _e);
    }
    void eval(int k, int l, int r) {
        if (node[k] == e || l + 1 == r)return;
        node[2 * k + 1] = f(node[k], node[2 * k + 1]);
        node[2 * k + 2] = f(node[k], node[2 * k + 2]);
        node[k] = e;
    }
    void add(T x, int a, int b, int k = 0, int l = 0, int r = -1) {
        if (r < 0)r = n;
        eval(k, l, r);
        if (r <= a || b <= l)return;
        if (a <= l && r <= b) {
            node[k] = f(x, node[k]);
            eval(k, l, r);
        }
        else {
            add(x, a, b, k * 2 + 1, l, (l + r) / 2);
            add(x, a, b, k * 2 + 2, (l + r) / 2, r);
        }
    }
    T query(int loc) {
        int k = 0, l = 0, r = n;
        while (r - l > 1) {
            eval(k, l, r);
            int m = (l + r) / 2;
            if (loc < m) {
                k = 2 * k + 1;
                r = m;
            }
            else {
                k = 2 * k + 2;
                l = m;
            }
        }
        return node[k];
    }
};
const int bl = 400;
void solve() {
    int n; cin >> n;
    vector<ll> a(n);
    rep(i, n)cin >> a[i];
    rep(i, n)a[i] *= -1;
    int m; cin >> m;
    vector<int> typ(m);
    vector<ll> x(m), k(m);
    rep(i, m) {
        cin >> typ[i] >> x[i] >> k[i];
        x[i]--;
        if (typ[i] == 1)k[i]--;
    }
    int q; cin >> q;
    vector<int> qx(q), qy(q);
    rep(i, q) {
        cin >> qx[i] >> qy[i]; qy[i]--;
    }
    vector<int> upmem(m);
    int tmp = n;
    vector<int> p(2 * n - 1);
    rep(i, 2 * n - 1) {
        p[i] = i;
    }
    function<int(int)> find_par = [&](int id) {
        if (p[id] == id)return id;
        return p[id] = find_par(p[id]);
    };
    vector<vector<int>> G(2 * n - 1);
    auto merge = [&](int x, int y) {
        x = find_par(x);
        y = find_par(y);
        if (x == y)return;
        p[x] = tmp;
        p[y] = tmp;
        G[tmp].push_back(x);
        G[tmp].push_back(y);
        tmp++;
    };
    vector<int> deg(n);
    rep(i, m) {
        if (typ[i] == 1) {
            deg[x[i]]++;
            deg[k[i]]++;
            merge(x[i], k[i]);
        }
        else if (typ[i] == 4) {
            upmem[i] = find_par(x[i]);
        }
    }
    rep1(i, n - 1) {
        merge(0, i);
    }
    assert(tmp == 2 * n - 1);
    vector<int> trans(2*n-1);
    vector<int> ri(2 * n - 1);
    tmp = 0;
    function<void(int)> initdfs = [&](int id) {
        trans[id] = tmp; tmp++;
        for (int to : G[id])initdfs(to);
        ri[id] = tmp;
    }; initdfs(2 * n - 2);
    //coutarray(trans);
    //coutarray(ri);
    auto f = [&](ll a, ll b) {
        return a + b;
    };
    SegT<ll> st(2 * n - 1, 0, f);
    vector<ll> score(n);
    rep(i, n)score[i] = a[i];
    vector<ll> lscore(n);
    vector<vector<int>> tos(n);
    vector<vector<int>> ltos(n);
    vector<vector<int>> qids(m + 1);
    rep(i, q) {
        qids[qx[i]].push_back(i);
    }
    vector<ll> ans(q);
    rep(i, m+1) {
        for (int qid : qids[i]) {
            int id = qy[qid];
            ll val = 0;
            val += score[id];
            for (int to : ltos[id])val += lscore[to];
            val += st.query(trans[id]);
            ans[qid] = val;
        }
        if (i == m)continue;
        if (typ[i] == 1) {
            int idx = x[i];
            int idy = k[i];
            tos[idx].push_back(idy);
            tos[idy].push_back(idx);
            if (deg[idx] >= bl) {
                score[idy] -= lscore[idx];
                ltos[idy].push_back(idx);
            }
            if (deg[idy] >= bl) {
                score[idx] -= lscore[idy];
                ltos[idx].push_back(idy);
            }
        }
        else if (typ[i] == 2) {
            score[x[i]] += k[i];
        }
        else if (typ[i] == 3) {
            int id = x[i];
            if (deg[id] < bl) {
                score[id] += k[i];
                for (int to : tos[id]) {
                    score[to] += k[i];
                }
            }
            else {
                score[id] += k[i];
                lscore[id] += k[i];
            }
        }
        else {
            int id = upmem[i];
            st.add(k[i], trans[id], ri[id]);
        }
    }
    rep(i, q) {
        ll res = ans[i];
        chmin(res, 0ll);
        cout << -res << "\n";
    }
}





signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    //cout << fixed << setprecision(10);
    init_f();
    //init();
    //while(true)
    //expr();
    //int t; cin >> t; rep(i, t)
    solve();
    return 0;
}

yukicoder

結果

テストケース

ソースコード