# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
73273 | nvmdava | Friend (IOI14_friend) | C++17 | 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 "friend.h"
#include<bits/stdc++.h>
using namespace std;
vector<int> p[1001];
int ans[1001][2];
inline void go(int v){
for(auto x : p){
go(x);
ans[v][0] += max(ans[x][1], ans[x][0]);
ans[v][1] += ans[x][0];
}
}
int findSample(int n,int confidence[],int host[],int protocol[]){
ans[0][1] = confidence[0];
for(int i = 1; i < n; i++){
p[host[i]].push_back(i);
ans[i][1] = confidence[i];
}
go(i);
return max(ans[i][0], ans[i][0]);
}