結果

問題 No.2439 Fragile Apple Tree
ユーザー 👑 potato167potato167
提出日時 2023-08-16 01:20:26
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 2,381 ms / 10,000 ms
コード長 7,589 bytes
コンパイル時間 2,679 ms
コンパイル使用メモリ 218,296 KB
実行使用メモリ 128,592 KB
最終ジャッジ日時 2024-11-28 13:19:15
合計ジャッジ時間 36,702 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1,030 ms
56,616 KB
testcase_01 AC 1,950 ms
75,196 KB
testcase_02 AC 1,840 ms
75,316 KB
testcase_03 AC 782 ms
128,592 KB
testcase_04 AC 898 ms
128,544 KB
testcase_05 AC 1,676 ms
75,200 KB
testcase_06 AC 1,834 ms
75,324 KB
testcase_07 AC 2,283 ms
74,800 KB
testcase_08 AC 2,381 ms
74,820 KB
testcase_09 AC 2 ms
5,248 KB
testcase_10 AC 2 ms
5,248 KB
testcase_11 AC 2 ms
5,248 KB
testcase_12 AC 2 ms
5,248 KB
testcase_13 AC 2 ms
5,248 KB
testcase_14 AC 2,307 ms
72,152 KB
testcase_15 AC 1,303 ms
75,152 KB
testcase_16 AC 1,817 ms
75,232 KB
testcase_17 AC 1,778 ms
75,192 KB
testcase_18 AC 739 ms
56,800 KB
testcase_19 AC 614 ms
30,020 KB
testcase_20 AC 269 ms
25,812 KB
testcase_21 AC 76 ms
5,248 KB
testcase_22 AC 1,020 ms
40,684 KB
testcase_23 AC 455 ms
21,140 KB
testcase_24 AC 555 ms
28,068 KB
testcase_25 AC 514 ms
48,176 KB
testcase_26 AC 631 ms
53,880 KB
testcase_27 AC 461 ms
38,644 KB
testcase_28 AC 2 ms
5,248 KB
testcase_29 AC 2 ms
5,248 KB
testcase_30 AC 2 ms
5,248 KB
testcase_31 AC 1,089 ms
72,360 KB
testcase_32 AC 1,098 ms
72,352 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(p) p.begin(),p.end()
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)
const int mod=998244353;


namespace atcoder {

namespace internal {

// @param n `0 <= n`
// @return minimum non-negative `x` s.t. `n <= 2**x`
int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

// @param n `1 <= n`
// @return minimum non-negative `x` s.t. `(n & (1 << x)) != 0`
int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

template <class S,
          S (*op)(S, S),
          S (*e)(),
          class F,
          S (*mapping)(F, S),
          F (*composition)(F, F),
          F (*id)()>
struct lazy_segtree {
  public:
    lazy_segtree() : lazy_segtree(0) {}
    lazy_segtree(int n) : lazy_segtree(std::vector<S>(n, e())) {}
    lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        lz = std::vector<F>(size, id());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        return d[p];
    }

    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return e();

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push(r >> i);
        }

        S sml = e(), smr = e();
        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }

        return op(sml, smr);
    }

    S all_prod() { return d[1]; }

    void apply(int p, F f) {
        assert(0 <= p && p < _n);
        p += size;
        for (int i = log; i >= 1; i--) push(p >> i);
        d[p] = mapping(f, d[p]);
        for (int i = 1; i <= log; i++) update(p >> i);
    }
    void apply(int l, int r, F f) {
        assert(0 <= l && l <= r && r <= _n);
        if (l == r) return;

        l += size;
        r += size;

        for (int i = log; i >= 1; i--) {
            if (((l >> i) << i) != l) push(l >> i);
            if (((r >> i) << i) != r) push((r - 1) >> i);
        }

        {
            int l2 = l, r2 = r;
            while (l < r) {
                if (l & 1) all_apply(l++, f);
                if (r & 1) all_apply(--r, f);
                l >>= 1;
                r >>= 1;
            }
            l = l2;
            r = r2;
        }

        for (int i = 1; i <= log; i++) {
            if (((l >> i) << i) != l) update(l >> i);
            if (((r >> i) << i) != r) update((r - 1) >> i);
        }
    }

    template <bool (*g)(S)> int max_right(int l) {
        return max_right(l, [](S x) { return g(x); });
    }
    template <class G> int max_right(int l, G g) {
        assert(0 <= l && l <= _n);
        assert(g(e()));
        if (l == _n) return _n;
        l += size;
        for (int i = log; i >= 1; i--) push(l >> i);
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!g(op(sm, d[l]))) {
                while (l < size) {
                    push(l);
                    l = (2 * l);
                    if (g(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*g)(S)> int min_left(int r) {
        return min_left(r, [](S x) { return g(x); });
    }
    template <class G> int min_left(int r, G g) {
        assert(0 <= r && r <= _n);
        assert(g(e()));
        if (r == 0) return 0;
        r += size;
        for (int i = log; i >= 1; i--) push((r - 1) >> i);
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!g(op(d[r], sm))) {
                while (r < size) {
                    push(r);
                    r = (2 * r + 1);
                    if (g(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;
    std::vector<F> lz;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
    void all_apply(int k, F f) {
        d[k] = mapping(f, d[k]);
        if (k < size) lz[k] = composition(f, lz[k]);
    }
    void push(int k) {
        all_apply(2 * k, lz[k]);
        all_apply(2 * k + 1, lz[k]);
        lz[k] = id();
    }
};

}  // namespace atcoder
using namespace atcoder;

const ll INF=1e18;
using lazy_S=ll;

using lazy_F=ll;

lazy_S lazy_op(lazy_S l, lazy_S r) {
	return min(l,r);
}

lazy_S lazy_e() { return INF; }

lazy_S mapping(lazy_F l, lazy_S r) {
	return r+l;
}

//l(r(x))
lazy_F composition(lazy_F l, lazy_F r) {
	return l+r;
}

lazy_F lazy_id(){return 0;}

#define lazy_calc lazy_S,lazy_op,lazy_e,lazy_F,mapping,composition,lazy_id

bool f(lazy_S x){return x>0;}

int main(){
	int N,Q;
	cin>>N>>Q;
	vector<int> A(N-1),B(N-1);
	vector<ll> C(N-1);
	vector<vector<int>> G(N);
	rep(i,0,N-1){
		cin>>A[i]>>B[i]>>C[i];
		A[i]--,B[i]--;
		G[A[i]].push_back(B[i]);
		G[B[i]].push_back(A[i]);
	}
	vector<int> order={0},depth(N),wei(N),pare(N,-1);
	pare[0]=-2;
	rep(i,0,N){
		int a=order[i];
		for(auto b:G[a]){
			if(pare[b]==-1){
				pare[b]=a;
				order.push_back(b);
				depth[b]=depth[a]+1;
			}
		}
	}
	order.clear();
	vector<vector<int>> H(N);
	rep(i,0,N) for(auto x:G[i]) if(pare[x]==i) H[i].push_back(x);
	swap(H,G);
	vector<int> rev(N),to(N);
	rep(i,0,N){
		int a=order[N-i-1];
		for(auto b:G[a]){
			wei[a]+=wei[b]; 
		}
		wei[a]++;
	}
	auto dfs=[&](auto self,int ind,int top)->void{
		rev[ind]=order.size();
		order.push_back(ind);
		to[ind]=top;
		if(G[ind].empty()) return;
		int tmp=G[ind][0];
		for(auto x:G[ind]) if(wei[tmp]<wei[x]) tmp=x;
		self(self,tmp,top);
		for(auto x:G[ind]) if(x!=tmp) self(self,x,x);
	};
	dfs(dfs,0,0);
	vector<ll> n_C(N),V(N);
	rep(i,0,N-1){
		if(depth[A[i]]>depth[B[i]]) swap(A[i],B[i]);
		n_C[B[i]]=C[i];
	}
	swap(n_C,C);
	C[0]=INF;
	lazy_segtree<lazy_calc> seg1(N),seg2(N);
	rep(i,0,N){
		int a=order[i];
		seg1.set(i,C[a]);
		seg2.set(i,wei[a]);
	}
	rep(rp,0,Q){
		int t;
		cin>>t;
		if(t==1){
			int u;
			ll x;
			cin>>u>>x;
			u--;
			int tmp=-1;
			while(u!=-2){
				int a=rev[to[u]];
				int b=rev[u];
				seg1.apply(a,b+1,-x);
				int c=seg1.min_left<f>(b+1);
				if(a<c&&tmp==-1) tmp=c-1;
				u=pare[to[u]];
			}
			if(tmp!=-1){
				u=order[tmp];
				ll v=C[u]-seg1.get(tmp);
				tmp=seg2.get(tmp);
				u=pare[u];
				while(u!=-2){
					int a=rev[to[u]];
					int b=rev[u];
					seg1.apply(a,b+1,v);
					seg2.apply(a,b+1,-tmp);
					u=pare[to[u]];
				}
			}
		}
		if(t==2){
			cout<<seg2.get(0)<<"\n";
		}
	}
}
0