제출 #1224991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1224991		kxd	Network (BOI15_net)	C++20	0 / 100	4 ms	7492 KiB

net

#include <bits/stdc++.h>
//#define DEBUG 1106
#define int long long
#define ll long long
#define ld long double
#define pb push_back
#define p_q priority_queue
#define m_p make_pair
#define pii pair<int,int>
#define endl '\n'
#define INIT ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define FOR(i,a,b) for(int i = a; i <= b; i++)
#define forn(i,n) for (int i = 0; i < n; i++)
#define forn1(i,n) for (int i = 1; i <= n; i++)
#define all(x) x.begin(),x.end()
#define ft first
#define sd second
#define lowbit(x) (x&(-x))
#define chmax(x,y) x=max(x,y)
#define chmin(x,y) x=min(x,y)
#ifdef DEBUG
#define debug(x) cout << #x << ": " << x << endl;
#else
#define debug(x) 1106;
#endif

using namespace std;
const int N = 3e5+5;
const int M = 2005;
const int inf = 1e9;
const int INF = 1e18;
const int MOD = 1e9+7;

int a[N];
vector<int> G[N];
vector<int> ret;

void dfs(int u, int par) {
	for(auto v: G[u]) {
		if(v!=par) dfs(v,u);
	}
	if(G[u].size()==1) ret.pb(u);
}

signed main() {
	INIT
	#ifdef DEBUG
	freopen("input.txt", "r", stdin);
	#endif
	///////////
	int n;
	cin >> n;
	forn(i,n-1) {
		int x, y;
		cin >> x >> y;
		G[x].pb(y);
		G[y].pb(x);
		a[x]++; a[y]++;
	}
	forn1(i,n) {
		if(a[i]>1) {
			dfs(i,0);
			break;
		}
	}
	if(ret.size()%2) ret.pb(1);
	cout << (ret.size())/2 << endl;
	forn(i,ret.size()) {
		cout << ret[i] << ' ';
		if(i%2==1) cout << endl;
	}
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 45
• Subtask 3: 0 / 37