# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
349857 | doowey | Mousetrap (CEOI17_mousetrap) | C++14 | 1081 ms | 260460 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;
typedef long long ll;
typedef pair<int,int> pii;
#define fi first
#define se second
#define mp make_pair
#define fastIO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N = (int)1e6 + 100;
vector<int> T[N];
vector<pii> lis[N];
int dp[N];
int up[N];
int pp[N];
int trap;
int mouse;
void dfs(int u, int par){
int deg = 0;
for(auto x : T[u]) if(x != par) deg ++ ;
for(auto x : T[u]){
if(x==par) continue;
pp[x]=u;
up[x] += up[u] + (par != -1) * (deg - 1);
# | 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... |