結果
問題 | No.1098 LCAs |
ユーザー |
![]() |
提出日時 | 2023-10-06 09:41:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 135 ms / 2,000 ms |
コード長 | 3,143 bytes |
コンパイル時間 | 1,352 ms |
コンパイル使用メモリ | 128,460 KB |
実行使用メモリ | 38,984 KB |
最終ジャッジ日時 | 2024-07-26 15:18:50 |
合計ジャッジ時間 | 5,422 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 3 ms
9,924 KB |
testcase_01 | AC | 3 ms
9,924 KB |
testcase_02 | AC | 3 ms
10,568 KB |
testcase_03 | AC | 3 ms
9,664 KB |
testcase_04 | AC | 3 ms
10,056 KB |
testcase_05 | AC | 4 ms
10,184 KB |
testcase_06 | AC | 4 ms
11,712 KB |
testcase_07 | AC | 4 ms
10,052 KB |
testcase_08 | AC | 3 ms
11,716 KB |
testcase_09 | AC | 3 ms
9,928 KB |
testcase_10 | AC | 4 ms
11,716 KB |
testcase_11 | AC | 3 ms
11,716 KB |
testcase_12 | AC | 4 ms
11,588 KB |
testcase_13 | AC | 4 ms
9,796 KB |
testcase_14 | AC | 3 ms
11,592 KB |
testcase_15 | AC | 4 ms
10,436 KB |
testcase_16 | AC | 3 ms
10,308 KB |
testcase_17 | AC | 3 ms
10,436 KB |
testcase_18 | AC | 97 ms
18,880 KB |
testcase_19 | AC | 115 ms
18,884 KB |
testcase_20 | AC | 100 ms
18,756 KB |
testcase_21 | AC | 100 ms
18,888 KB |
testcase_22 | AC | 101 ms
18,752 KB |
testcase_23 | AC | 79 ms
19,212 KB |
testcase_24 | AC | 79 ms
18,872 KB |
testcase_25 | AC | 76 ms
19,200 KB |
testcase_26 | AC | 80 ms
19,196 KB |
testcase_27 | AC | 80 ms
18,932 KB |
testcase_28 | AC | 132 ms
37,312 KB |
testcase_29 | AC | 135 ms
38,984 KB |
testcase_30 | AC | 131 ms
37,188 KB |
ソースコード
#include<iostream> #include<vector> #include<algorithm> #include<cstring> #include<cassert> #include<cmath> #include<ctime> #include<iomanip> #include<numeric> #include<stack> #include<queue> #include<map> #include<unordered_map> #include<set> #include<unordered_set> #include<bitset> #include<random> using namespace std; template<int m> struct modint { private: unsigned int value; static constexpr int mod() {return m;} public: constexpr modint(const long long x = 0) noexcept { long long y = x; if(y < 0 || y >= mod()) { y %= mod(); if(y < 0) y += mod(); } value = (unsigned int)y; } constexpr unsigned int val() noexcept {return value;} constexpr modint &operator+=(const modint &other) noexcept { value += other.value; if(value >= mod()) value -= mod(); return *this; } constexpr modint &operator-=(const modint &other) noexcept { unsigned int x = value; if(x < other.value) x += mod(); x -= other.value; value = x; return *this; } constexpr modint &operator*=(const modint &other) noexcept { unsigned long long x = value; x *= other.value; value = (unsigned int) (x % mod()); return *this; } constexpr modint &operator/=(const modint &other) noexcept { return *this *= other.inverse(); } constexpr modint inverse() const noexcept { assert(value); long long a = value,b = mod(),x = 1,y = 0; while(b) { long long q = a/b; a -= q*b; swap(a,b); x -= q*y; swap(x,y); } return modint(x); } constexpr modint power(long long N) const noexcept { assert(N >= 0); modint p = *this,ret = 1; while(N) { if(N & 1) ret *= p; p *= p; N >>= 1; } return ret; } constexpr modint operator+() {return *this;} constexpr modint operator-() {return modint() - *this;} constexpr modint &operator++(int) noexcept {return *this += 1;} constexpr modint &operator--(int) noexcept {return *this -= 1;} friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;} friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;} friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;} friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;} friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;} }; using mint = modint<998244353>; //using mint = modint<1000000007>; int N,ch[2 << 17]; vector<int> G[2 << 17]; long long ans[2 << 17]; void dfs(int u,int p) { ch[u] = 1; long long dp[2][2]; int cur = 0; dp[cur][0] = dp[cur][1] = 0; for(int v:G[u]) if(v != p) { dfs(v,u); int nxt = 1-cur; dp[nxt][0] = dp[nxt][1] = 0; dp[nxt][0] += dp[cur][0] + ch[v]; dp[nxt][1] += dp[cur][1] + dp[cur][0]*ch[v]; cur = nxt; ch[u] += ch[v]; } ans[u] = dp[cur][1]*2+ch[u]*2-1; } void solve() { cin >> N; for(int i = 1;i < N;i++) { int u,v; cin >> u >> v; u--; v--; G[u].push_back(v); G[v].push_back(u); } dfs(0,-1); for(int i = 0;i < N;i++) cout << ans[i] << "\n"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int T = 1; //cin >> T; while(T--) solve(); }