# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
303975 | 2020-09-20T21:48:57 Z | peuch | Mousetrap (CEOI17_mousetrap) | C++17 | 1136 ms | 76028 KB |
#include<bits/stdc++.h> using namespace std; const int MAXN = 1000010; int n, t, m; int pai[MAXN], prof[MAXN]; long long dp[MAXN]; int marc[MAXN]; long long ans; vector<int> ar[MAXN]; void dfs(int cur); void getDP(int cur); int main(){ scanf("%d %d %d", &n, &t, &m); for(int i = 1; i < n; i++){ int a, b; scanf("%d %d", &a, &b); ar[a].push_back(b); ar[b].push_back(a); } dfs(t); stack<int> fila; int aux = m; while(aux != t){ fila.push(aux); marc[aux] = 1; aux = pai[aux]; } int sum = 0; while(!fila.empty()){ getDP(fila.top()); ans = max(ans, dp[fila.top()] + sum + prof[m] - prof[fila.top()]); sum += ar[fila.top()].size() - 2; fila.pop(); } printf("%lld\n", ans); } void dfs(int cur){ for(int i = 0; i < ar[cur].size(); i++){ int viz = ar[cur][i]; if(viz == pai[cur]) continue; prof[viz] = prof[cur] + 1; pai[viz] = cur; dfs(viz); } } void getDP(int cur){ marc[cur] = 1; pair<long long, long long> aux = make_pair(0, 0); int tam = 0; for(int i = 0; i < ar[cur].size(); i++){ int viz = ar[cur][i]; if(viz == pai[cur]) continue; if(marc[viz]) continue; getDP(viz); if(dp[viz] > aux.first) aux.second = aux.first, aux.first = dp[viz]; else aux.second = max(aux.second, dp[viz]); tam++; } dp[cur] = aux.second + 1 + tam - 1; if(tam == 0) dp[cur] = 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 23808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 458 ms | 74832 KB | Output is correct |
2 | Correct | 391 ms | 69752 KB | Output is correct |
3 | Correct | 1136 ms | 76000 KB | Output is correct |
4 | Correct | 517 ms | 49880 KB | Output is correct |
5 | Correct | 1127 ms | 75904 KB | Output is correct |
6 | Correct | 1097 ms | 76028 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 23808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 15 ms | 23808 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |