結果

問題 No.1030 だんしんぐぱーりない
ユーザー maroon_kuri
提出日時 2020-04-17 22:08:41
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 171 ms / 2,000 ms
コード長 7,690 bytes
コンパイル時間 2,675 ms
コンパイル使用メモリ 192,800 KB
実行使用メモリ 33,540 KB
最終ジャッジ日時 2024-10-03 13:17:13
合計ジャッジ時間 8,118 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 40
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <bits/stdc++.h>
using namespace std;
using ll=long long;
#define int ll
#define rng(i,a,b) for(int i=int(a);i<int(b);i++)
#define rep(i,b) rng(i,0,b)
#define gnr(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define per(i,b) gnr(i,0,b)
#define pb push_back
#define eb emplace_back
#define a first
#define b second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<" "<<#x<<" "<<x<<endl
#else
#define dmp(x) void(0)
#endif
template<class t,class u> void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u> void chmin(t&a,u b){if(b<a)a=b;}
template<class t> using vc=vector<t>;
template<class t> using vvc=vc<vc<t>>;
using pi=pair<int,int>;
using vi=vc<int>;
template<class t,class u>
ostream& operator<<(ostream& os,const pair<t,u>& p){
    return os<<"{"<<p.a<<","<<p.b<<"}";
}
template<class t> ostream& operator<<(ostream& os,const vc<t>& v){
    os<<"{";
    for(auto e:v)os<<e<<",";
    return os<<"}";
}
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#ifdef LOCAL
void dmpr(ostream&os){os<<endl;}
template<class T,class... Args>
void dmpr(ostream&os,const T&t,const Args&... args){
    os<<t<<" ";
    dmpr(os,args...);
}
#define dmp2(...) dmpr(cerr,__LINE__,##__VA_ARGS__)
#else
#define dmp2(...) void(0)
#endif
using uint=unsigned;
using ull=unsigned long long;
template<class t,size_t n>
ostream& operator<<(ostream&os,const array<t,n>&a){
    return os<<vc<t>(all(a));
}
template<int i,class T>
void print_tuple(ostream&,const T&){
}
template<int i,class T,class H,class ...Args>
void print_tuple(ostream&os,const T&t){
    if(i)os<<",";
    os<<get<i>(t);
    print_tuple<i+1,T,Args...>(os,t);
}
template<class ...Args>
ostream& operator<<(ostream&os,const tuple<Args...>&t){
    os<<"{";
    print_tuple<0,tuple<Args...>,Args...>(os,t);
    return os<<"}";
}
template<class t>
void print(t x,int suc=1){
    cout<<x;
    if(suc==1)
        cout<<"\n";
    if(suc==2)
        cout<<" ";
}
ll read(){
    ll i;
    cin>>i;
    return i;
}
vi readvi(int n,int off=0){
    vi v(n);
    rep(i,n)v[i]=read()+off;
    return v;
}
template<class T>
void print(const vector<T>&v,int suc=1){
    rep(i,v.size())
        print(v[i],i==int(v.size())-1?suc:2);
}
string readString(){
    string s;
    cin>>s;
    return s;
}
template<class T>
T sq(const T& t){
    return t*t;
}
//#define CAPITAL
void yes(bool ex=true){
    #ifdef CAPITAL
    cout<<"YES"<<"\n";
    #else
    cout<<"Yes"<<"\n";
    #endif
    if(ex)exit(0);
}
void no(bool ex=true){
    #ifdef CAPITAL
    cout<<"NO"<<"\n";
    #else
    cout<<"No"<<"\n";
    #endif
    if(ex)exit(0);
}
void possible(bool ex=true){
    #ifdef CAPITAL
    cout<<"POSSIBLE"<<"\n";
    #else
    cout<<"Possible"<<"\n";
    #endif
    if(ex)exit(0);
}
void impossible(bool ex=true){
    #ifdef CAPITAL
    cout<<"IMPOSSIBLE"<<"\n";
    #else
    cout<<"Impossible"<<"\n";
    #endif
    if(ex)exit(0);
}
constexpr ll ten(int n){
    return n==0?1:ten(n-1)*10;
}
const ll infLL=LLONG_MAX/3;
#ifdef int
const int inf=infLL;
#else
const int inf=INT_MAX/2-100;
#endif
int topbit(signed t){
    return t==0?-1:31-__builtin_clz(t);
}
int topbit(ll t){
    return t==0?-1:63-__builtin_clzll(t);
}
int botbit(signed a){
    return a==0?32:__builtin_ctz(a);
}
int botbit(ll a){
    return a==0?64:__builtin_ctzll(a);
}
int popcount(signed t){
    return __builtin_popcount(t);
}
int popcount(ll t){
    return __builtin_popcountll(t);
}
bool ispow2(int i){
    return i&&(i&-i)==i;
}
ll mask(int i){
    return (ll(1)<<i)-1;
}
bool inc(int a,int b,int c){
    return a<=b&&b<=c;
}
template<class t> void mkuni(vc<t>&v){
    sort(all(v));
    v.erase(unique(all(v)),v.ed);
}
ll rand_int(ll l, ll r) { //[l, r]
    #ifdef LOCAL
    static mt19937_64 gen;
    #else
    static mt19937_64 gen(chrono::steady_clock::now().time_since_epoch().count());
    #endif
    return uniform_int_distribution<ll>(l, r)(gen);
}
template<class t>
void myshuffle(vc<t>&a){
    rep(i,si(a))swap(a[i],a[rand_int(0,i)]);
}
template<class t>
int lwb(const vc<t>&v,const t&a){
    return lower_bound(all(v),a)-v.bg;
}
//VERIFY: yosupo
//CF Global3 H
//ARC073 F
//point update
template<class T,class F>
struct SegTree{
    vc<T> buf;
    int s;
    const F f;
    const T g;
    SegTree(F ff,T gg):f(ff),g(gg){}
    void init(const vc<T>& d){
        int n=d.size();
        s=1;
        while(s<n)s*=2;
        buf.resize(s*2,g);
        rep(i,n)
            buf[i+s]=d[i];
        gnr(i,1,s)
            u(i);
    }
    SegTree(const vc<T>& d,F ff,T gg):f(ff),g(gg){
        init(d);
    }
    void u(int i){
        buf[i]=f(buf[i*2],buf[i*2+1]);
    }
    void set(int i,T t){
        i+=s;
        buf[i]=t;
        while(i>>=1)u(i);
    }
    void upd(int i,T t){
        i+=s;
        buf[i]=f(buf[i],t);
        while(i>>=1)u(i);
    }
    T get(int b,int e,int l,int r,int i){
        if(e<=l||r<=b)return g;
        if(b<=l&&r<=e)return buf[i];
        int m=(l+r)/2;
        return f(get(b,e,l,m,i*2),get(b,e,m,r,i*2+1));
    }
    T get(int b,int e){
        return get(b,e,0,s,1);
    }
};
template<class T,class F>
SegTree<T,F> segtree(const vc<T>& d,F f,T g){
    return SegTree<T,F>(d,f,g);
}
//内部でグラフをいじるから in,out を使うときは注意
//VERIFY: yosupo
//CF530F
//CodeChef Persistent Oak
//AOJ GRL5C
template<class E>
struct HLD{
    vvc<E> g;
    int n,rt,cnt;
    vi sub,in,out,par,head,dep;
    int dfs1(int v,int p,int d){
        par[v]=p;
        dep[v]=d;
        g[v].erase(remove(all(g[v]),p),g[v].ed);
        for(auto&e:g[v]){
            sub[v]+=dfs1(e,v,d+1);
            if(sub[g[v][0]]<sub[e])
                swap(g[v][0],e);
        }
        return sub[v];
    }
    void dfs2(int v,int h){
        in[v]=cnt++;
        head[v]=h;
        for(int to:g[v])
            dfs2(to,to==g[v][0]?h:to);
        out[v]=cnt;
    }
    HLD(){}
    HLD(const vvc<E>&gg,int rr):g(gg),n(g.size()),rt(rr),cnt(0),
        sub(n,1),in(n),out(n),par(n,-1),head(n),dep(n){
        dfs1(rt,-1,0);
        dfs2(rt,rt);
    }
    int lca(int a,int b){
        while(head[a]!=head[b]){
            if(dep[head[a]]>dep[head[b]])
                swap(a,b);
            b=par[head[b]];
        }
        if(dep[a]>dep[b])
            swap(a,b);
        return a;
    }
    int len(int a,int b){
        return dep[a]+dep[b]-dep[lca(a,b)]*2;
    }
    bool asde(int a,int b){
        return in[a]<=in[b]&&out[b]<=out[a];
    }
    //XX Opencup GP of Korea
    //CF625 F
    vi index;
    void init(){
        index.resize(n);
    }
    //vs を含む virtual tree を返す
    //返すのは辺の集合
    //辺の端点は，元の木における番号
    //元の木における番号を virtual tree の頂点番号に写すのが，index という変数
    vc<pi> tree_compress(vi vs){
        assert(index.size());
        auto comp = [&](int x,int y){
            return in[x] < in[y];
        };
        sort(all(vs),comp);
        vs.erase(unique(all(vs)),vs.ed);
        int k = vs.size();
        rep(i,k-1){
            vs.pb(lca(vs[i],vs[i+1]));
        }
        sort(all(vs),comp);
        vs.erase(unique(all(vs)),vs.ed);
        k = vs.size();
        rep(i,k) index[vs[i]] = i;
        vc<pi> es;
        rng(i,1,k){
            int p = lca(vs[i-1],vs[i]);
            es.eb(vs[i],p);
        }
        return es;
    }
    vi val;
    void dfs(int v,int w){
        chmax(w,val[v]);
        val[v]=w;
        for(auto c:g[v]){
            dfs(c,w);
        }
    }
    void initval(vi raw){
        val=raw;
        dfs(rt,0);
    }
};
signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout<<fixed<<setprecision(20);
    
    int n,k,q;cin>>n>>k>>q;
    vi c=readvi(n);
    vi a=readvi(k,-1);
    
    vvc<int> t(n);
    rep(i,n-1){
        int x,y;cin>>x>>y;
        x--;y--;
        t[x].pb(y);
        t[y].pb(x);
    }
    
    HLD<int> h(t,0);
    
    h.initval(c);
    
    vc<pi> in(k),out(k);
    rep(i,k){
        in[i]=pi(h.in[a[i]],a[i]);
        out[i]=pi(h.out[a[i]],a[i]);
    }
    
    auto pimin=[](pi x,pi y){return min(x,y);};
    auto pimax=[](pi x,pi y){return max(x,y);};
    
    auto segmin=segtree(in,pimin,pi(inf,-1));
    auto segmax=segtree(out,pimax,pi(-inf,-1));
    
    rep(_,q){
        int z;cin>>z;
        if(z==1){
            int x,y;cin>>x>>y;
            x--;
            y--;
            segmin.set(x,pi(h.in[y],y));
            segmax.set(x,pi(h.out[y],y));
        }else{
            int l,r;cin>>l>>r;
            l--;
            dmp2(l,r);
            int x=segmin.get(l,r).b;
            int y=segmax.get(l,r).b;
            dmp2(x,y);
            int lca=h.lca(x,y);
            print(h.val[lca]);
        }
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0