/// 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;
int dp[N];
vector <int> g[N];
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;
}
if (~dp[v]) return dp[v];
int id1 = -1, id2 = -1, sz = 0;
for (int i = 0; i < sz(g[v]); i++) {
int to = g[v][i];
if (to == p) continue;
if (id1 == -1 || dfs(to, v) > dfs(id1, v)) id1 = to;
++sz;
}
for (int i = 0; i < sz(g[v]); i++) {
int to = g[v][i];
if (to == p || to == id1) continue;
if (id2 == -1 || dfs(to, v) > dfs(id2, v)) id2 = to;
}
return dp[v] = dfs(id2, v) + sz;
}
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);
}
memset(dp, -1, sizeof(dp));
cout << dfs();
ioi
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
26 ms |
27768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
466 ms |
59240 KB |
Output is correct |
2 |
Correct |
391 ms |
68236 KB |
Output is correct |
3 |
Correct |
864 ms |
85608 KB |
Output is correct |
4 |
Correct |
394 ms |
85608 KB |
Output is correct |
5 |
Correct |
861 ms |
105412 KB |
Output is correct |
6 |
Correct |
865 ms |
118632 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
26 ms |
27768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
26 ms |
27768 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |