# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
313562 | kylych03 | 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 "friend.h"
#include <bits/stdc++.h>
#include "grader.cpp"
using namespace std;
int findSample(int n,int con[],int host[],int protocol[]){
int res = 0;
for(int i = n-1; i>0 ;i--){
if(protocol[i]==0){
res+=con[i];
con[host[i]] = max(0, con[host[i]] - con[i]);
}
if(protocol[i]==1){
con[host[i]] +=con[i];
}
if(protocol[i]==2){
con[host[i]] = max(con[i], con[host[i]]);
}
}
return res + con[0];
}