Submission #2143044
Source Code Expand
// #include {{{
#include <iostream>
#include <cassert>
#include <cstring>
#include <cstdlib>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <ctime>
#include <queue>
#include <set>
#include <map>
#include <stack>
#include <string>
#include <bitset>
#include <vector>
#include <complex>
#include <algorithm>
using namespace std;
// }}}
// #define {{{
typedef long long ll;
typedef double db;
typedef pair<int,int> pii;
typedef vector<int> vi;
#define de(x) cout << #x << "=" << x << endl
#define rep(i,a,b) for(int i=a;i<(b);++i)
#define per(i,a,b) for(int i=(b)-1;i>=(a);--i)
#define all(x) (x).begin(),(x).end()
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define fi first
#define se second
// }}}
const int N = 1e5 + 10;
int n , du[N] , ans;
vi g[N];
int dfs(int c,int fa=0) {
int a = 0 , b = 0;
for(auto t : g[c]) if(t != fa) {
int gt = dfs(t , c);
if(gt > a) swap(a , b) , a = gt;
else if(gt > b) b = gt;
}
if(du[c] == 2) ans = max(ans , ++a);
else ans = max(ans , a + b);
return a;
}
int main(){
scanf("%d",&n);
rep(i,1,n) {
int u,v;
scanf("%d%d",&u,&v);
g[u].pb(v);
g[v].pb(u);
du[u]++;
du[v]++;
}
int t = max_element(du + 1 , du + 1 + n) - du;
if(du[t] <= 2) return printf("%d\n",n) , 0;
dfs(t);
rep(i,1,n+1) ans += du[i] == 1;
printf("%d\n",ans);
return 0;
}
Submission Info
Submission Time
2018-02-28 20:50:52+0900
Task
K - Problem on Tree
User
Y_UME
Language
C++14 (GCC 5.4.1)
Score
100
Code Size
1447 Byte
Status
AC
Exec Time
61 ms
Memory
6272 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:54:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d",&n);
^
./Main.cpp:57:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&u,&v);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
100 / 100
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt
All
sample_01.txt, sample_02.txt, sample_01.txt, sample_02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt, subtask1_31.txt, subtask1_32.txt, subtask1_33.txt, subtask1_34.txt, subtask1_35.txt, subtask1_36.txt, subtask1_37.txt, subtask1_38.txt, subtask1_39.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
2 ms
2560 KB
sample_02.txt
AC
2 ms
2560 KB
subtask1_01.txt
AC
36 ms
5632 KB
subtask1_02.txt
AC
27 ms
4992 KB
subtask1_03.txt
AC
12 ms
3584 KB
subtask1_04.txt
AC
15 ms
3840 KB
subtask1_05.txt
AC
18 ms
4096 KB
subtask1_06.txt
AC
4 ms
2816 KB
subtask1_07.txt
AC
44 ms
6144 KB
subtask1_08.txt
AC
12 ms
3584 KB
subtask1_09.txt
AC
25 ms
4736 KB
subtask1_10.txt
AC
33 ms
5376 KB
subtask1_11.txt
AC
15 ms
3840 KB
subtask1_12.txt
AC
7 ms
3072 KB
subtask1_13.txt
AC
5 ms
2816 KB
subtask1_14.txt
AC
5 ms
2944 KB
subtask1_15.txt
AC
42 ms
6144 KB
subtask1_16.txt
AC
42 ms
6144 KB
subtask1_17.txt
AC
43 ms
6144 KB
subtask1_18.txt
AC
43 ms
6144 KB
subtask1_19.txt
AC
42 ms
6272 KB
subtask1_20.txt
AC
61 ms
6144 KB
subtask1_21.txt
AC
48 ms
6144 KB
subtask1_22.txt
AC
47 ms
6144 KB
subtask1_23.txt
AC
43 ms
6144 KB
subtask1_24.txt
AC
45 ms
6144 KB
subtask1_25.txt
AC
47 ms
6144 KB
subtask1_26.txt
AC
49 ms
6144 KB
subtask1_27.txt
AC
43 ms
6144 KB
subtask1_28.txt
AC
47 ms
6144 KB
subtask1_29.txt
AC
42 ms
6144 KB
subtask1_30.txt
AC
44 ms
6144 KB
subtask1_31.txt
AC
43 ms
6144 KB
subtask1_32.txt
AC
42 ms
6144 KB
subtask1_33.txt
AC
42 ms
6144 KB
subtask1_34.txt
AC
42 ms
6144 KB
subtask1_35.txt
AC
42 ms
6144 KB
subtask1_36.txt
AC
41 ms
6144 KB
subtask1_37.txt
AC
42 ms
6144 KB
subtask1_38.txt
AC
42 ms
6144 KB
subtask1_39.txt
AC
42 ms
6144 KB