結果

問題 No.2214 Products on Tree
ユーザー fastmathfastmath
提出日時 2023-02-10 22:08:30
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 143 ms / 3,000 ms
コード長 7,191 bytes
コンパイル時間 1,557 ms
コンパイル使用メモリ 149,488 KB
実行使用メモリ 42,496 KB
最終ジャッジ日時 2024-07-07 16:22:49
合計ジャッジ時間 5,614 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 4 ms
18,060 KB
testcase_01 AC 7 ms
17,752 KB
testcase_02 AC 5 ms
18,152 KB
testcase_03 AC 132 ms
27,536 KB
testcase_04 AC 137 ms
27,712 KB
testcase_05 AC 120 ms
27,188 KB
testcase_06 AC 75 ms
24,592 KB
testcase_07 AC 22 ms
19,700 KB
testcase_08 AC 16 ms
19,600 KB
testcase_09 AC 26 ms
21,164 KB
testcase_10 AC 75 ms
24,568 KB
testcase_11 AC 36 ms
21,508 KB
testcase_12 AC 40 ms
22,304 KB
testcase_13 AC 140 ms
27,828 KB
testcase_14 AC 138 ms
27,804 KB
testcase_15 AC 131 ms
27,956 KB
testcase_16 AC 143 ms
27,812 KB
testcase_17 AC 135 ms
27,812 KB
testcase_18 AC 68 ms
25,484 KB
testcase_19 AC 82 ms
25,992 KB
testcase_20 AC 69 ms
25,136 KB
testcase_21 AC 58 ms
24,040 KB
testcase_22 AC 103 ms
28,064 KB
testcase_23 AC 6 ms
17,596 KB
testcase_24 AC 5 ms
18,032 KB
testcase_25 AC 6 ms
18,680 KB
testcase_26 AC 6 ms
17,692 KB
testcase_27 AC 5 ms
17,704 KB
testcase_28 AC 56 ms
36,232 KB
testcase_29 AC 21 ms
20,748 KB
testcase_30 AC 54 ms
28,264 KB
testcase_31 AC 114 ms
28,252 KB
testcase_32 AC 99 ms
28,152 KB
testcase_33 AC 75 ms
42,476 KB
testcase_34 AC 76 ms
42,496 KB
testcase_35 AC 107 ms
35,316 KB
testcase_36 AC 112 ms
35,188 KB
testcase_37 AC 84 ms
28,260 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
#include <random>
#include <bitset>
#include <fstream>
#include <array>
#include <functional>
#include <stack>
#include <memory>
using namespace std;
#define int long long
#define ii pair <int, int>
#define app push_back
#define all(a) a.begin(), a.end()
#define bp __builtin_popcountll
#define ll long long
#define mp make_pair
#define x first
#define y second
#define Time (double)clock()/CLOCKS_PER_SEC

#ifdef LOCAL
#define debug(x) std::cerr << #x << ": " << x << '\n';
#define debug2(x, y) std::cerr << #x << ", " << #y << ": " << x << ", " << y << '\n';
#define debug3(x, y, z) std::cerr << #x << ", " << #y << ", " << #z << ": " << x << ", " << y << ", " << z << '\n';
#else
#define debug(x)
#define debug2(x, y) 
#define debug3(x, y, z) 
#endif

#define FORI(i,a,b) for (int i = (a); i < (b); ++i)
#define FOR(i,a) FORI(i,0,a)
#define ROFI(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define ROF(i,a) ROFI(i,0,a)
#define rep(a) FOR(_,a)
#define each(a,x) for (auto& a: x)
#define FORN(i, n) FORI(i, 1, n + 1)

using vi = vector<int>;
template <typename T>
std::istream& operator >>(std::istream& input, std::pair <T, T> & data)
{
    input >> data.x >> data.y;
    return input;
}
template <typename T>
std::istream& operator >>(std::istream& input, std::vector<T>& data)
{
    for (T& x : data)
        input >> x;
    return input;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const pair <T, T> & data)
{
    output << "(" << data.x << "," << data.y << ")";
    return output;
}
template <typename T>
std::ostream& operator <<(std::ostream& output, const std::vector<T>& data)
{
    for (const T& x : data)
        output << x << " ";
    return output;
}
ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up
ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down 
ll math_mod(ll a, ll b) { return a - b * div_down(a, b); }
#define tcT template<class T
#define tcTU tcT, class U
tcT> using V = vector<T>; 
tcT> bool ckmin(T& a, const T& b) {
    return b < a ? a = b, 1 : 0; 
} // set a = min(a,b)
tcT> bool ckmax(T& a, const T& b) {
    return a < b ? a = b, 1 : 0; 
}
ll gcd(ll a, ll b) {
    while (b) {
        tie(a, b) = mp(b, a % b);
    }
    return a;
}
int Bit(int mask, int bit) { return (mask >> bit) & 1; }

template<int MOD, int RT> struct mint {
    static const int mod = MOD;
    static constexpr mint rt() { return RT; } // primitive root for FFT
    int v; explicit operator int() const { return v; } // explicit -> don't silently convert to int
    mint() { v = 0; }
    mint(ll _v) { v = (int)((-MOD < _v && _v < MOD) ? _v : _v % MOD);
        if (v < 0) v += MOD; }
    friend bool operator==(const mint& a, const mint& b) { 
        return a.v == b.v; }
    friend bool operator!=(const mint& a, const mint& b) { 
        return !(a == b); }
    friend bool operator<(const mint& a, const mint& b) { 
        return a.v < b.v; }
    friend string ts(mint a) { return to_string(a.v); }

    mint& operator+=(const mint& m) { 
        if ((v += m.v) >= MOD) v -= MOD; 
        return *this; }
    mint& operator-=(const mint& m) { 
        if ((v -= m.v) < 0) v += MOD; 
        return *this; }
    mint& operator*=(const mint& m) { 
        v = (int)((ll)v*m.v%MOD); return *this; }
    mint& operator/=(const mint& m) { return (*this) *= inv(m); }
    friend mint pow(mint a, ll p) {
        mint ans = 1; assert(p >= 0);
        for (; p; p /= 2, a *= a) if (p&1) ans *= a;
        return ans; }
    mint & operator ^=(const int &p) { return (*this) = pow(this, p); }

    friend mint inv(const mint& a) { assert(a.v != 0); 
        return pow(a,MOD-2); }
        
    mint operator-() const { return mint(-v); }
    mint& operator++() { return *this += 1; }
    mint& operator--() { return *this -= 1; }
    friend mint operator+(mint a, const mint& b) { return a += b; }
    friend mint operator-(mint a, const mint& b) { return a -= b; }
    friend mint operator*(mint a, const mint& b) { return a *= b; }
    friend mint operator/(mint a, const mint& b) { return a /= b; }
    friend mint operator^(mint a, const int p) { return pow(a, p); }
};

const int MOD = 998244353;

typedef mint<MOD,5> mi; // 5 is primitive root for both common mods
typedef vector<mi> vmi;

std::ostream& operator << (std::ostream& o, const mi& a)
{
    cout << a.v;
    return o;
}

vector<vmi> scmb; // small combinations
void genComb(int SZ) {
    scmb.assign(SZ,vmi(SZ)); scmb[0][0] = 1;
    FORI(i,1,SZ) FOR(j,i+1) 
        scmb[i][j] = scmb[i-1][j]+(j?scmb[i-1][j-1]:0);
}
 
vmi invs, fac, ifac; // make sure to convert to LL before doing any multiplications ...
void genFac(int SZ) {
    invs.resize(SZ), fac.resize(SZ), ifac.resize(SZ); 
    invs[1] = fac[0] = ifac[0] = 1; 
    FORI(i,2,SZ) invs[i] = mi(-(ll)MOD/i*(int)invs[MOD%i]);
    FORI(i,1,SZ) {
        fac[i] = fac[i-1]*i;
        ifac[i] = ifac[i-1]*invs[i];
    }
}
mi comb(int a, int b) {
    if (a < b || b < 0) return 0;
    assert(a < fac.size());
    return fac[a]*ifac[b]*ifac[a-b];
}
mi partNonNegative(int a, int b) {
    assert(a >= 0);
    if (a == 0 && b == 0) {
        return 1;
    }
    else {
        return comb(a + b - 1, b - 1);
    }
}
mi partPositive(int a, int b) {
    assert(a >= 0);
    if (a == 0 && b == 0) {
        return 1;
    }
    else {
        return comb(a - 1, b - 1);
    }
}
const int N = 2e5+7;
vi g[N];
mi dp[N][2];
int ptr = 0, h[N], l[N], r[N], par[N], jump[N], cnt[N];
void calc(int u, int p) {
    par[u] = p;
    if (u == p) {
        jump[u] = u;
    }
    else if (h[p] - h[jump[p]] == h[jump[p]] - h[jump[jump[p]]]) {
        jump[u] = jump[jump[p]];
    }
    else {
        jump[u] = p;
    }
    l[u] = ptr;
    ptr++;    
    cnt[u] = 1;
    dp[u][0] = 1;
    dp[u][1] = 1;
    for (int v : g[u]) {
        if (v != p) {
            h[v] = h[u]+1;
            calc(v, u);

            vmi nd(2);
            FOR (l, 2) {
            	FOR (r, 2) {
            		if (l + r < 2) {
            			nd[l + r] += dp[u][l] * dp[v][r];
            		}
            	}
            }
            FOR(t,2)dp[u][t]=nd[t];

            cnt[u] += cnt[v];
        }
    }
    dp[u][0] += dp[u][1];
    r[u] = ptr - 1;
}   
bool anc(int u, int v) { return l[u] <= l[v] && r[v] <= r[u]; }
int lca(int u, int v) {
    if (anc(u, v)) { 
        return u;
    }
    while (!anc(par[u], v)) {
        if (!anc(jump[u], v)) {
            u = jump[u];
        }
        else {
            u = par[u];
        }
    }
    return par[u];
}   
int dist(int u, int v) { return h[u] + h[v] - 2 * h[lca(u,v)]; }

signed main() {
    #ifdef LOCAL
    #else
    #define endl '\n'
    ios_base::sync_with_stdio(0); cin.tie(0);
    #endif
    int n;
    cin >> n;rep(n - 1) {
    	int u,v;
    	cin>>u>>v;
    	g[u].app(v); g[v].app(u);
    }
    calc(1,1);
    cout<<dp[1][1]<<endl;
}
0