結果

問題 No.1197 モンスターショー
ユーザー ThistleThistle
提出日時 2020-08-17 00:52:33
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 988 ms / 3,000 ms
コード長 12,595 bytes
コンパイル時間 4,015 ms
コンパイル使用メモリ 179,676 KB
実行使用メモリ 96,336 KB
最終ジャッジ日時 2024-11-14 23:23:36
合計ジャッジ時間 25,479 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge5
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 40 ms
56,960 KB
testcase_01 AC 40 ms
57,088 KB
testcase_02 AC 40 ms
57,088 KB
testcase_03 AC 40 ms
56,960 KB
testcase_04 AC 41 ms
56,960 KB
testcase_05 AC 41 ms
57,088 KB
testcase_06 AC 42 ms
56,960 KB
testcase_07 AC 254 ms
85,656 KB
testcase_08 AC 314 ms
69,220 KB
testcase_09 AC 413 ms
78,152 KB
testcase_10 AC 643 ms
78,868 KB
testcase_11 AC 424 ms
66,368 KB
testcase_12 AC 313 ms
62,672 KB
testcase_13 AC 218 ms
70,360 KB
testcase_14 AC 608 ms
73,320 KB
testcase_15 AC 444 ms
66,072 KB
testcase_16 AC 652 ms
82,940 KB
testcase_17 AC 736 ms
83,656 KB
testcase_18 AC 300 ms
68,076 KB
testcase_19 AC 615 ms
80,632 KB
testcase_20 AC 153 ms
65,764 KB
testcase_21 AC 416 ms
64,412 KB
testcase_22 AC 72 ms
59,500 KB
testcase_23 AC 651 ms
75,316 KB
testcase_24 AC 478 ms
75,828 KB
testcase_25 AC 287 ms
69,640 KB
testcase_26 AC 545 ms
72,192 KB
testcase_27 AC 623 ms
82,584 KB
testcase_28 AC 480 ms
72,524 KB
testcase_29 AC 355 ms
73,144 KB
testcase_30 AC 287 ms
76,132 KB
testcase_31 AC 278 ms
71,360 KB
testcase_32 AC 300 ms
62,636 KB
testcase_33 AC 186 ms
68,308 KB
testcase_34 AC 979 ms
87,492 KB
testcase_35 AC 981 ms
88,032 KB
testcase_36 AC 973 ms
86,904 KB
testcase_37 AC 976 ms
88,144 KB
testcase_38 AC 988 ms
87,292 KB
testcase_39 AC 963 ms
86,904 KB
testcase_40 AC 880 ms
96,336 KB
testcase_41 AC 34 ms
59,440 KB
testcase_42 AC 34 ms
58,416 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target ("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _USE_MATH_DEFINES
#include<iostream>
#include<string>
#include<queue>
#include<cmath>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<random>
#include<functional>
#include<algorithm>
#include<stack>
#include<cstdio>
#include<cstring>
#include<bitset>
#include<unordered_map>
#include<climits>
#include<fstream>
#include<complex>
#include<time.h>
#include<cassert>
#include<functional>
#include<numeric>
#include<tuple>
using namespace std;
using ll = long long;
using ld = long double;
#define int long long
#define all(a) (a).begin(),(a).end()
#define fs first
#define sc second
#define xx first
#define yy second.first
#define zz second.second
#define H pair<int, int>
#define P pair<int, pair<int, int>>
#define Q(i,j,k) mkp(i,mkp(j,k))
#define rng(i,s,n) for(int i = (s) ; i < (n) ; i++)
#define rep(i,n) rng(i, 0, (n))
#define mkp make_pair
#define vec vector
#define vi vec<int>
#define pb emplace_back
#define siz(a) (int)(a).size()
#define crdcomp(b) sort(all((b)));(b).erase(unique(all((b))),(b).end())
#define getidx(b,i) (lower_bound(all(b),(i))-(b).begin())
#define ssp(i,n) (i==(int)(n)-1?"\n":" ")
#define ctoi(c) (int)(c-'0')
#define itoc(c) (char)(c+'0')
#define cyes printf("Yes\n")
#define cno printf("No\n")
#define cdf(n) int quetimes_=(n);rep(qq123_,quetimes_)
#define gcj printf("Case #%lld: ",qq123_+1)
#define readv(a,n) a.resize(n,0);rep(i,(n)) a[i]=read()
#define found(a,x) (a.find(x)!=a.end())
//#define endl "\n"
constexpr int mod = (ll)1e9 + 7;
constexpr int Mod = 998244353;
constexpr ld EPS = 1e-10;
constexpr ll inf = (ll)3 * 1e18;
constexpr int Inf = (ll)15 * 1e8;
constexpr int dx[] = { -1,1,0,0 }, dy[] = { 0,0,-1,1 };
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 (b < a) { a = b; return 1; } return 0; }
ll read() { ll u, k = scanf("%lld", &u); return u; }
string reads() { string s; cin >> s; return s; }
H readh(short g = 0) { H u; int k = scanf("%lld %lld", &u.fs, &u.sc); if (g == 1) u.fs--, u.sc--; if (g == 2) u.fs--; return u; }


auto RUQ = [](int& num, int x, int width) {num = x; };
auto RAQ = [](int& num, int x, int width) {num += x; };
auto RCMXQ = [](int& num, int x, int width) {num = max(num, x); };
auto RCMNQ = [](int& num, int x, int width) {num = min(num, x); };
auto RASQ = [](int& num, int x, int width) {num += (x * width); };
auto RUSQ = [](int& num, int x, int width) {num = (x * width); };
auto RSQ = [](int x, int y)->int {return x + y; };
auto RMXQ = [](int x, int y)->int {return max(x, y); };
auto RMNQ = [](int x, int y)->int {return min(x, y); };
class Segtree {
#define SEG_SIZE 900000
    using F = function<void(int&, int, int)>;
    using T = function<int(int, int)>;
    int siz, rr, zer, zer2;
    int dat[SEG_SIZE], lazy[SEG_SIZE];
    bool updated[SEG_SIZE];
    F upd; T qur;
public:
    //for update, for query
    void init(int size, F update, T query, int zero, int zero2) {
        siz = size, upd = update, qur = query, zer = zero2, zer2 = zero;
        rr = 1; while (rr < size) rr *= 2;
        for (int i = 0; i < SEG_SIZE; i++) dat[i] = zer, lazy[i] = zer2, updated[i] = 0;
    }
    void rmnq(int n) { init(n, RUQ, RMNQ, 0, inf); }
    void rmxq(int n) { init(n, RUQ, RMXQ, 0, -inf); }
    template<class Iterator>
    void build(const Iterator st, const Iterator ed) {
        Iterator it = st; int cur = rr - 1;
        while (it != ed) dat[cur++] = (*it++);
        for (int i = rr - 2; i >= 0; i--)
            dat[i] = qur(dat[i * 2 + 1], dat[i * 2 + 2]);
    }
    void build(vector<int>v) {
        for (int i = 0; i < min((int)v.size(), siz); i++)
            dat[i + rr - 1] = v[i];
        for (int i = rr - 2; i >= 0; i--)
            dat[i] = qur(dat[i * 2 + 1], dat[i * 2 + 2]);
    }
    void update(int a, int b, int x) {
        update(0, a, b, 0, rr, x);
    }
    void change(int a, int x) {
        change2(a, x);
    }//一点更新
    int query(int a, int b) {
        return query(0, a, b, 0, rr);
    }
    int lower_bound(int a, int b, function<bool(int)>comp) {
        return lower_bound(0, a, b, 0, rr, comp);
    }
    int upper_bound(int a, int b, function<bool(int)>comp) {
        return upper_bound(0, a, b, 0, rr, comp);
    }
    int operator[](const int i) {
        return query(i, i + 1);
    }
private:
    void eval(int i, int l, int r) {
        if (!updated[i]) return;
        if (r - l > 1) {
            upd(lazy[i * 2 + 1], lazy[i], 1);
            upd(lazy[i * 2 + 2], lazy[i], 1);
            updated[i * 2 + 1] = updated[i * 2 + 2] = 1;
        }
        upd(dat[i], lazy[i], min(r, siz) - l);
        lazy[i] = zer2;
        updated[i] = 0;
    }
    void update(int i, int a, int b, int l, int r, int x) {
        eval(i, l, r);
        if (b <= l || r <= a) return;
        if (a <= l && r <= b) {
            upd(lazy[i], x, 1); updated[i] = 1;
            eval(i, l, r);
            return;
        }
        update(i * 2 + 1, a, b, l, (l + r) / 2, x);
        update(i * 2 + 2, a, b, (l + r) / 2, r, x);
        dat[i] = qur(dat[i * 2 + 1], dat[i * 2 + 2]);
    }
    void change2(int a, int x) {
        query(a, a + 1);
        int t = a + rr - 1;
        dat[t] = x;
        while (t > 0) {
            t = (t - 1) / 2;
            dat[t] = qur(dat[t * 2 + 1], dat[t * 2 + 2]);
        }
    }
    int query(int i, int a, int b, int l, int r) {
        eval(i, l, r);
        if (b <= l || r <= a) return zer;
        if (a <= l && r <= b) return dat[i];
        return qur(query(i * 2 + 1, a, b, l, (l + r) / 2),
            query(i * 2 + 2, a, b, (l + r) / 2, r));
    }
    int lower_bound(int i, int a, int b, int l, int r, function<bool(int)>comp) {
        eval(i, l, r);
        if (b <= l || r <= a || !comp(dat[i])) return siz;
        if (r - l == 1) return l;
        int tmp = lower_bound(i * 2 + 1, a, b, l, (l + r) / 2, comp);
        if (tmp < siz) return tmp;
        return lower_bound(i * 2 + 2, a, b, (l + r) / 2, r, comp);
    }
    int upper_bound(int i, int a, int b, int l, int r, function<bool(int)>comp) {
        eval(i, l, r);
        if (b <= l || r <= a || !comp(dat[i])) return 0;
        if (r - l == 1) return r;
        int tmp = upper_bound(i * 2 + 2, a, b, (l + r) / 2, r, comp);
        if (tmp > 0) return tmp;
        return upper_bound(i * 2 + 1, a, b, l, (l + r) / 2, comp);
    }
};

class HLD {
#define HLD_SIZ 400010
#define H pair<int, int>
#define pb emplace_back
#define fs first
#define sc second
    using F = function<void(int&, int, int)>;
    using T = function<int(int, int)>;
    int n, st, zer, zer2, idx;
    bool mde;
    int siz[HLD_SIZ];
    vector<int>e[HLD_SIZ];
    vector<pair<int, pair<int, int>>>f;
    int in[HLD_SIZ], out[HLD_SIZ], rev[HLD_SIZ];
    int head[HLD_SIZ], prt[HLD_SIZ], dept[HLD_SIZ];
    Segtree seg;
    F upd; T qur;
public:
    //for update, for query, mode(0:vertex, 1:edge)
    void init(int size, F update, T query, int zero, int zero2, bool mode) {
        n = size, zero = zer, zer2 = zero2;
        upd = update, qur = query;
        mde = mode;
        f.clear();
        for (int i = 0; i <= n; i++) {
            siz[i] = 0, prt[i] = -1, head[i] = -1;
            in[i] = 0, out[i] = 0, rev[i] = 0;
            dept[i] = 0;
            e[i].clear();
        }
    }
    void add_edge(int u, int v, int r) {
        add_edge(u, v);
        f.pb(make_pair(u, make_pair(v, r)));
    }
    void add_edge(int u, int v) {
        e[u].pb(v);
        e[v].pb(u);
    }
    void build(int root = 0) {
        st = root;
        dept[st] = 0;
        for (auto u : e[st]) normalize(u, st, 1);
        for (int i = 0; i <= n; i++) if (i != st && !(~prt[i])) {
            dept[i] = 0;
            for (auto u : e[i]) normalize(u, i, 1);
        }
        for (int i = 0; i <= n; i++) if (!(~prt[i])) dfs1(i);
        for (int i = 0; i <= n; i++) if (!(~prt[i])) {
            head[i] = i; dfs2(i);
        }
        seg.init(idx, upd, qur, zer, zer2);
        if (f.size()) {
            vector<int>v(idx, zer2);
            for (auto g : f) {
                v[max(in[g.fs], in[g.sc.fs])] = g.sc.sc;
            }
            seg.build(v);
        }
    }
    void update(int a, int b, int x) {
        while (head[a] != head[b]) {
            if (in[a] > in[b]) swap(a, b);
            seg.update(in[head[b]], in[b] + 1, x);
            b = prt[head[b]];
        }
        if (in[a] > in[b]) swap(a, b);
        seg.update(in[a] + mde, in[b] + 1, x);
    }
    int query(int a, int b) {
        int ret = zer2;
        while (head[a] != head[b]) {
            if (in[a] > in[b]) swap(a, b);
            ret = qur(ret, seg.query(in[head[b]], in[b] + 1));
            b = prt[head[b]];
        }
        if (in[a] > in[b]) swap(a, b);
        ret = qur(ret, seg.query(in[a] + mde, in[b] + 1));
        return ret;
    }
    int lca(int a, int b) {
        while (1) {
            if (in[a] > in[b]) swap(a, b);
            if (head[a] == head[b]) return a;
            b = prt[head[b]];
        }
    }
    void subupdate(int a, int x) {
        seg.update(in[a], out[a], x);
    }
    int subquery(int a) {
        return seg.query(in[a], out[a]);
    }
    int par(int x, int t) {
        while (1) {
            if (in[x] - in[head[x]] >= t)
                return rev[in[head[x]] + ((in[x] - in[head[x]]) - t)];
            t -= (in[x] - in[head[x]] + 1);
            x = prt[head[x]];
        }
    }
    int operator[](const int& i) { return dept[i]; }
private:
    void normalize(int v, int p, int d) {
        dept[v] = d;
        prt[v] = p;
        for (auto& u : e[v]) {
            if (u == e[v].back()) break;
            if (u == p) swap(u, e[v].back());
            normalize(u, v, d + 1);
        }
        if (!e[v].empty()) e[v].pop_back();
    }
    void dfs1(int v) {
        siz[v] = 1;
        for (int& u : e[v]) {
            dfs1(u);
            siz[v] += siz[u];
            if (siz[u] > siz[e[v][0]]) {
                swap(u, e[v][0]);
            }
        }
    }
    void dfs2(int v) {
        rev[idx] = v;
        in[v] = idx++;
        for (auto u : e[v]) {
            head[u] = (u == e[v][0] ? head[v] : u);
            dfs2(u);
        }
        out[v] = idx;
    }
};


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

int n, k, q;
vi a;
vec<H>e;
vi f[200000];
vec<P> queries;
HLD hld, hld2;
int c[200000];

void generate(int num) {
        cin >> n >> k >> q;
        rep(i, k) a.pb(read()-1);
        rep(i, n - 1) {
            e.pb(readh(1));
            f[e.back().fs].pb(e.back().sc);
            f[e.back().sc].pb(e.back().fs);
        }
        rep(i, q) {
            int t; cin >> t; int  u, v = 1;
            if (t == 1) cin >> u >> v;
            else if (t == 2) cin >> u;
            u--; v--;
            queries.pb(Q(t, u, v));
        }
}
vi solve() {
    hld.init(n, RASQ, RSQ, 0, 0, 1);
    hld2.init(n, RASQ, RSQ, 0, 0, 0);
    function<void(int, int, int)> dfs = [&](int x, int p, int d) {
        c[x] = d;
        for (auto g : f[x]) {
            if (g != p) dfs(g, x, d);
        }
    };
    for (auto g : f[0]) dfs(g, 0, g);
    rep(i, n - 1) {
        hld.add_edge(e[i].fs, e[i].sc);
        hld2.add_edge(e[i].fs, e[i].sc);
    }
    hld.build(0);
    hld2.build(0);
    vi b = a;
    int ans = 0;
    rep(i, k) {
        hld.update(0, b[i], 1);
        hld2.update(b[i], b[i], 1);
        ans += hld[b[i]];
    }
    vi ret;
    for (auto g : queries) {
        if (g.xx == 1) {
            ans -= hld[b[g.yy]];
            hld.update(0, b[g.yy], -1);
            hld2.update(b[g.yy], b[g.yy], -1);
            b[g.yy] = g.zz;
            hld.update(0, b[g.yy], 1);
            hld2.update(b[g.yy], b[g.yy], 1);
            ans += hld[b[g.yy]];
        }
        else {
            int t = ans;
            int r = hld[g.yy] * hld2.subquery(c[g.yy]);
            //
            int d = hld.query(0, g.yy);
            //0からゴールまでのパスで、使用されたのは何回ですか？
            int h = (k - hld2.subquery(c[g.yy])) * hld[g.yy];
            //ゴールと全くパスを共有していない人たちは、深さ分だけコストが加算される
            ret.pb((t - d) + (r - d) + h);
        }
    }
    return ret;
}

signed main() {
    generate(0);
    vi ans = solve();
    for (auto g : ans) cout << g << endl;
}
0