結果
問題 | No.1103 Directed Length Sum |
ユーザー | mai |
提出日時 | 2020-07-03 21:43:05 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 724 ms / 3,000 ms |
コード長 | 5,963 bytes |
コンパイル時間 | 2,599 ms |
コンパイル使用メモリ | 221,672 KB |
実行使用メモリ | 194,776 KB |
最終ジャッジ日時 | 2023-10-17 00:05:38 |
合計ジャッジ時間 | 9,297 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge14 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,768 KB |
testcase_01 | AC | 2 ms
5,772 KB |
testcase_02 | AC | 262 ms
194,776 KB |
testcase_03 | AC | 137 ms
104,952 KB |
testcase_04 | AC | 377 ms
69,332 KB |
testcase_05 | AC | 724 ms
114,392 KB |
testcase_06 | AC | 212 ms
47,752 KB |
testcase_07 | AC | 32 ms
15,036 KB |
testcase_08 | AC | 52 ms
20,200 KB |
testcase_09 | AC | 17 ms
11,532 KB |
testcase_10 | AC | 79 ms
25,668 KB |
testcase_11 | AC | 403 ms
74,808 KB |
testcase_12 | AC | 205 ms
48,044 KB |
testcase_13 | AC | 82 ms
26,208 KB |
testcase_14 | AC | 14 ms
10,052 KB |
testcase_15 | AC | 148 ms
37,140 KB |
testcase_16 | AC | 463 ms
83,364 KB |
testcase_17 | AC | 489 ms
86,540 KB |
testcase_18 | AC | 90 ms
25,444 KB |
testcase_19 | AC | 424 ms
76,652 KB |
testcase_20 | AC | 23 ms
12,780 KB |
testcase_21 | AC | 48 ms
18,872 KB |
testcase_22 | AC | 349 ms
63,864 KB |
testcase_23 | AC | 167 ms
39,192 KB |
ソースコード
#pragma GCC optimize ("O3") #include "bits/stdc++.h" using namespace std; using ll = long long int; #define all(v) (v).begin(),(v).end() #define repeat(cnt,l) for(typename remove_const<typename remove_reference<decltype(l)>::type>::type cnt={};(cnt)<(l);++(cnt)) #define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt)) #define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt)) #define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt)) const long long MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L; template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')'; return o; } template<typename T> inline T& chmax(T& to, const T& val) { return to = max(to, val); } template<typename T> inline T& chmin(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(code); } mt19937_64 randdev(8901016); template<typename T, typename Random = decltype(randdev), typename enable_if<is_integral<T>::value>::type* = nullptr> inline T rand(T l, T h, Random& rand = randdev) { return uniform_int_distribution<T>(l, h)(rand); } template<typename T, typename Random = decltype(randdev), typename enable_if<is_floating_point<T>::value>::type* = nullptr> inline T rand(T l, T h, Random& rand = randdev) { return uniform_real_distribution<T>(l, h)(rand); } template <typename I> struct MyRangeFormat{ I b,e; MyRangeFormat(I _b, I _e):b(_b),e(_e){} }; template<typename I> static ostream& operator<<(ostream& o, const MyRangeFormat<I>& f) { o << "[ "; iterate(i,f.b,f.e) o<<*i<<' '; return o << ']'; } template <typename I> struct MyMatrixFormat{ const I& p; long long n, m; MyMatrixFormat(const I& _p, long long _n, long long _m):p(_p),n(_n),m(_m){} }; template<typename I> static ostream& operator<<(ostream& o, const MyMatrixFormat<I>& f) { o<<'\n'; repeat(i,(f.n)) { repeat(j,f.m) o<<f.p[i][j]<<' '; o<<'\n'; } return o; } struct LOG_t { ~LOG_t() { cout << endl; } }; #define LOG (LOG_t(),cout<<'L'<<__LINE__<<": ") #define FMTA(m,w) (MyRangeFormat<decltype(m+0)>(m,m+w)) #define FMTR(b,e) (MyRangeFormat<decltype(e)>(b,e)) #define FMTV(v) FMTR(v.begin(),v.end()) #define FMTM(m,h,w) (MyMatrixFormat<decltype(m+0)>(m,h,w)) #if defined(_WIN32) || defined(_WIN64) #define getc_x _getc_nolock #define putc_x _putc_nolock #elif defined(__GNUC__) #define getc_x getc_unlocked #define putc_x putc_unlocked #else #define getc_x getc #define putc_x putc #endif class MaiScanner { FILE* fp_; constexpr bool isvisiblechar(char c) noexcept { return (0x21<=(c)&&(c)<=0x7E); } public: inline MaiScanner(FILE* fp):fp_(fp){} template<typename T> void input_integer(T& var) noexcept { var = 0; T sign = 1; int cc = getc_x(fp_); for (; cc < '0' || '9' < cc; cc = getc_x(fp_)) if (cc == '-') sign = -1; for (; '0' <= cc && cc <= '9'; cc = getc_x(fp_)) var = (var << 3) + (var << 1) + cc - '0'; var = var * sign; } inline int c() noexcept { return getc_x(fp_); } template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr> inline MaiScanner& operator>>(T& var) noexcept { input_integer<T>(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getc_x(fp_); for (; !isvisiblechar(cc); cc = getc_x(fp_)); for (; isvisiblechar(cc); cc = getc_x(fp_)) var.push_back(cc); return *this; } template<typename IT> inline void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; class MaiPrinter { FILE* fp_; public: inline MaiPrinter(FILE* fp):fp_(fp){} template<typename T> void output_integer(T var) noexcept { if (var == 0) { putc_x('0', fp_); return; } if (var < 0) putc_x('-', fp_), var = -var; char stack[32]; int stack_p = 0; while (var) stack[stack_p++] = '0' + (var % 10), var /= 10; while (stack_p) putc_x(stack[--stack_p], fp_); } inline MaiPrinter& operator<<(char c) noexcept { putc_x(c, fp_); return *this; } template<typename T, typename enable_if<is_integral<T>::value, nullptr_t>::type = nullptr> inline MaiPrinter& operator<<(T var) noexcept { output_integer<T>(var); return *this; } inline MaiPrinter& operator<<(char* str_p) noexcept { while (*str_p) putc_x(*(str_p++), fp_); return *this; } inline MaiPrinter& operator<<(const string& str) { const char* p = str.c_str(); const char* l = p + str.size(); while (p < l) putc_x(*p++, fp_); return *this; } template<typename IT> void join(IT begin, IT end, char sep = ' ') { for (bool b = 0; begin != end; ++begin, b = 1) b ? *this << sep << *begin : *this << *begin; } }; MaiScanner scanner(stdin); MaiPrinter printer(stdout); class DGraph { public: int n; vector<vector<int>> vertex_to; vector<vector<int>> vertex_from; explicit DGraph(int n = 1) : n(n), vertex_to(n), vertex_from(n) {} inline int size() const { return n; } void resize(int _n) { n = _n; vertex_to.resize(_n); vertex_from.resize(_n); } void connect(int from, int to) { vertex_to[(int)from].emplace_back(to); vertex_from[(int)to].emplace_back(from); } }; // int N; DGraph G; // int rem[1000010]; ll num[1000010]; ll result[1000010]; void dfs(int v) { for (auto to : G.vertex_to[v]) { num[to] += num[v] + 1; result[to] += result[v] + num[v] + 1; result[to] %= MD; rem[to] -= 1; if (rem[to] == 0) dfs(to); } } int main() { scanner >> N; G.resize(N); repeat(i, N-1) { int a, b; scanner >> a >> b; --a; --b; G.connect(a, b); } vector<int> starts; repeat(i, N) { rem[i] = G.vertex_from[i].size(); if (rem[i] == 0) starts.emplace_back(i); } for (auto v : starts) { dfs(v); } ll total = 0; repeat(i, N) { total += result[i]; total %= MD; } cout << (total%MD) << endl; return 0; }