Submission #47051

#	Time	Username	Problem	Language	Result	Execution time	Memory
47051		RockyB	Mousetrap (CEOI17_mousetrap)	C++17	0 / 100	419 ms	55272 KiB

mousetrap

/// In The Name Of God

#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

#include <bits/stdc++.h>

#define f first
#define s second

#define pb push_back
#define pp pop_back
#define mp make_pair

#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()

#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);

#define nl '\n'
#define ioi exit(0);

typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;

const int N = (int)1e6 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};

using namespace std;

int n, t, m;
vector <int> g[N];


pair <int, int> a[N];
int go(int sz) {
	pair <int, int> mx = {-inf, -inf};
	for (int i = 1; i <= sz; i++) {
		if (mx.f < a[i].f) mx = a[i];
	}
	pair <int, int> res = {-inf, -inf};
	for (int i = 1; i <= sz; i++) {
		if (a[i] == mx) continue;
		if (res.f < a[i].f) res = a[i];
	}
	return res.s;
}
int dfs(int v = m, int p = t) {
	{
		int cnt = 0;
		for (auto to : g[v]) {
			if (to == p) continue;
			++cnt;
		}
		if (cnt <= 1) return cnt;
	}
	int sz = 0;
	for (auto to : g[v]) {
		if (to == p) continue;
		a[++sz] = {dfs(to, v), to};
	}
	int to = go(sz), add = sz;
	return add + dfs(to, v);
}
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
	#endif
	Kazakhstan
	cin >> n >> t >> m;
	for (int i = 1; i < n; i++) {
		int v, u;
		cin >> v >> u;
		g[v].pb(u);
		g[u].pb(v);
	}
	cout << dfs();
	ioi
}

• Subtask 1: 0 / 20
• Subtask 2: 0 / 25
• Subtask 3: 0 / 20
• Subtask 4: 0 / 35