結果
| 問題 | No.1098 LCAs |
| ユーザー |
 Ogtsn99
|
| 提出日時 | 2020-06-26 22:54:56 |
| 言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 502 ms / 2,000 ms |
| コード長 | 5,211 bytes |
| コンパイル時間 | 1,995 ms |
| コンパイル使用メモリ | 177,312 KB |
| 実行使用メモリ | 27,496 KB |
| 最終ジャッジ日時 | 2023-09-18 06:56:10 |
| 合計ジャッジ時間 | 9,420 ms |
|
ジャッジサーバーID （参考情報） |
judge13 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,384 KB |
| testcase_01 | AC | 1 ms
4,380 KB |
| testcase_02 | AC | 2 ms
4,380 KB |
| testcase_03 | AC | 2 ms
4,380 KB |
| testcase_04 | AC | 1 ms
4,380 KB |
| testcase_05 | AC | 2 ms
4,380 KB |
| testcase_06 | AC | 1 ms
4,380 KB |
| testcase_07 | AC | 2 ms
4,380 KB |
| testcase_08 | AC | 2 ms
4,380 KB |
| testcase_09 | AC | 2 ms
4,376 KB |
| testcase_10 | AC | 2 ms
4,376 KB |
| testcase_11 | AC | 2 ms
4,380 KB |
| testcase_12 | AC | 1 ms
4,376 KB |
| testcase_13 | AC | 3 ms
4,380 KB |
| testcase_14 | AC | 3 ms
4,384 KB |
| testcase_15 | AC | 3 ms
4,508 KB |
| testcase_16 | AC | 3 ms
4,380 KB |
| testcase_17 | AC | 3 ms
4,380 KB |
| testcase_18 | AC | 448 ms
20,088 KB |
| testcase_19 | AC | 450 ms
20,152 KB |
| testcase_20 | AC | 444 ms
20,148 KB |
| testcase_21 | AC | 444 ms
20,088 KB |
| testcase_22 | AC | 459 ms
20,156 KB |
| testcase_23 | AC | 358 ms
23,236 KB |
| testcase_24 | AC | 368 ms
23,360 KB |
| testcase_25 | AC | 352 ms
23,304 KB |
| testcase_26 | AC | 363 ms
23,332 KB |
| testcase_27 | AC | 359 ms
23,332 KB |
| testcase_28 | AC | 493 ms
26,676 KB |
| testcase_29 | AC | 502 ms
27,496 KB |
| testcase_30 | AC | 495 ms
26,764 KB |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define rrep(i,n) for(int (i)=((n)-1);(i)>=0;(i)--)
#define itn int
#define miele(v) min_element(v.begin(), v.end())
#define maele(v) max_element(v.begin(), v.end())
#define SUM(v) accumulate(v.begin(), v.end(), 0LL)
#define lb(a, key) lower_bound(a.begin(),a.end(),key)
#define ub(a, key) upper_bound(a.begin(),a.end(),key)
#define COUNT(a, key) count(a.begin(), a.end(), key)
#define BITCOUNT(x) __builtin_popcount(x)
#define pb push_back
#define all(x) (x).begin(),(x).end()
#define F first
#define S second
using P = pair <int,int>;
using WeightedGraph = vector<vector <P>>;
using UnWeightedGraph = vector<vector<int>>;
using Real = long double;
using Point = complex<Real>; //Point and Vector2d is the same!
using Vector2d = complex<Real>;
const long long INF = 1LL << 60;
const int MOD = 1000000007;
const double EPS = 1e-15;
const double PI=3.14159265358979323846;
template <typename T>
int getIndexOfLowerBound(vector <T> &v, T x){
return lower_bound(v.begin(),v.end(),x)-v.begin();
}
template <typename T>
int getIndexOfUpperBound(vector <T> &v, T x){
return upper_bound(v.begin(),v.end(),x)-v.begin();
}
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
#define DUMPOUT cerr
#define repi(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
istream &operator>>(istream &is, Point &p) {
Real a, b; is >> a >> b; p = Point(a, b); return is;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T,U> &p_var) {
is >> p_var.first >> p_var.second;
return is;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &vec) {
for (T &x : vec) is >> x;
return is;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, pair<T, U> &pair_var) {
DUMPOUT<<'{';
os << pair_var.first;
DUMPOUT<<',';
os << " "<< pair_var.second;
DUMPOUT<<'}';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &vec) {
DUMPOUT<<'[';
for (int i = 0; i < vec.size(); i++)
os << vec[i] << (i + 1 == vec.size() ? "" : " ");
DUMPOUT<<']';
return os;
}
template <typename T>
ostream &operator<<(ostream &os, vector<vector<T>> &df) {
for (auto& vec : df) os<<vec;
return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, map<T, U> &map_var) {
DUMPOUT << "{";
repi(itr, map_var) {
os << *itr;
itr++;
if (itr != map_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
template <typename T>
ostream &operator<<(ostream &os, set<T> &set_var) {
DUMPOUT << "{";
repi(itr, set_var) {
os << *itr;
itr++;
if (itr != set_var.end()) DUMPOUT << ", ";
itr--;
}
DUMPOUT << "}";
return os;
}
void print() {cout << endl;}
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
cout << head;
if (sizeof...(tail) != 0) cout << " ";
print(forward<Tail>(tail)...);
}
void dump_func() {DUMPOUT << '#'<<endl;}
template <typename Head, typename... Tail>
void dump_func(Head &&head, Tail &&... tail) {
DUMPOUT << head;
if (sizeof...(Tail) > 0) DUMPOUT << ", ";
dump_func(std::move(tail)...);
}
#ifdef DEBUG_
#define DEB
#define dump(...) \
DUMPOUT << " " << string(#__VA_ARGS__) << ": " \
<< "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" \
<< endl \
<< " ", \
dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif
UnWeightedGraph g;
vector <int> subtreeSize;
int dfs(int s = 0, int mae = -1){
int res = 1;
for(auto e: g[s]){
if(e == mae) continue;
res += dfs(e, s);
}
return subtreeSize[s] = res;
}
signed main(void) { cin.tie(0); ios::sync_with_stdio(false);
int n; cin>>n;
g.resize(n);
subtreeSize.resize(n);
rep(i, n-1){
int v, u; cin>>v>>u;
v--, u--;
g[v].pb(u);
g[u].pb(v);
}
dfs();
vector <int> done(n);
queue <int> q;
q.push(0);
vector <int> ans(n);
while(!q.empty()){
int now = q.front(); q.pop();
int cnt = 0;
vector <int> subtree;
for(int i=0;i<g[now].size();i++){
if(!done[g[now][i]]) {
cnt++;
subtree.pb(subtreeSize[g[now][i]]);
}
}
if(subtree.size() == 0) ans[now] = 1;
else {
int sum = SUM(subtree);
ans[now] = 1 + sum*2;
rep(i, subtree.size()){
ans[now] += (sum - subtree[i])*subtree[i];
}
for(auto e: g[now]){
if(!done[e]) q.push(e);
}
}
done[now] = 1;
}
rep(i, n){
print(ans[i]);
}
}