結果
問題 | No.277 根掘り葉掘り |
ユーザー |
![]() |
提出日時 | 2015-09-04 22:37:04 |
言語 | C++11 (gcc 13.3.0) |
結果 |
RE
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 1,720 bytes |
コンパイル時間 | 1,189 ms |
コンパイル使用メモリ | 107,740 KB |
実行使用メモリ | 33,152 KB |
最終ジャッジ日時 | 2024-07-19 01:02:53 |
合計ジャッジ時間 | 5,803 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | RE * 2 |
other | RE * 18 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:86:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 86 | scanf("%d", &n); | ~~~~~^~~~~~~~~~ main.cpp:89:22: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 89 | scanf("%d%d", &a, &b); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp: In function ‘int dfs(int, int)’: main.cpp:84:1: warning: control reaches end of non-void function [-Wreturn-type] 84 | } | ^
ソースコード
#include<iostream>#include<cstdio>#include<cstring>#include<string>#include<cctype>#include<cstdlib>#include<algorithm>#include<bitset>#include<vector>#include<list>#include<deque>#include<queue>#include<map>#include<set>#include<stack>#include<cmath>#include<sstream>#include<fstream>#include<iomanip>#include<ctime>#include<complex>#include<functional>#include<climits>#include<cassert>#include<iterator>using namespace std;#define MAX 100002int n;vector<int> v[MAX];bool use[MAX];int ans[MAX];int dep[MAX];inline void dfs2(int a){use[a] = true;dep[a] = INT_MAX;int countt = 0;for (int i = 0; i < v[a].size(); i++){if (use[v[a][i]] == false){dfs2(v[a][i]);dep[a] = min(dep[a], dep[v[a][i]] + 1);countt++;}}if (countt== 0){dep[a] = 0;}return;}inline int dfs(int a, int b){use[a] = false;ans[a] = INT_MAX;map<int,int> s;s.clear();int countt = 0;for (int i = 0; i < v[a].size(); i++){if (use[v[a][i]] == false){continue;}countt++;s[dep[v[a][i]]+1]++;}if (countt == 0){ans[a] = 0;return 0;}s[b]++;map<int, int>::iterator ite;ite = s.begin();ans[a] = (*ite).first;for (int i = 0; i < v[a].size(); i++){if (use[v[a][i]] == false){continue;}int val = dep[v[a][i]]+1;s[val]--;if (s[val] == 0){s.erase(val);}ite = s.begin();dfs(v[a][i], (*ite).first+1);s[val]++;}}int main(){scanf("%d", &n);for (int i = 1; i < n; i++){int a, b;scanf("%d%d", &a, &b);a--;b--;v[a].push_back(b);v[b].push_back(a);}for (int i = 0; i < n; i++){ans[i] = INT_MAX;}dfs2(0);dfs(0, 0);for (int i = 0; i < n; i++){printf("%d\n", ans[i]);}return 0;}