Submission #2330443

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1LL << 60
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<ll,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

struct edge
{
    int from,to;
    ll cost;
};

struct eda
{
    int to,id;
};

pair<int,int> inc[MAX_N];
vector<edge> es;
vector<eda> G[MAX_N];

template<typename V> class segtree {
public:
    int n,sz;
    vector<V> node;
    vector<int> node_id;
    segtree(vector<V>& v){
        sz = (int)v.size();
        n = 1;
        while(n < sz){
            n *= 2;
        }
        node.resize(2*n-1,P(INF,0)),node_id.resize(2*n-1);
        rep(i,sz){
            node[i+n-1] = v[i];
            node_id[i+n-1] = i;
        }
        for(int i=n-2; i>=0; i--){
            if(node[2*i+1] > node[2*i+2]){
                node[i] = node[2*i+2];
                node_id[i] = node_id[2*i+2];
            }else{
                node[i] = node[2*i+1];
                node_id[i] = node_id[2*i+1];
            }
        }
    }
    void update(int k,ll a)
    {
    	k += n-1;
    	node[k].fi += a,node_id[k] = k-(n-1);
    	while(k>0){
    		k = (k-1)/2;
    		if(node[2*k+1] < node[2*k+2]){
                node[k] = node[2*k+1],node_id[k] = node_id[2*k+1];
            }else{
                node[k] = node[2*k+2],node_id[k] = node_id[2*k+2];
            }
    	}
    }
    pair<V,int> query(int a,int b,int k=0,int l=0,int r=-1)
    {
        if(r < 0) r = n;
    	if(r <= a || b <= l){
    		return pair<V,int>(P(INF,0),-1);
    	}
    	if(a <= l && r <= b){
    		return pair<V,int>(node[k],node_id[k]);
    	}else{
    		pair<V,int> vl = query(a,b,2*k+1,l,(l+r)/2);
    		pair<V,int> vr = query(a,b,2*k+2,(l+r)/2,r);
    		return min(vl,vr);
    	}
    }
    void print()
    {
        rep(i,sz){
            pair<V,int> p;
            p = query(i,i+1);
            cout << "st[" << i << "]: " << p.fi << " " << p.se << endl;
        }
    }
};

vector<segtree<P> > vec;
int sz[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,q;
    cin >> n;
    es.resize(n-1);
    vector<P> pr(n-1);
    rep(i,n-1){
        int a,b,c;
        cin >> a >> b >> c;
        --a,--b;
        es[i] = (edge){a,b,c};
        G[a].pb((eda){b,i}),G[b].pb((eda){a,i});
        pr[i] = P(c,i);
        inc[i] = P(0,i);
    }
    segtree<P> seg(pr);
    vec.pb(seg);
    sz[0] = seg.sz;
    cin >> q;
    rep(i,q){
        int a;
        cin >> a;
        if(a == 1){
            int id,d;
            cin >> id >> d;
            --id;
            if(inc[id].fi < 0) continue;
            es[id].cost += d;
            vec[inc[id].fi].update(inc[id].se,d);
        }else{
            int id;
            cin >> id;
            --id;
            if(inc[id].fi < 0){
                cout << "-1\n";
                continue;
            }
            int tmp = inc[id].fi;
            segtree<P>& seg = vec[inc[id].fi];
            auto hoge = seg.query(0,seg.sz);
            P p = hoge.fi;
            seg.update(hoge.se,INF);
            sz[tmp]--;
            inc[p.se].fi = -1;
            cout << p.se+1 << "\n";
            queue<int> q[2];
            vi h[2];
            vector<P> nvec;
            q[0].push(es[p.se].to),q[1].push(es[p.se].from);
            int index[2] = {}, ch = -1;
            set<int> st[2];
            st[0] = {es[p.se].to}, st[1] = {es[p.se].from};
            while(1){
                rep(j,2){
                    bool ok = false;
                    while(!q[j].empty()){
                        int p = q[j].front();
                        for(;index[j]<len(G[p]);index[j]++){
                            auto& e = G[p][index[j]];
                            if(inc[e.id].fi >= 0 && st[j].find(e.to) == st[j].end()){
                                h[j].pb(e.id);
                                q[j].push(e.to);
                                st[j].insert(e.to);
                                ok = true;
                                index[j]++;
                                break;
                            }
                        }
                        if(ok) break;
                        q[j].pop();
                        index[j] = 0;
                    }
                    if(!ok){
                        ch = j;
                        break;
                    }
                }
                if(ch >= 0){
                    break;
                }
            }
            for(int j = 0; j < len(h[ch]); j++){
                seg.update(inc[h[ch][j]].se,INF);
                sz[tmp]--;
                inc[h[ch][j]] = P(len(vec),j);
                nvec.pb(P(es[h[ch][j]].cost,h[ch][j]));
            }
            if(len(nvec)){
                segtree<P> nseg(nvec);
                sz[len(vec)] = len(nvec);
                vec.pb(nseg);
            }
        }
    }
    return 0;
}

Submission Info

Judge Result