# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288743 | TadijaSebez | Mousetrap (CEOI17_mousetrap) | C++11 | 1080 ms | 202616 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<int,int>
const int N=1000050;
vector<int> E[N];
int dp[N],dep[N],n,t,m;
bool on[N];
void DP(int u,int p){
vector<int> d;
for(int v:E[u])if(v!=p){
if(p)dp[v]=dp[u]+E[u].size()-2;
DP(v,u);
if(on[v])on[u]=1;
d.pb(dp[v]);
}
sort(d.rbegin(),d.rend());
if(d.size()>1)dp[u]=d[1];
dp[u]+=E[u].size()>1;
}
vector<pii> tmp;
void DFS(int u,int p){
if(u==t)return;
for(int v:E[u])if(v!=p){
dep[v]=dep[u]+1;
if(on[u]&&!on[v])tmp.pb({dep[v],dp[v]+(u==m)});
else DFS(v,u);
}
}
bool Check(int mid){
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |