oj.uz

답안 #79344

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
79344 2018-10-12T10:29:18 Z aminra Mousetrap (CEOI17_mousetrap) C++14
0 / 100
 857 ms 97556 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
const int MOD = (int)1e9 + 7;
const int MAXN = (int)1e6 + 7;
const int infint = (int)1e9;
//try for 25 pts.
int n, t, m, dp[MAXN];
vector<int> G[MAXN];
void dfs(int u, int p)
{
	int childs = 0;
	for (auto v : G[u])
		if(v != p)
			childs++;
	if(childs == 0)
	{
		dp[u] = 0;
		return;
	}
	int fir = -1, sec = -1;
	for (auto v : G[u])
	{
		if(v == p)
			continue;
		dfs(v, u);
		if(dp[v] > fir)
			sec = fir, fir = dp[v];
		else
		if(dp[v] > sec)
			sec = dp[v];
	}
	dp[u] = sec + childs;
	return;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> t >> m;
	for (int i = 0; i < n - 1; i++)
	{
		int u, v;
		cin >> u >> v;
		G[u].push_back(v);
		G[v].push_back(u);
	}
	dfs(m, t);
	cout << dp[m];
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 403 ms 70940 KB Output is correct
2 Correct 366 ms 79560 KB Output is correct
3 Correct 857 ms 97556 KB Output is correct
4 Incorrect 392 ms 97556 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 21 ms 23800 KB Output isn't correct
2 Halted 0 ms 0 KB -