답안 #309564

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
309564 2020-10-03T19:48:34 Z bigg Mousetrap (CEOI17_mousetrap) C++14
25 / 100
910 ms 73464 KB
#include<bits/stdc++.h>
using namespace std;
const int MAXN = 1e6 + 10;
vector<int> grafo[MAXN];
int dp[MAXN];

pair<int, int > inserts(int x, pair<int, int> p){
	if(x >= p.first) swap(p.first, p.second), p.first = x;
	else if(x > p.second) p.second = x;
	return p;
}

void dfs(int x, int p){
	pair<int, int> par = make_pair(-1, -1);
	for(int i = 0; i < grafo[x].size(); i++){
		int viz = grafo[x][i];
		if(viz == p) continue;
		dfs(viz, x);
		par = inserts(dp[viz], par);
	}

	if(grafo[x].size() == 1) dp[x] = 0;
	else{
		dp[x] = (grafo[x].size() == 2) ? 1 : par.second + grafo[x].size() - 1;
	}
	//printf("%d\n", dp[x]);
}
int n, t, m;
int main(){
	scanf("%d %d %d", &n, &t, &m);
	if(n == 1 || t == m){
		printf("0\n");
		return 0;
	}
	for(int i = 1; i < n; i++){
		int u, v;
		scanf("%d %d", &u, &v);
		grafo[u].push_back(v);
		grafo[v].push_back(u);
	}
	dfs(t, 0);
	printf("%d\n",dp[m] );
}

Compilation message

mousetrap.cpp: In function 'void dfs(int, int)':
mousetrap.cpp:15:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   15 |  for(int i = 0; i < grafo[x].size(); i++){
      |                 ~~^~~~~~~~~~~~~~~~~
mousetrap.cpp: In function 'int main()':
mousetrap.cpp:30:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   30 |  scanf("%d %d %d", &n, &t, &m);
      |  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
mousetrap.cpp:37:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   37 |   scanf("%d %d", &u, &v);
      |   ~~~~~^~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 23808 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Correct 414 ms 71032 KB Output is correct
2 Correct 379 ms 67448 KB Output is correct
3 Correct 892 ms 73464 KB Output is correct
4 Correct 425 ms 48412 KB Output is correct
5 Correct 910 ms 73464 KB Output is correct
6 Correct 885 ms 73340 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 23808 KB Output isn't correct
2 Halted 0 ms 0 KB -
# 결과 실행 시간 메모리 Grader output
1 Incorrect 16 ms 23808 KB Output isn't correct
2 Halted 0 ms 0 KB -