oj.uz

Submission #571680

# Submission time Handle Problem Language Result Execution time Memory
571680 2022-06-02T14:03:35 Z BackNoob Mousetrap (CEOI17_mousetrap) C++14
25 / 100
 772 ms 73304 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()

using namespace std;
const int mxN = 1e6 + 227;
const int inf = 1e9 + 277;
const int mod = 1e9 + 7;
const ll infll = 1e18 + 7;
const int base = 200;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

int n;
int t;
int m;
int dp[mxN];
vector<int> adj[mxN];

void dfs(int u, int par)
{
	vector<int> val;
	for(int v : adj[u]) {
		if(v == par || v == t) continue;
		dfs(v, u);
		val.pb(dp[v]);
	}

	sort(all(val));
	reverse(all(val));

	if(sz(val) == 0) dp[u] = 0;
	if(sz(val) == 1) dp[u] = 1;
	if(sz(val) >= 2) dp[u] = val[1] + sz(val);
}

void solve()
{	
	cin >> n >> t >> m;
	for(int i = 1; i < n; i++) {
		int u, v;
		cin >> u >> v;
		adj[u].pb(v);
		adj[v].pb(u);
	}

	dfs(m, -1);
	cout << dp[m] << endl;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".in" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
	

    int tc = 1;
    // cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 290 ms 59040 KB Output is correct
2 Correct 299 ms 55460 KB Output is correct
3 Correct 737 ms 60236 KB Output is correct
4 Correct 339 ms 48392 KB Output is correct
5 Correct 772 ms 73292 KB Output is correct
6 Correct 744 ms 73304 KB Output is correct

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 23764 KB Output isn't correct
2 Halted 0 ms 0 KB -