結果
問題 | No.1103 Directed Length Sum |
ユーザー | mikianaaa |
提出日時 | 2020-08-20 15:51:21 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,853 bytes |
コンパイル時間 | 1,499 ms |
コンパイル使用メモリ | 173,532 KB |
実行使用メモリ | 89,588 KB |
最終ジャッジ日時 | 2024-04-21 13:21:17 |
合計ジャッジ時間 | 8,221 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 1 ms
5,376 KB |
testcase_02 | WA | - |
testcase_03 | AC | 235 ms
89,588 KB |
testcase_04 | AC | 375 ms
46,836 KB |
testcase_05 | AC | 798 ms
78,720 KB |
testcase_06 | AC | 201 ms
31,488 KB |
testcase_07 | AC | 35 ms
10,112 KB |
testcase_08 | AC | 56 ms
13,568 KB |
testcase_09 | AC | 21 ms
7,552 KB |
testcase_10 | AC | 76 ms
17,536 KB |
testcase_11 | AC | 424 ms
50,616 KB |
testcase_12 | AC | 211 ms
31,820 KB |
testcase_13 | AC | 88 ms
17,956 KB |
testcase_14 | AC | 17 ms
6,528 KB |
testcase_15 | AC | 147 ms
25,572 KB |
testcase_16 | AC | 487 ms
56,516 KB |
testcase_17 | AC | 515 ms
58,836 KB |
testcase_18 | AC | 90 ms
17,408 KB |
testcase_19 | AC | 461 ms
51,908 KB |
testcase_20 | AC | 27 ms
8,320 KB |
testcase_21 | AC | 51 ms
12,672 KB |
testcase_22 | AC | 322 ms
43,008 KB |
testcase_23 | AC | 169 ms
27,112 KB |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/c++allocator.h:33, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/allocator.h:46, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/string:43, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bitset:52, from /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/x86_64-pc-linux-gnu/bits/stdc++.h:52, from main.cpp:2: In member function 'void std::__new_allocator<_Tp>::construct(_Up*, _Args&& ...) [with _Up = long long int; _Args = {const long long int&}; _Tp = long long int]', inlined from 'static void std::allocator_traits<std::allocator<_CharT> >::construct(allocator_type&, _Up*, _Args&& ...) [with _Up = long long int; _Args = {const long long int&}; _Tp = long long int]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/alloc_traits.h:537:17, inlined from 'void std::deque<_Tp, _Alloc>::push_back(const value_type&) [with _Tp = long long int; _Alloc = std::allocator<long long int>]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_deque.h:1543:30, inlined from 'void std::queue<_Tp, _Sequence>::push(const value_type&) [with _Tp = long long int; _Sequence = std::deque<long long int, std::allocator<long long int> >]' at /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/stl_queue.h:286:20, inlined from 'int main()' at main.cpp:42:13: /home/linuxbrew/.linuxbrew/Cellar/gcc/13.2.0/include/c++/13/bits/new_allocator.h:187:11: warning: 's' may be used uninitialized [-Wmaybe-uninitialized] 187 | { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); } | ^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ main.cpp: In function 'int main()': main.cpp:29:8: note: 's' was declared here 29 | ll s; | ^
ソースコード
#include <algorithm> #include <bits/stdc++.h> using namespace std; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define all(x) (x).begin(), (x).end() #define ll long long #define ld long double #define INF 1000000000000000000 typedef pair<ll, ll> pll; int main() { cin.tie(0); ios::sync_with_stdio(false); int N; cin >> N; ll MOD = pow(10, 9) + 7; vector<vector<ll>> G(N, vector<ll>()); vector<ll> root(N, -1); rep(i, N - 1) { ll a, b; cin >> a >> b; a--, b--; G[a].push_back(b); G[b].push_back(a); root[b] = a; } ll s; rep(i, N) { if (root[i] == -1) { s = i; break; } } vector<ll> dist(N, -1); // 全頂点を「未訪問」に初期化 queue<ll> que; // 初期条件 (頂点 0 を初期ノードとする) dist[s] = 0; que.push(s); // 0 を橙色頂点にする // BFS 開始 (キューが空になるまで探索を行う) while (!que.empty()) { int v = que.front(); // キューから先頭頂点を取り出す que.pop(); // v から辿れる頂点をすべて調べる for (int nv : G[v]) { if (dist[nv] != -1) continue; // すでに発見済みの頂点は探索しない // 新たな白色頂点 nv について距離情報を更新してキューに追加する dist[nv] = dist[v] + 1; dist[nv] %= MOD; que.push(nv); } } ll ans = 0; rep(i, N) { ll tmp = dist[i] % MOD; if (dist[i] >= 2) { tmp = (1 + dist[i]) % MOD * dist[i] % MOD / 2; } ans += tmp; ans %= MOD; } if (ans < 0) { while (ans < 0) { ans += MOD; } } cout << ans << endl; }