# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590725 | keta_tsimakuridze | Friend (IOI14_friend) | C++14 | 6 ms | 7504 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 "friend.h"
#include<bits/stdc++.h>
using namespace std;
// Find out best sample
const int N = 3e5 + 5;
int dp[N][2], a[N];
vector<int> V[N];
void dfs(int u) {
dp[u][1] = a[u];
for(int i = 0; i < V[u].size(); i++) {
dfs(V[u][i]);
dp[u][0] += max(dp[V[u][i]][0], dp[V[u][i]][1]);
dp[u][1] += dp[V[u][i]][0];
}
}
int findSample(int n,int A[],int p[],int t[]){
int t1 = 1, t2 = 1, t0 = 1;
for(int i = 1; i < n; i++) {
if(t[i] != 0) t0 = 0;
if(t[i] != 1) t1 = 0;
if(t[i] != 2) t2 = 0;
}
for(int i = 0; i < n; i++) a[i] = A[i];
int ans = 0;
if(t1) {
for(int i = 0; i < n; i++) ans += a[i];
}
else if(t2) for(int i = 0; i < n; i++) ans = max(ans, a[i]);
else if(t0) {
for(int i = 1; i < n; i++) {
V[p[i]].push_back(i);
}
dfs(0);
ans = max(dp[0][0], dp[0][1]);
}
return ans;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |