結果

問題 No.1030 だんしんぐぱーりない
ユーザー Konton7Konton7
提出日時 2020-07-13 13:56:13
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 340 ms / 2,000 ms
コード長 7,978 bytes
コンパイル時間 2,769 ms
コンパイル使用メモリ 219,680 KB
実行使用メモリ 23,272 KB
最終ジャッジ日時 2024-11-07 13:06:36
合計ジャッジ時間 14,587 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
5,248 KB
testcase_01 AC 2 ms
5,248 KB
testcase_02 AC 2 ms
5,248 KB
testcase_03 AC 2 ms
5,248 KB
testcase_04 AC 2 ms
5,248 KB
testcase_05 AC 248 ms
20,496 KB
testcase_06 AC 211 ms
16,116 KB
testcase_07 AC 143 ms
8,792 KB
testcase_08 AC 151 ms
10,700 KB
testcase_09 AC 201 ms
20,672 KB
testcase_10 AC 91 ms
5,888 KB
testcase_11 AC 249 ms
12,336 KB
testcase_12 AC 163 ms
18,688 KB
testcase_13 AC 171 ms
16,988 KB
testcase_14 AC 253 ms
16,704 KB
testcase_15 AC 144 ms
5,248 KB
testcase_16 AC 190 ms
14,592 KB
testcase_17 AC 183 ms
21,412 KB
testcase_18 AC 256 ms
17,416 KB
testcase_19 AC 129 ms
8,064 KB
testcase_20 AC 143 ms
12,544 KB
testcase_21 AC 160 ms
15,780 KB
testcase_22 AC 139 ms
13,056 KB
testcase_23 AC 196 ms
11,920 KB
testcase_24 AC 174 ms
7,248 KB
testcase_25 AC 193 ms
11,796 KB
testcase_26 AC 117 ms
5,248 KB
testcase_27 AC 147 ms
5,248 KB
testcase_28 AC 215 ms
14,952 KB
testcase_29 AC 125 ms
18,432 KB
testcase_30 AC 120 ms
13,312 KB
testcase_31 AC 138 ms
12,160 KB
testcase_32 AC 223 ms
16,476 KB
testcase_33 AC 203 ms
19,236 KB
testcase_34 AC 94 ms
6,820 KB
testcase_35 AC 340 ms
23,264 KB
testcase_36 AC 314 ms
23,264 KB
testcase_37 AC 327 ms
23,272 KB
testcase_38 AC 332 ms
23,144 KB
testcase_39 AC 328 ms
23,140 KB
testcase_40 AC 2 ms
5,248 KB
testcase_41 AC 2 ms
5,248 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
using VB = vector<bool>;
using VVB = vector<vector<bool>>;
using VVI = vector<VI>;
using VVL = vector<VL>;
using PII = std::pair<int, int>;
using VPII = std::vector<std::pair<int, int>>;
using PLL = std::pair<ll, ll>;
using VPLL = std::vector<std::pair<ll, ll>>;
using TI3 = std::tuple<int, int, int>;
using TI4 = std::tuple<int, int, int, int>;
using TL3 = std::tuple<ll, ll, ll>;
using TL4 = std::tuple<ll, ll, ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define rep3(i, s, n, d) for (int i = (s); i < (int)(n); i += (d))
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()
#define allpt_cr(v) (v).crbegin(), (v).crend()

const int mod1 = 1e9 + 7, mod2 = 998244353, mod3 = 1e9 + 9;
const int mod = mod1;
const ll inf = 1e18;

const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;

    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}

bool check(int y, int x, int h, int w)
{
    return 0 <= y && y < h && 0 <= x && x < w;
}

template <typename T>
vector<T> cumsum(const vector<T> &v)
{
    T s = 0;
    vector<T> ret;

    rep(i, v.size())
    {
        s += v[i];
        s %= mod;
        ret.emplace_back(s);
    }
    return ret;
}

bool iskadomatsu(int a, int b, int c)
{
    return (a != b && b != c && c != a) && ((a > b && b < c) || (a < b && b > c));
}

VS split(string s, char c)
{
    VS ret;
    string part;
    s += c;
    rep(i, s.length())
    {
        if (s[i] == c)
        {
            ret.emplace_back(part);
            part = "";
        }
        else if (s[i] != c)
        {
            part += s[i];
        }
    }
    return ret;
}

string removezero(string &s)
{
    string ret;
    for (auto z : s)
        if (z != '0')
            ret += z;
    return ret;
}

ll sumdigit(ll x)
{
    ll ans{0};
    while (x > 0)
    {
        ans += x % 10;
        x /= 10;
    }
    return ans;
}

template <typename T, typename S, typename R>
ll pow_mod(T p, S q, R mod = 1ll)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r, ret %= mod;
        r = (r * r) % mod, q /= 2;
    }
    return ret % mod;
}

template <typename T, typename S>
ll pow_no_mod(T p, S q)
{
    ll ret = 1, r = p;
    while (q)
    {
        if (q % 2)
            ret *= r;
        r = (r * r), q /= 2;
    }
    return ret;
}

void make_frac_tables(VL &frac_list, VL &frac_inv_list)
{
    rep(i, frac_list.size() - 1)
    {
        frac_list[i + 1] *= frac_list[i] * (i + 1);
        frac_list[i + 1] %= mod;
        frac_inv_list[i + 1] *= frac_inv_list[i] * pow_mod(i + 1, mod - 2, mod);
        frac_inv_list[i + 1] %= mod;
    }
}

ll comb(int a, int b, const VL &frac_list, const VL &frac_inv_list)
{
    if (a < b)
        return 0;
    if (b < 0)
        return 0;
    ll ret = frac_list[a];
    ret *= frac_inv_list[b];
    ret %= mod;
    ret *= frac_inv_list[a - b];
    ret %= mod;
    return ret;
}

VI depth;
VVI dp;

void dfs(int v, int d, VVI &connect, const VI &fever, VI &accum_fever)
{
    depth[v] = d;
    {
        for (auto u : connect[v])
        {
            if (depth[u] == -1)
            {
                accum_fever[u] += max(accum_fever[v], fever[u]);
                dp[u][0] = v;
                dfs(u, d + 1, connect, fever, accum_fever);
            }
        }
    }
    return;
}

int lca(int a, int b)
{
    if (a == -1) return b;
    if (b == -1) return a;

    int c, d;
    if (depth[a] < depth[b])
        swap(a, b);
    d = depth[a] - depth[b];

    rep(i, 25)
    {
        if (d & (1 << i))
            a = dp[a][i];
    }
    if (a == b)
        return a;
    // 深さが不一致なら浅い方に揃え、一致したら終了

    while (dp[a][0] != dp[b][0])
    {
        rep(i, 25) if (dp[a][i + 1] == dp[b][i + 1])
        {
            a = dp[a][i];
            b = dp[b][i];
            break;
        }
        // すぐ上の頂点が一致するまでダブリングで同じ深さまで登る
    }
    return dp[a][0];
}

class RangeMinorMaxorSumQuery // 0-index
{
    int const intmax = 2147483647;
    int const intmin = 0;
    vector<int> sgt;
    int n;
    int k;

public:
    RangeMinorMaxorSumQuery(int n1, int f = -1)
    {
        if (f == -1)
            f = intmax;
        else if (f == 0)
            f = intmin;
        int na = 1;
        int ka = 0;
        while (na < n1)
        {
            na *= 2;
            ka++;
        }
        for (int i = 0; i < 2 * na; i++)
            sgt.push_back(f);
        n = na;
        k = ka;
    }

    void update_lca(int i, int x)
    {
        i += n;
        sgt[i] = x;
        while (i > 1)
        {
            i /= 2;
            sgt[i] = lca(sgt[2 * i], sgt[2 * i + 1]);
        }
    }

    int getlca(int a, int b, int k = 1, int l = 0, int r = -1) //閉区間 l <= x < r とする
    {
        // cout << a << wsp << b << rt;;
        if (r == -1)
            r = n;
        if (r <= a || b <= l)
            return -1;
        if (a == l && b == r)
            return sgt[k];
        else
            return lca(getlca(a, min(b, (l + r) / 2), 2 * k, l, (l + r) / 2), getlca(max(a, (l + r) / 2), b, 2 * k + 1, (l + r) / 2, r));
    }

    void printsegtree()
    {
        for (int i = 0; i < 2 * n; i++)
        {
            cout << sgt[i] << " ";
        }
        cout << endl;
    }
};



int main()
{

    cin.tie(0);
    ios::sync_with_stdio(false);

#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    const int m = 25;
    int n, k, q, a, b, op;
    cin >> n >> k >> q;
    ll ans{0};
    VI fever(n), livingtown(k), accum_fever(n, 0);
    VVI connect(n);
    depth.resize(n);
    fill(allpt(depth), -1);
    dp.resize(n);
    fill(allpt(dp), VI(m, -1));
    rep(i, n) cin >> fever[i];
    accum_fever[0] = fever[0];
    rep(i, k)
    {
        cin >> livingtown[i];
        livingtown[i]--;
    }
    rep(i, n - 1)
    {
        cin >> a >> b;
        a--, b--;
        connect[b].emplace_back(a);
    }

    dfs(0, 0, connect, fever, accum_fever);
    rep(j, m - 1) rep(i, n) if (dp[i][j] != -1)
    {
        dp[i][j + 1] = dp[dp[i][j]][j];
    }
    // show2dvec(dp);
    // show1dvec(accum_fever);

    RangeMinorMaxorSumQuery beebars(k, 0);
    rep(i, k)
    {
        beebars.update_lca(i, livingtown[i]);
    }

    rep(i, q)
    {
        cin >> op >> a >> b;
        if (op == 1)
        {
            beebars.update_lca(a - 1, b - 1);
        }
        if (op == 2)
        {
            cout << accum_fever[beebars.getlca(a - 1, b)] << rt;
        }
        // beebars.printsegtree();
    }

    return 0;
}
0