結果
問題 | No.1103 Directed Length Sum |
ユーザー | もりを |
提出日時 | 2020-07-03 21:45:44 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 11,007 bytes |
コンパイル時間 | 2,046 ms |
コンパイル使用メモリ | 214,144 KB |
実行使用メモリ | 104,376 KB |
最終ジャッジ日時 | 2024-09-16 23:55:14 |
合計ジャッジ時間 | 8,185 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | AC | 171 ms
58,240 KB |
testcase_04 | AC | 320 ms
37,228 KB |
testcase_05 | AC | 641 ms
59,152 KB |
testcase_06 | AC | 168 ms
24,884 KB |
testcase_07 | AC | 32 ms
8,448 KB |
testcase_08 | AC | 52 ms
11,600 KB |
testcase_09 | AC | 19 ms
6,500 KB |
testcase_10 | AC | 71 ms
14,100 KB |
testcase_11 | AC | 350 ms
40,064 KB |
testcase_12 | AC | 179 ms
24,960 KB |
testcase_13 | AC | 74 ms
14,388 KB |
testcase_14 | AC | 15 ms
5,888 KB |
testcase_15 | AC | 120 ms
20,880 KB |
testcase_16 | AC | 406 ms
44,088 KB |
testcase_17 | AC | 423 ms
45,664 KB |
testcase_18 | AC | 64 ms
14,052 KB |
testcase_19 | AC | 342 ms
40,752 KB |
testcase_20 | AC | 24 ms
7,424 KB |
testcase_21 | AC | 44 ms
10,276 KB |
testcase_22 | AC | 266 ms
32,592 KB |
testcase_23 | AC | 133 ms
21,696 KB |
ソースコード
// #pragma GCC target ("avx") // #pragma GCC optimize("Ofast") // #pragma GCC optimize("unroll-loops") // #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native") #include <bits/stdc++.h> using namespace std; // #define int long long // #define endl '\n' #pragma region TEMPLATE /* TYPE */ typedef long long ll; typedef long double ld; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<pii> vpii; typedef vector<pll> vpll; typedef vector<int> vi; typedef vector<ll> vl; typedef vector<string> vst; typedef vector<bool> vb; typedef vector<ld> vld; typedef vector<vector<int>> vvi; template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>; template<typename T> using prique_r = prique<T, greater<>>; /* CONSTANT */ #define ln '\n' const int INF = 1 << 30; const ll INFF = 1LL << 60; const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"; const int MOD = 1e9 + 7; const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz"; const double EPS = 1e-9; const ld PI = 3.14159265358979323846264338327950288; const int dx[] = { 1, 0, -1, 0, 1, -1, -1, 1, 0 }; const int dy[] = { 0, 1, 0, -1, -1, -1, 1, 1, 0 }; /* CONTAINER */ #define PB emplace_back #define ALL(v) (v).begin(), (v).end() #define RALL(v) (v).rbegin(), (v).rend() #define SORT(v) sort(ALL(v)) #define RSORT(v) sort(RALL(v)) #define LESS(x, val) (lower_bound(x.begin(), x.end(), val) - x.begin()) #define LEQ(x, val) (upper_bound(x.begin(), x.end(), val) - x.begin()) #define GREATER(x, val) (int)(x).size() - LEQ((x), (val)) #define GEQ(x, val) (int)(x).size() - LESS((x), (val)) #define UNIQUE(v) sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end()) template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); } template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); } template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); } template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); } /* LOOP */ #define _overload3(_1, _2, _3, name, ...) name #define _REP(i, n) REPI(i, 0, n) #define REPI(i, a, b) for (ll i = (ll)a; i < (ll)b; ++i) #define REP(...) _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__) #define _RREP(i, n) RREPI(i, n, 0) #define RREPI(i, a, b) for (ll i = (ll)a; i >= (ll)b; --i) #define RREP(...) _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__) #define EACH(e, v) for (auto& e : v) #define PERM(v) sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v))) /* INPUT */ template<typename T> void SSS(T& t) { cin >> t; } template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); } #define SS(T, ...) T __VA_ARGS__; SSS(__VA_ARGS__); #define SV(T, v, n) vector<T> v(n); for (auto& i : v) cin >> i; #define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i; /* OUTPUT */ // Yes / No inline int YES(bool x) { cout << (x ? "YES" : "NO") << endl; return 0; } inline int Yes(bool x) { cout << (x ? "Yes" : "No") << endl; return 0; } inline int yes(bool x) { cout << (x ? "yes" : "no") << endl; return 0; } inline int yES(bool x) { cout << (x ? "yES" : "nO") << endl; return 0; } inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; } // PROTOTYPE DECLARATION template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j); template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t); template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c); template<typename T> ostream &operator<<(ostream &os, const stack<T> &j); template<typename T> ostream &operator<<(ostream &os, const queue<T> &j); template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j); // IMPLEMENTATION template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; } template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {} template<size_t num = 0, typename... T> enable_if_t<num < sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); } template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; } template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; } template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; } template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top()); return os << d; } // OUTPUT FUNCTION template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \n"[i == sz - 1]; return 0; } inline int print() { cout << endl; return 0; } template<typename Head> int print(Head&& head){ cout << head; return print(); } template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); } #ifdef LOCAL inline void dump() { cerr << endl; } template<typename Head> void dump(Head&& head) { cerr << head; dump(); } template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); } #define debug(...) do {cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false) #else #define dump(...) #define debug(...) #endif /* OTHER */ #define fi first #define se second #define MP make_pair #define MT make_tuple #define tmax(x, y, z) max((x), max((y), (z))) #define tmin(x, y, z) min((x), min((y), (z))) template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); } template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; } template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; } inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; } inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; } inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1) r *= a; a *= a; } while (b >>= 1); return r; } struct abracadabra { abracadabra() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); cerr << fixed << setprecision(5); }; } ABRACADABRA; #pragma endregion #pragma region graph template /** * @brief グラフテンプレート * @docs docs/graph/template.md */ template<typename T> struct Edge { int frm, to, idx; T cst; Edge() {} Edge(int f, int t, T c, int i = -1) : frm(f), to(t), cst(c), idx(i) {} operator int() const { return to; } }; template<typename T> constexpr T GINF = numeric_limits<T>::max() / 10; template<typename T> struct Graph { int V, E; vector<vector<Edge<T>>> mat; vector<vector<T>> wf; Graph() {} Graph(int v) : V(v), E(0), mat(v) {} inline void add_edge(int a, int b, T c = 1, int margin = 0) { a -= margin, b -= margin; mat[a].emplace_back(a, b, c, E++); mat[b].emplace_back(b, a, c, E++); } inline void add_arc(int a, int b, T c = 1, int margin = 0) { a -= margin, b -= margin; mat[a].emplace_back(a, b, c, E++); } inline void input_edges(int M, int margin = 0, bool need_cost = false) { for (int i = 0; i < M; ++i) { if (need_cost) { int a, b; T c; cin >> a >> b >> c; add_edge(a, b, c, margin); } else { int a, b; T c(1); cin >> a >> b; add_edge(a, b, c, margin); } } } inline void input_arcs(int M, int margin = 0, bool need_cost = false) { for (int i = 0; i < M; ++i) { if (need_cost) { int a, b; T c; cin >> a >> b >> c; add_arc(a, b, c, margin); } else { int a, b; T c(1); cin >> a >> b; add_arc(a, b, c, margin); } } } inline bool is_bipartite() { bool isbi = true; vector<int> color(V, 0); auto dfs = [&](auto &&f, int i, int clr) -> void { if (color[i] != 0) return; color[i] = clr; for (auto& e: mat[i]) { /* */if (color[e.to] == 0) f(f, e.to, -clr); else if (color[e.to] == clr) isbi = false; } }; dfs(dfs, 0, 1); return isbi; // int cnt = 0; // for (auto& e: color) if (e == 1) ++cnt; // return isbi ? -1 : cnt; } }; #pragma endregion #pragma region graph topological sort /** * @brief トポロジカルソート * @docs docs/graph/other/topologicalsort.md */ template<typename T> vector<int> TopologicalSort(const Graph< T > &g) { vector<int> order, color(g.V, 0); auto rec = [&](auto &&f, int v) -> bool { color[v] = 1; for (auto& e: g.mat[v]) { if (color[e] == 2) continue; if (color[e] == 1) return false; if (not f(f, e)) return false; } order.push_back(v); color[v] = 2; return true; }; for (int i = 0; i < g.V; ++i) if (not color[i] and not rec(rec, i)) return vector<int>(); reverse(order.begin(), order.end()); return order; } #pragma endregion int dep[1001001]; void dfs(const Graph<int>&g, int cur, int d=0) { dep[cur]=d; for(auto&nxt:g.mat[cur]){ dfs(g,nxt,d+1); } } signed main() { SS(int,N); Graph<int> g(N); g.input_arcs(N-1,1,false); auto tp = TopologicalSort(g); dfs(g,tp[0]); ll res=0; REP(i,N){ ll d=dep[i]; res+=d*(d+1)/2; } print(res); }