# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
238359 | caoash | Friend (IOI14_friend) | C++14 | 0 ms | 0 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 <bits/stdc++.h>
#include "friend.h"
using namespace std;
#define ll long long
#define pi pair<int, int>
#define f first
#define s second
#define pb push_back
int findSample(int n, int* confidence, int* host, int* protocol){
int host = confidence[n-1], mv = 0, ans = 0;
for(int i = n-1; i; i--){
mv = confidence[host[i]];
if(protocol[i] == 0){
if(host > mv){
ans += host; mv = 0;
}
else{
ans += host; mv -= host;
}
}
else if(protocol[i] == 1){
mv += host;
}
else{
mv = max(host, mv);
}
host = mv, mv = 0;
}
ans += host;
return ans;
}