# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
309559 | 2020-10-03T19:35:10 Z | bigg | Mousetrap (CEOI17_mousetrap) | C++14 | 44 ms | 11512 KB |
#include<bits/stdc++.h> using namespace std; const int MAXN = 1e5 + 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 = p.first; return p; } void dfs(int x, int p){ pair<int, int> p_ = 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); p_ = inserts(dp[viz], p_); } if(grafo[x].size() == 1) dp[x] = 0; else if (grafo[x].size() == 2) dp[x] = 1; else dp[x] = p_.second + grafo[x].size() - 1; } int n, t, m; int main(){ scanf("%d %d %d", &n, &t, &m); if(n == 1){ 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
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 44 ms | 11512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 2 ms | 2688 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |