# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
122978 | 2019-06-29T20:06:54 Z | davitmarg | Mousetrap (CEOI17_mousetrap) | C++17 | 552 ms | 105988 KB |
/*DavitMarg*/ #include <iostream> #include <algorithm> #include <cmath> #include <vector> #include <string> #include <cstring> #include <map> #include <unordered_map> #include <bitset> #include <set> #include <queue> #include <deque> #include <stack> #include <iterator> #include <ctype.h> #include <stdlib.h> #include <cassert> #include <fstream> #define mod 1000000007ll #define LL long long #define LD long double #define MP make_pair #define PB push_back #define all(v) v.begin(),v.end() using namespace std; int n,trap,m,u[1000006],nxt[1000006],dp[1000006],d[1000006],ans; vector<int> g[1000006],t[1000006]; void maketree(int v) { u[v]=1; if(v==trap) { nxt[v]=1; return; } for(int i=0;i<g[v].size();i++) { int to=g[v][i]; if(u[to]) continue; t[v].PB(to); maketree(to); if(nxt[to]) { dp[v]+=dp[to]; nxt[v]=1; } } dp[v]+=t[v].size()-1; dp[v]*=nxt[v]; } void dfs(int v,int p=0,int last=m,int sum=0) { d[v]=d[p]+1; if(nxt[v]) { last=v; sum=0; } else if(!t[v].empty()) sum+=t[v].size()-1; for(int i=0;i<t[v].size();i++) { int to=t[v][i]; dfs(to,v,last,sum); } if(t[v].empty() && !nxt[v]) ans=max(ans,dp[last]+sum-1+d[v]-d[last]); } int main() { cin>>n>>trap>>m; for(int i=1;i<=n-1;i++) { int a,b; scanf("%d%d",&a,&b); g[a].PB(b); g[b].PB(a); } maketree(m); d[0]=-1; dfs(m); cout<<ans<<endl; return 0; } /* 6 6 1 1 2 1 3 1 4 2 5 4 6 */
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 47352 KB | Output is correct |
2 | Correct | 42 ms | 47352 KB | Output is correct |
3 | Correct | 42 ms | 47352 KB | Output is correct |
4 | Incorrect | 42 ms | 47352 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 552 ms | 105988 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 47352 KB | Output is correct |
2 | Correct | 42 ms | 47352 KB | Output is correct |
3 | Correct | 42 ms | 47352 KB | Output is correct |
4 | Incorrect | 42 ms | 47352 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 42 ms | 47352 KB | Output is correct |
2 | Correct | 42 ms | 47352 KB | Output is correct |
3 | Correct | 42 ms | 47352 KB | Output is correct |
4 | Incorrect | 42 ms | 47352 KB | Output isn't correct |
5 | Halted | 0 ms | 0 KB | - |