Submission #371205

---

Source Code Expand

#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>
#include <tuple>
#include <array>
#include <climits>
#include <bitset>
#include <cassert>
#include <unordered_map>
#include <complex>

#ifdef _MSC_VER
#include <agents.h>
#endif

#define FOR(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep(i, n) FOR(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define REV(v) v.rbegin(), v.rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define UNIQUE(v) (v).erase(unique(ALL(v)), (v).end())
#define MP make_pair
#define MT make_tuple

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;

const int N = 1e5 + 10;
int dist[N];
int len;

vector<int> G[N];
void dfs(int v, int p, int d){
	if (dist[v] > 0){
		len = d - dist[v];
		return;
	}
	dist[v] = d;
	for (auto nxt : G[v]){
		if (nxt == p) continue;
		dfs(nxt, v, d + 1);
	}
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cout.setf(ios::fixed);
	cout.precision(20);

	int n;
	cin >> n;
	rep(i, n){
		int a, b;
		cin >> a >> b;
		--a, --b;
		G[a].push_back(b);
		G[b].push_back(a);
	}
	int Min = 1e9;
	rep(i, n) Min = min(Min, (int)G[i].size());
	dfs(0, -1, 1);

	int Max = n - (len & 1);

	cout << Min << ' ' << Max << endl;

}

Submission Info

Judge Result