Submission #883265

#	Time	Username	Problem	Language	Result	Execution time	Memory
883265		marvinthang	Sumtree (INOI20_sumtree)	C++17	10 / 100	104 ms	70824 KiB

Main

/*************************************
*    author: marvinthang             *
*    created: 05.12.2023 08:26:16    *
*************************************/

#include <bits/stdc++.h>

using namespace std;

#define                  fi  first
#define                  se  second
#define                left  ___left
#define               right  ___right
#define                TIME  (1.0 * clock() / CLOCKS_PER_SEC)
#define             MASK(i)  (1LL << (i))
#define           BIT(x, i)  ((x) >> (i) & 1)
#define  __builtin_popcount  __builtin_popcountll
#define              ALL(v)  (v).begin(), (v).end()
#define           REP(i, n)  for (int i = 0, _n = (n); i < _n; ++i)
#define          REPD(i, n)  for (int i = (n); i-- > 0; )
#define        FOR(i, a, b)  for (int i = (a), _b = (b); i < _b; ++i) 
#define       FORD(i, b, a)  for (int i = (b), _a = (a); --i >= _a; ) 
#define       FORE(i, a, b)  for (int i = (a), _b = (b); i <= _b; ++i) 
#define      FORDE(i, b, a)  for (int i = (b), _a = (a); i >= _a; --i) 
#define        scan_op(...)  istream & operator >> (istream &in, __VA_ARGS__ &u)
#define       print_op(...)  ostream & operator << (ostream &out, const __VA_ARGS__ &u)
#ifdef LOCAL
    #include "debug.h"
#else
    #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
    #define DB(...) 23
    #define db(...) 23
    #define debug(...) 23
#endif

template <class U, class V> scan_op(pair <U, V>)  { return in >> u.first >> u.second; }
template <class T> scan_op(vector <T>)  { for (size_t i = 0; i < u.size(); ++i) in >> u[i]; return in; }
template <class U, class V> print_op(pair <U, V>)  { return out << '(' << u.first << ", " << u.second << ')'; }
template <size_t i, class T> ostream & print_tuple_utils(ostream &out, const T &tup) { if constexpr(i == tuple_size<T>::value) return out << ")";  else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); }
template <class ...U> print_op(tuple<U...>) { return print_tuple_utils<0, tuple<U...>>(out, u); }
template <class Con, class = decltype(begin(declval<Con>()))> typename enable_if <!is_same<Con, string>::value, ostream&>::type operator << (ostream &out, const Con &con) { out << '{'; for (__typeof(con.begin()) it = con.begin(); it != con.end(); ++it) out << (it == con.begin() ? "" : ", ") << *it; return out << '}'; }
const int MOD = 1e9 + 7;
namespace MODULAR {
    inline void fasterLLDivMod(unsigned long long x, unsigned y, unsigned &out_d, unsigned &out_m) {
        unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
    #ifdef __GNUC__
        asm(
            "divl %4 \n\t"
            : "=a" (d), "=d" (m)
            : "d" (xh), "a" (xl), "r" (y)
        );
    #else
        __asm {
            mov edx, dword ptr[xh];
            mov eax, dword ptr[xl];
            div dword ptr[y];
            mov dword ptr[d], eax;
            mov dword ptr[m], edx;
        };
    #endif
        out_d = d; out_m = m;
    }
    template <class T> T invGeneral(T a, T b) {
        a %= b;
        if (!a) return b == 1 ? 0 : -1;
        T x = invGeneral(b, a);
        return x == -1 ? -1 : ((1 - 1LL * b * x) / a + b) % b;
    }
    template <int MOD> struct ModInt {
        unsigned int val;
        ModInt(void): val(0) {}
        ModInt(const long long &x) { *this = x; }
        ModInt & normalize(const unsigned int &v) {
            val = v >= MOD ? v - MOD : v;
            return *this;
        }
        bool operator ! (void) { return !val; }
        ModInt & operator = (const ModInt &x) { val = x.val; return *this; }
        ModInt & operator = (const long long &x) { return normalize(x % MOD + MOD); }
        ModInt operator - (void) { return ModInt(MOD - val); }
        ModInt & operator += (const ModInt &other) { return normalize(val + other.val); }
        ModInt & operator -= (const ModInt &other) { return normalize(val + MOD - other.val); }
        ModInt & operator /= (const ModInt &other) { return *this *= other.inv(); }
        ModInt & operator *= (const ModInt &other) {
            unsigned dummy;
            fasterLLDivMod((unsigned long long) val * other.val, MOD, dummy, val);
            return *this;
        }
        ModInt operator + (const ModInt &other) const { return ModInt(*this) += other; }
        ModInt operator - (const ModInt &other) const { return ModInt(*this) -= other; }
        ModInt operator * (const ModInt &other) const { return ModInt(*this) *= other; }
        ModInt operator / (const ModInt &other) const { return ModInt(*this) /= other; }
        ModInt pow(long long n) const {
            assert(n >= 0);
            ModInt res = 1, a = *this;
            for (; n; n >>= 1, a *= a) if (n & 1) res *= a;
            return res;
        }
        ModInt inv(void) const {
            int i = invGeneral((int) val, MOD);
            assert(~i);
            return i;
        }
        ModInt & operator ++ (void) { return *this += 1; }
        ModInt & operator -- (void) { return *this -= 1; }
        ModInt operator ++ (int) { ModInt old = *this; operator ++(); return old; }
        ModInt operator -- (int) { ModInt old = *this; operator --(); return old; }
        friend ModInt operator + (const long long &x, const ModInt &y) { return ModInt(x) + y; }
        friend ModInt operator - (const long long &x, const ModInt &y) { return ModInt(x) - y; }
        friend ModInt operator * (const long long &x, const ModInt &y) { return ModInt(x) * y; }
        friend ModInt operator / (const long long &x, const ModInt &y) { return ModInt(x) / y; }
        friend ostream & operator << (ostream &out, const ModInt &x) { return out << x.val; }
        friend istream & operator >> (istream &in, ModInt &x) { long long a; in >> a; x = a; return in; }
        explicit operator bool(void) const { return val; }
        explicit operator int(void) const { return val; }
    };  
    using Modular = ModInt <MOD>;
}
using namespace MODULAR;

// index from 0
template <class T> struct Fenwick {
    int n; vector <T> bit;
    Fenwick(int _n = 0): n(_n), bit(n + 1, 0) {}
    void reset(void) { fill(bit.begin(), bit.end(), 0); }
    void resize(int _n) { bit.assign(_n + 1, 0); }
    void update(int i, T val) { for (++i; i <= n; i += i & -i) bit[i] += val; }
    T get(int i) {
        if (i < 0) return 0;
        T res(0);
        for (i = min(i + 1, n); i > 0; i &= i - 1) res += bit[i];
        return res;
    }
    int upper_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i) 
            if ((res | MASK(i)) <= n && val >= bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
    int lower_bound(T val) {
        int res = 0;
        for (int i = __lg(n); i >= 0; --i)
            if ((res | MASK(i)) <= n && val > bit[res | MASK(i)]) res |= MASK(i), val -= bit[res];
        return res;
    }
};

// end of template

void process(void) {
	int n, r; cin >> n >> r;
	vector <vector <int>> adj(n);
	REP(i, n - 1) {
		int u, v; cin >> u >> v; --u; --v;
		adj[u].push_back(v);
		adj[v].push_back(u);
	}
	vector <int> tags(n, -1);
	tags[0] = r;
	int m = n + r;
	vector <Modular> fact(m + 1), ifact(m + 1);
	fact[0] = 1;
	FORE(i, 1, m) fact[i] = fact[i - 1] * i;
	ifact[m] = fact[m].inv();
	REPD(i, m) ifact[i] = ifact[i + 1] * (i + 1);
	auto C = [&] (int n, int k) -> Modular {
		if (k < 0 || n < k) return 0;
		return fact[n] * ifact[k] * ifact[n - k];
	};
	auto candy = [&] (int n, int k) {
		return C(n + k - 1, k - 1);
	};
	vector <int> tsz(n), tin(n), tout(n), ver(n);
	int t = 0;
	function<void(int)> dfs = [&] (int u) {
		ver[t] = u;
		tin[u] = t++;
		tsz[u] = 1;
		for (int v: adj[u]) {
			adj[v].erase(find(ALL(adj[v]), u));
			dfs(v);
			tsz[u] += tsz[v];
		}
		tout[u] = t;
	};
	dfs(0);
	vector <int> st(n * 4 + 23, -1);
	function<void(int, int, int, int, int)> update = [&] (int i, int l, int r, int p, int v) {
		if (r - l == 1) {
			st[i] = v;
			return;
		}
		int m = l + r >> 1;
		if (p < m) update(i << 1, l, m, p, v);
		else update(i << 1 | 1, m, r, p, v);
		st[i] = max(st[i << 1], st[i << 1 | 1]);
	};
	function<int(int, int, int, int, int)> walk = [&] (int i, int l, int r, int p, int v) {
		if (l >= p || st[i] < v) return -1;
		if (r - l == 1) return ver[l];
		int m = l + r >> 1;
		int res = walk(i << 1 | 1, m, r, p, v);
		if (res == -1) res = walk(i << 1, l, m, p, v);
		return res;
	};
	update(1, 0, n, 0, n);
	Fenwick <long long> sum_st(n), sum_sz(n);
	sum_st.update(0, r);
	sum_sz.update(0, n);
	Modular res = candy(r, n);
	cout << res << '\n';
	int cnt = 0;
	auto add = [&] (int u) {
		long long st = tags[u] - sum_st.get(tout[u] - 1) + sum_st.get(tin[u]);
		long long sz = tsz[u] - sum_sz.get(tout[u] - 1) + sum_sz.get(tin[u]);
		sum_st.update(tin[u], st);
		sum_sz.update(tin[u], sz);
		update(1, 0, n, tin[u], tout[u]);
		if (st < 0) ++cnt;
		else res *= candy(st, sz);
	};
	auto del = [&] (int u) {
		long long st = sum_st.get(tout[u] - 1) - sum_st.get(tin[u] - 1);
		long long sz = sum_sz.get(tout[u] - 1) - sum_sz.get(tin[u] - 1);
		sum_st.update(tin[u], -st);
		sum_sz.update(tin[u], -sz);
		update(1, 0, n, tin[u], -1);
		if (st < 0) --cnt;
		else res /= candy(st, sz);
	};
	
	int q; cin >> q;
	while (q--) {
		int t, u; cin >> t >> u; --u;
		int p = walk(1, 0, n, tin[u], tout[u]);
		if (t == 1) {
			cin >> tags[u];
			del(p); add(u); add(p);
		} else {
			del(p); del(u); add(p);
		}
		cout << (cnt ? 0 : res) << '\n';
	}
}

int main(void) {
	ios_base::sync_with_stdio(false); cin.tie(nullptr); // cout.tie(nullptr);
	file("INOI20_sumtree");
	// int t; cin >> t; while (t--)
	process();
	// cerr << "Time elapsed: " << TIME << " s.\n";
	return (0^0);
}

Compilation message (stderr)

Main.cpp: In lambda function:
Main.cpp:193:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  193 |   int m = l + r >> 1;
      |           ~~^~~
Main.cpp: In lambda function:
Main.cpp:201:13: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
  201 |   int m = l + r >> 1;
      |           ~~^~~
Main.cpp: In function 'int main()':
Main.cpp:30:61: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                      ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:248:2: note: in expansion of macro 'file'
  248 |  file("INOI20_sumtree");
      |  ^~~~
Main.cpp:30:94: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |     #define file(name) if (fopen(name".inp", "r")) { freopen(name".inp", "r", stdin); freopen(name".out", "w", stdout); }
      |                                                                                       ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
Main.cpp:248:2: note: in expansion of macro 'file'
  248 |  file("INOI20_sumtree");
      |  ^~~~

• Subtask 1: 10 / 10
• Subtask 2: 0 / 20
• Subtask 3: 0 / 20
• Subtask 4: 0 / 20
• Subtask 5: 0 / 30