結果

問題 No.1098 LCAs
ユーザー gazellegazelle
提出日時 2020-06-26 21:41:15
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 179 ms / 2,000 ms
コード長 5,259 bytes
コンパイル時間 1,382 ms
コンパイル使用メモリ 133,308 KB
実行使用メモリ 36,864 KB
最終ジャッジ日時 2024-07-04 20:15:51
合計ジャッジ時間 5,051 ms
ジャッジサーバーID
(参考情報)
judge1 / judge2
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 7 ms
11,264 KB
testcase_01 AC 7 ms
11,136 KB
testcase_02 AC 7 ms
11,136 KB
testcase_03 AC 7 ms
11,008 KB
testcase_04 AC 7 ms
11,136 KB
testcase_05 AC 8 ms
11,136 KB
testcase_06 AC 7 ms
11,136 KB
testcase_07 AC 7 ms
11,136 KB
testcase_08 AC 7 ms
11,136 KB
testcase_09 AC 7 ms
11,008 KB
testcase_10 AC 7 ms
11,136 KB
testcase_11 AC 7 ms
11,136 KB
testcase_12 AC 7 ms
11,264 KB
testcase_13 AC 7 ms
11,264 KB
testcase_14 AC 7 ms
11,136 KB
testcase_15 AC 8 ms
11,264 KB
testcase_16 AC 7 ms
11,264 KB
testcase_17 AC 7 ms
11,136 KB
testcase_18 AC 139 ms
25,344 KB
testcase_19 AC 143 ms
25,472 KB
testcase_20 AC 147 ms
25,472 KB
testcase_21 AC 140 ms
25,472 KB
testcase_22 AC 143 ms
25,344 KB
testcase_23 AC 103 ms
25,856 KB
testcase_24 AC 100 ms
25,852 KB
testcase_25 AC 96 ms
25,936 KB
testcase_26 AC 108 ms
25,924 KB
testcase_27 AC 100 ms
25,796 KB
testcase_28 AC 179 ms
35,712 KB
testcase_29 AC 177 ms
36,864 KB
testcase_30 AC 176 ms
35,712 KB
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <stack>
#include <queue>
#include <algorithm>
#include <cassert>
#include <random>
#include <iomanip>
#include <bitset>
#include <array>
#define FOR(i, n, m) for(ll i = (n); i < (ll)(m); i++)
#define REP(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define pb push_back
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
constexpr ll inf = 1000000000;
constexpr ll mod = 998244353;
constexpr long double eps = 1e-6;
template<typename T1, typename T2>
ostream& operator<<(ostream& os, pair<T1, T2> p) {
os << to_string(p.first) << " " << to_string(p.second);
return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& v) {
REP(i, v.size()) {
if(i) os << " ";
os << v[i];
}
return os;
}
struct modint {
ll n;
public:
modint(const ll n = 0) : n((n % mod + mod) % mod) {}
static modint pow(modint a, int m) {
modint r = 1;
while(m > 0) {
if(m & 1) { r *= a; }
a = (a * a); m /= 2;
}
return r;
}
modint &operator++() { *this += 1; return *this; }
modint &operator--() { *this -= 1; return *this; }
modint operator++(int) { modint ret = *this; *this += 1; return ret; }
modint operator--(int) { modint ret = *this; *this -= 1; return ret; }
modint operator~() const { return (this -> pow(n, mod - 2)); } // inverse
friend bool operator==(const modint& lhs, const modint& rhs) {
return lhs.n == rhs.n;
}
friend bool operator<(const modint& lhs, const modint& rhs) {
return lhs.n < rhs.n;
}
friend bool operator>(const modint& lhs, const modint& rhs) {
return lhs.n > rhs.n;
}
friend modint &operator+=(modint& lhs, const modint& rhs) {
lhs.n += rhs.n;
if (lhs.n >= mod) lhs.n -= mod;
return lhs;
}
friend modint &operator-=(modint& lhs, const modint& rhs) {
lhs.n -= rhs.n;
if (lhs.n < 0) lhs.n += mod;
return lhs;
}
friend modint &operator*=(modint& lhs, const modint& rhs) {
lhs.n = (lhs.n * rhs.n) % mod;
return lhs;
}
friend modint &operator/=(modint& lhs, const modint& rhs) {
lhs.n = (lhs.n * (~rhs).n) % mod;
return lhs;
}
friend modint operator+(const modint& lhs, const modint& rhs) {
return modint(lhs.n + rhs.n);
}
friend modint operator-(const modint& lhs, const modint& rhs) {
return modint(lhs.n - rhs.n);
}
friend modint operator*(const modint& lhs, const modint& rhs) {
return modint(lhs.n * rhs.n);
}
friend modint operator/(const modint& lhs, const modint& rhs) {
return modint(lhs.n * (~rhs).n);
}
};
istream& operator>>(istream& is, modint m) { is >> m.n; return is; }
ostream& operator<<(ostream& os, modint m) { os << m.n; return os; }
#define MAX_N 1010101
long long extgcd(long long a, long long b, long long& x, long long& y) {
long long d = a;
if (b != 0) {
d = extgcd(b, a % b, y, x);
y -= (a / b) * x;
} else {
x = 1; y = 0;
}
return d;
}
long long mod_inverse(long long a, long long m) {
long long x, y;
if(extgcd(a, m, x, y) == 1) return (m + x % m) % m;
else return -1;
}
vector<long long> fact(MAX_N+1, inf);
long long mod_fact(long long n, long long& e) {
if(fact[0] == inf) {
fact[0]=1;
if(MAX_N != 0) fact[1]=1;
for(ll i = 2; i <= MAX_N; ++i) {
fact[i] = (fact[i-1] * i) % mod;
}
}
e = 0;
if(n == 0) return 1;
long long res = mod_fact(n / mod, e);
e += n / mod;
if((n / mod) % 2 != 0) return (res * (mod - fact[n % mod])) % mod;
return (res * fact[n % mod]) % mod;
}
// return nCk
long long mod_comb(long long n, long long k) {
if(n < 0 || k < 0 || n < k) return 0;
long long e1, e2, e3;
long long a1 = mod_fact(n, e1), a2 = mod_fact(k, e2), a3 = mod_fact(n - k, e3);
if(e1 > e2 + e3) return 0;
return (a1 * mod_inverse((a2 * a3) % mod, mod)) % mod;
}
using mi = modint;
mi mod_pow(mi a, ll n) {
mi ret = 1;
mi tmp = a;
while(n > 0) {
if(n % 2) ret *= tmp;
tmp = tmp * tmp;
n /= 2;
}
return ret;
}
ll gcd(ll a, ll b) {
if (b == 0) return a;
return gcd(b, a % b);
}
int n;
vector<vector<int>> t;
vector<ll> ans;
vector<ll> subt;
ll dfs1(int v, int p) {
ll ret = 1;
for(auto adj: t[v]) {
if(adj == p) continue;
ret += dfs1(adj, v);
}
return subt[v] = ret;
}
ll dfs2(int v, int p) {
ll ret = 0;
for(auto adj: t[v]) {
if(adj == p) continue;
ret += dfs2(adj, v);
}
ll tmp = subt[v] * subt[v];
tmp -= ret;
ans[v] = tmp;
ret += tmp;
return ret;
}
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
cin >> n;
t.resize(n);
ans.resize(n);
subt.resize(n);
REP(i, n - 1) {
int u, v;
cin >> u >> v;
u--;
v--;
t[u].pb(v);
t[v].pb(u);
}
dfs1(0, -1);
dfs2(0, -1);
REP(i, n) {
cout << ans[i] << "\n";
}
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0