oj.uz

답안 #883264

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
883264 2023-12-05T01:49:15 Z marvinthang Sumtree (INOI20_sumtree) C++17
30 / 100
 3000 ms 27436 KB 
/*************************************
*    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;

// 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);
	};
	Modular res;
	vector <int> tsz(n);
	function<void(int)> dfs = [&] (int u) {
		tsz[u] = 1;
		for (int v: adj[u]) {
			adj[v].erase(find(ALL(adj[v]), u));
			dfs(v);
			tsz[u] += tsz[v];
		}
	};
	dfs(0);
	function<pair<int, int>(int)> solve = [&] (int u) {
		int st = 0, sz = 0;
		for (int v: adj[u]) {
			auto [x, y] = solve(v);
			st += x; sz += y;
			if (st > r) {
				res = 0;
				return pair{0, 0};
			}
		}
		if (tags[u] >= 0) {
			res *= candy(tags[u] - st, tsz[u] - sz);
			return pair{tags[u], tsz[u]};
		}
		return pair{st, sz};
	};
	res = 1;
	solve(0);
	cout << res << '\n';
	int q; cin >> q;
	while (q--) {
		int t, u; cin >> t >> u; --u;
		if (t == 1) {
			cin >> t;
			tags[u] = t;
		} else tags[u] = -1;
		res = 1;
		solve(0);
		cout << 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

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:191:2: note: in expansion of macro 'file'
  191 |  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:191:2: note: in expansion of macro 'file'
  191 |  file("INOI20_sumtree");
      |  ^~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 27436 KB Output is correct
2 Correct 100 ms 26604 KB Output is correct
3 Correct 98 ms 26048 KB Output is correct
4 Correct 107 ms 27168 KB Output is correct
5 Correct 81 ms 21860 KB Output is correct
6 Correct 6 ms 3164 KB Output is correct
7 Correct 6 ms 3020 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 78 ms 16840 KB Output is correct
10 Correct 88 ms 16936 KB Output is correct
11 Correct 92 ms 17132 KB Output is correct
12 Correct 63 ms 14536 KB Output is correct
13 Correct 78 ms 26192 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 0 ms 460 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 5 ms 348 KB Output is correct
6 Correct 50 ms 720 KB Output is correct
7 Correct 46 ms 604 KB Output is correct
8 Correct 50 ms 860 KB Output is correct
9 Correct 111 ms 1052 KB Output is correct
10 Correct 117 ms 1864 KB Output is correct
11 Correct 113 ms 2428 KB Output is correct
12 Correct 13 ms 3164 KB Output is correct
13 Correct 120 ms 2980 KB Output is correct
14 Correct 117 ms 3044 KB Output is correct
15 Correct 148 ms 3420 KB Output is correct
16 Correct 113 ms 2908 KB Output is correct
17 Correct 114 ms 1992 KB Output is correct
18 Correct 56 ms 2652 KB Output is correct
19 Correct 119 ms 2912 KB Output is correct
20 Correct 18 ms 604 KB Output is correct
21 Correct 18 ms 600 KB Output is correct
22 Correct 1 ms 348 KB Output is correct

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3046 ms 26528 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3062 ms 16992 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 95 ms 27436 KB Output is correct
2 Correct 100 ms 26604 KB Output is correct
3 Correct 98 ms 26048 KB Output is correct
4 Correct 107 ms 27168 KB Output is correct
5 Correct 81 ms 21860 KB Output is correct
6 Correct 6 ms 3164 KB Output is correct
7 Correct 6 ms 3020 KB Output is correct
8 Correct 4 ms 1884 KB Output is correct
9 Correct 78 ms 16840 KB Output is correct
10 Correct 88 ms 16936 KB Output is correct
11 Correct 92 ms 17132 KB Output is correct
12 Correct 63 ms 14536 KB Output is correct
13 Correct 78 ms 26192 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 0 ms 460 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 348 KB Output is correct
18 Correct 5 ms 348 KB Output is correct
19 Correct 50 ms 720 KB Output is correct
20 Correct 46 ms 604 KB Output is correct
21 Correct 50 ms 860 KB Output is correct
22 Correct 111 ms 1052 KB Output is correct
23 Correct 117 ms 1864 KB Output is correct
24 Correct 113 ms 2428 KB Output is correct
25 Correct 13 ms 3164 KB Output is correct
26 Correct 120 ms 2980 KB Output is correct
27 Correct 117 ms 3044 KB Output is correct
28 Correct 148 ms 3420 KB Output is correct
29 Correct 113 ms 2908 KB Output is correct
30 Correct 114 ms 1992 KB Output is correct
31 Correct 56 ms 2652 KB Output is correct
32 Correct 119 ms 2912 KB Output is correct
33 Correct 18 ms 604 KB Output is correct
34 Correct 18 ms 600 KB Output is correct
35 Correct 1 ms 348 KB Output is correct
36 Execution timed out 3046 ms 26528 KB Time limit exceeded
37 Halted 0 ms 0 KB -