# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1063347 | phoenix | Friend (IOI14_friend) | C++17 | 30 ms | 3504 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[]){
int f[n][2];
for (int i = 0; i < n; i++) {
f[i][0] = 0;
f[i][1] = confidence[i];
}
for (int i = n - 1; i > 0; i--) {
int x = host[i];
int p[2];
if (protocol[i] == 0) {
p[0] = f[host[i]][0] + max(f[i][0], f[i][1]);
p[1] = f[host[i]][1] + f[i][0];
}
if (protocol[i] == 1) {
p[0] = f[host[i]][0] + f[i][0];
p[1] = max({f[host[i]][1] + f[i][1], f[host[i]][0] + f[i][1], f[host[i]][1] + f[i][0]});
}
if (protocol[i] == 2) {
p[0] = f[host[i]][0] + f[i][0];
p[1] = max({f[host[i]][1] + f[i][0], f[host[i]][0] + f[i][1]});
}
f[host[i]][0] = p[0];
f[host[i]][1] = p[1];
}
return max(f[0][0], f[0][1]);
}
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... |