# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
119400 | zubec | Chase (CEOI17_chase) | C++14 | 440 ms | 265592 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 long double ld;
const int N = 100100;
ll dp[N][110], dp2[N][110], a[N];
vector <int> g[N];
int n, k;
ll ans = 0;
void dfs(int v, int p){
ll mx1[101] = {0}, mx2[101] = {0};
ll sum = 0;
for (int i = 0; i < g[v].size(); i++){
sum += a[g[v][i]];
}
dp[v][0] = dp2[v][0] = 0;
dp2[v][1] = sum;
for (int i = 0; i < g[v].size(); i++){
int to = g[v][i];
if (to == p)
continue;
dfs(to, v);
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... |