| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 162051 | oolimry | Friend (IOI14_friend) | C++14 | 8 ms | 380 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;
int findSample(int n, int confidence[], int host[], int protocol[]) {
long long s = 0;
vector<int> child[n];
for(int i = 1;i < n;i++){
child[host[i]].push_back(i);
}
typedef pair<int,int> ii;
ii dp[n];
fill(dp,dp+n,ii(0,0));
for(int u = n-1;u >= 0;u--){
dp[u] = ii(confidence[u],0);
for(int v : child[u]){
dp[u].first += dp[v].second;
dp[u].second += dp[v].first;
}
dp[u].first = max(dp[u].second,dp[u].first);
}
return dp[0].first;
}
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... | ||||
