Submission #371133

---

Source Code Expand

#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <utility>
#include <bitset>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <cstdio>

using namespace std;

#define REP(i,n) for((i)=0;(i)<(int)(n);(i)++)
#define snuke(c,itr) for(__typeof((c).begin()) itr=(c).begin();itr!=(c).end();itr++)

#define MAXV 100010

int parent[MAXV],rank[MAXV];

void init(int n){
	int i;
	REP(i,n) {parent[i] = i; rank[i] = 1;}
}

int root(int x){
	if(parent[x] != x) parent[x] = root(parent[x]);
	return parent[x];
}

void connect(int x, int y){
	int rx=root(x),ry=root(y);
	if(rx == ry) return;
	if(rank[rx] > rank[ry]) {parent[ry] = rx; rank[rx] += rank[ry];}
	if(rank[rx] <= rank[ry]) {parent[rx] = ry; rank[ry] += rank[rx];}
}

vector <int> graph[100010];
int dist[100010];

void dfs(int p, int x, int d){
	dist[x] = d;
	int i;
	REP(i,graph[x].size()){
		int y = graph[x][i];
		if(y != p) dfs(x, y, d+1);
	}
}

int main(void){
	int s=-1,t=-1,i,j,N;
	
	cin >> N;
	init(N);
	
	REP(i,N){
		int a,b;
		scanf("%d%d", &a, &b);
		a--; b--;
		
		if(root(a) == root(b)){
			s = a; t = b;
		} else {
			connect(a, b);
			graph[a].push_back(b);
			graph[b].push_back(a);
		}
	}
	
	dfs(-1, s, 0);
	
	int cycle = dist[t];
	cycle++;
	// cout << cycle << endl;
	
	int small = 1;
	if(cycle == N) small = 2;
	int big = N;
	if(cycle % 2 == 1) big--;
	cout << small << ' ' << big << endl;
	
	return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:66:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d", &a, &b);
                        ^

Judge Result