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;
#define f first
#define s second
//#define int long long
#define pii pair <int, int>
#define pb push_back
const int N = 3e5 + 5;
int t,n,a[N];
int findSample(int n, int confidence[], int host[], int protocol[]){
int ans = 0;
for (int i = n - 1; i >= 0; i--) {
if (protocol[i] == 0) {
ans += confidence[i];
confidence[host[i]] -= max(0, confidence[host[i]] - confidence[i]);
} else if (protocol[i] == 1) {
confidence[host[i]] += confidence[i];
} else {
confidence[host[i]] = max(confidence[host[i]], confidence[i]);
}
}
ans += confidence[0];
return ans;
}
# | 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... |