| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 233235 | anonymous | Friend (IOI14_friend) | C++14 | 42 ms | 3448 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 <iostream>
int dp[100005][2];
int findSample(int n,int confidence[],int host[],int protocol[]){
for (int i=n-1; i>=0; i--) {
dp[i][0] = confidence[i];
}
for (int i=n-1; i>0; i--) {
if (protocol[i] == 0) {
dp[host[i]][0] += dp[i][1];
dp[host[i]][1] += dp[i][0];
} else if (protocol[i] == 1) {
dp[host[i]][0] += dp[i][0];
dp[host[i]][1] += dp[i][1];
} else {
dp[host[i]][0] = std::max(dp[host[i]][0] + dp[i][1], dp[host[i]][1] + dp[i][0]);
dp[host[i]][1] += dp[i][1];
}
dp[host[i]][0] = std::max(dp[host[i]][0], dp[host[i]][1]);
}
return(dp[0][0]);
}
| # | 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... | ||||
